./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.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_1465e0db-96ba-4c41-a2cf-c6e1f9f99d17/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1465e0db-96ba-4c41-a2cf-c6e1f9f99d17/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1465e0db-96ba-4c41-a2cf-c6e1f9f99d17/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1465e0db-96ba-4c41-a2cf-c6e1f9f99d17/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1465e0db-96ba-4c41-a2cf-c6e1f9f99d17/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1465e0db-96ba-4c41-a2cf-c6e1f9f99d17/bin/uautomizer-verify-BQ2R08f2Ya --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 af00d5f4cc6a18cb9fd8a5151467217fe3ddb5ee0fa30b2cfbd9dd374105ee15 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:30:28,940 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:30:29,005 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1465e0db-96ba-4c41-a2cf-c6e1f9f99d17/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 00:30:29,011 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:30:29,011 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:30:29,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:30:29,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:30:29,033 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:30:29,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:30:29,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:30:29,035 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:30:29,035 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:30:29,036 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:30:29,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:30:29,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:30:29,037 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:30:29,038 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:30:29,038 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:30:29,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:30:29,039 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:30:29,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:30:29,041 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:30:29,041 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 00:30:29,041 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:30:29,042 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:30:29,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:30:29,043 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:30:29,043 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:30:29,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:30:29,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:30:29,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:30:29,045 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:30:29,045 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:30:29,045 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:30:29,046 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:30:29,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:30:29,046 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:30:29,046 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:30:29,046 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:30:29,046 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:30:29,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:30:29,047 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_1465e0db-96ba-4c41-a2cf-c6e1f9f99d17/bin/uautomizer-verify-BQ2R08f2Ya/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_1465e0db-96ba-4c41-a2cf-c6e1f9f99d17/bin/uautomizer-verify-BQ2R08f2Ya 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 -> af00d5f4cc6a18cb9fd8a5151467217fe3ddb5ee0fa30b2cfbd9dd374105ee15 [2023-11-29 00:30:29,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:30:29,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:30:29,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:30:29,303 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:30:29,303 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:30:29,304 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1465e0db-96ba-4c41-a2cf-c6e1f9f99d17/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i [2023-11-29 00:30:32,092 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:30:32,339 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:30:32,339 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1465e0db-96ba-4c41-a2cf-c6e1f9f99d17/sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i [2023-11-29 00:30:32,356 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1465e0db-96ba-4c41-a2cf-c6e1f9f99d17/bin/uautomizer-verify-BQ2R08f2Ya/data/6a26098e7/01d6ed005c4e4b28a0e8e7b73b2e6559/FLAG87cf3528b [2023-11-29 00:30:32,371 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1465e0db-96ba-4c41-a2cf-c6e1f9f99d17/bin/uautomizer-verify-BQ2R08f2Ya/data/6a26098e7/01d6ed005c4e4b28a0e8e7b73b2e6559 [2023-11-29 00:30:32,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:30:32,375 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:30:32,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:30:32,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:30:32,382 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:30:32,383 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:30:32" (1/1) ... [2023-11-29 00:30:32,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac41548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:32, skipping insertion in model container [2023-11-29 00:30:32,384 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:30:32" (1/1) ... [2023-11-29 00:30:32,429 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:30:32,744 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:30:32,761 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:30:32,810 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:30:32,857 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:30:32,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:32 WrapperNode [2023-11-29 00:30:32,858 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:30:32,859 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:30:32,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:30:32,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:30:32,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:32" (1/1) ... [2023-11-29 00:30:32,887 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:32" (1/1) ... [2023-11-29 00:30:32,913 INFO L138 Inliner]: procedures = 172, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 94 [2023-11-29 00:30:32,913 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:30:32,914 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:30:32,914 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:30:32,914 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:30:32,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:32" (1/1) ... [2023-11-29 00:30:32,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:32" (1/1) ... [2023-11-29 00:30:32,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:32" (1/1) ... [2023-11-29 00:30:32,929 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:32" (1/1) ... [2023-11-29 00:30:32,937 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:32" (1/1) ... [2023-11-29 00:30:32,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:32" (1/1) ... [2023-11-29 00:30:32,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:32" (1/1) ... [2023-11-29 00:30:32,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:32" (1/1) ... [2023-11-29 00:30:32,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:30:32,949 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:30:32,949 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:30:32,949 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:30:32,950 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:32" (1/1) ... [2023-11-29 00:30:32,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:30:32,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1465e0db-96ba-4c41-a2cf-c6e1f9f99d17/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:30:32,980 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1465e0db-96ba-4c41-a2cf-c6e1f9f99d17/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:30:32,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1465e0db-96ba-4c41-a2cf-c6e1f9f99d17/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:30:33,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 00:30:33,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 00:30:33,017 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-29 00:30:33,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:30:33,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:30:33,018 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-29 00:30:33,018 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-29 00:30:33,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:30:33,018 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2023-11-29 00:30:33,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 00:30:33,019 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-29 00:30:33,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:30:33,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:30:33,021 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 00:30:33,157 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:30:33,160 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:30:33,369 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:30:33,405 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:30:33,405 INFO L309 CfgBuilder]: Removed 11 assume(true) statements. [2023-11-29 00:30:33,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:30:33 BoogieIcfgContainer [2023-11-29 00:30:33,407 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:30:33,409 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:30:33,409 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:30:33,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:30:33,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:30:32" (1/3) ... [2023-11-29 00:30:33,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4c03e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:30:33, skipping insertion in model container [2023-11-29 00:30:33,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:32" (2/3) ... [2023-11-29 00:30:33,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4c03e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:30:33, skipping insertion in model container [2023-11-29 00:30:33,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:30:33" (3/3) ... [2023-11-29 00:30:33,414 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_41-trylock_racefree.i [2023-11-29 00:30:33,421 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 00:30:33,430 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:30:33,430 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-29 00:30:33,430 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 00:30:33,485 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-29 00:30:33,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 141 transitions, 289 flow [2023-11-29 00:30:33,586 INFO L124 PetriNetUnfolderBase]: 23/198 cut-off events. [2023-11-29 00:30:33,586 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 00:30:33,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 198 events. 23/198 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 670 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 109. Up to 6 conditions per place. [2023-11-29 00:30:33,593 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 141 transitions, 289 flow [2023-11-29 00:30:33,599 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 141 transitions, 289 flow [2023-11-29 00:30:33,611 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:30:33,618 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;@44ee9b8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:30:33,618 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-11-29 00:30:33,631 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:30:33,631 INFO L124 PetriNetUnfolderBase]: 4/51 cut-off events. [2023-11-29 00:30:33,631 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:30:33,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:30:33,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:33,632 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-29 00:30:33,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:33,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1392139285, now seen corresponding path program 1 times [2023-11-29 00:30:33,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:33,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843451700] [2023-11-29 00:30:33,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:33,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:33,841 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-29 00:30:33,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:33,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843451700] [2023-11-29 00:30:33,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843451700] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:33,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:33,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:30:33,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010563908] [2023-11-29 00:30:33,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:33,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:30:33,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:33,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:30:33,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:30:33,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 141 [2023-11-29 00:30:33,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 141 transitions, 289 flow. Second operand has 2 states, 2 states have (on average 116.0) internal successors, (232), 2 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:33,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:30:33,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 141 [2023-11-29 00:30:33,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:30:34,029 INFO L124 PetriNetUnfolderBase]: 27/356 cut-off events. [2023-11-29 00:30:34,029 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 00:30:34,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 356 events. 27/356 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1456 event pairs, 24 based on Foata normal form. 53/372 useless extension candidates. Maximal degree in co-relation 335. Up to 65 conditions per place. [2023-11-29 00:30:34,034 INFO L140 encePairwiseOnDemand]: 128/141 looper letters, 12 selfloop transitions, 0 changer transitions 0/125 dead transitions. [2023-11-29 00:30:34,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 125 transitions, 281 flow [2023-11-29 00:30:34,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:30:34,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 00:30:34,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 255 transitions. [2023-11-29 00:30:34,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9042553191489362 [2023-11-29 00:30:34,052 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 255 transitions. [2023-11-29 00:30:34,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 255 transitions. [2023-11-29 00:30:34,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:30:34,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 255 transitions. [2023-11-29 00:30:34,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:34,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:34,067 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:34,069 INFO L175 Difference]: Start difference. First operand has 129 places, 141 transitions, 289 flow. Second operand 2 states and 255 transitions. [2023-11-29 00:30:34,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 125 transitions, 281 flow [2023-11-29 00:30:34,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 125 transitions, 281 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:30:34,079 INFO L231 Difference]: Finished difference. Result has 127 places, 125 transitions, 257 flow [2023-11-29 00:30:34,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=257, PETRI_PLACES=127, PETRI_TRANSITIONS=125} [2023-11-29 00:30:34,086 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -2 predicate places. [2023-11-29 00:30:34,086 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 125 transitions, 257 flow [2023-11-29 00:30:34,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 116.0) internal successors, (232), 2 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:34,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:30:34,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:34,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:30:34,088 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-29 00:30:34,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:34,089 INFO L85 PathProgramCache]: Analyzing trace with hash 2017999959, now seen corresponding path program 1 times [2023-11-29 00:30:34,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:34,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690280906] [2023-11-29 00:30:34,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:34,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:34,206 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-29 00:30:34,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:34,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690280906] [2023-11-29 00:30:34,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690280906] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:34,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:34,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:30:34,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179005891] [2023-11-29 00:30:34,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:34,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:30:34,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:34,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:30:34,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:30:34,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 141 [2023-11-29 00:30:34,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 125 transitions, 257 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:34,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:30:34,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 141 [2023-11-29 00:30:34,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:30:34,338 INFO L124 PetriNetUnfolderBase]: 55/493 cut-off events. [2023-11-29 00:30:34,339 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 00:30:34,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 493 events. 55/493 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2363 event pairs, 0 based on Foata normal form. 1/446 useless extension candidates. Maximal degree in co-relation 611. Up to 108 conditions per place. [2023-11-29 00:30:34,345 INFO L140 encePairwiseOnDemand]: 138/141 looper letters, 22 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2023-11-29 00:30:34,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 131 transitions, 317 flow [2023-11-29 00:30:34,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:30:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:30:34,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2023-11-29 00:30:34,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8321513002364066 [2023-11-29 00:30:34,349 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2023-11-29 00:30:34,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2023-11-29 00:30:34,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:30:34,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2023-11-29 00:30:34,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:34,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 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-29 00:30:34,356 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 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-29 00:30:34,357 INFO L175 Difference]: Start difference. First operand has 127 places, 125 transitions, 257 flow. Second operand 3 states and 352 transitions. [2023-11-29 00:30:34,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 131 transitions, 317 flow [2023-11-29 00:30:34,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 131 transitions, 317 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:30:34,362 INFO L231 Difference]: Finished difference. Result has 130 places, 125 transitions, 265 flow [2023-11-29 00:30:34,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=265, PETRI_PLACES=130, PETRI_TRANSITIONS=125} [2023-11-29 00:30:34,364 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, 1 predicate places. [2023-11-29 00:30:34,364 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 125 transitions, 265 flow [2023-11-29 00:30:34,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:34,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:30:34,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:34,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:30:34,365 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-29 00:30:34,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:34,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1670619221, now seen corresponding path program 1 times [2023-11-29 00:30:34,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:34,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049416159] [2023-11-29 00:30:34,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:34,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:34,426 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-29 00:30:34,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:34,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049416159] [2023-11-29 00:30:34,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049416159] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:34,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:34,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:30:34,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399417636] [2023-11-29 00:30:34,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:34,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:30:34,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:34,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:30:34,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:30:34,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 141 [2023-11-29 00:30:34,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 125 transitions, 265 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:34,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:30:34,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 141 [2023-11-29 00:30:34,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:30:34,639 INFO L124 PetriNetUnfolderBase]: 92/783 cut-off events. [2023-11-29 00:30:34,640 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-29 00:30:34,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1013 conditions, 783 events. 92/783 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4710 event pairs, 30 based on Foata normal form. 0/711 useless extension candidates. Maximal degree in co-relation 1007. Up to 125 conditions per place. [2023-11-29 00:30:34,645 INFO L140 encePairwiseOnDemand]: 132/141 looper letters, 30 selfloop transitions, 6 changer transitions 0/138 dead transitions. [2023-11-29 00:30:34,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 138 transitions, 366 flow [2023-11-29 00:30:34,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:30:34,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:30:34,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2023-11-29 00:30:34,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8297872340425532 [2023-11-29 00:30:34,647 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2023-11-29 00:30:34,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2023-11-29 00:30:34,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:30:34,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2023-11-29 00:30:34,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:34,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 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-29 00:30:34,652 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 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-29 00:30:34,652 INFO L175 Difference]: Start difference. First operand has 130 places, 125 transitions, 265 flow. Second operand 3 states and 351 transitions. [2023-11-29 00:30:34,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 138 transitions, 366 flow [2023-11-29 00:30:34,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 138 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:30:34,657 INFO L231 Difference]: Finished difference. Result has 130 places, 127 transitions, 299 flow [2023-11-29 00:30:34,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=299, PETRI_PLACES=130, PETRI_TRANSITIONS=127} [2023-11-29 00:30:34,658 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, 1 predicate places. [2023-11-29 00:30:34,659 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 127 transitions, 299 flow [2023-11-29 00:30:34,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:34,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:30:34,659 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-11-29 00:30:34,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:30:34,660 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-29 00:30:34,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:34,660 INFO L85 PathProgramCache]: Analyzing trace with hash 184640773, now seen corresponding path program 1 times [2023-11-29 00:30:34,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:34,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096934255] [2023-11-29 00:30:34,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:34,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:30:34,688 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:30:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:30:34,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:30:34,725 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:30:34,726 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2023-11-29 00:30:34,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2023-11-29 00:30:34,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2023-11-29 00:30:34,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2023-11-29 00:30:34,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2023-11-29 00:30:34,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2023-11-29 00:30:34,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2023-11-29 00:30:34,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2023-11-29 00:30:34,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2023-11-29 00:30:34,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2023-11-29 00:30:34,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2023-11-29 00:30:34,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:30:34,730 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-29 00:30:34,733 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 00:30:34,733 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-29 00:30:34,767 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-29 00:30:34,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 190 transitions, 396 flow [2023-11-29 00:30:34,839 INFO L124 PetriNetUnfolderBase]: 40/336 cut-off events. [2023-11-29 00:30:34,840 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-29 00:30:34,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 336 events. 40/336 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1300 event pairs, 0 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 200. Up to 9 conditions per place. [2023-11-29 00:30:34,844 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 190 transitions, 396 flow [2023-11-29 00:30:34,849 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 190 transitions, 396 flow [2023-11-29 00:30:34,850 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:30:34,852 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;@44ee9b8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:30:34,852 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-11-29 00:30:34,858 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:30:34,858 INFO L124 PetriNetUnfolderBase]: 4/51 cut-off events. [2023-11-29 00:30:34,858 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:30:34,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:30:34,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:34,859 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-29 00:30:34,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:34,859 INFO L85 PathProgramCache]: Analyzing trace with hash -905535509, now seen corresponding path program 1 times [2023-11-29 00:30:34,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:34,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824255112] [2023-11-29 00:30:34,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:34,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:34,886 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-29 00:30:34,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:34,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824255112] [2023-11-29 00:30:34,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824255112] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:34,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:34,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:30:34,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35561922] [2023-11-29 00:30:34,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:34,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:30:34,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:34,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:30:34,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:30:34,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 190 [2023-11-29 00:30:34,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 190 transitions, 396 flow. Second operand has 2 states, 2 states have (on average 151.0) internal successors, (302), 2 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:34,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:30:34,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 190 [2023-11-29 00:30:34,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:30:35,411 INFO L124 PetriNetUnfolderBase]: 421/2594 cut-off events. [2023-11-29 00:30:35,412 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2023-11-29 00:30:35,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3353 conditions, 2594 events. 421/2594 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 21507 event pairs, 414 based on Foata normal form. 573/2898 useless extension candidates. Maximal degree in co-relation 2799. Up to 716 conditions per place. [2023-11-29 00:30:35,441 INFO L140 encePairwiseOnDemand]: 171/190 looper letters, 20 selfloop transitions, 0 changer transitions 0/168 dead transitions. [2023-11-29 00:30:35,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 168 transitions, 392 flow [2023-11-29 00:30:35,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:30:35,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 00:30:35,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 339 transitions. [2023-11-29 00:30:35,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8921052631578947 [2023-11-29 00:30:35,444 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 339 transitions. [2023-11-29 00:30:35,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 339 transitions. [2023-11-29 00:30:35,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:30:35,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 339 transitions. [2023-11-29 00:30:35,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 169.5) internal successors, (339), 2 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:35,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:35,450 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:35,450 INFO L175 Difference]: Start difference. First operand has 173 places, 190 transitions, 396 flow. Second operand 2 states and 339 transitions. [2023-11-29 00:30:35,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 168 transitions, 392 flow [2023-11-29 00:30:35,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 168 transitions, 392 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:30:35,457 INFO L231 Difference]: Finished difference. Result has 171 places, 168 transitions, 352 flow [2023-11-29 00:30:35,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=352, PETRI_PLACES=171, PETRI_TRANSITIONS=168} [2023-11-29 00:30:35,459 INFO L281 CegarLoopForPetriNet]: 173 programPoint places, -2 predicate places. [2023-11-29 00:30:35,459 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 168 transitions, 352 flow [2023-11-29 00:30:35,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 151.0) internal successors, (302), 2 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:35,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:30:35,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:35,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:30:35,460 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-29 00:30:35,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:35,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1492799511, now seen corresponding path program 1 times [2023-11-29 00:30:35,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:35,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066235498] [2023-11-29 00:30:35,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:35,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:35,525 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-29 00:30:35,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:35,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066235498] [2023-11-29 00:30:35,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066235498] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:35,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:35,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:30:35,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560336131] [2023-11-29 00:30:35,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:35,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:30:35,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:35,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:30:35,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:30:35,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 190 [2023-11-29 00:30:35,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 168 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:35,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:30:35,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 190 [2023-11-29 00:30:35,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:30:36,242 INFO L124 PetriNetUnfolderBase]: 802/4260 cut-off events. [2023-11-29 00:30:36,242 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-11-29 00:30:36,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5614 conditions, 4260 events. 802/4260 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 40749 event pairs, 632 based on Foata normal form. 1/3860 useless extension candidates. Maximal degree in co-relation 5609. Up to 1303 conditions per place. [2023-11-29 00:30:36,273 INFO L140 encePairwiseOnDemand]: 187/190 looper letters, 31 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2023-11-29 00:30:36,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 175 transitions, 432 flow [2023-11-29 00:30:36,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:30:36,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:30:36,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2023-11-29 00:30:36,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8175438596491228 [2023-11-29 00:30:36,275 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 466 transitions. [2023-11-29 00:30:36,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 466 transitions. [2023-11-29 00:30:36,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:30:36,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 466 transitions. [2023-11-29 00:30:36,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:36,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:36,280 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:36,280 INFO L175 Difference]: Start difference. First operand has 171 places, 168 transitions, 352 flow. Second operand 3 states and 466 transitions. [2023-11-29 00:30:36,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 175 transitions, 432 flow [2023-11-29 00:30:36,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 175 transitions, 432 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:30:36,285 INFO L231 Difference]: Finished difference. Result has 174 places, 169 transitions, 364 flow [2023-11-29 00:30:36,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=174, PETRI_TRANSITIONS=169} [2023-11-29 00:30:36,287 INFO L281 CegarLoopForPetriNet]: 173 programPoint places, 1 predicate places. [2023-11-29 00:30:36,287 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 169 transitions, 364 flow [2023-11-29 00:30:36,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:36,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:30:36,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:36,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:30:36,288 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-29 00:30:36,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:36,288 INFO L85 PathProgramCache]: Analyzing trace with hash 592983066, now seen corresponding path program 1 times [2023-11-29 00:30:36,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:36,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123614912] [2023-11-29 00:30:36,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:36,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:36,327 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-29 00:30:36,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:36,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123614912] [2023-11-29 00:30:36,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123614912] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:36,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:36,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:30:36,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595891218] [2023-11-29 00:30:36,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:36,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:30:36,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:36,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:30:36,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:30:36,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 190 [2023-11-29 00:30:36,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 169 transitions, 364 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:36,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:30:36,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 190 [2023-11-29 00:30:36,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:30:38,272 INFO L124 PetriNetUnfolderBase]: 3950/14590 cut-off events. [2023-11-29 00:30:38,272 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2023-11-29 00:30:38,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21183 conditions, 14590 events. 3950/14590 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 163849 event pairs, 1374 based on Foata normal form. 0/13071 useless extension candidates. Maximal degree in co-relation 21176. Up to 3544 conditions per place. [2023-11-29 00:30:38,368 INFO L140 encePairwiseOnDemand]: 171/190 looper letters, 58 selfloop transitions, 14 changer transitions 0/202 dead transitions. [2023-11-29 00:30:38,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 202 transitions, 585 flow [2023-11-29 00:30:38,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:30:38,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:30:38,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2023-11-29 00:30:38,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8245614035087719 [2023-11-29 00:30:38,371 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 470 transitions. [2023-11-29 00:30:38,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 470 transitions. [2023-11-29 00:30:38,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:30:38,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 470 transitions. [2023-11-29 00:30:38,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:38,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:38,376 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:38,376 INFO L175 Difference]: Start difference. First operand has 174 places, 169 transitions, 364 flow. Second operand 3 states and 470 transitions. [2023-11-29 00:30:38,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 202 transitions, 585 flow [2023-11-29 00:30:38,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 202 transitions, 583 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:30:38,382 INFO L231 Difference]: Finished difference. Result has 177 places, 183 transitions, 484 flow [2023-11-29 00:30:38,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=484, PETRI_PLACES=177, PETRI_TRANSITIONS=183} [2023-11-29 00:30:38,383 INFO L281 CegarLoopForPetriNet]: 173 programPoint places, 4 predicate places. [2023-11-29 00:30:38,383 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 183 transitions, 484 flow [2023-11-29 00:30:38,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:38,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:30:38,385 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] [2023-11-29 00:30:38,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:30:38,385 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-29 00:30:38,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:38,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1070496224, now seen corresponding path program 1 times [2023-11-29 00:30:38,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:38,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356694561] [2023-11-29 00:30:38,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:38,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:38,422 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-29 00:30:38,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:38,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356694561] [2023-11-29 00:30:38,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356694561] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:38,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:38,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:30:38,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985686723] [2023-11-29 00:30:38,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:38,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:30:38,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:38,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:30:38,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:30:38,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 190 [2023-11-29 00:30:38,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 183 transitions, 484 flow. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:38,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:30:38,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 190 [2023-11-29 00:30:38,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:30:40,359 INFO L124 PetriNetUnfolderBase]: 4053/17145 cut-off events. [2023-11-29 00:30:40,359 INFO L125 PetriNetUnfolderBase]: For 4319/4501 co-relation queries the response was YES. [2023-11-29 00:30:40,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27922 conditions, 17145 events. 4053/17145 cut-off events. For 4319/4501 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 206710 event pairs, 2548 based on Foata normal form. 37/15575 useless extension candidates. Maximal degree in co-relation 27914. Up to 5551 conditions per place. [2023-11-29 00:30:40,465 INFO L140 encePairwiseOnDemand]: 181/190 looper letters, 52 selfloop transitions, 14 changer transitions 0/207 dead transitions. [2023-11-29 00:30:40,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 207 transitions, 702 flow [2023-11-29 00:30:40,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:30:40,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:30:40,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions. [2023-11-29 00:30:40,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8140350877192982 [2023-11-29 00:30:40,468 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 464 transitions. [2023-11-29 00:30:40,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 464 transitions. [2023-11-29 00:30:40,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:30:40,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 464 transitions. [2023-11-29 00:30:40,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:40,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:40,473 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:40,473 INFO L175 Difference]: Start difference. First operand has 177 places, 183 transitions, 484 flow. Second operand 3 states and 464 transitions. [2023-11-29 00:30:40,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 207 transitions, 702 flow [2023-11-29 00:30:40,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 207 transitions, 664 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:30:40,490 INFO L231 Difference]: Finished difference. Result has 179 places, 195 transitions, 582 flow [2023-11-29 00:30:40,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=179, PETRI_TRANSITIONS=195} [2023-11-29 00:30:40,491 INFO L281 CegarLoopForPetriNet]: 173 programPoint places, 6 predicate places. [2023-11-29 00:30:40,491 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 195 transitions, 582 flow [2023-11-29 00:30:40,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:40,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:30:40,492 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:40,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:30:40,493 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-29 00:30:40,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:40,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1453823320, now seen corresponding path program 1 times [2023-11-29 00:30:40,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:40,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899442455] [2023-11-29 00:30:40,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:40,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:30:40,516 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:30:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:30:40,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:30:40,537 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:30:40,537 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2023-11-29 00:30:40,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2023-11-29 00:30:40,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2023-11-29 00:30:40,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2023-11-29 00:30:40,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2023-11-29 00:30:40,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2023-11-29 00:30:40,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2023-11-29 00:30:40,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2023-11-29 00:30:40,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2023-11-29 00:30:40,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2023-11-29 00:30:40,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2023-11-29 00:30:40,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2023-11-29 00:30:40,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2023-11-29 00:30:40,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2023-11-29 00:30:40,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2023-11-29 00:30:40,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:30:40,540 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-29 00:30:40,541 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 00:30:40,541 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-29 00:30:40,580 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-29 00:30:40,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 217 places, 239 transitions, 505 flow [2023-11-29 00:30:40,641 INFO L124 PetriNetUnfolderBase]: 62/521 cut-off events. [2023-11-29 00:30:40,641 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-29 00:30:40,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 521 events. 62/521 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2202 event pairs, 1 based on Foata normal form. 0/431 useless extension candidates. Maximal degree in co-relation 344. Up to 16 conditions per place. [2023-11-29 00:30:40,644 INFO L82 GeneralOperation]: Start removeDead. Operand has 217 places, 239 transitions, 505 flow [2023-11-29 00:30:40,649 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 217 places, 239 transitions, 505 flow [2023-11-29 00:30:40,650 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:30:40,651 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;@44ee9b8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:30:40,651 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2023-11-29 00:30:40,656 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:30:40,656 INFO L124 PetriNetUnfolderBase]: 4/51 cut-off events. [2023-11-29 00:30:40,656 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:30:40,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:30:40,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:40,657 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-29 00:30:40,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:40,657 INFO L85 PathProgramCache]: Analyzing trace with hash -835961365, now seen corresponding path program 1 times [2023-11-29 00:30:40,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:40,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669146250] [2023-11-29 00:30:40,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:40,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:40,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:30:40,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:40,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669146250] [2023-11-29 00:30:40,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669146250] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:40,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:40,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:30:40,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541284076] [2023-11-29 00:30:40,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:40,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:30:40,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:40,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:30:40,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:30:40,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 239 [2023-11-29 00:30:40,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 239 transitions, 505 flow. Second operand has 2 states, 2 states have (on average 186.0) internal successors, (372), 2 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:40,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:30:40,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 239 [2023-11-29 00:30:40,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:30:43,380 INFO L124 PetriNetUnfolderBase]: 4833/20300 cut-off events. [2023-11-29 00:30:43,380 INFO L125 PetriNetUnfolderBase]: For 940/940 co-relation queries the response was YES. [2023-11-29 00:30:43,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27725 conditions, 20300 events. 4833/20300 cut-off events. For 940/940 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 245398 event pairs, 4795 based on Foata normal form. 5455/23802 useless extension candidates. Maximal degree in co-relation 23319. Up to 6995 conditions per place. [2023-11-29 00:30:43,534 INFO L140 encePairwiseOnDemand]: 214/239 looper letters, 28 selfloop transitions, 0 changer transitions 0/211 dead transitions. [2023-11-29 00:30:43,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 211 transitions, 505 flow [2023-11-29 00:30:43,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:30:43,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 00:30:43,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 423 transitions. [2023-11-29 00:30:43,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8849372384937239 [2023-11-29 00:30:43,537 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 423 transitions. [2023-11-29 00:30:43,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 423 transitions. [2023-11-29 00:30:43,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:30:43,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 423 transitions. [2023-11-29 00:30:43,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 211.5) internal successors, (423), 2 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:43,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:43,540 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:43,540 INFO L175 Difference]: Start difference. First operand has 217 places, 239 transitions, 505 flow. Second operand 2 states and 423 transitions. [2023-11-29 00:30:43,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 211 transitions, 505 flow [2023-11-29 00:30:43,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 211 transitions, 505 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:30:43,551 INFO L231 Difference]: Finished difference. Result has 215 places, 211 transitions, 449 flow [2023-11-29 00:30:43,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=449, PETRI_PLACES=215, PETRI_TRANSITIONS=211} [2023-11-29 00:30:43,553 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, -2 predicate places. [2023-11-29 00:30:43,553 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 211 transitions, 449 flow [2023-11-29 00:30:43,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 186.0) internal successors, (372), 2 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:43,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:30:43,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:43,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:30:43,554 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-29 00:30:43,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:43,555 INFO L85 PathProgramCache]: Analyzing trace with hash -365917193, now seen corresponding path program 1 times [2023-11-29 00:30:43,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:43,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638177163] [2023-11-29 00:30:43,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:43,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:43,602 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-29 00:30:43,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:43,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638177163] [2023-11-29 00:30:43,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638177163] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:43,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:43,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:30:43,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4588919] [2023-11-29 00:30:43,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:43,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:30:43,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:43,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:30:43,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:30:43,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 239 [2023-11-29 00:30:43,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 211 transitions, 449 flow. Second operand has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:43,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:30:43,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 239 [2023-11-29 00:30:43,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:30:47,469 INFO L124 PetriNetUnfolderBase]: 8969/35253 cut-off events. [2023-11-29 00:30:47,470 INFO L125 PetriNetUnfolderBase]: For 952/952 co-relation queries the response was YES. [2023-11-29 00:30:47,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48492 conditions, 35253 events. 8969/35253 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 775. Compared 459817 event pairs, 5659 based on Foata normal form. 1/32009 useless extension candidates. Maximal degree in co-relation 48486. Up to 12802 conditions per place. [2023-11-29 00:30:47,862 INFO L140 encePairwiseOnDemand]: 236/239 looper letters, 39 selfloop transitions, 2 changer transitions 0/218 dead transitions. [2023-11-29 00:30:47,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 218 transitions, 545 flow [2023-11-29 00:30:47,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:30:47,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:30:47,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 579 transitions. [2023-11-29 00:30:47,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8075313807531381 [2023-11-29 00:30:47,867 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 579 transitions. [2023-11-29 00:30:47,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 579 transitions. [2023-11-29 00:30:47,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:30:47,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 579 transitions. [2023-11-29 00:30:47,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:47,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:47,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:47,873 INFO L175 Difference]: Start difference. First operand has 215 places, 211 transitions, 449 flow. Second operand 3 states and 579 transitions. [2023-11-29 00:30:47,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 218 transitions, 545 flow [2023-11-29 00:30:47,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 218 transitions, 545 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:30:47,880 INFO L231 Difference]: Finished difference. Result has 218 places, 212 transitions, 461 flow [2023-11-29 00:30:47,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=218, PETRI_TRANSITIONS=212} [2023-11-29 00:30:47,881 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, 1 predicate places. [2023-11-29 00:30:47,881 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 212 transitions, 461 flow [2023-11-29 00:30:47,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:47,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:30:47,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:47,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:30:47,882 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-29 00:30:47,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:47,883 INFO L85 PathProgramCache]: Analyzing trace with hash -448351255, now seen corresponding path program 1 times [2023-11-29 00:30:47,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:47,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164723952] [2023-11-29 00:30:47,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:47,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:47,918 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-29 00:30:47,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:47,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164723952] [2023-11-29 00:30:47,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164723952] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:47,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:47,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:30:47,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034609506] [2023-11-29 00:30:47,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:47,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:30:47,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:47,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:30:47,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:30:47,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 239 [2023-11-29 00:30:47,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 212 transitions, 461 flow. Second operand has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:47,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:30:47,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 239 [2023-11-29 00:30:47,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:31:25,100 INFO L124 PetriNetUnfolderBase]: 112584/280353 cut-off events. [2023-11-29 00:31:25,100 INFO L125 PetriNetUnfolderBase]: For 6272/6272 co-relation queries the response was YES. [2023-11-29 00:31:25,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440829 conditions, 280353 events. 112584/280353 cut-off events. For 6272/6272 co-relation queries the response was YES. Maximal size of possible extension queue 5967. Compared 4014328 event pairs, 42388 based on Foata normal form. 0/249635 useless extension candidates. Maximal degree in co-relation 440821. Up to 84274 conditions per place. [2023-11-29 00:31:27,172 INFO L140 encePairwiseOnDemand]: 212/239 looper letters, 82 selfloop transitions, 20 changer transitions 0/259 dead transitions. [2023-11-29 00:31:27,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 259 transitions, 780 flow [2023-11-29 00:31:27,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:31:27,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:31:27,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 583 transitions. [2023-11-29 00:31:27,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8131101813110181 [2023-11-29 00:31:27,175 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 583 transitions. [2023-11-29 00:31:27,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 583 transitions. [2023-11-29 00:31:27,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:31:27,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 583 transitions. [2023-11-29 00:31:27,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:31:27,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:31:27,181 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:31:27,181 INFO L175 Difference]: Start difference. First operand has 218 places, 212 transitions, 461 flow. Second operand 3 states and 583 transitions. [2023-11-29 00:31:27,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 259 transitions, 780 flow [2023-11-29 00:31:27,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 259 transitions, 778 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:31:27,191 INFO L231 Difference]: Finished difference. Result has 221 places, 232 transitions, 633 flow [2023-11-29 00:31:27,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=633, PETRI_PLACES=221, PETRI_TRANSITIONS=232} [2023-11-29 00:31:27,193 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, 4 predicate places. [2023-11-29 00:31:27,193 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 232 transitions, 633 flow [2023-11-29 00:31:27,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:31:27,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:31:27,194 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] [2023-11-29 00:31:27,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 00:31:27,194 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-29 00:31:27,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:31:27,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1371307650, now seen corresponding path program 1 times [2023-11-29 00:31:27,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:31:27,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268106333] [2023-11-29 00:31:27,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:31:27,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:31:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:27,227 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-29 00:31:27,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:31:27,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268106333] [2023-11-29 00:31:27,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268106333] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:31:27,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:31:27,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:31:27,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039200378] [2023-11-29 00:31:27,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:31:27,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:31:27,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:31:27,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:31:27,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:31:27,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 239 [2023-11-29 00:31:27,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 232 transitions, 633 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:31:27,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:31:27,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 239 [2023-11-29 00:31:27,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:31:32,162 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([844] L701-9-->L701-10: Formula: (= |v_t_funThread2of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|} OutVars{t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][98], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 18#L700-3true, 37#L701-10true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, Black: 230#(= |#race~global~0| 0), t_funThread3of3ForFork0InUse, 48#L701-16true, 234#true, 144#L709-5true, 228#true]) [2023-11-29 00:31:32,162 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2023-11-29 00:31:32,163 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2023-11-29 00:31:32,163 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2023-11-29 00:31:32,163 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2023-11-29 00:31:32,475 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][181], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 18#L700-3true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, Black: 228#true, t_funThread3of3ForFork0InUse, 58#L701-6true, 234#true, 230#(= |#race~global~0| 0), 144#L709-5true, 174#L701-24true]) [2023-11-29 00:31:32,475 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2023-11-29 00:31:32,475 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 00:31:32,475 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 00:31:32,475 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 00:31:32,476 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([878] L701-4-->L701-5: Formula: (= |v_#race~global~0_4| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_4|} AuxVars[] AssignedVars[#race~global~0][167], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, Black: 228#true, t_funThread3of3ForFork0InUse, 58#L701-6true, 48#L701-16true, 234#true, 230#(= |#race~global~0| 0), 144#L709-5true, 167#L701-5true]) [2023-11-29 00:31:32,476 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2023-11-29 00:31:32,476 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 00:31:32,476 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 00:31:32,476 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 00:31:33,455 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([844] L701-9-->L701-10: Formula: (= |v_t_funThread2of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|} OutVars{t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][98], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 18#L700-3true, 37#L701-10true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, Black: 230#(= |#race~global~0| 0), t_funThread3of3ForFork0InUse, 234#true, 144#L709-5true, 228#true, 158#L701-22true]) [2023-11-29 00:31:33,455 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2023-11-29 00:31:33,455 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 00:31:33,455 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 00:31:33,455 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 00:31:33,457 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([844] L701-9-->L701-10: Formula: (= |v_t_funThread2of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|} OutVars{t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][98], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 37#L701-10true, 99#L701-3true, t_funThread1of3ForFork0InUse, Black: 230#(= |#race~global~0| 0), t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 234#true, 48#L701-16true, 144#L709-5true, 228#true]) [2023-11-29 00:31:33,457 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2023-11-29 00:31:33,457 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 00:31:33,457 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 00:31:33,457 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 00:31:34,075 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][181], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 99#L701-3true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, Black: 228#true, t_funThread3of3ForFork0InUse, 58#L701-6true, 234#true, 230#(= |#race~global~0| 0), 174#L701-24true, 144#L709-5true]) [2023-11-29 00:31:34,076 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2023-11-29 00:31:34,076 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 00:31:34,076 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 00:31:34,076 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 00:31:34,077 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([878] L701-4-->L701-5: Formula: (= |v_#race~global~0_4| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_4|} AuxVars[] AssignedVars[#race~global~0][167], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, Black: 228#true, t_funThread3of3ForFork0InUse, 58#L701-6true, 234#true, 230#(= |#race~global~0| 0), 144#L709-5true, 167#L701-5true, 158#L701-22true]) [2023-11-29 00:31:34,077 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2023-11-29 00:31:34,077 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 00:31:34,077 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 00:31:34,078 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 00:31:35,007 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([844] L701-9-->L701-10: Formula: (= |v_t_funThread2of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|} OutVars{t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][98], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 99#L701-3true, 37#L701-10true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, Black: 230#(= |#race~global~0| 0), t_funThread3of3ForFork0InUse, 234#true, 144#L709-5true, 228#true, 158#L701-22true]) [2023-11-29 00:31:35,007 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2023-11-29 00:31:35,007 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 00:31:35,007 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 00:31:35,007 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 00:32:11,486 INFO L124 PetriNetUnfolderBase]: 108989/321904 cut-off events. [2023-11-29 00:32:11,486 INFO L125 PetriNetUnfolderBase]: For 111239/117572 co-relation queries the response was YES. [2023-11-29 00:32:12,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581839 conditions, 321904 events. 108989/321904 cut-off events. For 111239/117572 co-relation queries the response was YES. Maximal size of possible extension queue 6679. Compared 5121344 event pairs, 67742 based on Foata normal form. 930/291704 useless extension candidates. Maximal degree in co-relation 581830. Up to 128681 conditions per place. [2023-11-29 00:32:14,156 INFO L140 encePairwiseOnDemand]: 226/239 looper letters, 76 selfloop transitions, 22 changer transitions 0/272 dead transitions. [2023-11-29 00:32:14,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 272 transitions, 981 flow [2023-11-29 00:32:14,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:32:14,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:32:14,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 581 transitions. [2023-11-29 00:32:14,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.810320781032078 [2023-11-29 00:32:14,159 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 581 transitions. [2023-11-29 00:32:14,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 581 transitions. [2023-11-29 00:32:14,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:32:14,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 581 transitions. [2023-11-29 00:32:14,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:32:14,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:32:14,165 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:32:14,165 INFO L175 Difference]: Start difference. First operand has 221 places, 232 transitions, 633 flow. Second operand 3 states and 581 transitions. [2023-11-29 00:32:14,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 272 transitions, 981 flow [2023-11-29 00:32:14,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 272 transitions, 923 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:32:14,371 INFO L231 Difference]: Finished difference. Result has 223 places, 252 transitions, 799 flow [2023-11-29 00:32:14,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=799, PETRI_PLACES=223, PETRI_TRANSITIONS=252} [2023-11-29 00:32:14,373 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, 6 predicate places. [2023-11-29 00:32:14,373 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 252 transitions, 799 flow [2023-11-29 00:32:14,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:32:14,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:32:14,374 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-11-29 00:32:14,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 00:32:14,374 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-29 00:32:14,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:32:14,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1215718748, now seen corresponding path program 1 times [2023-11-29 00:32:14,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:32:14,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348838950] [2023-11-29 00:32:14,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:32:14,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:32:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:14,415 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 00:32:14,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:32:14,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348838950] [2023-11-29 00:32:14,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348838950] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:32:14,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:32:14,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:32:14,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436490436] [2023-11-29 00:32:14,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:32:14,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:32:14,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:32:14,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:32:14,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:32:14,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 239 [2023-11-29 00:32:14,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 252 transitions, 799 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:32:14,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:32:14,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 239 [2023-11-29 00:32:14,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:32:17,673 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([844] L701-9-->L701-10: Formula: (= |v_t_funThread2of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|} OutVars{t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][180], [220#true, 18#L700-3true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 37#L701-10true, Black: 230#(= |#race~global~0| 0), 234#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread3of3ForFork0InUse, 144#L709-5true]) [2023-11-29 00:32:17,673 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2023-11-29 00:32:17,673 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-11-29 00:32:17,673 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-11-29 00:32:17,673 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-11-29 00:32:18,955 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([844] L701-9-->L701-10: Formula: (= |v_t_funThread2of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|} OutVars{t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][180], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 99#L701-3true, 37#L701-10true, Black: 230#(= |#race~global~0| 0), 234#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread3of3ForFork0InUse, 144#L709-5true]) [2023-11-29 00:32:18,955 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2023-11-29 00:32:18,956 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2023-11-29 00:32:18,956 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2023-11-29 00:32:18,956 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2023-11-29 00:32:19,346 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([878] L701-4-->L701-5: Formula: (= |v_#race~global~0_4| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_4|} AuxVars[] AssignedVars[#race~global~0][241], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 62#L701-9true, 234#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 167#L701-5true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#L709-5true]) [2023-11-29 00:32:19,346 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2023-11-29 00:32:19,346 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 00:32:19,347 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 00:32:19,347 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 00:32:26,382 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([891] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][228], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 205#L701-16true, 240#true, Black: 230#(= |#race~global~0| 0), 234#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 65#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 61#L701-10true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 00:32:26,382 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-29 00:32:26,382 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:32:26,382 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:32:26,382 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:32:26,382 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([891] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][228], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 230#(= |#race~global~0| 0), 234#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 65#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 61#L701-10true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 82#L701-22true]) [2023-11-29 00:32:26,382 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2023-11-29 00:32:26,382 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-29 00:32:26,382 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-29 00:32:26,382 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-29 00:32:26,384 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][276], [30#L701-6true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 210#L701-24true, 234#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 65#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 00:32:26,384 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 00:32:26,384 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:32:26,384 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:32:26,384 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:32:26,388 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][276], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 210#L701-24true, 234#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#L709-5true, 212#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue]) [2023-11-29 00:32:26,388 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 00:32:26,388 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:32:26,389 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:32:26,389 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:32:28,504 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][204], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 210#L701-24true, 234#true, 159#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#L709-5true, 212#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue]) [2023-11-29 00:32:28,504 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 00:32:28,504 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:32:28,504 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:32:28,504 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:32:28,527 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([891] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][163], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 205#L701-16true, 240#true, Black: 230#(= |#race~global~0| 0), 234#true, 159#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 65#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 61#L701-10true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 00:32:28,527 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is not cut-off event [2023-11-29 00:32:28,528 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2023-11-29 00:32:28,528 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2023-11-29 00:32:28,528 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2023-11-29 00:32:29,372 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][225], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 210#L701-24true, Black: 228#true, 234#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 65#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 212#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue]) [2023-11-29 00:32:29,372 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is not cut-off event [2023-11-29 00:32:29,372 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is not cut-off event [2023-11-29 00:32:29,372 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is not cut-off event [2023-11-29 00:32:29,372 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is not cut-off event [2023-11-29 00:32:29,420 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][204], [30#L701-6true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 210#L701-24true, 234#true, 159#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 65#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 00:32:29,420 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is not cut-off event [2023-11-29 00:32:29,420 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is not cut-off event [2023-11-29 00:32:29,420 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is not cut-off event [2023-11-29 00:32:29,420 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is not cut-off event [2023-11-29 00:32:30,781 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([891] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][163], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 230#(= |#race~global~0| 0), 234#true, 159#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 65#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 61#L701-10true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 82#L701-22true]) [2023-11-29 00:32:30,782 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2023-11-29 00:32:30,782 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-29 00:32:30,782 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-29 00:32:30,782 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-29 00:32:37,997 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][262], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 205#L701-16true, 240#true, Black: 228#true, 234#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 65#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 176#L701-24true]) [2023-11-29 00:32:37,997 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2023-11-29 00:32:37,997 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-29 00:32:37,997 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-29 00:32:37,997 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-29 00:32:39,214 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][225], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 210#L701-24true, Black: 228#true, 234#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 65#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 123#L701-16true, t_funThread3of3ForFork0InUse]) [2023-11-29 00:32:39,214 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is not cut-off event [2023-11-29 00:32:39,214 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2023-11-29 00:32:39,214 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2023-11-29 00:32:39,214 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2023-11-29 00:32:41,515 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][262], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 234#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 65#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 82#L701-22true, 176#L701-24true]) [2023-11-29 00:32:41,515 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2023-11-29 00:32:41,515 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-29 00:32:41,515 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-29 00:32:41,515 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-29 00:32:42,691 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][225], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 104#L701-22true, Black: 228#true, 210#L701-24true, 234#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 65#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 00:32:42,692 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is not cut-off event [2023-11-29 00:32:42,692 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is not cut-off event [2023-11-29 00:32:42,692 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is not cut-off event [2023-11-29 00:32:42,692 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is not cut-off event [2023-11-29 00:32:42,812 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L701-28-->L701-29: Formula: (= |v_#race~global~0_13| |v_t_funThread3of3ForFork0_#t~nondet10_3|) InVars {t_funThread3of3ForFork0_#t~nondet10=|v_t_funThread3of3ForFork0_#t~nondet10_3|} OutVars{t_funThread3of3ForFork0_#t~nondet10=|v_t_funThread3of3ForFork0_#t~nondet10_3|, #race~global~0=|v_#race~global~0_13|} AuxVars[] AssignedVars[#race~global~0][280], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 205#L701-16true, 240#true, Black: 230#(= |#race~global~0| 0), 133#L701-29true, 234#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 65#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 00:32:42,813 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2023-11-29 00:32:42,813 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2023-11-29 00:32:42,813 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2023-11-29 00:32:42,813 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2023-11-29 00:32:42,822 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][276], [220#true, 154#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 210#L701-24true, Black: 228#true, 234#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#L709-5true]) [2023-11-29 00:32:42,822 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2023-11-29 00:32:42,822 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-29 00:32:42,822 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-29 00:32:42,822 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-29 00:32:42,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][276], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 162#L701-25true, Black: 228#true, 210#L701-24true, 234#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 65#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 00:32:42,833 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2023-11-29 00:32:42,833 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-29 00:32:42,833 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-29 00:32:42,833 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-29 00:32:45,978 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][204], [220#true, 154#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 210#L701-24true, 234#true, 159#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#L709-5true]) [2023-11-29 00:32:45,978 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is not cut-off event [2023-11-29 00:32:45,979 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is not cut-off event [2023-11-29 00:32:45,979 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is not cut-off event [2023-11-29 00:32:45,979 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is not cut-off event [2023-11-29 00:32:46,012 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L701-28-->L701-29: Formula: (= |v_#race~global~0_13| |v_t_funThread3of3ForFork0_#t~nondet10_3|) InVars {t_funThread3of3ForFork0_#t~nondet10=|v_t_funThread3of3ForFork0_#t~nondet10_3|} OutVars{t_funThread3of3ForFork0_#t~nondet10=|v_t_funThread3of3ForFork0_#t~nondet10_3|, #race~global~0=|v_#race~global~0_13|} AuxVars[] AssignedVars[#race~global~0][280], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 230#(= |#race~global~0| 0), 133#L701-29true, 234#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 65#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 82#L701-22true]) [2023-11-29 00:32:46,012 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2023-11-29 00:32:46,012 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-11-29 00:32:46,012 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-11-29 00:32:46,013 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-11-29 00:33:09,280 INFO L124 PetriNetUnfolderBase]: 135024/391484 cut-off events. [2023-11-29 00:33:09,280 INFO L125 PetriNetUnfolderBase]: For 204464/214452 co-relation queries the response was YES. [2023-11-29 00:33:10,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744264 conditions, 391484 events. 135024/391484 cut-off events. For 204464/214452 co-relation queries the response was YES. Maximal size of possible extension queue 8357. Compared 6325716 event pairs, 77340 based on Foata normal form. 1244/348886 useless extension candidates. Maximal degree in co-relation 744254. Up to 157249 conditions per place. [2023-11-29 00:33:12,822 INFO L140 encePairwiseOnDemand]: 226/239 looper letters, 91 selfloop transitions, 34 changer transitions 0/301 dead transitions. [2023-11-29 00:33:12,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 301 transitions, 1284 flow [2023-11-29 00:33:12,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:33:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:33:12,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions. [2023-11-29 00:33:12,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8089260808926081 [2023-11-29 00:33:12,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 580 transitions. [2023-11-29 00:33:12,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 580 transitions. [2023-11-29 00:33:12,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:33:12,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 580 transitions. [2023-11-29 00:33:12,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:33:12,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:33:12,829 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:33:12,829 INFO L175 Difference]: Start difference. First operand has 223 places, 252 transitions, 799 flow. Second operand 3 states and 580 transitions. [2023-11-29 00:33:12,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 301 transitions, 1284 flow [2023-11-29 00:33:20,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 301 transitions, 1216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:33:20,891 INFO L231 Difference]: Finished difference. Result has 225 places, 282 transitions, 1113 flow [2023-11-29 00:33:20,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1113, PETRI_PLACES=225, PETRI_TRANSITIONS=282} [2023-11-29 00:33:20,892 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, 8 predicate places. [2023-11-29 00:33:20,892 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 282 transitions, 1113 flow [2023-11-29 00:33:20,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:33:20,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:33:20,893 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] [2023-11-29 00:33:20,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 00:33:20,893 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-29 00:33:20,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:33:20,893 INFO L85 PathProgramCache]: Analyzing trace with hash -195074069, now seen corresponding path program 1 times [2023-11-29 00:33:20,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:33:20,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741600450] [2023-11-29 00:33:20,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:33:20,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:33:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:33:20,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:33:20,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:33:20,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741600450] [2023-11-29 00:33:20,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741600450] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:33:20,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438762539] [2023-11-29 00:33:20,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:33:20,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:33:20,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1465e0db-96ba-4c41-a2cf-c6e1f9f99d17/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:33:20,998 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1465e0db-96ba-4c41-a2cf-c6e1f9f99d17/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:33:20,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1465e0db-96ba-4c41-a2cf-c6e1f9f99d17/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 00:33:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:33:21,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:33:21,116 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:33:21,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:33:21,194 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:33:21,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:33:21,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438762539] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:33:21,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:33:21,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-29 00:33:21,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515566884] [2023-11-29 00:33:21,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:33:21,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 00:33:21,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:33:21,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 00:33:21,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:33:21,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 239 [2023-11-29 00:33:21,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 282 transitions, 1113 flow. Second operand has 10 states, 10 states have (on average 178.5) internal successors, (1785), 10 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:33:21,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:33:21,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 239 [2023-11-29 00:33:21,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:33:25,128 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][341], [60#L701-11true, 30#L701-6true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 91#L706-8true, 481#(< |ULTIMATE.start_main_~i~0#1| 10000), 174#L701-24true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 00:33:25,129 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 00:33:25,129 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 00:33:25,129 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 00:33:25,129 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 00:33:25,142 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][342], [30#L701-6true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 210#L701-24true, Black: 228#true, 91#L706-8true, 173#L701-11true, 481#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 00:33:25,143 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 00:33:25,143 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 00:33:25,143 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 00:33:25,143 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 00:33:26,074 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][341], [60#L701-11true, 30#L701-6true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 481#(< |ULTIMATE.start_main_~i~0#1| 10000), 174#L701-24true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 198#L706-11true, t_funThread3of3ForFork0InUse]) [2023-11-29 00:33:26,075 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2023-11-29 00:33:26,075 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 00:33:26,075 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 00:33:26,075 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 00:33:26,143 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][342], [30#L701-6true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 210#L701-24true, Black: 228#true, 173#L701-11true, 481#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 198#L706-11true, t_funThread3of3ForFork0InUse]) [2023-11-29 00:33:26,143 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2023-11-29 00:33:26,143 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 00:33:26,144 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 00:33:26,144 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 00:33:27,610 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][341], [60#L701-11true, 220#true, 42#$Ultimate##0true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 246#true, 174#L701-24true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#L709-5true]) [2023-11-29 00:33:27,610 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2023-11-29 00:33:27,610 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 00:33:27,610 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 00:33:27,611 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 00:33:27,710 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][342], [220#true, 42#$Ultimate##0true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 210#L701-24true, Black: 228#true, 173#L701-11true, 246#true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#L709-5true]) [2023-11-29 00:33:27,710 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2023-11-29 00:33:27,710 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 00:33:27,710 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 00:33:27,710 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 00:33:28,288 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([786] L709-3-->L709-4: Formula: (= |v_#race~global~0_1| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_1|} AuxVars[] AssignedVars[#race~global~0][260], [60#L701-11true, 30#L701-6true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 36#L709-4true, 246#true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 48#L701-16true]) [2023-11-29 00:33:28,289 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2023-11-29 00:33:28,289 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 00:33:28,289 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 00:33:28,289 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 00:33:28,364 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([786] L709-3-->L709-4: Formula: (= |v_#race~global~0_1| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_1|} AuxVars[] AssignedVars[#race~global~0][258], [30#L701-6true, 220#true, 205#L701-16true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 36#L709-4true, 246#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 00:33:28,364 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2023-11-29 00:33:28,364 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 00:33:28,364 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 00:33:28,365 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 00:33:28,818 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][341], [60#L701-11true, 220#true, 18#L700-3true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 246#true, 174#L701-24true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#L709-5true]) [2023-11-29 00:33:28,818 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2023-11-29 00:33:28,818 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 00:33:28,818 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 00:33:28,818 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 00:33:28,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][342], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 18#L700-3true, 240#true, Black: 228#true, 210#L701-24true, 246#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#L709-5true]) [2023-11-29 00:33:28,943 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2023-11-29 00:33:28,943 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 00:33:28,943 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 00:33:28,943 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 00:33:30,287 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([786] L709-3-->L709-4: Formula: (= |v_#race~global~0_1| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_1|} AuxVars[] AssignedVars[#race~global~0][260], [60#L701-11true, 30#L701-6true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 36#L709-4true, 246#true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 158#L701-22true, Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 00:33:30,287 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2023-11-29 00:33:30,287 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 00:33:30,288 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 00:33:30,288 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 00:33:30,380 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([786] L709-3-->L709-4: Formula: (= |v_#race~global~0_1| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_1|} AuxVars[] AssignedVars[#race~global~0][258], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 36#L709-4true, 246#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 61#L701-10true, t_funThread1of3ForFork0InUse, 39#L701-25true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 00:33:30,380 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-29 00:33:30,381 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 00:33:30,381 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 00:33:30,381 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 00:33:30,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([786] L709-3-->L709-4: Formula: (= |v_#race~global~0_1| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_1|} AuxVars[] AssignedVars[#race~global~0][258], [30#L701-6true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 36#L709-4true, 173#L701-11true, 246#true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 82#L701-22true]) [2023-11-29 00:33:30,410 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2023-11-29 00:33:30,410 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 00:33:30,410 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 00:33:30,410 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 00:33:30,904 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][341], [60#L701-11true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 99#L701-3true, Black: 228#true, 246#true, 174#L701-24true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#L709-5true]) [2023-11-29 00:33:30,904 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2023-11-29 00:33:30,904 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 00:33:30,904 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 00:33:30,904 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 00:33:31,060 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][342], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 99#L701-3true, 210#L701-24true, Black: 228#true, 246#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#L709-5true]) [2023-11-29 00:33:31,060 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2023-11-29 00:33:31,060 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 00:33:31,060 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 00:33:31,061 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 00:33:31,819 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][341], [60#L701-11true, 30#L701-6true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 36#L709-4true, 246#true, 174#L701-24true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 00:33:31,819 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-29 00:33:31,819 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:31,819 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:31,819 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:31,908 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][342], [30#L701-6true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 210#L701-24true, Black: 228#true, 36#L709-4true, 246#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 00:33:31,908 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-29 00:33:31,908 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:31,908 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:31,908 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:31,954 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][327], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 36#L709-4true, 173#L701-11true, 246#true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 58#L701-6true, 176#L701-24true]) [2023-11-29 00:33:31,955 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-29 00:33:31,955 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:31,955 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:31,955 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:31,957 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][327], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 173#L701-11true, 246#true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 207#L701-5true, t_funThread3of3ForFork0InUse, 176#L701-24true, 144#L709-5true]) [2023-11-29 00:33:31,957 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-29 00:33:31,957 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:31,957 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:31,957 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:31,961 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][342], [30#L701-6true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 210#L701-24true, Black: 228#true, 36#L709-4true, 173#L701-11true, 246#true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 00:33:31,961 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-29 00:33:31,962 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:31,962 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:31,962 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:31,962 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:31,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][342], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 210#L701-24true, Black: 228#true, 173#L701-11true, 246#true, 167#L701-5true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#L709-5true]) [2023-11-29 00:33:31,962 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-29 00:33:31,962 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:31,962 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:31,962 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:32,151 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][333], [60#L701-11true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 131#L701-5true, 246#true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 176#L701-24true, 144#L709-5true]) [2023-11-29 00:33:32,151 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-29 00:33:32,151 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:32,152 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:32,152 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:32,460 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][341], [60#L701-11true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 246#true, 174#L701-24true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 167#L701-5true, Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#L709-5true]) [2023-11-29 00:33:32,460 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-29 00:33:32,460 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:32,460 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:32,460 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:32,495 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][341], [60#L701-11true, 30#L701-6true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 246#true, 174#L701-24true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 65#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 00:33:32,495 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,495 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,495 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,495 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,496 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][341], [60#L701-11true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 246#true, 174#L701-24true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#L709-5true, 212#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue]) [2023-11-29 00:33:32,497 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,497 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,497 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,497 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,497 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([927] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][341], [60#L701-11true, 30#L701-6true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 246#true, 174#L701-24true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 65#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 00:33:32,498 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,498 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,498 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,498 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,498 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,667 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][342], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 210#L701-24true, 246#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 167#L701-5true, Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#L709-5true]) [2023-11-29 00:33:32,667 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-29 00:33:32,668 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:32,668 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:32,668 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:32,668 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:32,713 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][342], [30#L701-6true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 210#L701-24true, Black: 228#true, 173#L701-11true, 246#true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#L709-5true]) [2023-11-29 00:33:32,713 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,713 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,713 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,713 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,715 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][342], [30#L701-6true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 210#L701-24true, Black: 228#true, 246#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 65#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 00:33:32,715 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,715 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,715 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,716 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,718 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][342], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 210#L701-24true, Black: 228#true, 246#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#L709-5true, 212#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue]) [2023-11-29 00:33:32,718 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,718 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,718 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,718 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,719 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][342], [30#L701-6true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 210#L701-24true, 246#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 65#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 00:33:32,719 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,719 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,719 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,719 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,719 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][327], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 246#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 58#L701-6true, 176#L701-24true, 144#L709-5true]) [2023-11-29 00:33:32,762 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,762 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,762 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,762 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,792 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][327], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 246#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 65#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 58#L701-6true, 176#L701-24true]) [2023-11-29 00:33:32,793 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,793 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,793 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,793 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,907 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][333], [60#L701-11true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 43#L701-6true, 36#L709-4true, 246#true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 176#L701-24true]) [2023-11-29 00:33:32,908 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-29 00:33:32,908 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:32,908 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:32,908 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:32,910 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][333], [60#L701-11true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 43#L701-6true, 246#true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 176#L701-24true, 144#L709-5true]) [2023-11-29 00:33:32,910 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,910 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,910 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:32,910 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:33,012 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][333], [60#L701-11true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 43#L701-6true, 246#true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 65#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 176#L701-24true]) [2023-11-29 00:33:33,012 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 00:33:33,013 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:33,013 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:33,013 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:33,362 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][341], [60#L701-11true, 30#L701-6true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 246#true, 174#L701-24true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#L709-5true]) [2023-11-29 00:33:33,362 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 00:33:33,362 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:33,362 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:33,362 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:33,593 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][342], [30#L701-6true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 210#L701-24true, Black: 228#true, 246#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#L709-5true]) [2023-11-29 00:33:33,593 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 00:33:33,594 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:33,594 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:33,594 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:33,594 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:33,649 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][213], [30#L701-6true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 210#L701-24true, Black: 228#true, 36#L709-4true, 159#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 246#true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 00:33:33,649 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-29 00:33:33,650 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:33,650 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:33,650 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:33,651 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][213], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 210#L701-24true, Black: 228#true, 159#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 246#true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 167#L701-5true, Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#L709-5true]) [2023-11-29 00:33:33,652 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-29 00:33:33,652 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:33,652 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:33,652 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:33,708 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][292], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 159#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 246#true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 207#L701-5true, 176#L701-24true, 144#L709-5true]) [2023-11-29 00:33:33,708 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-29 00:33:33,708 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:33,708 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:33,708 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 00:33:34,214 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][341], [60#L701-11true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 162#L701-25true, Black: 228#true, 91#L706-8true, 481#(< |ULTIMATE.start_main_~i~0#1| 10000), 174#L701-24true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 00:33:34,215 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 00:33:34,215 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:34,215 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:34,215 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:34,233 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][342], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 162#L701-25true, Black: 228#true, 210#L701-24true, 91#L706-8true, 173#L701-11true, 481#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 00:33:34,233 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 00:33:34,233 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:34,233 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:34,233 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:34,323 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][222], [30#L701-6true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 246#true, 174#L701-24true, 125#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 65#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 00:33:34,323 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 00:33:34,323 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:34,323 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:34,323 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:34,475 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([786] L709-3-->L709-4: Formula: (= |v_#race~global~0_1| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_1|} AuxVars[] AssignedVars[#race~global~0][260], [60#L701-11true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 36#L709-4true, 108#L701-25true, 246#true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 61#L701-10true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 00:33:34,475 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-29 00:33:34,475 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 00:33:34,475 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 00:33:34,475 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 00:33:34,620 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][213], [30#L701-6true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 210#L701-24true, Black: 228#true, 159#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 246#true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#L709-5true]) [2023-11-29 00:33:34,621 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 00:33:34,621 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:34,621 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:34,621 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:34,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][213], [30#L701-6true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 210#L701-24true, Black: 228#true, 246#true, 159#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 65#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 00:33:34,621 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 00:33:34,621 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:34,622 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:34,622 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:34,667 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][292], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 159#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 246#true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 58#L701-6true, 176#L701-24true, 144#L709-5true]) [2023-11-29 00:33:34,667 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 00:33:34,667 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:34,667 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:34,667 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 00:33:34,883 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][292], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 131#L701-5true, 246#true, 125#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 176#L701-24true, 144#L709-5true]) [2023-11-29 00:33:34,884 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is not cut-off event [2023-11-29 00:33:34,884 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2023-11-29 00:33:34,884 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2023-11-29 00:33:34,884 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2023-11-29 00:33:35,759 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][292], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 43#L701-6true, 246#true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 125#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 176#L701-24true, 144#L709-5true]) [2023-11-29 00:33:35,759 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is not cut-off event [2023-11-29 00:33:35,759 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is not cut-off event [2023-11-29 00:33:35,760 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is not cut-off event [2023-11-29 00:33:35,760 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is not cut-off event [2023-11-29 00:33:36,275 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][341], [60#L701-11true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 162#L701-25true, Black: 228#true, 481#(< |ULTIMATE.start_main_~i~0#1| 10000), 174#L701-24true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 198#L706-11true, t_funThread3of3ForFork0InUse]) [2023-11-29 00:33:36,275 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-29 00:33:36,275 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 00:33:36,275 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 00:33:36,275 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 00:33:36,412 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][213], [30#L701-6true, 220#true, 24#L701-13true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 210#L701-24true, 36#L709-4true, 246#true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 00:33:36,413 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is not cut-off event [2023-11-29 00:33:36,413 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is not cut-off event [2023-11-29 00:33:36,413 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is not cut-off event [2023-11-29 00:33:36,413 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is not cut-off event [2023-11-29 00:33:36,415 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][213], [220#true, 24#L701-13true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 210#L701-24true, 246#true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 167#L701-5true, Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 144#L709-5true]) [2023-11-29 00:33:36,415 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is not cut-off event [2023-11-29 00:33:36,415 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is not cut-off event [2023-11-29 00:33:36,415 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is not cut-off event [2023-11-29 00:33:36,415 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is not cut-off event [2023-11-29 00:33:36,451 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][292], [220#true, 24#L701-13true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 36#L709-4true, 246#true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 58#L701-6true, 176#L701-24true]) [2023-11-29 00:33:36,452 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is not cut-off event [2023-11-29 00:33:36,452 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is not cut-off event [2023-11-29 00:33:36,452 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is not cut-off event [2023-11-29 00:33:36,452 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is not cut-off event [2023-11-29 00:33:36,458 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][292], [220#true, 24#L701-13true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 246#true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 207#L701-5true, t_funThread3of3ForFork0InUse, 176#L701-24true, 144#L709-5true]) [2023-11-29 00:33:36,458 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is not cut-off event [2023-11-29 00:33:36,458 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is not cut-off event [2023-11-29 00:33:36,458 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is not cut-off event [2023-11-29 00:33:36,458 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is not cut-off event [2023-11-29 00:33:36,560 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][342], [220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 162#L701-25true, Black: 228#true, 210#L701-24true, 481#(< |ULTIMATE.start_main_~i~0#1| 10000), 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 198#L706-11true, t_funThread3of3ForFork0InUse]) [2023-11-29 00:33:36,560 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-29 00:33:36,560 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 00:33:36,560 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 00:33:36,560 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 00:33:36,652 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][347], [60#L701-11true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 36#L709-4true, 246#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 176#L701-24true]) [2023-11-29 00:33:36,652 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-29 00:33:36,652 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 00:33:36,652 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 00:33:36,653 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 00:33:36,656 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][354], [60#L701-11true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 173#L701-11true, 246#true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 176#L701-24true, 144#L709-5true]) [2023-11-29 00:33:36,656 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2023-11-29 00:33:36,656 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-29 00:33:36,656 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-29 00:33:36,656 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-29 00:33:36,660 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([880] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][354], [60#L701-11true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 246#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 176#L701-24true, 144#L709-5true]) [2023-11-29 00:33:36,660 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2023-11-29 00:33:36,660 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-29 00:33:36,660 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-29 00:33:36,660 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-29 00:33:36,660 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-29 00:33:36,661 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L701-23-->L701-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][347], [60#L701-11true, 220#true, Black: 225#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, Black: 228#true, 246#true, 173#L701-11true, Black: 236#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 65#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 242#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 176#L701-24true]) [2023-11-29 00:33:36,661 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2023-11-29 00:33:36,661 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-29 00:33:36,661 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-29 00:33:36,662 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event