./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for data races
Using default analysis
Version 0e0057cc
Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8a72be3-5785-4ff3-abba-a49063522bf1/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8a72be3-5785-4ff3-abba-a49063522bf1/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_c8a72be3-5785-4ff3-abba-a49063522bf1/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8a72be3-5785-4ff3-abba-a49063522bf1/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8a72be3-5785-4ff3-abba-a49063522bf1/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_c8a72be3-5785-4ff3-abba-a49063522bf1/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 801883caffd8b582a36607f9ec62109ac5c5dc10c811693a281fb396b4b60131
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2023-11-26 11:57:58,650 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-26 11:57:58,775 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8a72be3-5785-4ff3-abba-a49063522bf1/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-11-26 11:57:58,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-26 11:57:58,792 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-26 11:57:58,835 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-26 11:57:58,836 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-26 11:57:58,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-26 11:57:58,839 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-26 11:57:58,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-26 11:57:58,846 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-26 11:57:58,846 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-26 11:57:58,847 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-26 11:57:58,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-26 11:57:58,849 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2023-11-26 11:57:58,850 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-26 11:57:58,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2023-11-26 11:57:58,851 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-26 11:57:58,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-26 11:57:58,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2023-11-26 11:57:58,852 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-26 11:57:58,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2023-11-26 11:57:58,853 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true
[2023-11-26 11:57:58,854 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2023-11-26 11:57:58,854 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-26 11:57:58,855 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2023-11-26 11:57:58,855 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-26 11:57:58,856 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-26 11:57:58,856 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-26 11:57:58,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-26 11:57:58,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2023-11-26 11:57:58,859 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-26 11:57:58,859 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-26 11:57:58,859 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-26 11:57:58,860 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-11-26 11:57:58,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-26 11:57:58,860 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2023-11-26 11:57:58,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-26 11:57:58,861 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-26 11:57:58,861 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-26 11:57:58,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-26 11:57:58,862 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_c8a72be3-5785-4ff3-abba-a49063522bf1/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_c8a72be3-5785-4ff3-abba-a49063522bf1/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 -> 801883caffd8b582a36607f9ec62109ac5c5dc10c811693a281fb396b4b60131
[2023-11-26 11:57:59,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-26 11:57:59,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-26 11:57:59,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-26 11:57:59,238 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-26 11:57:59,238 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-26 11:57:59,240 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8a72be3-5785-4ff3-abba-a49063522bf1/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i
[2023-11-26 11:58:02,415 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-26 11:58:02,678 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-26 11:58:02,679 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8a72be3-5785-4ff3-abba-a49063522bf1/sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i
[2023-11-26 11:58:02,697 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8a72be3-5785-4ff3-abba-a49063522bf1/bin/uautomizer-verify-VRDe98Ueme/data/ae8f81d72/08b37d8adc804b80a890c866f06e5cba/FLAG1c613f849
[2023-11-26 11:58:02,714 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8a72be3-5785-4ff3-abba-a49063522bf1/bin/uautomizer-verify-VRDe98Ueme/data/ae8f81d72/08b37d8adc804b80a890c866f06e5cba
[2023-11-26 11:58:02,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-26 11:58:02,718 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-26 11:58:02,720 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-26 11:58:02,720 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-26 11:58:02,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-26 11:58:02,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:58:02" (1/1) ...
[2023-11-26 11:58:02,729 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9bc7b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:02, skipping insertion in model container
[2023-11-26 11:58:02,729 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:58:02" (1/1) ...
[2023-11-26 11:58:02,788 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-26 11:58:03,238 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-26 11:58:03,258 INFO L202 MainTranslator]: Completed pre-run
[2023-11-26 11:58:03,337 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-26 11:58:03,405 INFO L206 MainTranslator]: Completed translation
[2023-11-26 11:58:03,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:03 WrapperNode
[2023-11-26 11:58:03,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-26 11:58:03,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-26 11:58:03,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-26 11:58:03,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-26 11:58:03,417 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:58:03" (1/1) ...
[2023-11-26 11:58:03,448 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:58:03" (1/1) ...
[2023-11-26 11:58:03,484 INFO L138 Inliner]: procedures = 165, calls = 21, calls flagged for inlining = 4, calls inlined = 5, statements flattened = 95
[2023-11-26 11:58:03,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-26 11:58:03,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-26 11:58:03,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-26 11:58:03,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-26 11:58:03,495 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:03" (1/1) ...
[2023-11-26 11:58:03,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:03" (1/1) ...
[2023-11-26 11:58:03,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:03" (1/1) ...
[2023-11-26 11:58:03,499 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:03" (1/1) ...
[2023-11-26 11:58:03,504 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:03" (1/1) ...
[2023-11-26 11:58:03,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:03" (1/1) ...
[2023-11-26 11:58:03,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:03" (1/1) ...
[2023-11-26 11:58:03,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:03" (1/1) ...
[2023-11-26 11:58:03,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-26 11:58:03,517 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-26 11:58:03,517 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-26 11:58:03,517 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-26 11:58:03,518 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:03" (1/1) ...
[2023-11-26 11:58:03,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2023-11-26 11:58:03,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8a72be3-5785-4ff3-abba-a49063522bf1/bin/uautomizer-verify-VRDe98Ueme/z3
[2023-11-26 11:58:03,563 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8a72be3-5785-4ff3-abba-a49063522bf1/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:58:03,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8a72be3-5785-4ff3-abba-a49063522bf1/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:58:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure thr1
[2023-11-26 11:58:03,603 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1
[2023-11-26 11:58:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2023-11-26 11:58:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2023-11-26 11:58:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-26 11:58:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-26 11:58:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-26 11:58:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-26 11:58:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2023-11-26 11:58:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-26 11:58:03,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-26 11:58:03,605 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:58:03,755 INFO L241 CfgBuilder]: Building ICFG
[2023-11-26 11:58:03,758 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-26 11:58:04,012 INFO L282 CfgBuilder]: Performing block encoding
[2023-11-26 11:58:04,040 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-26 11:58:04,040 INFO L309 CfgBuilder]: Removed 1 assume(true) statements.
[2023-11-26 11:58:04,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:58:04 BoogieIcfgContainer
[2023-11-26 11:58:04,042 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-26 11:58:04,045 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-26 11:58:04,045 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-26 11:58:04,049 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-26 11:58:04,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:58:02" (1/3) ...
[2023-11-26 11:58:04,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae650bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:58:04, skipping insertion in model container
[2023-11-26 11:58:04,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:03" (2/3) ...
[2023-11-26 11:58:04,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae650bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:58:04, skipping insertion in model container
[2023-11-26 11:58:04,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:58:04" (3/3) ...
[2023-11-26 11:58:04,054 INFO L112 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs-pthread.i
[2023-11-26 11:58:04,086 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-26 11:58:04,098 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-26 11:58:04,099 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations.
[2023-11-26 11:58:04,099 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-26 11:58:04,209 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-26 11:58:04,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 105 transitions, 214 flow
[2023-11-26 11:58:04,362 INFO L124 PetriNetUnfolderBase]: 8/158 cut-off events.
[2023-11-26 11:58:04,363 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-26 11:58:04,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 158 events. 8/158 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 384 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 86. Up to 4 conditions per place.
[2023-11-26 11:58:04,371 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 105 transitions, 214 flow
[2023-11-26 11:58:04,381 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 105 transitions, 214 flow
[2023-11-26 11:58:04,393 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-26 11:58:04,401 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;@7cf64110, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-11-26 11:58:04,402 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2023-11-26 11:58:04,426 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-26 11:58:04,428 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events.
[2023-11-26 11:58:04,428 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-26 11:58:04,429 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:58:04,429 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]
[2023-11-26 11:58:04,430 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-26 11:58:04,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:58:04,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1866201768, now seen corresponding path program 1 times
[2023-11-26 11:58:04,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:58:04,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273960163]
[2023-11-26 11:58:04,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:58:04,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:58:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 11:58:04,678 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:58:04,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 11:58:04,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273960163]
[2023-11-26 11:58:04,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273960163] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 11:58:04,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 11:58:04,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-26 11:58:04,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618693191]
[2023-11-26 11:58:04,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 11:58:04,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-26 11:58:04,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 11:58:04,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-26 11:58:04,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-26 11:58:04,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 105
[2023-11-26 11:58:04,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 105 transitions, 214 flow. Second operand has 2 states, 2 states have (on average 94.0) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 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:58:04,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 11:58:04,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 105
[2023-11-26 11:58:04,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 11:58:04,797 INFO L124 PetriNetUnfolderBase]: 4/195 cut-off events.
[2023-11-26 11:58:04,798 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2023-11-26 11:58:04,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 195 events. 4/195 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 558 event pairs, 4 based on Foata normal form. 15/186 useless extension candidates. Maximal degree in co-relation 141. Up to 16 conditions per place.
[2023-11-26 11:58:04,801 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 5 selfloop transitions, 0 changer transitions 0/94 dead transitions.
[2023-11-26 11:58:04,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 94 transitions, 202 flow
[2023-11-26 11:58:04,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2023-11-26 11:58:04,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-26 11:58:04,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 196 transitions.
[2023-11-26 11:58:04,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333
[2023-11-26 11:58:04,822 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 196 transitions.
[2023-11-26 11:58:04,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 196 transitions.
[2023-11-26 11:58:04,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 11:58:04,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 196 transitions.
[2023-11-26 11:58:04,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 98.0) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 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:58:04,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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:58:04,838 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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:58:04,840 INFO L175 Difference]: Start difference. First operand has 103 places, 105 transitions, 214 flow. Second operand 2 states and 196 transitions.
[2023-11-26 11:58:04,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 94 transitions, 202 flow
[2023-11-26 11:58:04,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 94 transitions, 202 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-26 11:58:04,848 INFO L231 Difference]: Finished difference. Result has 98 places, 94 transitions, 192 flow
[2023-11-26 11:58:04,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=192, PETRI_PLACES=98, PETRI_TRANSITIONS=94}
[2023-11-26 11:58:04,854 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, -5 predicate places.
[2023-11-26 11:58:04,855 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 94 transitions, 192 flow
[2023-11-26 11:58:04,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 94.0) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 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:58:04,855 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:58:04,856 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]
[2023-11-26 11:58:04,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-26 11:58:04,856 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-26 11:58:04,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:58:04,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1524195953, now seen corresponding path program 1 times
[2023-11-26 11:58:04,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:58:04,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707235773]
[2023-11-26 11:58:04,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:58:04,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:58:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 11:58:04,956 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:58:04,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 11:58:04,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707235773]
[2023-11-26 11:58:04,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707235773] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 11:58:04,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 11:58:04,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-26 11:58:04,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834616416]
[2023-11-26 11:58:04,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 11:58:04,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 11:58:04,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 11:58:04,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 11:58:04,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 11:58:04,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105
[2023-11-26 11:58:04,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 94 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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:58:04,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 11:58:04,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105
[2023-11-26 11:58:04,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 11:58:05,131 INFO L124 PetriNetUnfolderBase]: 59/464 cut-off events.
[2023-11-26 11:58:05,132 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2023-11-26 11:58:05,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 464 events. 59/464 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2423 event pairs, 41 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 613. Up to 126 conditions per place.
[2023-11-26 11:58:05,136 INFO L140 encePairwiseOnDemand]: 98/105 looper letters, 18 selfloop transitions, 6 changer transitions 0/101 dead transitions.
[2023-11-26 11:58:05,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 101 transitions, 254 flow
[2023-11-26 11:58:05,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-26 11:58:05,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-26 11:58:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions.
[2023-11-26 11:58:05,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8507936507936508
[2023-11-26 11:58:05,140 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 268 transitions.
[2023-11-26 11:58:05,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 268 transitions.
[2023-11-26 11:58:05,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 11:58:05,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 268 transitions.
[2023-11-26 11:58:05,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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:58:05,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 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:58:05,162 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 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:58:05,163 INFO L175 Difference]: Start difference. First operand has 98 places, 94 transitions, 192 flow. Second operand 3 states and 268 transitions.
[2023-11-26 11:58:05,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 101 transitions, 254 flow
[2023-11-26 11:58:05,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 101 transitions, 254 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-26 11:58:05,167 INFO L231 Difference]: Finished difference. Result has 102 places, 99 transitions, 238 flow
[2023-11-26 11:58:05,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=102, PETRI_TRANSITIONS=99}
[2023-11-26 11:58:05,171 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, -1 predicate places.
[2023-11-26 11:58:05,173 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 99 transitions, 238 flow
[2023-11-26 11:58:05,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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:58:05,174 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:58:05,174 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]
[2023-11-26 11:58:05,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-26 11:58:05,176 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-26 11:58:05,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:58:05,178 INFO L85 PathProgramCache]: Analyzing trace with hash 293414073, now seen corresponding path program 1 times
[2023-11-26 11:58:05,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:58:05,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766706897]
[2023-11-26 11:58:05,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:58:05,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:58:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 11:58:05,316 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:58:05,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 11:58:05,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766706897]
[2023-11-26 11:58:05,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766706897] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 11:58:05,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 11:58:05,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-26 11:58:05,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317796687]
[2023-11-26 11:58:05,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 11:58:05,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 11:58:05,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 11:58:05,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 11:58:05,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 11:58:05,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 105
[2023-11-26 11:58:05,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 99 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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:58:05,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 11:58:05,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 105
[2023-11-26 11:58:05,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 11:58:05,465 INFO L124 PetriNetUnfolderBase]: 64/437 cut-off events.
[2023-11-26 11:58:05,465 INFO L125 PetriNetUnfolderBase]: For 46/48 co-relation queries the response was YES.
[2023-11-26 11:58:05,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 437 events. 64/437 cut-off events. For 46/48 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2332 event pairs, 32 based on Foata normal form. 0/380 useless extension candidates. Maximal degree in co-relation 677. Up to 119 conditions per place.
[2023-11-26 11:58:05,470 INFO L140 encePairwiseOnDemand]: 98/105 looper letters, 18 selfloop transitions, 7 changer transitions 0/106 dead transitions.
[2023-11-26 11:58:05,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 106 transitions, 306 flow
[2023-11-26 11:58:05,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-26 11:58:05,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-26 11:58:05,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions.
[2023-11-26 11:58:05,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8634920634920635
[2023-11-26 11:58:05,474 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 272 transitions.
[2023-11-26 11:58:05,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 272 transitions.
[2023-11-26 11:58:05,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 11:58:05,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 272 transitions.
[2023-11-26 11:58:05,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 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:58:05,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 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:58:05,479 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 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:58:05,479 INFO L175 Difference]: Start difference. First operand has 102 places, 99 transitions, 238 flow. Second operand 3 states and 272 transitions.
[2023-11-26 11:58:05,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 106 transitions, 306 flow
[2023-11-26 11:58:05,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 106 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-26 11:58:05,486 INFO L231 Difference]: Finished difference. Result has 104 places, 104 transitions, 278 flow
[2023-11-26 11:58:05,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=104, PETRI_TRANSITIONS=104}
[2023-11-26 11:58:05,488 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 1 predicate places.
[2023-11-26 11:58:05,488 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 104 transitions, 278 flow
[2023-11-26 11:58:05,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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:58:05,489 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:58:05,489 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]
[2023-11-26 11:58:05,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-26 11:58:05,490 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-26 11:58:05,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:58:05,491 INFO L85 PathProgramCache]: Analyzing trace with hash 927636466, now seen corresponding path program 1 times
[2023-11-26 11:58:05,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:58:05,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093795782]
[2023-11-26 11:58:05,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:58:05,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:58:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 11:58:05,556 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:58:05,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 11:58:05,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093795782]
[2023-11-26 11:58:05,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093795782] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 11:58:05,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 11:58:05,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-26 11:58:05,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360795428]
[2023-11-26 11:58:05,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 11:58:05,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 11:58:05,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 11:58:05,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 11:58:05,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 11:58:05,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 105
[2023-11-26 11:58:05,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 104 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 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:58:05,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 11:58:05,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 105
[2023-11-26 11:58:05,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 11:58:05,721 INFO L124 PetriNetUnfolderBase]: 83/566 cut-off events.
[2023-11-26 11:58:05,721 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES.
[2023-11-26 11:58:05,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 950 conditions, 566 events. 83/566 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3358 event pairs, 23 based on Foata normal form. 0/500 useless extension candidates. Maximal degree in co-relation 943. Up to 101 conditions per place.
[2023-11-26 11:58:05,727 INFO L140 encePairwiseOnDemand]: 95/105 looper letters, 23 selfloop transitions, 12 changer transitions 0/118 dead transitions.
[2023-11-26 11:58:05,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 118 transitions, 400 flow
[2023-11-26 11:58:05,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-26 11:58:05,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-26 11:58:05,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions.
[2023-11-26 11:58:05,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8825396825396825
[2023-11-26 11:58:05,730 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 278 transitions.
[2023-11-26 11:58:05,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 278 transitions.
[2023-11-26 11:58:05,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 11:58:05,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 278 transitions.
[2023-11-26 11:58:05,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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:58:05,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 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:58:05,735 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 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:58:05,735 INFO L175 Difference]: Start difference. First operand has 104 places, 104 transitions, 278 flow. Second operand 3 states and 278 transitions.
[2023-11-26 11:58:05,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 118 transitions, 400 flow
[2023-11-26 11:58:05,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 118 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-26 11:58:05,745 INFO L231 Difference]: Finished difference. Result has 106 places, 114 transitions, 376 flow
[2023-11-26 11:58:05,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=106, PETRI_TRANSITIONS=114}
[2023-11-26 11:58:05,747 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 3 predicate places.
[2023-11-26 11:58:05,747 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 114 transitions, 376 flow
[2023-11-26 11:58:05,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 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:58:05,748 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:58:05,748 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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:58:05,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-26 11:58:05,749 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-26 11:58:05,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:58:05,750 INFO L85 PathProgramCache]: Analyzing trace with hash 130408571, now seen corresponding path program 1 times
[2023-11-26 11:58:05,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:58:05,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689129752]
[2023-11-26 11:58:05,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:58:05,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:58:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-26 11:58:05,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-26 11:58:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-26 11:58:05,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-26 11:58:05,845 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-11-26 11:58:05,847 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining)
[2023-11-26 11:58:05,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining)
[2023-11-26 11:58:05,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining)
[2023-11-26 11:58:05,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining)
[2023-11-26 11:58:05,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining)
[2023-11-26 11:58:05,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining)
[2023-11-26 11:58:05,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining)
[2023-11-26 11:58:05,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining)
[2023-11-26 11:58:05,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining)
[2023-11-26 11:58:05,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining)
[2023-11-26 11:58:05,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-26 11:58:05,854 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2023-11-26 11:58:05,856 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-26 11:58:05,857 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-11-26 11:58:05,916 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-26 11:58:05,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 137 transitions, 284 flow
[2023-11-26 11:58:05,966 INFO L124 PetriNetUnfolderBase]: 13/245 cut-off events.
[2023-11-26 11:58:05,966 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES.
[2023-11-26 11:58:05,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 245 events. 13/245 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 802 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 159. Up to 6 conditions per place.
[2023-11-26 11:58:05,969 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 137 transitions, 284 flow
[2023-11-26 11:58:05,973 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 137 transitions, 284 flow
[2023-11-26 11:58:05,974 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-26 11:58:05,982 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;@7cf64110, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-11-26 11:58:05,988 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2023-11-26 11:58:05,994 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-26 11:58:05,995 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events.
[2023-11-26 11:58:05,995 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-26 11:58:05,995 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:58:05,995 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]
[2023-11-26 11:58:05,996 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-26 11:58:05,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:58:05,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1881723496, now seen corresponding path program 1 times
[2023-11-26 11:58:05,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:58:05,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478009675]
[2023-11-26 11:58:05,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:58:05,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:58:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 11:58:06,050 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:58:06,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 11:58:06,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478009675]
[2023-11-26 11:58:06,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478009675] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 11:58:06,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 11:58:06,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-26 11:58:06,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225632768]
[2023-11-26 11:58:06,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 11:58:06,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-26 11:58:06,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 11:58:06,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-26 11:58:06,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-26 11:58:06,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 137
[2023-11-26 11:58:06,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 137 transitions, 284 flow. Second operand has 2 states, 2 states have (on average 120.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 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:58:06,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 11:58:06,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 137
[2023-11-26 11:58:06,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 11:58:06,184 INFO L124 PetriNetUnfolderBase]: 34/576 cut-off events.
[2023-11-26 11:58:06,184 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES.
[2023-11-26 11:58:06,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 663 conditions, 576 events. 34/576 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3255 event pairs, 34 based on Foata normal form. 65/554 useless extension candidates. Maximal degree in co-relation 433. Up to 73 conditions per place.
[2023-11-26 11:58:06,189 INFO L140 encePairwiseOnDemand]: 130/137 looper letters, 8 selfloop transitions, 0 changer transitions 0/121 dead transitions.
[2023-11-26 11:58:06,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 121 transitions, 268 flow
[2023-11-26 11:58:06,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2023-11-26 11:58:06,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-26 11:58:06,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 253 transitions.
[2023-11-26 11:58:06,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9233576642335767
[2023-11-26 11:58:06,192 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 253 transitions.
[2023-11-26 11:58:06,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 253 transitions.
[2023-11-26 11:58:06,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 11:58:06,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 253 transitions.
[2023-11-26 11:58:06,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 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:58:06,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 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:58:06,195 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 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:58:06,195 INFO L175 Difference]: Start difference. First operand has 135 places, 137 transitions, 284 flow. Second operand 2 states and 253 transitions.
[2023-11-26 11:58:06,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 121 transitions, 268 flow
[2023-11-26 11:58:06,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 121 transitions, 268 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-26 11:58:06,201 INFO L231 Difference]: Finished difference. Result has 127 places, 121 transitions, 252 flow
[2023-11-26 11:58:06,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=252, PETRI_PLACES=127, PETRI_TRANSITIONS=121}
[2023-11-26 11:58:06,204 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -8 predicate places.
[2023-11-26 11:58:06,205 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 121 transitions, 252 flow
[2023-11-26 11:58:06,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 120.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 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:58:06,205 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:58:06,206 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]
[2023-11-26 11:58:06,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-26 11:58:06,207 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-26 11:58:06,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:58:06,208 INFO L85 PathProgramCache]: Analyzing trace with hash 75662874, now seen corresponding path program 1 times
[2023-11-26 11:58:06,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:58:06,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683405233]
[2023-11-26 11:58:06,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:58:06,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:58:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 11:58:06,279 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:58:06,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 11:58:06,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683405233]
[2023-11-26 11:58:06,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683405233] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 11:58:06,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 11:58:06,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-26 11:58:06,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010297413]
[2023-11-26 11:58:06,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 11:58:06,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 11:58:06,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 11:58:06,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 11:58:06,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 11:58:06,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 137
[2023-11-26 11:58:06,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 121 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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:58:06,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 11:58:06,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 137
[2023-11-26 11:58:06,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 11:58:06,874 INFO L124 PetriNetUnfolderBase]: 845/3313 cut-off events.
[2023-11-26 11:58:06,875 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES.
[2023-11-26 11:58:06,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4763 conditions, 3313 events. 845/3313 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 29966 event pairs, 631 based on Foata normal form. 0/2810 useless extension candidates. Maximal degree in co-relation 4758. Up to 1252 conditions per place.
[2023-11-26 11:58:06,907 INFO L140 encePairwiseOnDemand]: 127/137 looper letters, 26 selfloop transitions, 9 changer transitions 0/133 dead transitions.
[2023-11-26 11:58:06,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 133 transitions, 346 flow
[2023-11-26 11:58:06,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-26 11:58:06,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-26 11:58:06,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions.
[2023-11-26 11:58:06,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8467153284671532
[2023-11-26 11:58:06,910 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions.
[2023-11-26 11:58:06,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions.
[2023-11-26 11:58:06,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 11:58:06,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions.
[2023-11-26 11:58:06,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 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:58:06,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 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:58:06,916 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 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:58:06,916 INFO L175 Difference]: Start difference. First operand has 127 places, 121 transitions, 252 flow. Second operand 3 states and 348 transitions.
[2023-11-26 11:58:06,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 133 transitions, 346 flow
[2023-11-26 11:58:06,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 133 transitions, 346 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-26 11:58:06,920 INFO L231 Difference]: Finished difference. Result has 131 places, 129 transitions, 322 flow
[2023-11-26 11:58:06,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=131, PETRI_TRANSITIONS=129}
[2023-11-26 11:58:06,923 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -4 predicate places.
[2023-11-26 11:58:06,923 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 129 transitions, 322 flow
[2023-11-26 11:58:06,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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:58:06,923 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:58:06,924 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]
[2023-11-26 11:58:06,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-26 11:58:06,924 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-26 11:58:06,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:58:06,925 INFO L85 PathProgramCache]: Analyzing trace with hash -808995271, now seen corresponding path program 1 times
[2023-11-26 11:58:06,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:58:06,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916037755]
[2023-11-26 11:58:06,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:58:06,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:58:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 11:58:07,001 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:58:07,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 11:58:07,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916037755]
[2023-11-26 11:58:07,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916037755] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 11:58:07,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 11:58:07,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-26 11:58:07,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270823660]
[2023-11-26 11:58:07,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 11:58:07,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 11:58:07,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 11:58:07,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 11:58:07,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 11:58:07,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137
[2023-11-26 11:58:07,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 129 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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:58:07,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 11:58:07,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137
[2023-11-26 11:58:07,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 11:58:07,712 INFO L124 PetriNetUnfolderBase]: 1082/3771 cut-off events.
[2023-11-26 11:58:07,713 INFO L125 PetriNetUnfolderBase]: For 820/958 co-relation queries the response was YES.
[2023-11-26 11:58:07,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6664 conditions, 3771 events. 1082/3771 cut-off events. For 820/958 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 35211 event pairs, 602 based on Foata normal form. 3/3181 useless extension candidates. Maximal degree in co-relation 6657. Up to 1422 conditions per place.
[2023-11-26 11:58:07,759 INFO L140 encePairwiseOnDemand]: 127/137 looper letters, 30 selfloop transitions, 13 changer transitions 0/145 dead transitions.
[2023-11-26 11:58:07,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 145 transitions, 467 flow
[2023-11-26 11:58:07,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-26 11:58:07,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-26 11:58:07,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions.
[2023-11-26 11:58:07,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8588807785888077
[2023-11-26 11:58:07,763 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions.
[2023-11-26 11:58:07,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions.
[2023-11-26 11:58:07,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 11:58:07,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions.
[2023-11-26 11:58:07,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 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:58:07,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 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:58:07,769 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 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:58:07,769 INFO L175 Difference]: Start difference. First operand has 131 places, 129 transitions, 322 flow. Second operand 3 states and 353 transitions.
[2023-11-26 11:58:07,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 145 transitions, 467 flow
[2023-11-26 11:58:07,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 145 transitions, 441 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-26 11:58:07,782 INFO L231 Difference]: Finished difference. Result has 133 places, 140 transitions, 416 flow
[2023-11-26 11:58:07,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=416, PETRI_PLACES=133, PETRI_TRANSITIONS=140}
[2023-11-26 11:58:07,783 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -2 predicate places.
[2023-11-26 11:58:07,783 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 140 transitions, 416 flow
[2023-11-26 11:58:07,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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:58:07,784 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:58:07,784 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]
[2023-11-26 11:58:07,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-26 11:58:07,785 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-26 11:58:07,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:58:07,786 INFO L85 PathProgramCache]: Analyzing trace with hash -784761070, now seen corresponding path program 1 times
[2023-11-26 11:58:07,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:58:07,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859406886]
[2023-11-26 11:58:07,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:58:07,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:58:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 11:58:07,828 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:58:07,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 11:58:07,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859406886]
[2023-11-26 11:58:07,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859406886] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 11:58:07,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 11:58:07,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-26 11:58:07,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544294289]
[2023-11-26 11:58:07,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 11:58:07,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 11:58:07,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 11:58:07,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 11:58:07,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 11:58:07,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 137
[2023-11-26 11:58:07,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 140 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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:58:07,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 11:58:07,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 137
[2023-11-26 11:58:07,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 11:58:08,994 INFO L124 PetriNetUnfolderBase]: 2061/6952 cut-off events.
[2023-11-26 11:58:08,995 INFO L125 PetriNetUnfolderBase]: For 3727/3899 co-relation queries the response was YES.
[2023-11-26 11:58:09,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13721 conditions, 6952 events. 2061/6952 cut-off events. For 3727/3899 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 72686 event pairs, 630 based on Foata normal form. 7/5820 useless extension candidates. Maximal degree in co-relation 13713. Up to 1788 conditions per place.
[2023-11-26 11:58:09,070 INFO L140 encePairwiseOnDemand]: 122/137 looper letters, 44 selfloop transitions, 26 changer transitions 0/172 dead transitions.
[2023-11-26 11:58:09,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 172 transitions, 715 flow
[2023-11-26 11:58:09,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-26 11:58:09,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-26 11:58:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions.
[2023-11-26 11:58:09,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8686131386861314
[2023-11-26 11:58:09,073 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions.
[2023-11-26 11:58:09,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions.
[2023-11-26 11:58:09,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 11:58:09,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions.
[2023-11-26 11:58:09,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 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:58:09,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 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:58:09,077 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 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:58:09,078 INFO L175 Difference]: Start difference. First operand has 133 places, 140 transitions, 416 flow. Second operand 3 states and 357 transitions.
[2023-11-26 11:58:09,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 172 transitions, 715 flow
[2023-11-26 11:58:09,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 172 transitions, 671 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-26 11:58:09,095 INFO L231 Difference]: Finished difference. Result has 135 places, 165 transitions, 672 flow
[2023-11-26 11:58:09,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=672, PETRI_PLACES=135, PETRI_TRANSITIONS=165}
[2023-11-26 11:58:09,096 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 0 predicate places.
[2023-11-26 11:58:09,097 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 165 transitions, 672 flow
[2023-11-26 11:58:09,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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:58:09,097 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:58:09,097 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]
[2023-11-26 11:58:09,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-26 11:58:09,098 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-26 11:58:09,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:58:09,099 INFO L85 PathProgramCache]: Analyzing trace with hash -147005306, now seen corresponding path program 1 times
[2023-11-26 11:58:09,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:58:09,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790982227]
[2023-11-26 11:58:09,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:58:09,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:58:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 11:58:09,137 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:58:09,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 11:58:09,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790982227]
[2023-11-26 11:58:09,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790982227] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 11:58:09,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 11:58:09,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-26 11:58:09,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219639296]
[2023-11-26 11:58:09,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 11:58:09,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 11:58:09,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 11:58:09,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 11:58:09,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 11:58:09,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 137
[2023-11-26 11:58:09,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 165 transitions, 672 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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:58:09,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 11:58:09,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 137
[2023-11-26 11:58:09,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 11:58:10,810 INFO L124 PetriNetUnfolderBase]: 2966/9951 cut-off events.
[2023-11-26 11:58:10,811 INFO L125 PetriNetUnfolderBase]: For 14744/15181 co-relation queries the response was YES.
[2023-11-26 11:58:10,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23585 conditions, 9951 events. 2966/9951 cut-off events. For 14744/15181 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 108273 event pairs, 1072 based on Foata normal form. 41/8522 useless extension candidates. Maximal degree in co-relation 23576. Up to 3627 conditions per place.
[2023-11-26 11:58:10,913 INFO L140 encePairwiseOnDemand]: 127/137 looper letters, 60 selfloop transitions, 22 changer transitions 0/187 dead transitions.
[2023-11-26 11:58:10,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 187 transitions, 984 flow
[2023-11-26 11:58:10,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-26 11:58:10,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-26 11:58:10,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions.
[2023-11-26 11:58:10,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8467153284671532
[2023-11-26 11:58:10,915 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions.
[2023-11-26 11:58:10,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions.
[2023-11-26 11:58:10,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 11:58:10,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions.
[2023-11-26 11:58:10,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 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:58:10,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 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:58:10,919 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 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:58:10,919 INFO L175 Difference]: Start difference. First operand has 135 places, 165 transitions, 672 flow. Second operand 3 states and 348 transitions.
[2023-11-26 11:58:10,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 187 transitions, 984 flow
[2023-11-26 11:58:10,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 187 transitions, 916 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-26 11:58:10,938 INFO L231 Difference]: Finished difference. Result has 137 places, 183 transitions, 870 flow
[2023-11-26 11:58:10,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=870, PETRI_PLACES=137, PETRI_TRANSITIONS=183}
[2023-11-26 11:58:10,940 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 2 predicate places.
[2023-11-26 11:58:10,940 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 183 transitions, 870 flow
[2023-11-26 11:58:10,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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:58:10,940 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:58:10,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]
[2023-11-26 11:58:10,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-26 11:58:10,941 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-26 11:58:10,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:58:10,942 INFO L85 PathProgramCache]: Analyzing trace with hash -559176797, now seen corresponding path program 1 times
[2023-11-26 11:58:10,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:58:10,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789290344]
[2023-11-26 11:58:10,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:58:10,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:58:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 11:58:10,979 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:58:10,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 11:58:10,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789290344]
[2023-11-26 11:58:10,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789290344] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 11:58:10,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 11:58:10,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-26 11:58:10,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537393250]
[2023-11-26 11:58:10,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 11:58:10,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 11:58:10,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 11:58:10,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 11:58:10,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 11:58:11,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137
[2023-11-26 11:58:11,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 183 transitions, 870 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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:58:11,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 11:58:11,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137
[2023-11-26 11:58:11,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 11:58:12,859 INFO L124 PetriNetUnfolderBase]: 3426/10677 cut-off events.
[2023-11-26 11:58:12,860 INFO L125 PetriNetUnfolderBase]: For 20984/21418 co-relation queries the response was YES.
[2023-11-26 11:58:12,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27699 conditions, 10677 events. 3426/10677 cut-off events. For 20984/21418 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 116325 event pairs, 1003 based on Foata normal form. 24/8914 useless extension candidates. Maximal degree in co-relation 27689. Up to 3920 conditions per place.
[2023-11-26 11:58:12,962 INFO L140 encePairwiseOnDemand]: 127/137 looper letters, 73 selfloop transitions, 28 changer transitions 0/210 dead transitions.
[2023-11-26 11:58:12,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 210 transitions, 1279 flow
[2023-11-26 11:58:12,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-26 11:58:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-26 11:58:12,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions.
[2023-11-26 11:58:12,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8588807785888077
[2023-11-26 11:58:12,964 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions.
[2023-11-26 11:58:12,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions.
[2023-11-26 11:58:12,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 11:58:12,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions.
[2023-11-26 11:58:12,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 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:58:12,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 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:58:12,971 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 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:58:12,971 INFO L175 Difference]: Start difference. First operand has 137 places, 183 transitions, 870 flow. Second operand 3 states and 353 transitions.
[2023-11-26 11:58:12,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 210 transitions, 1279 flow
[2023-11-26 11:58:13,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 210 transitions, 1183 flow, removed 20 selfloop flow, removed 2 redundant places.
[2023-11-26 11:58:13,031 INFO L231 Difference]: Finished difference. Result has 139 places, 205 transitions, 1124 flow
[2023-11-26 11:58:13,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1124, PETRI_PLACES=139, PETRI_TRANSITIONS=205}
[2023-11-26 11:58:13,034 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 4 predicate places.
[2023-11-26 11:58:13,034 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 205 transitions, 1124 flow
[2023-11-26 11:58:13,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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:58:13,034 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:58:13,035 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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:58:13,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-26 11:58:13,035 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-26 11:58:13,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:58:13,036 INFO L85 PathProgramCache]: Analyzing trace with hash -602538138, now seen corresponding path program 1 times
[2023-11-26 11:58:13,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:58:13,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006637238]
[2023-11-26 11:58:13,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:58:13,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:58:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 11:58:13,088 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-11-26 11:58:13,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 11:58:13,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006637238]
[2023-11-26 11:58:13,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006637238] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 11:58:13,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 11:58:13,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-26 11:58:13,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125734994]
[2023-11-26 11:58:13,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 11:58:13,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 11:58:13,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 11:58:13,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 11:58:13,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 11:58:13,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137
[2023-11-26 11:58:13,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 205 transitions, 1124 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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:58:13,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 11:58:13,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137
[2023-11-26 11:58:13,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 11:58:14,992 INFO L124 PetriNetUnfolderBase]: 4410/12965 cut-off events.
[2023-11-26 11:58:14,992 INFO L125 PetriNetUnfolderBase]: For 34048/34623 co-relation queries the response was YES.
[2023-11-26 11:58:15,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37012 conditions, 12965 events. 4410/12965 cut-off events. For 34048/34623 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 142177 event pairs, 1110 based on Foata normal form. 27/10829 useless extension candidates. Maximal degree in co-relation 37001. Up to 4835 conditions per place.
[2023-11-26 11:58:15,113 INFO L140 encePairwiseOnDemand]: 127/137 looper letters, 84 selfloop transitions, 44 changer transitions 0/239 dead transitions.
[2023-11-26 11:58:15,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 239 transitions, 1652 flow
[2023-11-26 11:58:15,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-26 11:58:15,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-26 11:58:15,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions.
[2023-11-26 11:58:15,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8564476885644768
[2023-11-26 11:58:15,116 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions.
[2023-11-26 11:58:15,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions.
[2023-11-26 11:58:15,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 11:58:15,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions.
[2023-11-26 11:58:15,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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:58:15,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 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:58:15,120 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 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:58:15,121 INFO L175 Difference]: Start difference. First operand has 139 places, 205 transitions, 1124 flow. Second operand 3 states and 352 transitions.
[2023-11-26 11:58:15,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 239 transitions, 1652 flow
[2023-11-26 11:58:15,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 239 transitions, 1528 flow, removed 24 selfloop flow, removed 2 redundant places.
[2023-11-26 11:58:15,220 INFO L231 Difference]: Finished difference. Result has 141 places, 235 transitions, 1502 flow
[2023-11-26 11:58:15,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1502, PETRI_PLACES=141, PETRI_TRANSITIONS=235}
[2023-11-26 11:58:15,221 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 6 predicate places.
[2023-11-26 11:58:15,221 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 235 transitions, 1502 flow
[2023-11-26 11:58:15,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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:58:15,222 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:58:15,222 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 11:58:15,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-11-26 11:58:15,222 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-26 11:58:15,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:58:15,223 INFO L85 PathProgramCache]: Analyzing trace with hash 2039971382, now seen corresponding path program 1 times
[2023-11-26 11:58:15,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:58:15,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886041508]
[2023-11-26 11:58:15,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:58:15,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:58:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-26 11:58:15,243 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-26 11:58:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-26 11:58:15,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-26 11:58:15,267 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-11-26 11:58:15,267 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining)
[2023-11-26 11:58:15,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining)
[2023-11-26 11:58:15,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining)
[2023-11-26 11:58:15,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining)
[2023-11-26 11:58:15,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining)
[2023-11-26 11:58:15,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining)
[2023-11-26 11:58:15,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining)
[2023-11-26 11:58:15,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining)
[2023-11-26 11:58:15,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining)
[2023-11-26 11:58:15,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining)
[2023-11-26 11:58:15,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining)
[2023-11-26 11:58:15,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining)
[2023-11-26 11:58:15,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining)
[2023-11-26 11:58:15,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-26 11:58:15,270 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 11:58:15,271 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-26 11:58:15,271 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-11-26 11:58:15,311 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-26 11:58:15,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 169 transitions, 356 flow
[2023-11-26 11:58:15,357 INFO L124 PetriNetUnfolderBase]: 18/332 cut-off events.
[2023-11-26 11:58:15,357 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES.
[2023-11-26 11:58:15,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 332 events. 18/332 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1225 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 249. Up to 8 conditions per place.
[2023-11-26 11:58:15,361 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 169 transitions, 356 flow
[2023-11-26 11:58:15,367 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 169 transitions, 356 flow
[2023-11-26 11:58:15,369 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-26 11:58:15,372 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;@7cf64110, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-11-26 11:58:15,372 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations.
[2023-11-26 11:58:15,375 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-26 11:58:15,376 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events.
[2023-11-26 11:58:15,376 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-26 11:58:15,376 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:58:15,376 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]
[2023-11-26 11:58:15,376 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-26 11:58:15,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:58:15,377 INFO L85 PathProgramCache]: Analyzing trace with hash -513088984, now seen corresponding path program 1 times
[2023-11-26 11:58:15,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:58:15,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329424883]
[2023-11-26 11:58:15,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:58:15,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:58:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 11:58:15,404 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:58:15,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 11:58:15,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329424883]
[2023-11-26 11:58:15,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329424883] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 11:58:15,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 11:58:15,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-26 11:58:15,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418855790]
[2023-11-26 11:58:15,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 11:58:15,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-26 11:58:15,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 11:58:15,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-26 11:58:15,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-26 11:58:15,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 169
[2023-11-26 11:58:15,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 169 transitions, 356 flow. Second operand has 2 states, 2 states have (on average 146.0) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 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:58:15,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 11:58:15,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 169
[2023-11-26 11:58:15,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 11:58:15,665 INFO L124 PetriNetUnfolderBase]: 178/1746 cut-off events.
[2023-11-26 11:58:15,665 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES.
[2023-11-26 11:58:15,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2095 conditions, 1746 events. 178/1746 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 14324 event pairs, 178 based on Foata normal form. 260/1723 useless extension candidates. Maximal degree in co-relation 1379. Up to 298 conditions per place.
[2023-11-26 11:58:15,682 INFO L140 encePairwiseOnDemand]: 160/169 looper letters, 11 selfloop transitions, 0 changer transitions 0/148 dead transitions.
[2023-11-26 11:58:15,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 148 transitions, 336 flow
[2023-11-26 11:58:15,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2023-11-26 11:58:15,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-26 11:58:15,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 310 transitions.
[2023-11-26 11:58:15,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9171597633136095
[2023-11-26 11:58:15,685 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 310 transitions.
[2023-11-26 11:58:15,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 310 transitions.
[2023-11-26 11:58:15,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 11:58:15,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 310 transitions.
[2023-11-26 11:58:15,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 155.0) internal successors, (310), 2 states have internal predecessors, (310), 0 states have call successors, (0), 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:58:15,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 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:58:15,688 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 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:58:15,689 INFO L175 Difference]: Start difference. First operand has 167 places, 169 transitions, 356 flow. Second operand 2 states and 310 transitions.
[2023-11-26 11:58:15,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 148 transitions, 336 flow
[2023-11-26 11:58:15,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 148 transitions, 334 flow, removed 1 selfloop flow, removed 0 redundant places.
[2023-11-26 11:58:15,694 INFO L231 Difference]: Finished difference. Result has 156 places, 148 transitions, 312 flow
[2023-11-26 11:58:15,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=312, PETRI_PLACES=156, PETRI_TRANSITIONS=148}
[2023-11-26 11:58:15,695 INFO L281 CegarLoopForPetriNet]: 167 programPoint places, -11 predicate places.
[2023-11-26 11:58:15,695 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 148 transitions, 312 flow
[2023-11-26 11:58:15,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 146.0) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 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:58:15,696 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:58:15,696 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]
[2023-11-26 11:58:15,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-11-26 11:58:15,696 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-26 11:58:15,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:58:15,697 INFO L85 PathProgramCache]: Analyzing trace with hash -81007133, now seen corresponding path program 1 times
[2023-11-26 11:58:15,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:58:15,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604664869]
[2023-11-26 11:58:15,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:58:15,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:58:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 11:58:15,728 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:58:15,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 11:58:15,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604664869]
[2023-11-26 11:58:15,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604664869] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 11:58:15,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 11:58:15,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-26 11:58:15,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627136256]
[2023-11-26 11:58:15,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 11:58:15,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 11:58:15,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 11:58:15,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 11:58:15,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 11:58:15,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 169
[2023-11-26 11:58:15,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 148 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 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:58:15,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 11:58:15,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 169
[2023-11-26 11:58:15,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 11:58:18,260 INFO L124 PetriNetUnfolderBase]: 8153/23088 cut-off events.
[2023-11-26 11:58:18,260 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES.
[2023-11-26 11:58:18,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34955 conditions, 23088 events. 8153/23088 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 265791 event pairs, 6323 based on Foata normal form. 0/19845 useless extension candidates. Maximal degree in co-relation 34949. Up to 10488 conditions per place.
[2023-11-26 11:58:18,415 INFO L140 encePairwiseOnDemand]: 156/169 looper letters, 34 selfloop transitions, 12 changer transitions 0/165 dead transitions.
[2023-11-26 11:58:18,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 165 transitions, 438 flow
[2023-11-26 11:58:18,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-26 11:58:18,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-26 11:58:18,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions.
[2023-11-26 11:58:18,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8441814595660749
[2023-11-26 11:58:18,418 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions.
[2023-11-26 11:58:18,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions.
[2023-11-26 11:58:18,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 11:58:18,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions.
[2023-11-26 11:58:18,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 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:58:18,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 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:58:18,422 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 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:58:18,422 INFO L175 Difference]: Start difference. First operand has 156 places, 148 transitions, 312 flow. Second operand 3 states and 428 transitions.
[2023-11-26 11:58:18,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 165 transitions, 438 flow
[2023-11-26 11:58:18,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 165 transitions, 438 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-26 11:58:18,426 INFO L231 Difference]: Finished difference. Result has 160 places, 159 transitions, 406 flow
[2023-11-26 11:58:18,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=160, PETRI_TRANSITIONS=159}
[2023-11-26 11:58:18,428 INFO L281 CegarLoopForPetriNet]: 167 programPoint places, -7 predicate places.
[2023-11-26 11:58:18,428 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 159 transitions, 406 flow
[2023-11-26 11:58:18,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 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:58:18,428 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:58:18,428 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]
[2023-11-26 11:58:18,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-11-26 11:58:18,429 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-26 11:58:18,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:58:18,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1116714810, now seen corresponding path program 1 times
[2023-11-26 11:58:18,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:58:18,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093557373]
[2023-11-26 11:58:18,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:58:18,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:58:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 11:58:18,458 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:58:18,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 11:58:18,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093557373]
[2023-11-26 11:58:18,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093557373] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 11:58:18,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 11:58:18,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-26 11:58:18,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509322751]
[2023-11-26 11:58:18,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 11:58:18,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 11:58:18,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 11:58:18,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 11:58:18,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 11:58:18,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 169
[2023-11-26 11:58:18,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 159 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 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:58:18,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 11:58:18,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 169
[2023-11-26 11:58:18,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 11:58:21,602 INFO L124 PetriNetUnfolderBase]: 11165/29147 cut-off events.
[2023-11-26 11:58:21,602 INFO L125 PetriNetUnfolderBase]: For 7745/8844 co-relation queries the response was YES.
[2023-11-26 11:58:21,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55213 conditions, 29147 events. 11165/29147 cut-off events. For 7745/8844 co-relation queries the response was YES. Maximal size of possible extension queue 1013. Compared 339671 event pairs, 6732 based on Foata normal form. 26/24775 useless extension candidates. Maximal degree in co-relation 55205. Up to 13156 conditions per place.
[2023-11-26 11:58:21,974 INFO L140 encePairwiseOnDemand]: 156/169 looper letters, 42 selfloop transitions, 19 changer transitions 0/184 dead transitions.
[2023-11-26 11:58:21,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 184 transitions, 628 flow
[2023-11-26 11:58:21,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-26 11:58:21,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-26 11:58:21,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions.
[2023-11-26 11:58:21,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8560157790927022
[2023-11-26 11:58:21,983 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions.
[2023-11-26 11:58:21,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions.
[2023-11-26 11:58:21,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 11:58:21,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions.
[2023-11-26 11:58:21,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 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:58:21,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 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:58:21,989 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 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:58:21,989 INFO L175 Difference]: Start difference. First operand has 160 places, 159 transitions, 406 flow. Second operand 3 states and 434 transitions.
[2023-11-26 11:58:21,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 184 transitions, 628 flow
[2023-11-26 11:58:22,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 184 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-26 11:58:22,103 INFO L231 Difference]: Finished difference. Result has 162 places, 176 transitions, 554 flow
[2023-11-26 11:58:22,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=162, PETRI_TRANSITIONS=176}
[2023-11-26 11:58:22,104 INFO L281 CegarLoopForPetriNet]: 167 programPoint places, -5 predicate places.
[2023-11-26 11:58:22,104 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 176 transitions, 554 flow
[2023-11-26 11:58:22,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 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:58:22,105 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:58:22,105 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]
[2023-11-26 11:58:22,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-11-26 11:58:22,105 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-26 11:58:22,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:58:22,106 INFO L85 PathProgramCache]: Analyzing trace with hash 488678962, now seen corresponding path program 1 times
[2023-11-26 11:58:22,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:58:22,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815972351]
[2023-11-26 11:58:22,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:58:22,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:58:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 11:58:22,148 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:58:22,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 11:58:22,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815972351]
[2023-11-26 11:58:22,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815972351] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 11:58:22,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 11:58:22,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-26 11:58:22,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87699073]
[2023-11-26 11:58:22,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 11:58:22,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 11:58:22,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 11:58:22,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 11:58:22,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 11:58:22,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 169
[2023-11-26 11:58:22,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 176 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 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:58:22,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 11:58:22,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 169
[2023-11-26 11:58:22,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 11:58:27,388 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][148], [75#L693-7true, 115#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 170#true, thr1Thread1of3ForFork0InUse, 179#true, thr1Thread2of3ForFork0InUse, 16#L693-6true, thr1Thread3of3ForFork0InUse, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:27,389 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event
[2023-11-26 11:58:27,389 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event
[2023-11-26 11:58:27,389 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event
[2023-11-26 11:58:27,389 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event
[2023-11-26 11:58:27,818 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][218], [75#L693-7true, 113#L693-4true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 170#true, thr1Thread1of3ForFork0InUse, 179#true, 185#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true])
[2023-11-26 11:58:27,818 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event
[2023-11-26 11:58:27,819 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event
[2023-11-26 11:58:27,819 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event
[2023-11-26 11:58:27,819 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event
[2023-11-26 11:58:27,837 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][199], [Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 113#L693-4true, 115#L693-7true, 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 170#true, 185#true, thr1Thread1of3ForFork0InUse, 179#true, thr1Thread2of3ForFork0InUse, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), thr1Thread3of3ForFork0InUse, 98#L693-14true])
[2023-11-26 11:58:27,837 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event
[2023-11-26 11:58:27,838 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event
[2023-11-26 11:58:27,838 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event
[2023-11-26 11:58:27,838 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event
[2023-11-26 11:58:28,456 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][127], [115#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 170#true, thr1Thread1of3ForFork0InUse, 179#true, 185#true, thr1Thread2of3ForFork0InUse, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), thr1Thread3of3ForFork0InUse, 98#L693-14true, 155#L693-5true])
[2023-11-26 11:58:28,456 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event
[2023-11-26 11:58:28,456 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event
[2023-11-26 11:58:28,456 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event
[2023-11-26 11:58:28,456 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event
[2023-11-26 11:58:28,458 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][179], [75#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 170#true, 185#true, thr1Thread1of3ForFork0InUse, 179#true, thr1Thread2of3ForFork0InUse, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), thr1Thread3of3ForFork0InUse, 58#L693-14true, 155#L693-5true])
[2023-11-26 11:58:28,458 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event
[2023-11-26 11:58:28,458 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event
[2023-11-26 11:58:28,458 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event
[2023-11-26 11:58:28,458 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event
[2023-11-26 11:58:31,648 INFO L124 PetriNetUnfolderBase]: 31822/79067 cut-off events.
[2023-11-26 11:58:31,649 INFO L125 PetriNetUnfolderBase]: For 55086/56791 co-relation queries the response was YES.
[2023-11-26 11:58:31,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171397 conditions, 79067 events. 31822/79067 cut-off events. For 55086/56791 co-relation queries the response was YES. Maximal size of possible extension queue 2881. Compared 1035877 event pairs, 10576 based on Foata normal form. 71/65212 useless extension candidates. Maximal degree in co-relation 171388. Up to 24692 conditions per place.
[2023-11-26 11:58:32,175 INFO L140 encePairwiseOnDemand]: 149/169 looper letters, 65 selfloop transitions, 40 changer transitions 0/226 dead transitions.
[2023-11-26 11:58:32,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 226 transitions, 1036 flow
[2023-11-26 11:58:32,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-26 11:58:32,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-26 11:58:32,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions.
[2023-11-26 11:58:32,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8599605522682445
[2023-11-26 11:58:32,177 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 436 transitions.
[2023-11-26 11:58:32,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions.
[2023-11-26 11:58:32,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 11:58:32,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions.
[2023-11-26 11:58:32,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 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:58:32,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 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:58:32,181 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 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:58:32,182 INFO L175 Difference]: Start difference. First operand has 162 places, 176 transitions, 554 flow. Second operand 3 states and 436 transitions.
[2023-11-26 11:58:32,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 226 transitions, 1036 flow
[2023-11-26 11:58:32,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 226 transitions, 964 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-26 11:58:32,521 INFO L231 Difference]: Finished difference. Result has 164 places, 216 transitions, 972 flow
[2023-11-26 11:58:32,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=972, PETRI_PLACES=164, PETRI_TRANSITIONS=216}
[2023-11-26 11:58:32,522 INFO L281 CegarLoopForPetriNet]: 167 programPoint places, -3 predicate places.
[2023-11-26 11:58:32,522 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 216 transitions, 972 flow
[2023-11-26 11:58:32,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 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:58:32,523 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:58:32,523 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]
[2023-11-26 11:58:32,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2023-11-26 11:58:32,523 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-26 11:58:32,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:58:32,524 INFO L85 PathProgramCache]: Analyzing trace with hash -789703729, now seen corresponding path program 1 times
[2023-11-26 11:58:32,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:58:32,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804229181]
[2023-11-26 11:58:32,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:58:32,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:58:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 11:58:32,560 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:58:32,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 11:58:32,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804229181]
[2023-11-26 11:58:32,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804229181] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 11:58:32,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 11:58:32,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-26 11:58:32,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755653663]
[2023-11-26 11:58:32,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 11:58:32,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 11:58:32,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 11:58:32,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 11:58:32,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 11:58:32,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 169
[2023-11-26 11:58:32,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 216 transitions, 972 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 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:58:32,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 11:58:32,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 169
[2023-11-26 11:58:32,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 11:58:35,374 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][226], [75#L693-7true, 113#L693-4true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 125#L693-3true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:35,374 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event
[2023-11-26 11:58:35,374 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event
[2023-11-26 11:58:35,374 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event
[2023-11-26 11:58:35,374 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event
[2023-11-26 11:58:35,536 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][142], [75#L693-7true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 16#L693-6true, thr1Thread3of3ForFork0InUse, 191#true, 187#(= |#race~c~0| 0), 95#L692-3true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true])
[2023-11-26 11:58:35,536 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event
[2023-11-26 11:58:35,536 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event
[2023-11-26 11:58:35,536 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event
[2023-11-26 11:58:35,536 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event
[2023-11-26 11:58:35,819 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][200], [113#L693-4true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 95#L692-3true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:35,820 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event
[2023-11-26 11:58:35,820 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event
[2023-11-26 11:58:35,820 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event
[2023-11-26 11:58:35,820 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event
[2023-11-26 11:58:36,618 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([600] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][141], [75#L693-7true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, thr1Thread3of3ForFork0InUse, 191#true, 187#(= |#race~c~0| 0), 95#L692-3true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true, 92#L693-6true])
[2023-11-26 11:58:36,618 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event
[2023-11-26 11:58:36,618 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event
[2023-11-26 11:58:36,618 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event
[2023-11-26 11:58:36,618 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event
[2023-11-26 11:58:36,664 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][170], [75#L693-7true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 155#L693-5true, 125#L693-3true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:36,664 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event
[2023-11-26 11:58:36,664 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event
[2023-11-26 11:58:36,665 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event
[2023-11-26 11:58:36,665 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event
[2023-11-26 11:58:36,701 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][201], [75#L693-7true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, thr1Thread3of3ForFork0InUse, 191#true, 97#L693-4true, 125#L693-3true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:36,701 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event
[2023-11-26 11:58:36,701 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event
[2023-11-26 11:58:36,701 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event
[2023-11-26 11:58:36,702 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event
[2023-11-26 11:58:36,925 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][162], [170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, thr1Thread3of3ForFork0InUse, 191#true, 97#L693-4true, 95#L692-3true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:36,925 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event
[2023-11-26 11:58:36,925 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event
[2023-11-26 11:58:36,925 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event
[2023-11-26 11:58:36,925 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event
[2023-11-26 11:58:36,948 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][122], [170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 95#L692-3true, 155#L693-5true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:36,948 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is not cut-off event
[2023-11-26 11:58:36,948 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is not cut-off event
[2023-11-26 11:58:36,948 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is not cut-off event
[2023-11-26 11:58:36,948 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is not cut-off event
[2023-11-26 11:58:37,483 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][122], [170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, thr1Thread3of3ForFork0InUse, 191#true, 95#L692-3true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 185#true, 61#L693-5true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:37,483 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event
[2023-11-26 11:58:37,483 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event
[2023-11-26 11:58:37,484 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event
[2023-11-26 11:58:37,484 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event
[2023-11-26 11:58:38,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][170], [75#L693-7true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, thr1Thread3of3ForFork0InUse, 191#true, 125#L693-3true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 185#true, 61#L693-5true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:38,197 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is not cut-off event
[2023-11-26 11:58:38,197 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event
[2023-11-26 11:58:38,197 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event
[2023-11-26 11:58:38,197 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event
[2023-11-26 11:58:38,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][142], [75#L693-7true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 16#L693-6true, thr1Thread3of3ForFork0InUse, 191#true, 187#(= |#race~c~0| 0), 115#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true])
[2023-11-26 11:58:38,621 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event
[2023-11-26 11:58:38,621 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event
[2023-11-26 11:58:38,621 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event
[2023-11-26 11:58:38,621 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event
[2023-11-26 11:58:38,680 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([600] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][141], [75#L693-7true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 187#(= |#race~c~0| 0), 115#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 112#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true, 92#L693-6true])
[2023-11-26 11:58:38,680 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event
[2023-11-26 11:58:38,680 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event
[2023-11-26 11:58:38,680 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event
[2023-11-26 11:58:38,680 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event
[2023-11-26 11:58:39,047 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][204], [75#L693-7true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 97#L693-4true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 112#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:39,047 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event
[2023-11-26 11:58:39,048 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event
[2023-11-26 11:58:39,048 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event
[2023-11-26 11:58:39,048 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event
[2023-11-26 11:58:39,049 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][228], [75#L693-7true, 113#L693-4true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:39,049 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event
[2023-11-26 11:58:39,049 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event
[2023-11-26 11:58:39,049 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event
[2023-11-26 11:58:39,049 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event
[2023-11-26 11:58:39,057 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][162], [170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 97#L693-4true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 115#L693-7true, 112#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:39,057 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event
[2023-11-26 11:58:39,057 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event
[2023-11-26 11:58:39,058 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event
[2023-11-26 11:58:39,058 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event
[2023-11-26 11:58:39,387 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][200], [113#L693-4true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 115#L693-7true, 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:39,388 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event
[2023-11-26 11:58:39,388 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event
[2023-11-26 11:58:39,388 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event
[2023-11-26 11:58:39,388 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event
[2023-11-26 11:58:40,169 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][122], [170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 155#L693-5true, 115#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:40,169 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event
[2023-11-26 11:58:40,169 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event
[2023-11-26 11:58:40,169 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event
[2023-11-26 11:58:40,169 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event
[2023-11-26 11:58:40,171 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][178], [75#L693-7true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 155#L693-5true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:40,171 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event
[2023-11-26 11:58:40,171 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event
[2023-11-26 11:58:40,171 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event
[2023-11-26 11:58:40,171 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event
[2023-11-26 11:58:40,235 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][122], [170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 115#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 112#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, 61#L693-5true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:40,235 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event
[2023-11-26 11:58:40,236 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event
[2023-11-26 11:58:40,236 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event
[2023-11-26 11:58:40,236 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event
[2023-11-26 11:58:40,238 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][178], [75#L693-7true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 112#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, 61#L693-5true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:40,238 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event
[2023-11-26 11:58:40,238 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event
[2023-11-26 11:58:40,238 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event
[2023-11-26 11:58:40,238 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event
[2023-11-26 11:58:43,697 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][162], [170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 97#L693-4true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 185#true, 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, 19#L694-3true, Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:43,697 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event
[2023-11-26 11:58:43,697 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event
[2023-11-26 11:58:43,697 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event
[2023-11-26 11:58:43,697 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event
[2023-11-26 11:58:43,699 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][204], [170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 97#L693-4true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 74#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 19#L694-3true, 58#L693-14true, Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:43,699 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event
[2023-11-26 11:58:43,699 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event
[2023-11-26 11:58:43,699 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event
[2023-11-26 11:58:43,699 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event
[2023-11-26 11:58:43,967 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][178], [170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, 74#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 19#L694-3true, 58#L693-14true, Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:43,967 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event
[2023-11-26 11:58:43,967 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event
[2023-11-26 11:58:43,968 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event
[2023-11-26 11:58:43,968 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event
[2023-11-26 11:58:43,970 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][122], [170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, 19#L694-3true, Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:43,970 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event
[2023-11-26 11:58:43,970 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event
[2023-11-26 11:58:43,970 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event
[2023-11-26 11:58:43,970 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event
[2023-11-26 11:58:44,963 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][162], [30#L701-3true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 97#L693-4true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 185#true, 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:44,963 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event
[2023-11-26 11:58:44,963 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event
[2023-11-26 11:58:44,964 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event
[2023-11-26 11:58:44,964 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event
[2023-11-26 11:58:44,966 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][204], [30#L701-3true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 97#L693-4true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 74#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:44,966 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event
[2023-11-26 11:58:44,966 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event
[2023-11-26 11:58:44,966 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event
[2023-11-26 11:58:44,966 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event
[2023-11-26 11:58:45,134 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][122], [30#L701-3true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:45,135 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event
[2023-11-26 11:58:45,135 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event
[2023-11-26 11:58:45,135 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event
[2023-11-26 11:58:45,135 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event
[2023-11-26 11:58:45,139 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][178], [30#L701-3true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, 74#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:45,139 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event
[2023-11-26 11:58:45,140 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event
[2023-11-26 11:58:45,140 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event
[2023-11-26 11:58:45,140 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event
[2023-11-26 11:58:45,906 INFO L124 PetriNetUnfolderBase]: 45455/114802 cut-off events.
[2023-11-26 11:58:45,906 INFO L125 PetriNetUnfolderBase]: For 219378/225225 co-relation queries the response was YES.
[2023-11-26 11:58:46,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306745 conditions, 114802 events. 45455/114802 cut-off events. For 219378/225225 co-relation queries the response was YES. Maximal size of possible extension queue 3829. Compared 1566389 event pairs, 17128 based on Foata normal form. 381/95894 useless extension candidates. Maximal degree in co-relation 306735. Up to 49255 conditions per place.
[2023-11-26 11:58:47,386 INFO L140 encePairwiseOnDemand]: 156/169 looper letters, 91 selfloop transitions, 36 changer transitions 0/254 dead transitions.
[2023-11-26 11:58:47,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 254 transitions, 1504 flow
[2023-11-26 11:58:47,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-26 11:58:47,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-26 11:58:47,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions.
[2023-11-26 11:58:47,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8441814595660749
[2023-11-26 11:58:47,390 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions.
[2023-11-26 11:58:47,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions.
[2023-11-26 11:58:47,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 11:58:47,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions.
[2023-11-26 11:58:47,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 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:58:47,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 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:58:47,395 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 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:58:47,395 INFO L175 Difference]: Start difference. First operand has 164 places, 216 transitions, 972 flow. Second operand 3 states and 428 transitions.
[2023-11-26 11:58:47,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 254 transitions, 1504 flow
[2023-11-26 11:58:47,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 254 transitions, 1394 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-26 11:58:47,552 INFO L231 Difference]: Finished difference. Result has 166 places, 248 transitions, 1338 flow
[2023-11-26 11:58:47,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1338, PETRI_PLACES=166, PETRI_TRANSITIONS=248}
[2023-11-26 11:58:47,554 INFO L281 CegarLoopForPetriNet]: 167 programPoint places, -1 predicate places.
[2023-11-26 11:58:47,554 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 248 transitions, 1338 flow
[2023-11-26 11:58:47,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 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:58:47,554 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:58:47,555 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]
[2023-11-26 11:58:47,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2023-11-26 11:58:47,555 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-26 11:58:47,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:58:47,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1949648860, now seen corresponding path program 1 times
[2023-11-26 11:58:47,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:58:47,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310627159]
[2023-11-26 11:58:47,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:58:47,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:58:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 11:58:47,614 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:58:47,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 11:58:47,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310627159]
[2023-11-26 11:58:47,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310627159] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 11:58:47,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 11:58:47,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-26 11:58:47,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023570190]
[2023-11-26 11:58:47,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 11:58:47,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 11:58:47,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 11:58:47,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 11:58:47,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 11:58:47,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 169
[2023-11-26 11:58:47,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 248 transitions, 1338 flow. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 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:58:47,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 11:58:47,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 169
[2023-11-26 11:58:47,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 11:58:50,320 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][246], [75#L693-7true, 113#L693-4true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 197#true, 125#L693-3true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:50,320 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event
[2023-11-26 11:58:50,320 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event
[2023-11-26 11:58:50,320 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event
[2023-11-26 11:58:50,320 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event
[2023-11-26 11:58:50,868 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][145], [75#L693-7true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 16#L693-6true, thr1Thread3of3ForFork0InUse, 191#true, 95#L692-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true])
[2023-11-26 11:58:50,868 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event
[2023-11-26 11:58:50,868 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event
[2023-11-26 11:58:50,868 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event
[2023-11-26 11:58:50,869 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event
[2023-11-26 11:58:51,208 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][213], [113#L693-4true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 95#L692-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:51,208 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event
[2023-11-26 11:58:51,208 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event
[2023-11-26 11:58:51,208 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event
[2023-11-26 11:58:51,208 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event
[2023-11-26 11:58:51,674 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([600] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][144], [75#L693-7true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, thr1Thread3of3ForFork0InUse, 191#true, 95#L692-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true, 92#L693-6true])
[2023-11-26 11:58:51,674 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event
[2023-11-26 11:58:51,674 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event
[2023-11-26 11:58:51,674 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event
[2023-11-26 11:58:51,674 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event
[2023-11-26 11:58:51,733 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][178], [75#L693-7true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 155#L693-5true, 125#L693-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:51,734 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event
[2023-11-26 11:58:51,734 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event
[2023-11-26 11:58:51,734 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event
[2023-11-26 11:58:51,734 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event
[2023-11-26 11:58:51,770 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][214], [75#L693-7true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, thr1Thread3of3ForFork0InUse, 191#true, 97#L693-4true, 197#true, 125#L693-3true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:51,770 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event
[2023-11-26 11:58:51,770 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event
[2023-11-26 11:58:51,770 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event
[2023-11-26 11:58:51,770 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event
[2023-11-26 11:58:52,072 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][169], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, thr1Thread3of3ForFork0InUse, 191#true, 97#L693-4true, 95#L692-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:52,072 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event
[2023-11-26 11:58:52,072 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event
[2023-11-26 11:58:52,072 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event
[2023-11-26 11:58:52,072 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event
[2023-11-26 11:58:52,090 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][122], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 155#L693-5true, 95#L692-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:52,090 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is not cut-off event
[2023-11-26 11:58:52,090 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is not cut-off event
[2023-11-26 11:58:52,090 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is not cut-off event
[2023-11-26 11:58:52,090 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is not cut-off event
[2023-11-26 11:58:52,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([461] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][156], [75#L693-7true, 170#true, thr1Thread1of3ForFork0InUse, Black: 191#true, 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 97#L693-4true, 54#L693-14true, 95#L692-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:52,123 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event
[2023-11-26 11:58:52,123 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event
[2023-11-26 11:58:52,123 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event
[2023-11-26 11:58:52,123 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event
[2023-11-26 11:58:52,788 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([461] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][66], [75#L693-7true, 170#true, thr1Thread1of3ForFork0InUse, Black: 191#true, 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 95#L692-3true, 54#L693-14true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 61#L693-5true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:52,788 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event
[2023-11-26 11:58:52,788 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event
[2023-11-26 11:58:52,788 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event
[2023-11-26 11:58:52,788 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event
[2023-11-26 11:58:53,232 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][122], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, thr1Thread3of3ForFork0InUse, 191#true, 95#L692-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 61#L693-5true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)])
[2023-11-26 11:58:53,232 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event
[2023-11-26 11:58:53,232 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event
[2023-11-26 11:58:53,232 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event
[2023-11-26 11:58:53,232 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event