./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-inner-race-2.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_7740ab89-f13f-4b3e-878b-2a517af573a9/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7740ab89-f13f-4b3e-878b-2a517af573a9/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_7740ab89-f13f-4b3e-878b-2a517af573a9/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7740ab89-f13f-4b3e-878b-2a517af573a9/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-inner-race-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7740ab89-f13f-4b3e-878b-2a517af573a9/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_7740ab89-f13f-4b3e-878b-2a517af573a9/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 57356a47c1e9533c32a5036af0336a5d2dbdf5bea55ed5f64606bf9ec7afd35e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:58:41,154 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:58:41,232 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7740ab89-f13f-4b3e-878b-2a517af573a9/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-26 11:58:41,237 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:58:41,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:58:41,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:58:41,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:58:41,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:58:41,265 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:58:41,266 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:58:41,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:58:41,267 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:58:41,268 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:58:41,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:58:41,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:58:41,270 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:58:41,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:58:41,271 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:58:41,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:58:41,272 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:58:41,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:58:41,273 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:58:41,273 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-26 11:58:41,274 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:58:41,274 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:58:41,275 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:58:41,275 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:58:41,276 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:58:41,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:58:41,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:58:41,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:58:41,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:58:41,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:58:41,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:58:41,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:58:41,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:58:41,280 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:58:41,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:58:41,281 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:58:41,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:58:41,282 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:58:41,282 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_7740ab89-f13f-4b3e-878b-2a517af573a9/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_7740ab89-f13f-4b3e-878b-2a517af573a9/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 -> 57356a47c1e9533c32a5036af0336a5d2dbdf5bea55ed5f64606bf9ec7afd35e [2023-11-26 11:58:41,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:58:41,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:58:41,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:58:41,608 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:58:41,609 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:58:41,611 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7740ab89-f13f-4b3e-878b-2a517af573a9/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-inner-race-2.i [2023-11-26 11:58:44,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:58:45,090 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:58:45,091 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7740ab89-f13f-4b3e-878b-2a517af573a9/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-inner-race-2.i [2023-11-26 11:58:45,117 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7740ab89-f13f-4b3e-878b-2a517af573a9/bin/uautomizer-verify-VRDe98Ueme/data/7b627ba6e/ff28bb45cd1f4fab9d92171b60a05943/FLAG17a964579 [2023-11-26 11:58:45,139 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7740ab89-f13f-4b3e-878b-2a517af573a9/bin/uautomizer-verify-VRDe98Ueme/data/7b627ba6e/ff28bb45cd1f4fab9d92171b60a05943 [2023-11-26 11:58:45,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:58:45,147 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:58:45,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:58:45,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:58:45,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:58:45,157 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:58:45" (1/1) ... [2023-11-26 11:58:45,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d80699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:45, skipping insertion in model container [2023-11-26 11:58:45,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:58:45" (1/1) ... [2023-11-26 11:58:45,222 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:58:45,613 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:58:45,641 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:58:45,725 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:58:45,773 WARN L675 CHandler]: The function pthread_detach is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:58:45,781 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:58:45,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:45 WrapperNode [2023-11-26 11:58:45,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:58:45,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:58:45,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:58:45,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:58:45,793 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:45" (1/1) ... [2023-11-26 11:58:45,830 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:45" (1/1) ... [2023-11-26 11:58:45,858 INFO L138 Inliner]: procedures = 160, calls = 58, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 127 [2023-11-26 11:58:45,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:58:45,859 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:58:45,859 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:58:45,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:58:45,869 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:45" (1/1) ... [2023-11-26 11:58:45,870 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:45" (1/1) ... [2023-11-26 11:58:45,886 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:45" (1/1) ... [2023-11-26 11:58:45,892 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:45" (1/1) ... [2023-11-26 11:58:45,900 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:45" (1/1) ... [2023-11-26 11:58:45,916 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:45" (1/1) ... [2023-11-26 11:58:45,922 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:45" (1/1) ... [2023-11-26 11:58:45,924 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:45" (1/1) ... [2023-11-26 11:58:45,927 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:58:45,928 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:58:45,928 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:58:45,929 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:58:45,930 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:45" (1/1) ... [2023-11-26 11:58:45,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:58:45,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7740ab89-f13f-4b3e-878b-2a517af573a9/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:58:45,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7740ab89-f13f-4b3e-878b-2a517af573a9/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:45,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7740ab89-f13f-4b3e-878b-2a517af573a9/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:46,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-26 11:58:46,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-26 11:58:46,004 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-26 11:58:46,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:58:46,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:58:46,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:58:46,011 INFO L130 BoogieDeclarations]: Found specification of procedure pthread_detach [2023-11-26 11:58:46,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-26 11:58:46,012 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-26 11:58:46,012 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-26 11:58:46,012 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-26 11:58:46,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:58:46,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:58:46,015 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:46,161 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:58:46,163 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:58:46,546 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:58:46,608 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:58:46,608 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-26 11:58:46,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:58:46 BoogieIcfgContainer [2023-11-26 11:58:46,610 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:58:46,613 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:58:46,613 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:58:46,617 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:58:46,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:58:45" (1/3) ... [2023-11-26 11:58:46,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2158c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:58:46, skipping insertion in model container [2023-11-26 11:58:46,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:45" (2/3) ... [2023-11-26 11:58:46,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2158c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:58:46, skipping insertion in model container [2023-11-26 11:58:46,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:58:46" (3/3) ... [2023-11-26 11:58:46,642 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-counter-inner-race-2.i [2023-11-26 11:58:46,652 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 11:58:46,663 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:58:46,663 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-26 11:58:46,663 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 11:58:46,777 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:58:46,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 186 transitions, 376 flow [2023-11-26 11:58:46,938 INFO L124 PetriNetUnfolderBase]: 13/239 cut-off events. [2023-11-26 11:58:46,938 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:58:46,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 239 events. 13/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 451 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 131. Up to 4 conditions per place. [2023-11-26 11:58:46,946 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 186 transitions, 376 flow [2023-11-26 11:58:46,954 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 186 transitions, 376 flow [2023-11-26 11:58:46,966 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:58:46,974 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;@3a2dea9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:58:46,974 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-11-26 11:58:46,994 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:58:46,994 INFO L124 PetriNetUnfolderBase]: 2/66 cut-off events. [2023-11-26 11:58:46,994 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:58:46,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:46,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, 1, 1, 1, 1, 1, 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:46,996 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-26 11:58:47,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:47,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1585845305, now seen corresponding path program 1 times [2023-11-26 11:58:47,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:47,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617227324] [2023-11-26 11:58:47,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:47,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:47,393 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,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:47,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617227324] [2023-11-26 11:58:47,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617227324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:47,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:47,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:47,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018280472] [2023-11-26 11:58:47,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:47,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:47,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:47,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:47,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:47,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 186 [2023-11-26 11:58:47,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 186 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have 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,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:47,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 186 [2023-11-26 11:58:47,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:47,973 INFO L124 PetriNetUnfolderBase]: 421/1875 cut-off events. [2023-11-26 11:58:47,974 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-26 11:58:47,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 1875 events. 421/1875 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 13560 event pairs, 78 based on Foata normal form. 44/1729 useless extension candidates. Maximal degree in co-relation 2586. Up to 507 conditions per place. [2023-11-26 11:58:47,999 INFO L140 encePairwiseOnDemand]: 169/186 looper letters, 51 selfloop transitions, 8 changer transitions 1/205 dead transitions. [2023-11-26 11:58:47,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 205 transitions, 532 flow [2023-11-26 11:58:48,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:48,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:48,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2023-11-26 11:58:48,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9139784946236559 [2023-11-26 11:58:48,024 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 510 transitions. [2023-11-26 11:58:48,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 510 transitions. [2023-11-26 11:58:48,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:48,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 510 transitions. [2023-11-26 11:58:48,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have 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:48,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have 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:48,044 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have 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:48,047 INFO L175 Difference]: Start difference. First operand has 181 places, 186 transitions, 376 flow. Second operand 3 states and 510 transitions. [2023-11-26 11:58:48,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 205 transitions, 532 flow [2023-11-26 11:58:48,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 205 transitions, 532 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:58:48,061 INFO L231 Difference]: Finished difference. Result has 183 places, 184 transitions, 420 flow [2023-11-26 11:58:48,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=183, PETRI_TRANSITIONS=184} [2023-11-26 11:58:48,070 INFO L281 CegarLoopForPetriNet]: 181 programPoint places, 2 predicate places. [2023-11-26 11:58:48,070 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 184 transitions, 420 flow [2023-11-26 11:58:48,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have 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:48,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:48,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:48,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:58:48,072 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-26 11:58:48,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:48,075 INFO L85 PathProgramCache]: Analyzing trace with hash 761967791, now seen corresponding path program 1 times [2023-11-26 11:58:48,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:48,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994293822] [2023-11-26 11:58:48,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:48,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:48,960 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:48,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:48,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994293822] [2023-11-26 11:58:48,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994293822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:48,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:48,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:58:48,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870761021] [2023-11-26 11:58:48,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:48,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:58:48,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:48,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:58:48,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:58:49,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 186 [2023-11-26 11:58:49,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 184 transitions, 420 flow. Second operand has 6 states, 6 states have (on average 150.33333333333334) internal successors, (902), 6 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have 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:49,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:49,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 186 [2023-11-26 11:58:49,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:49,744 INFO L124 PetriNetUnfolderBase]: 393/2234 cut-off events. [2023-11-26 11:58:49,744 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2023-11-26 11:58:49,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3190 conditions, 2234 events. 393/2234 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 16854 event pairs, 218 based on Foata normal form. 0/2028 useless extension candidates. Maximal degree in co-relation 3059. Up to 582 conditions per place. [2023-11-26 11:58:49,762 INFO L140 encePairwiseOnDemand]: 180/186 looper letters, 66 selfloop transitions, 5 changer transitions 0/223 dead transitions. [2023-11-26 11:58:49,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 223 transitions, 640 flow [2023-11-26 11:58:49,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:58:49,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:58:49,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 966 transitions. [2023-11-26 11:58:49,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8655913978494624 [2023-11-26 11:58:49,768 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 966 transitions. [2023-11-26 11:58:49,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 966 transitions. [2023-11-26 11:58:49,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:49,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 966 transitions. [2023-11-26 11:58:49,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 161.0) internal successors, (966), 6 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have 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:49,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 186.0) internal successors, (1302), 7 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have 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:49,781 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 186.0) internal successors, (1302), 7 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have 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:49,781 INFO L175 Difference]: Start difference. First operand has 183 places, 184 transitions, 420 flow. Second operand 6 states and 966 transitions. [2023-11-26 11:58:49,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 223 transitions, 640 flow [2023-11-26 11:58:49,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 223 transitions, 624 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:58:49,796 INFO L231 Difference]: Finished difference. Result has 184 places, 183 transitions, 412 flow [2023-11-26 11:58:49,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=412, PETRI_PLACES=184, PETRI_TRANSITIONS=183} [2023-11-26 11:58:49,798 INFO L281 CegarLoopForPetriNet]: 181 programPoint places, 3 predicate places. [2023-11-26 11:58:49,798 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 183 transitions, 412 flow [2023-11-26 11:58:49,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 150.33333333333334) internal successors, (902), 6 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have 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:49,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:49,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:49,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:58:49,803 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-26 11:58:49,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:49,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1261194709, now seen corresponding path program 1 times [2023-11-26 11:58:49,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:49,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734675505] [2023-11-26 11:58:49,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:49,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:49,864 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:49,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:49,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734675505] [2023-11-26 11:58:49,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734675505] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:49,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:49,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:49,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470017924] [2023-11-26 11:58:49,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:49,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:49,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:49,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:49,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:49,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 186 [2023-11-26 11:58:49,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 183 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have 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:49,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:49,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 186 [2023-11-26 11:58:49,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:50,367 INFO L124 PetriNetUnfolderBase]: 468/2046 cut-off events. [2023-11-26 11:58:50,367 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-26 11:58:50,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3056 conditions, 2046 events. 468/2046 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 15178 event pairs, 290 based on Foata normal form. 0/1833 useless extension candidates. Maximal degree in co-relation 2926. Up to 748 conditions per place. [2023-11-26 11:58:50,382 INFO L140 encePairwiseOnDemand]: 181/186 looper letters, 38 selfloop transitions, 4 changer transitions 0/196 dead transitions. [2023-11-26 11:58:50,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 196 transitions, 522 flow [2023-11-26 11:58:50,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:50,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:50,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2023-11-26 11:58:50,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8942652329749103 [2023-11-26 11:58:50,385 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 499 transitions. [2023-11-26 11:58:50,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions. [2023-11-26 11:58:50,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:50,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions. [2023-11-26 11:58:50,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have 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:50,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have 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:50,391 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have 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:50,391 INFO L175 Difference]: Start difference. First operand has 184 places, 183 transitions, 412 flow. Second operand 3 states and 499 transitions. [2023-11-26 11:58:50,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 196 transitions, 522 flow [2023-11-26 11:58:50,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 196 transitions, 512 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-26 11:58:50,431 INFO L231 Difference]: Finished difference. Result has 183 places, 186 transitions, 432 flow [2023-11-26 11:58:50,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=183, PETRI_TRANSITIONS=186} [2023-11-26 11:58:50,433 INFO L281 CegarLoopForPetriNet]: 181 programPoint places, 2 predicate places. [2023-11-26 11:58:50,434 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 186 transitions, 432 flow [2023-11-26 11:58:50,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have 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:50,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:50,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:50,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:58:50,435 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-26 11:58:50,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:50,436 INFO L85 PathProgramCache]: Analyzing trace with hash -2093627855, now seen corresponding path program 1 times [2023-11-26 11:58:50,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:50,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237759229] [2023-11-26 11:58:50,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:50,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:50,512 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:50,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:50,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237759229] [2023-11-26 11:58:50,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237759229] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:50,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:50,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:50,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609212694] [2023-11-26 11:58:50,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:50,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:50,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:50,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:50,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:50,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 186 [2023-11-26 11:58:50,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 186 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have 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:50,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:50,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 186 [2023-11-26 11:58:50,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:50,934 INFO L124 PetriNetUnfolderBase]: 477/2129 cut-off events. [2023-11-26 11:58:50,935 INFO L125 PetriNetUnfolderBase]: For 187/195 co-relation queries the response was YES. [2023-11-26 11:58:50,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3384 conditions, 2129 events. 477/2129 cut-off events. For 187/195 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 15811 event pairs, 281 based on Foata normal form. 4/1913 useless extension candidates. Maximal degree in co-relation 3251. Up to 814 conditions per place. [2023-11-26 11:58:50,951 INFO L140 encePairwiseOnDemand]: 180/186 looper letters, 44 selfloop transitions, 7 changer transitions 0/202 dead transitions. [2023-11-26 11:58:50,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 202 transitions, 574 flow [2023-11-26 11:58:50,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:50,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:50,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2023-11-26 11:58:50,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2023-11-26 11:58:50,954 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 496 transitions. [2023-11-26 11:58:50,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 496 transitions. [2023-11-26 11:58:50,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:50,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 496 transitions. [2023-11-26 11:58:50,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have 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:50,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have 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:50,959 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have 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:50,960 INFO L175 Difference]: Start difference. First operand has 183 places, 186 transitions, 432 flow. Second operand 3 states and 496 transitions. [2023-11-26 11:58:50,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 202 transitions, 574 flow [2023-11-26 11:58:50,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 202 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:58:50,967 INFO L231 Difference]: Finished difference. Result has 185 places, 192 transitions, 486 flow [2023-11-26 11:58:50,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=185, PETRI_TRANSITIONS=192} [2023-11-26 11:58:50,968 INFO L281 CegarLoopForPetriNet]: 181 programPoint places, 4 predicate places. [2023-11-26 11:58:50,969 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 192 transitions, 486 flow [2023-11-26 11:58:50,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have 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:50,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:50,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:50,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:58:50,970 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-26 11:58:50,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:50,971 INFO L85 PathProgramCache]: Analyzing trace with hash -119272493, now seen corresponding path program 1 times [2023-11-26 11:58:50,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:50,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187815761] [2023-11-26 11:58:50,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:50,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:51,059 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:51,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:51,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187815761] [2023-11-26 11:58:51,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187815761] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:51,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:51,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:51,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673023054] [2023-11-26 11:58:51,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:51,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:51,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:51,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:51,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:51,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 186 [2023-11-26 11:58:51,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 192 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have 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:51,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:51,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 186 [2023-11-26 11:58:51,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:51,570 INFO L124 PetriNetUnfolderBase]: 434/2263 cut-off events. [2023-11-26 11:58:51,570 INFO L125 PetriNetUnfolderBase]: For 132/135 co-relation queries the response was YES. [2023-11-26 11:58:51,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3434 conditions, 2263 events. 434/2263 cut-off events. For 132/135 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 16907 event pairs, 230 based on Foata normal form. 0/2023 useless extension candidates. Maximal degree in co-relation 3301. Up to 647 conditions per place. [2023-11-26 11:58:51,587 INFO L140 encePairwiseOnDemand]: 182/186 looper letters, 33 selfloop transitions, 3 changer transitions 1/204 dead transitions. [2023-11-26 11:58:51,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 204 transitions, 584 flow [2023-11-26 11:58:51,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:51,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:51,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2023-11-26 11:58:51,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9068100358422939 [2023-11-26 11:58:51,591 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 506 transitions. [2023-11-26 11:58:51,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 506 transitions. [2023-11-26 11:58:51,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:51,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 506 transitions. [2023-11-26 11:58:51,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have 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:51,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have 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:51,596 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have 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:51,596 INFO L175 Difference]: Start difference. First operand has 185 places, 192 transitions, 486 flow. Second operand 3 states and 506 transitions. [2023-11-26 11:58:51,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 204 transitions, 584 flow [2023-11-26 11:58:51,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 204 transitions, 570 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:58:51,603 INFO L231 Difference]: Finished difference. Result has 187 places, 194 transitions, 494 flow [2023-11-26 11:58:51,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=494, PETRI_PLACES=187, PETRI_TRANSITIONS=194} [2023-11-26 11:58:51,604 INFO L281 CegarLoopForPetriNet]: 181 programPoint places, 6 predicate places. [2023-11-26 11:58:51,605 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 194 transitions, 494 flow [2023-11-26 11:58:51,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have 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:51,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:51,606 INFO L208 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:58:51,606 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-26 11:58:51,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:51,607 INFO L85 PathProgramCache]: Analyzing trace with hash -915274511, now seen corresponding path program 1 times [2023-11-26 11:58:51,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:51,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283856745] [2023-11-26 11:58:51,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:51,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:58:51,637 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:58:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:58:51,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:58:51,686 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:58:51,687 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2023-11-26 11:58:51,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2023-11-26 11:58:51,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2023-11-26 11:58:51,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2023-11-26 11:58:51,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2023-11-26 11:58:51,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2023-11-26 11:58:51,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2023-11-26 11:58:51,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2023-11-26 11:58:51,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2023-11-26 11:58:51,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2023-11-26 11:58:51,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2023-11-26 11:58:51,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2023-11-26 11:58:51,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2023-11-26 11:58:51,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2023-11-26 11:58:51,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2023-11-26 11:58:51,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2023-11-26 11:58:51,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2023-11-26 11:58:51,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2023-11-26 11:58:51,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:58:51,694 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-26 11:58:51,697 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 11:58:51,697 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-26 11:58:51,738 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:58:51,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 242 places, 247 transitions, 504 flow [2023-11-26 11:58:51,806 INFO L124 PetriNetUnfolderBase]: 20/371 cut-off events. [2023-11-26 11:58:51,806 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-26 11:58:51,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 371 events. 20/371 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 944 event pairs, 0 based on Foata normal form. 0/322 useless extension candidates. Maximal degree in co-relation 240. Up to 6 conditions per place. [2023-11-26 11:58:51,812 INFO L82 GeneralOperation]: Start removeDead. Operand has 242 places, 247 transitions, 504 flow [2023-11-26 11:58:51,817 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 242 places, 247 transitions, 504 flow [2023-11-26 11:58:51,818 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:58:51,819 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;@3a2dea9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:58:51,820 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-11-26 11:58:51,838 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:58:51,839 INFO L124 PetriNetUnfolderBase]: 2/66 cut-off events. [2023-11-26 11:58:51,839 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:58:51,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:51,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:51,840 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-11-26 11:58:51,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:51,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1854180176, now seen corresponding path program 1 times [2023-11-26 11:58:51,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:51,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875125809] [2023-11-26 11:58:51,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:51,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:51,887 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:51,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:51,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875125809] [2023-11-26 11:58:51,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875125809] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:51,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:51,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:51,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917650752] [2023-11-26 11:58:51,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:51,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:51,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:51,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:51,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:51,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 247 [2023-11-26 11:58:51,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 247 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have 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:51,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:51,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 247 [2023-11-26 11:58:51,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:59:00,335 INFO L124 PetriNetUnfolderBase]: 19226/51319 cut-off events. [2023-11-26 11:59:00,335 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-11-26 11:59:00,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80395 conditions, 51319 events. 19226/51319 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 615904 event pairs, 5952 based on Foata normal form. 1672/46942 useless extension candidates. Maximal degree in co-relation 66304. Up to 16183 conditions per place. [2023-11-26 11:59:00,939 INFO L140 encePairwiseOnDemand]: 219/247 looper letters, 85 selfloop transitions, 16 changer transitions 1/288 dead transitions. [2023-11-26 11:59:00,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 288 transitions, 793 flow [2023-11-26 11:59:00,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:59:00,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:59:00,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2023-11-26 11:59:00,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9163292847503374 [2023-11-26 11:59:00,943 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 679 transitions. [2023-11-26 11:59:00,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 679 transitions. [2023-11-26 11:59:00,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:59:00,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 679 transitions. [2023-11-26 11:59:00,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have 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:59:00,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have 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:59:00,948 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have 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:59:00,949 INFO L175 Difference]: Start difference. First operand has 242 places, 247 transitions, 504 flow. Second operand 3 states and 679 transitions. [2023-11-26 11:59:00,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 288 transitions, 793 flow [2023-11-26 11:59:00,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 288 transitions, 793 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:59:00,957 INFO L231 Difference]: Finished difference. Result has 246 places, 256 transitions, 630 flow [2023-11-26 11:59:00,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=246, PETRI_TRANSITIONS=256} [2023-11-26 11:59:00,960 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, 4 predicate places. [2023-11-26 11:59:00,960 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 256 transitions, 630 flow [2023-11-26 11:59:00,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have 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:59:00,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:59:00,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:59:00,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:59:00,962 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-11-26 11:59:00,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:59:00,962 INFO L85 PathProgramCache]: Analyzing trace with hash -389489182, now seen corresponding path program 1 times [2023-11-26 11:59:00,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:59:00,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388786726] [2023-11-26 11:59:00,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:59:00,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:59:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:59:01,508 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:59:01,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:59:01,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388786726] [2023-11-26 11:59:01,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388786726] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:59:01,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:59:01,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:59:01,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397073062] [2023-11-26 11:59:01,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:59:01,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:59:01,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:59:01,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:59:01,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:59:01,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 247 [2023-11-26 11:59:01,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 256 transitions, 630 flow. Second operand has 6 states, 6 states have (on average 199.33333333333334) internal successors, (1196), 6 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have 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:59:01,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:59:01,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 247 [2023-11-26 11:59:01,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:59:05,095 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([595] L728-4-->L728-1: Formula: (= 0 |v_#race~threads_alive~0_4|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][123], [threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 247#(= |#race~threads_alive~0| 0), 251#true, 78#L694-2true, 198#L698-6true, 168#L728-1true, Black: 245#true]) [2023-11-26 11:59:05,095 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2023-11-26 11:59:05,095 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-26 11:59:05,096 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 11:59:05,096 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 11:59:05,534 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([595] L728-4-->L728-1: Formula: (= 0 |v_#race~threads_alive~0_4|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][255], [threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 247#(= |#race~threads_alive~0| 0), 251#true, 198#L698-6true, Black: 245#true, 168#L728-1true, 23#L694-6true]) [2023-11-26 11:59:05,535 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2023-11-26 11:59:05,535 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-26 11:59:05,535 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-26 11:59:05,535 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-26 11:59:06,088 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([622] L728-5-->L730-2: Formula: (and (= |v_ULTIMATE.start_main_#t~nondet32#1_7| 0) (= (store |v_#pthreadsMutex_62| |v_~#threads_alive_mutex~0.base_29| (store (select |v_#pthreadsMutex_62| |v_~#threads_alive_mutex~0.base_29|) |v_~#threads_alive_mutex~0.offset_29| 0)) |v_#pthreadsMutex_61|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_62|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_29|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_29|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_61|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_7|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_29|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_29|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet32#1][132], [113#L697-3true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 247#(= |#race~threads_alive~0| 0), 251#true, Black: 245#true, 239#L697-3true, 167#L730-2true]) [2023-11-26 11:59:06,089 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-26 11:59:06,089 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-26 11:59:06,089 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-26 11:59:06,089 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-26 11:59:06,090 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([617] L729-->L729-3: Formula: (and (= |v_#pthreadsMutex_45| (store |v_#pthreadsMutex_46| |v_~#threads_alive_mutex~0.base_21| (store (select |v_#pthreadsMutex_46| |v_~#threads_alive_mutex~0.base_21|) |v_~#threads_alive_mutex~0.offset_21| 0))) (= |v_ULTIMATE.start_main_#t~nondet30#1_7| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_46|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_21|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_21|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_45|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_21|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_7|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_21|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet30#1][133], [113#L697-3true, threadThread1of2ForFork0InUse, 227#L729-3true, threadThread2of2ForFork0InUse, 247#(= |#race~threads_alive~0| 0), 251#true, Black: 245#true, 239#L697-3true]) [2023-11-26 11:59:06,090 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-26 11:59:06,090 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-26 11:59:06,090 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-26 11:59:06,091 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-26 11:59:10,354 INFO L124 PetriNetUnfolderBase]: 14332/52186 cut-off events. [2023-11-26 11:59:10,354 INFO L125 PetriNetUnfolderBase]: For 1988/2027 co-relation queries the response was YES. [2023-11-26 11:59:10,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79425 conditions, 52186 events. 14332/52186 cut-off events. For 1988/2027 co-relation queries the response was YES. Maximal size of possible extension queue 1089. Compared 702545 event pairs, 8718 based on Foata normal form. 0/47399 useless extension candidates. Maximal degree in co-relation 62413. Up to 16203 conditions per place. [2023-11-26 11:59:10,737 INFO L140 encePairwiseOnDemand]: 241/247 looper letters, 117 selfloop transitions, 5 changer transitions 0/335 dead transitions. [2023-11-26 11:59:10,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 335 transitions, 1032 flow [2023-11-26 11:59:10,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:59:10,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:59:10,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1311 transitions. [2023-11-26 11:59:10,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8846153846153846 [2023-11-26 11:59:10,742 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1311 transitions. [2023-11-26 11:59:10,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1311 transitions. [2023-11-26 11:59:10,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:59:10,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1311 transitions. [2023-11-26 11:59:10,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 218.5) internal successors, (1311), 6 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have 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:59:10,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have 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:59:10,752 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have 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:59:10,752 INFO L175 Difference]: Start difference. First operand has 246 places, 256 transitions, 630 flow. Second operand 6 states and 1311 transitions. [2023-11-26 11:59:10,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 335 transitions, 1032 flow [2023-11-26 11:59:10,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 335 transitions, 1000 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:59:10,787 INFO L231 Difference]: Finished difference. Result has 247 places, 255 transitions, 606 flow [2023-11-26 11:59:10,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=606, PETRI_PLACES=247, PETRI_TRANSITIONS=255} [2023-11-26 11:59:10,789 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, 5 predicate places. [2023-11-26 11:59:10,789 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 255 transitions, 606 flow [2023-11-26 11:59:10,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 199.33333333333334) internal successors, (1196), 6 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have 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:59:10,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:59:10,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:59:10,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 11:59:10,791 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-11-26 11:59:10,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:59:10,791 INFO L85 PathProgramCache]: Analyzing trace with hash 604253451, now seen corresponding path program 1 times [2023-11-26 11:59:10,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:59:10,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218167020] [2023-11-26 11:59:10,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:59:10,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:59:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:59:10,833 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:59:10,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:59:10,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218167020] [2023-11-26 11:59:10,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218167020] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:59:10,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:59:10,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:59:10,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897180876] [2023-11-26 11:59:10,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:59:10,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:59:10,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:59:10,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:59:10,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:59:10,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 247 [2023-11-26 11:59:10,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 255 transitions, 606 flow. Second operand has 3 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have 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:59:10,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:59:10,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 247 [2023-11-26 11:59:10,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:59:13,254 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L721-4-->L721-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][86], [38#L698-6true, threadThread1of2ForFork0InUse, 170#L721-1true, threadThread2of2ForFork0InUse, 44#L698-1true, 251#true, Black: 245#true, 258#true]) [2023-11-26 11:59:13,254 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2023-11-26 11:59:13,254 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-26 11:59:13,255 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-26 11:59:13,255 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-26 11:59:13,525 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L721-4-->L721-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][86], [38#L698-6true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 170#L721-1true, 251#true, Black: 245#true, 125#L698-2true, 258#true]) [2023-11-26 11:59:13,526 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-26 11:59:13,526 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-26 11:59:13,526 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-26 11:59:13,526 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-26 11:59:13,884 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L721-4-->L721-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][60], [38#L698-6true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 170#L721-1true, 251#true, 198#L698-6true, Black: 245#true, 258#true]) [2023-11-26 11:59:13,884 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-26 11:59:13,884 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-26 11:59:13,884 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-26 11:59:13,884 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:59:19,074 INFO L124 PetriNetUnfolderBase]: 18545/55694 cut-off events. [2023-11-26 11:59:19,074 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-11-26 11:59:19,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87039 conditions, 55694 events. 18545/55694 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 1297. Compared 719963 event pairs, 12639 based on Foata normal form. 0/49722 useless extension candidates. Maximal degree in co-relation 83873. Up to 22448 conditions per place. [2023-11-26 11:59:19,482 INFO L140 encePairwiseOnDemand]: 241/247 looper letters, 60 selfloop transitions, 5 changer transitions 0/279 dead transitions. [2023-11-26 11:59:19,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 279 transitions, 784 flow [2023-11-26 11:59:19,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:59:19,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:59:19,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 666 transitions. [2023-11-26 11:59:19,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8987854251012146 [2023-11-26 11:59:19,499 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 666 transitions. [2023-11-26 11:59:19,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 666 transitions. [2023-11-26 11:59:19,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:59:19,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 666 transitions. [2023-11-26 11:59:19,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have 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:59:19,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have 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:59:19,504 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have 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:59:19,504 INFO L175 Difference]: Start difference. First operand has 247 places, 255 transitions, 606 flow. Second operand 3 states and 666 transitions. [2023-11-26 11:59:19,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 279 transitions, 784 flow [2023-11-26 11:59:19,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 279 transitions, 774 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-26 11:59:19,512 INFO L231 Difference]: Finished difference. Result has 246 places, 259 transitions, 634 flow [2023-11-26 11:59:19,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=246, PETRI_TRANSITIONS=259} [2023-11-26 11:59:19,515 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, 4 predicate places. [2023-11-26 11:59:19,516 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 259 transitions, 634 flow [2023-11-26 11:59:19,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have 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:59:19,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:59:19,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:59:19,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 11:59:19,518 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-11-26 11:59:19,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:59:19,518 INFO L85 PathProgramCache]: Analyzing trace with hash -542208636, now seen corresponding path program 1 times [2023-11-26 11:59:19,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:59:19,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583734284] [2023-11-26 11:59:19,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:59:19,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:59:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:59:19,562 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:59:19,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:59:19,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583734284] [2023-11-26 11:59:19,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583734284] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:59:19,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:59:19,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:59:19,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004877623] [2023-11-26 11:59:19,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:59:19,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:59:19,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:59:19,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:59:19,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:59:19,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 247 [2023-11-26 11:59:19,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 259 transitions, 634 flow. Second operand has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have 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:59:19,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:59:19,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 247 [2023-11-26 11:59:19,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:59:20,494 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L721-4-->L721-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][199], [threadThread1of2ForFork0InUse, 170#L721-1true, threadThread2of2ForFork0InUse, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), 78#L694-2true, Black: 245#true, 166#L694-7true, 264#true, 258#true]) [2023-11-26 11:59:20,495 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2023-11-26 11:59:20,496 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-26 11:59:20,496 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2023-11-26 11:59:20,496 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-26 11:59:20,654 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L721-4-->L721-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][86], [threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 170#L721-1true, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), 78#L694-2true, Black: 245#true, 238#L696true, 264#true, 258#true]) [2023-11-26 11:59:20,654 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2023-11-26 11:59:20,654 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2023-11-26 11:59:20,654 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-26 11:59:20,655 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2023-11-26 11:59:20,736 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L721-4-->L721-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][86], [threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 170#L721-1true, 74#L696-3true, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), 78#L694-2true, Black: 245#true, 264#true, 258#true]) [2023-11-26 11:59:20,736 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2023-11-26 11:59:20,736 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-26 11:59:20,737 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-26 11:59:20,737 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-26 11:59:20,895 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L721-4-->L721-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][86], [threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 170#L721-1true, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), 78#L694-2true, Black: 245#true, 239#L697-3true, 264#true, 258#true]) [2023-11-26 11:59:20,895 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2023-11-26 11:59:20,895 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-11-26 11:59:20,895 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-26 11:59:20,896 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-11-26 11:59:21,434 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L721-4-->L721-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][199], [17#L698-2true, threadThread1of2ForFork0InUse, 170#L721-1true, threadThread2of2ForFork0InUse, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), Black: 245#true, 166#L694-7true, 264#true, 258#true]) [2023-11-26 11:59:21,434 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is cut-off event [2023-11-26 11:59:21,434 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-26 11:59:21,434 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-26 11:59:21,435 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-26 11:59:21,893 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L721-4-->L721-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][86], [17#L698-2true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 170#L721-1true, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), Black: 245#true, 238#L696true, 264#true, 258#true]) [2023-11-26 11:59:21,893 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2023-11-26 11:59:21,894 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-26 11:59:21,894 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-26 11:59:21,894 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-26 11:59:21,971 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L721-4-->L721-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][86], [17#L698-2true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 170#L721-1true, 74#L696-3true, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), Black: 245#true, 264#true, 258#true]) [2023-11-26 11:59:21,971 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2023-11-26 11:59:21,971 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-26 11:59:21,971 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2023-11-26 11:59:21,971 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2023-11-26 11:59:22,118 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([595] L728-4-->L728-1: Formula: (= 0 |v_#race~threads_alive~0_4|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][231], [threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), 78#L694-2true, 166#L694-7true, 168#L728-1true, Black: 245#true, 264#true, 258#true]) [2023-11-26 11:59:22,118 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2023-11-26 11:59:22,118 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2023-11-26 11:59:22,118 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-26 11:59:22,118 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2023-11-26 11:59:22,137 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L721-4-->L721-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][86], [17#L698-2true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 170#L721-1true, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), Black: 245#true, 239#L697-3true, 264#true, 258#true]) [2023-11-26 11:59:22,137 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2023-11-26 11:59:22,137 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-26 11:59:22,137 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-26 11:59:22,137 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-26 11:59:22,289 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([595] L728-4-->L728-1: Formula: (= 0 |v_#race~threads_alive~0_4|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][113], [threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 74#L696-3true, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), 78#L694-2true, 168#L728-1true, Black: 245#true, 264#true, 258#true]) [2023-11-26 11:59:22,289 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2023-11-26 11:59:22,289 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-26 11:59:22,290 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-26 11:59:22,290 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-26 11:59:22,379 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([595] L728-4-->L728-1: Formula: (= 0 |v_#race~threads_alive~0_4|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][113], [threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 74#L696-3true, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), 78#L694-2true, 168#L728-1true, Black: 245#true, 264#true, 258#true]) [2023-11-26 11:59:22,379 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2023-11-26 11:59:22,379 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-26 11:59:22,379 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-26 11:59:22,379 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-26 11:59:22,379 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-26 11:59:22,480 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([595] L728-4-->L728-1: Formula: (= 0 |v_#race~threads_alive~0_4|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][113], [threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), 78#L694-2true, 168#L728-1true, Black: 245#true, 239#L697-3true, 264#true, 258#true]) [2023-11-26 11:59:22,480 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2023-11-26 11:59:22,480 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-26 11:59:22,480 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-26 11:59:22,480 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 11:59:22,814 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([595] L728-4-->L728-1: Formula: (= 0 |v_#race~threads_alive~0_4|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][113], [threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), 78#L694-2true, 168#L728-1true, Black: 245#true, 239#L697-3true, 264#true, 258#true]) [2023-11-26 11:59:22,814 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2023-11-26 11:59:22,814 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-26 11:59:22,815 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-26 11:59:22,824 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 11:59:22,824 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 11:59:28,674 INFO L124 PetriNetUnfolderBase]: 21456/63282 cut-off events. [2023-11-26 11:59:28,674 INFO L125 PetriNetUnfolderBase]: For 7391/7730 co-relation queries the response was YES. [2023-11-26 11:59:28,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107750 conditions, 63282 events. 21456/63282 cut-off events. For 7391/7730 co-relation queries the response was YES. Maximal size of possible extension queue 1332. Compared 818823 event pairs, 13197 based on Foata normal form. 131/56626 useless extension candidates. Maximal degree in co-relation 70490. Up to 28121 conditions per place. [2023-11-26 11:59:29,073 INFO L140 encePairwiseOnDemand]: 237/247 looper letters, 75 selfloop transitions, 16 changer transitions 0/294 dead transitions. [2023-11-26 11:59:29,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 294 transitions, 915 flow [2023-11-26 11:59:29,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:59:29,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:59:29,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 661 transitions. [2023-11-26 11:59:29,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8920377867746289 [2023-11-26 11:59:29,080 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 661 transitions. [2023-11-26 11:59:29,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 661 transitions. [2023-11-26 11:59:29,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:59:29,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 661 transitions. [2023-11-26 11:59:29,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have 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:59:29,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have 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:59:29,092 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have 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:59:29,093 INFO L175 Difference]: Start difference. First operand has 246 places, 259 transitions, 634 flow. Second operand 3 states and 661 transitions. [2023-11-26 11:59:29,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 294 transitions, 915 flow [2023-11-26 11:59:29,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 294 transitions, 905 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:59:29,160 INFO L231 Difference]: Finished difference. Result has 248 places, 273 transitions, 770 flow [2023-11-26 11:59:29,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=248, PETRI_TRANSITIONS=273} [2023-11-26 11:59:29,162 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, 6 predicate places. [2023-11-26 11:59:29,162 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 273 transitions, 770 flow [2023-11-26 11:59:29,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have 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:59:29,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:59:29,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:59:29,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 11:59:29,163 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-11-26 11:59:29,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:59:29,164 INFO L85 PathProgramCache]: Analyzing trace with hash 297052147, now seen corresponding path program 1 times [2023-11-26 11:59:29,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:59:29,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858487744] [2023-11-26 11:59:29,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:59:29,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:59:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:59:29,204 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:59:29,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:59:29,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858487744] [2023-11-26 11:59:29,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858487744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:59:29,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:59:29,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:59:29,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975089392] [2023-11-26 11:59:29,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:59:29,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:59:29,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:59:29,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:59:29,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:59:29,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 247 [2023-11-26 11:59:29,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 273 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have 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:59:29,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:59:29,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 247 [2023-11-26 11:59:29,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:59:29,950 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L721-4-->L721-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][193], [threadThread1of2ForFork0InUse, 170#L721-1true, threadThread2of2ForFork0InUse, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), 78#L694-2true, Black: 245#true, 166#L694-7true, Black: 266#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 264#true, 270#true]) [2023-11-26 11:59:29,951 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2023-11-26 11:59:29,951 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2023-11-26 11:59:29,951 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-26 11:59:29,951 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-26 11:59:30,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L721-4-->L721-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][86], [threadThread1of2ForFork0InUse, 170#L721-1true, threadThread2of2ForFork0InUse, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), 78#L694-2true, Black: 245#true, 238#L696true, Black: 266#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 264#true, 270#true]) [2023-11-26 11:59:30,041 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2023-11-26 11:59:30,042 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-26 11:59:30,042 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2023-11-26 11:59:30,042 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2023-11-26 11:59:30,474 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L721-4-->L721-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][193], [17#L698-2true, threadThread1of2ForFork0InUse, 170#L721-1true, threadThread2of2ForFork0InUse, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), Black: 245#true, 166#L694-7true, Black: 266#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 264#true, 270#true]) [2023-11-26 11:59:30,474 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is cut-off event [2023-11-26 11:59:30,474 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-26 11:59:30,474 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-26 11:59:30,474 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-26 11:59:30,475 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([646] L721-4-->L721-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][193], [17#L698-2true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 170#L721-1true, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), 166#L694-7true, Black: 245#true, Black: 266#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 264#true, 270#true]) [2023-11-26 11:59:30,475 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is cut-off event [2023-11-26 11:59:30,475 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-26 11:59:30,475 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-26 11:59:30,475 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-26 11:59:30,475 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-26 11:59:30,535 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([817] L698-->L698-1: Formula: (= |v_#race~threads_alive~0_13| 0) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_13|} AuxVars[] AssignedVars[#race~threads_alive~0][265], [threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), 67#L721-2true, 41#L698-1true, 166#L694-7true, Black: 245#true, Black: 266#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 264#true, 270#true]) [2023-11-26 11:59:30,535 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is cut-off event [2023-11-26 11:59:30,535 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-26 11:59:30,535 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-26 11:59:30,535 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-26 11:59:30,549 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L721-4-->L721-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][193], [threadThread1of2ForFork0InUse, 170#L721-1true, threadThread2of2ForFork0InUse, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), 41#L698-1true, Black: 245#true, 166#L694-7true, Black: 266#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 264#true, 270#true]) [2023-11-26 11:59:30,549 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2023-11-26 11:59:30,550 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-26 11:59:30,550 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-26 11:59:30,550 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-26 11:59:30,649 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([595] L728-4-->L728-1: Formula: (= 0 |v_#race~threads_alive~0_4|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][220], [threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), 78#L694-2true, 166#L694-7true, 168#L728-1true, Black: 245#true, Black: 266#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 264#true, 270#true]) [2023-11-26 11:59:30,650 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2023-11-26 11:59:30,650 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-26 11:59:30,650 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2023-11-26 11:59:30,650 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2023-11-26 11:59:30,690 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L721-4-->L721-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][86], [17#L698-2true, threadThread1of2ForFork0InUse, 170#L721-1true, threadThread2of2ForFork0InUse, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), Black: 245#true, 11#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 266#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 264#true, 270#true]) [2023-11-26 11:59:30,690 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is cut-off event [2023-11-26 11:59:30,691 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-26 11:59:30,691 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-26 11:59:30,691 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-26 11:59:30,728 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([802] L694-->L694-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][246], [threadThread1of2ForFork0InUse, 25#L728-2true, 235#L694-1true, threadThread2of2ForFork0InUse, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), 166#L694-7true, Black: 245#true, Black: 266#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 264#true, 270#true]) [2023-11-26 11:59:30,728 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2023-11-26 11:59:30,728 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2023-11-26 11:59:30,728 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2023-11-26 11:59:30,728 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-26 11:59:30,739 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L721-4-->L721-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][86], [threadThread1of2ForFork0InUse, 17#L698-2true, 170#L721-1true, threadThread2of2ForFork0InUse, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), Black: 245#true, 238#L696true, Black: 266#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 264#true, 270#true]) [2023-11-26 11:59:30,739 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2023-11-26 11:59:30,739 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-26 11:59:30,739 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-26 11:59:30,739 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-26 11:59:30,940 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([802] L694-->L694-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][154], [threadThread1of2ForFork0InUse, 25#L728-2true, 235#L694-1true, threadThread2of2ForFork0InUse, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), Black: 245#true, 238#L696true, Black: 266#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 264#true, 270#true]) [2023-11-26 11:59:30,940 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2023-11-26 11:59:30,940 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-26 11:59:30,940 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-26 11:59:30,940 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-26 11:59:31,470 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([817] L698-->L698-1: Formula: (= |v_#race~threads_alive~0_13| 0) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_13|} AuxVars[] AssignedVars[#race~threads_alive~0][265], [threadThread1of2ForFork0InUse, 25#L728-2true, threadThread2of2ForFork0InUse, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), 41#L698-1true, 166#L694-7true, Black: 245#true, Black: 266#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 264#true, 270#true]) [2023-11-26 11:59:31,470 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-26 11:59:31,471 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:59:31,471 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:59:31,471 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:59:31,718 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L721-4-->L721-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][86], [38#L698-6true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 170#L721-1true, 44#L698-1true, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), Black: 245#true, Black: 266#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 264#true, 270#true]) [2023-11-26 11:59:31,718 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2023-11-26 11:59:31,718 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-26 11:59:31,719 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-26 11:59:31,719 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-26 11:59:31,836 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L721-4-->L721-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][86], [38#L698-6true, threadThread1of2ForFork0InUse, 170#L721-1true, threadThread2of2ForFork0InUse, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), Black: 245#true, Black: 266#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 264#true, 125#L698-2true, 270#true]) [2023-11-26 11:59:31,836 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-26 11:59:31,836 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-26 11:59:31,836 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-26 11:59:31,837 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-26 11:59:31,904 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([817] L698-->L698-1: Formula: (= |v_#race~threads_alive~0_13| 0) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_13|} AuxVars[] AssignedVars[#race~threads_alive~0][206], [threadThread1of2ForFork0InUse, 25#L728-2true, threadThread2of2ForFork0InUse, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), 41#L698-1true, Black: 245#true, 238#L696true, Black: 266#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 264#true, 270#true]) [2023-11-26 11:59:31,904 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2023-11-26 11:59:31,904 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-26 11:59:31,904 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-26 11:59:31,904 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-26 11:59:32,172 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([595] L728-4-->L728-1: Formula: (= 0 |v_#race~threads_alive~0_4|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][220], [threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), 41#L698-1true, 166#L694-7true, 168#L728-1true, Black: 245#true, Black: 266#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 264#true, 270#true]) [2023-11-26 11:59:32,173 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2023-11-26 11:59:32,173 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 11:59:32,173 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 11:59:32,173 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 11:59:32,174 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([595] L728-4-->L728-1: Formula: (= 0 |v_#race~threads_alive~0_4|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][113], [17#L698-2true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), 168#L728-1true, Black: 245#true, 11#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 266#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 264#true, 270#true]) [2023-11-26 11:59:32,174 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-26 11:59:32,174 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:59:32,174 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:59:32,175 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:59:32,175 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([595] L728-4-->L728-1: Formula: (= 0 |v_#race~threads_alive~0_4|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][220], [17#L698-2true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), 168#L728-1true, Black: 245#true, 166#L694-7true, Black: 266#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 264#true, 270#true]) [2023-11-26 11:59:32,175 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-26 11:59:32,175 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:59:32,175 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:59:32,175 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:59:32,176 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([595] L728-4-->L728-1: Formula: (= 0 |v_#race~threads_alive~0_4|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][220], [17#L698-2true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), 166#L694-7true, 168#L728-1true, Black: 245#true, Black: 266#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 264#true, 270#true]) [2023-11-26 11:59:32,176 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-26 11:59:32,176 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:59:32,176 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:59:32,176 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:59:32,177 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-26 11:59:32,343 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L721-4-->L721-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][60], [38#L698-6true, threadThread1of2ForFork0InUse, 170#L721-1true, threadThread2of2ForFork0InUse, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), Black: 245#true, 198#L698-6true, Black: 266#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 264#true, 270#true]) [2023-11-26 11:59:32,343 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-26 11:59:32,343 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:59:32,343 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-26 11:59:32,343 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-26 11:59:33,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([595] L728-4-->L728-1: Formula: (= 0 |v_#race~threads_alive~0_4|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][113], [38#L698-6true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 44#L698-1true, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), 168#L728-1true, Black: 245#true, Black: 266#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 264#true, 270#true]) [2023-11-26 11:59:33,873 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2023-11-26 11:59:33,873 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-26 11:59:33,873 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-26 11:59:33,874 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-26 11:59:33,989 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([595] L728-4-->L728-1: Formula: (= 0 |v_#race~threads_alive~0_4|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][113], [38#L698-6true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), 168#L728-1true, Black: 245#true, Black: 266#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 264#true, 125#L698-2true, 270#true]) [2023-11-26 11:59:33,989 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2023-11-26 11:59:33,989 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-26 11:59:33,990 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-26 11:59:33,990 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-26 11:59:34,761 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([595] L728-4-->L728-1: Formula: (= 0 |v_#race~threads_alive~0_4|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][228], [38#L698-6true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 260#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet27#1|), 168#L728-1true, 198#L698-6true, Black: 245#true, Black: 266#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 264#true, 270#true]) [2023-11-26 11:59:34,761 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2023-11-26 11:59:34,761 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-26 11:59:34,761 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-26 11:59:34,762 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event