./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/01_inc.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_1a20cc80-97ae-44a0-8c41-156138bbca6f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a20cc80-97ae-44a0-8c41-156138bbca6f/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_1a20cc80-97ae-44a0-8c41-156138bbca6f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a20cc80-97ae-44a0-8c41-156138bbca6f/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/01_inc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a20cc80-97ae-44a0-8c41-156138bbca6f/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_1a20cc80-97ae-44a0-8c41-156138bbca6f/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 dc44c09c63836e77e2249e5abf8328354015a2494c028ff1b2e04f58fa741976 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:32:50,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:32:50,301 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a20cc80-97ae-44a0-8c41-156138bbca6f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 02:32:50,306 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:32:50,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:32:50,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:32:50,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:32:50,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:32:50,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:32:50,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:32:50,336 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:32:50,336 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:32:50,337 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:32:50,337 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:32:50,338 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 02:32:50,338 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:32:50,339 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:32:50,339 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:32:50,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:32:50,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 02:32:50,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:32:50,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 02:32:50,342 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 02:32:50,343 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:32:50,343 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:32:50,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 02:32:50,344 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:32:50,345 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:32:50,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:32:50,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:32:50,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:32:50,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:32:50,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:32:50,360 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 02:32:50,360 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:32:50,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:32:50,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:32:50,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:32:50,361 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 02:32:50,362 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:32:50,362 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:32:50,362 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_1a20cc80-97ae-44a0-8c41-156138bbca6f/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_1a20cc80-97ae-44a0-8c41-156138bbca6f/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 -> dc44c09c63836e77e2249e5abf8328354015a2494c028ff1b2e04f58fa741976 [2023-11-29 02:32:50,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:32:50,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:32:50,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:32:50,624 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:32:50,624 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:32:50,625 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a20cc80-97ae-44a0-8c41-156138bbca6f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-ext/01_inc.i [2023-11-29 02:32:53,326 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:32:53,548 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:32:53,548 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a20cc80-97ae-44a0-8c41-156138bbca6f/sv-benchmarks/c/pthread-ext/01_inc.i [2023-11-29 02:32:53,564 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a20cc80-97ae-44a0-8c41-156138bbca6f/bin/uautomizer-verify-BQ2R08f2Ya/data/43bc98c61/28375ec0f9264665abd2e929aeace5c5/FLAG6c9c39b8f [2023-11-29 02:32:53,580 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a20cc80-97ae-44a0-8c41-156138bbca6f/bin/uautomizer-verify-BQ2R08f2Ya/data/43bc98c61/28375ec0f9264665abd2e929aeace5c5 [2023-11-29 02:32:53,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:32:53,599 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:32:53,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:32:53,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:32:53,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:32:53,607 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:32:53" (1/1) ... [2023-11-29 02:32:53,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21ca3eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:32:53, skipping insertion in model container [2023-11-29 02:32:53,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:32:53" (1/1) ... [2023-11-29 02:32:53,666 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:32:54,003 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:32:54,015 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:32:54,061 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:32:54,098 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:32:54,099 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:32:54,108 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:32:54,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:32:54 WrapperNode [2023-11-29 02:32:54,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:32:54,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:32:54,110 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:32:54,110 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:32:54,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:32:54" (1/1) ... [2023-11-29 02:32:54,135 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:32:54" (1/1) ... [2023-11-29 02:32:54,161 INFO L138 Inliner]: procedures = 172, calls = 18, calls flagged for inlining = 8, calls inlined = 9, statements flattened = 90 [2023-11-29 02:32:54,162 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:32:54,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:32:54,163 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:32:54,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:32:54,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:32:54" (1/1) ... [2023-11-29 02:32:54,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:32:54" (1/1) ... [2023-11-29 02:32:54,177 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:32:54" (1/1) ... [2023-11-29 02:32:54,177 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:32:54" (1/1) ... [2023-11-29 02:32:54,183 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:32:54" (1/1) ... [2023-11-29 02:32:54,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:32:54" (1/1) ... [2023-11-29 02:32:54,189 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:32:54" (1/1) ... [2023-11-29 02:32:54,190 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:32:54" (1/1) ... [2023-11-29 02:32:54,193 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:32:54,194 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:32:54,195 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:32:54,195 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:32:54,196 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:32:54" (1/1) ... [2023-11-29 02:32:54,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:32:54,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a20cc80-97ae-44a0-8c41-156138bbca6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:32:54,226 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a20cc80-97ae-44a0-8c41-156138bbca6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:32:54,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a20cc80-97ae-44a0-8c41-156138bbca6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:32:54,274 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-29 02:32:54,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-29 02:32:54,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 02:32:54,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 02:32:54,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:32:54,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 02:32:54,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:32:54,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 02:32:54,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 02:32:54,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:32:54,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:32:54,278 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 02:32:54,428 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:32:54,430 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:32:54,599 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:32:54,707 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:32:54,707 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 02:32:54,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:32:54 BoogieIcfgContainer [2023-11-29 02:32:54,709 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:32:54,712 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:32:54,712 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:32:54,716 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:32:54,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:32:53" (1/3) ... [2023-11-29 02:32:54,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fae7289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:32:54, skipping insertion in model container [2023-11-29 02:32:54,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:32:54" (2/3) ... [2023-11-29 02:32:54,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fae7289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:32:54, skipping insertion in model container [2023-11-29 02:32:54,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:32:54" (3/3) ... [2023-11-29 02:32:54,718 INFO L112 eAbstractionObserver]: Analyzing ICFG 01_inc.i [2023-11-29 02:32:54,726 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 02:32:54,734 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:32:54,734 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-11-29 02:32:54,735 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 02:32:54,775 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 02:32:54,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 57 transitions, 118 flow [2023-11-29 02:32:54,839 INFO L124 PetriNetUnfolderBase]: 3/68 cut-off events. [2023-11-29 02:32:54,839 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:32:54,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 68 events. 3/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 104 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 44. Up to 4 conditions per place. [2023-11-29 02:32:54,844 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 57 transitions, 118 flow [2023-11-29 02:32:54,848 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 57 transitions, 118 flow [2023-11-29 02:32:54,858 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:32:54,865 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;@24def2c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:32:54,866 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2023-11-29 02:32:54,877 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 02:32:54,877 INFO L124 PetriNetUnfolderBase]: 2/30 cut-off events. [2023-11-29 02:32:54,878 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:32:54,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:32:54,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:32:54,879 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-11-29 02:32:54,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:32:54,886 INFO L85 PathProgramCache]: Analyzing trace with hash -737868889, now seen corresponding path program 1 times [2023-11-29 02:32:54,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:32:54,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914945894] [2023-11-29 02:32:54,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:32:54,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:32:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:55,082 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 02:32:55,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:32:55,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914945894] [2023-11-29 02:32:55,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914945894] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:32:55,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:32:55,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:32:55,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898130813] [2023-11-29 02:32:55,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:32:55,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:32:55,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:32:55,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:32:55,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:32:55,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 57 [2023-11-29 02:32:55,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 118 flow. Second operand has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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 02:32:55,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:32:55,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 57 [2023-11-29 02:32:55,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:32:55,169 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2023-11-29 02:32:55,169 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 02:32:55,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 47 events. 1/47 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 31 event pairs, 0 based on Foata normal form. 6/49 useless extension candidates. Maximal degree in co-relation 34. Up to 6 conditions per place. [2023-11-29 02:32:55,171 INFO L140 encePairwiseOnDemand]: 48/57 looper letters, 5 selfloop transitions, 0 changer transitions 0/43 dead transitions. [2023-11-29 02:32:55,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 100 flow [2023-11-29 02:32:55,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:32:55,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 02:32:55,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2023-11-29 02:32:55,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8771929824561403 [2023-11-29 02:32:55,183 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 100 transitions. [2023-11-29 02:32:55,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 100 transitions. [2023-11-29 02:32:55,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:32:55,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 100 transitions. [2023-11-29 02:32:55,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 50.0) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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 02:32:55,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states 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 02:32:55,193 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states 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 02:32:55,195 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 118 flow. Second operand 2 states and 100 transitions. [2023-11-29 02:32:55,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 100 flow [2023-11-29 02:32:55,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 43 transitions, 100 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 02:32:55,201 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 90 flow [2023-11-29 02:32:55,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2023-11-29 02:32:55,206 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -12 predicate places. [2023-11-29 02:32:55,207 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 90 flow [2023-11-29 02:32:55,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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 02:32:55,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:32:55,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:32:55,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:32:55,208 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-11-29 02:32:55,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:32:55,208 INFO L85 PathProgramCache]: Analyzing trace with hash -422387606, now seen corresponding path program 1 times [2023-11-29 02:32:55,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:32:55,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641371304] [2023-11-29 02:32:55,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:32:55,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:32:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:55,295 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 02:32:55,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:32:55,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641371304] [2023-11-29 02:32:55,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641371304] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:32:55,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:32:55,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:32:55,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980613902] [2023-11-29 02:32:55,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:32:55,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:32:55,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:32:55,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:32:55,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:32:55,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 57 [2023-11-29 02:32:55,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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 02:32:55,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:32:55,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 57 [2023-11-29 02:32:55,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:32:55,345 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2023-11-29 02:32:55,345 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 02:32:55,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 45 events. 1/45 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 57. Up to 6 conditions per place. [2023-11-29 02:32:55,346 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 7 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2023-11-29 02:32:55,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 41 transitions, 106 flow [2023-11-29 02:32:55,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:32:55,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:32:55,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2023-11-29 02:32:55,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7017543859649122 [2023-11-29 02:32:55,349 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 120 transitions. [2023-11-29 02:32:55,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 120 transitions. [2023-11-29 02:32:55,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:32:55,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 120 transitions. [2023-11-29 02:32:55,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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 02:32:55,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states 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 02:32:55,353 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states 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 02:32:55,353 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 90 flow. Second operand 3 states and 120 transitions. [2023-11-29 02:32:55,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 41 transitions, 106 flow [2023-11-29 02:32:55,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 106 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 02:32:55,356 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 92 flow [2023-11-29 02:32:55,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2023-11-29 02:32:55,357 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -12 predicate places. [2023-11-29 02:32:55,357 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 92 flow [2023-11-29 02:32:55,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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 02:32:55,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:32:55,358 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:32:55,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:32:55,359 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-11-29 02:32:55,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:32:55,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1184463730, now seen corresponding path program 1 times [2023-11-29 02:32:55,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:32:55,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576240128] [2023-11-29 02:32:55,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:32:55,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:32:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:32:55,384 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:32:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:32:55,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:32:55,418 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 02:32:55,419 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2023-11-29 02:32:55,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (19 of 21 remaining) [2023-11-29 02:32:55,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 21 remaining) [2023-11-29 02:32:55,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (17 of 21 remaining) [2023-11-29 02:32:55,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 21 remaining) [2023-11-29 02:32:55,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (15 of 21 remaining) [2023-11-29 02:32:55,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (14 of 21 remaining) [2023-11-29 02:32:55,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (13 of 21 remaining) [2023-11-29 02:32:55,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (12 of 21 remaining) [2023-11-29 02:32:55,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (11 of 21 remaining) [2023-11-29 02:32:55,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (10 of 21 remaining) [2023-11-29 02:32:55,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 21 remaining) [2023-11-29 02:32:55,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (8 of 21 remaining) [2023-11-29 02:32:55,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 21 remaining) [2023-11-29 02:32:55,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 21 remaining) [2023-11-29 02:32:55,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (5 of 21 remaining) [2023-11-29 02:32:55,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 21 remaining) [2023-11-29 02:32:55,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (3 of 21 remaining) [2023-11-29 02:32:55,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (2 of 21 remaining) [2023-11-29 02:32:55,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (1 of 21 remaining) [2023-11-29 02:32:55,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (0 of 21 remaining) [2023-11-29 02:32:55,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:32:55,427 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-29 02:32:55,429 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 02:32:55,429 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-29 02:32:55,458 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 02:32:55,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 89 transitions, 188 flow [2023-11-29 02:32:55,498 INFO L124 PetriNetUnfolderBase]: 5/113 cut-off events. [2023-11-29 02:32:55,498 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 02:32:55,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 113 events. 5/113 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 283 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 75. Up to 6 conditions per place. [2023-11-29 02:32:55,500 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 89 transitions, 188 flow [2023-11-29 02:32:55,502 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 89 transitions, 188 flow [2023-11-29 02:32:55,504 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:32:55,505 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;@24def2c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:32:55,505 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-11-29 02:32:55,510 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 02:32:55,511 INFO L124 PetriNetUnfolderBase]: 2/30 cut-off events. [2023-11-29 02:32:55,511 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:32:55,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:32:55,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:32:55,511 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2023-11-29 02:32:55,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:32:55,512 INFO L85 PathProgramCache]: Analyzing trace with hash -661269600, now seen corresponding path program 1 times [2023-11-29 02:32:55,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:32:55,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946613082] [2023-11-29 02:32:55,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:32:55,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:32:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:55,544 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 02:32:55,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:32:55,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946613082] [2023-11-29 02:32:55,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946613082] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:32:55,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:32:55,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:32:55,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287396404] [2023-11-29 02:32:55,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:32:55,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:32:55,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:32:55,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:32:55,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:32:55,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 89 [2023-11-29 02:32:55,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 89 transitions, 188 flow. Second operand has 2 states, 2 states have (on average 64.0) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states 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 02:32:55,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:32:55,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 89 [2023-11-29 02:32:55,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:32:55,607 INFO L124 PetriNetUnfolderBase]: 26/198 cut-off events. [2023-11-29 02:32:55,607 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-29 02:32:55,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 198 events. 26/198 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 756 event pairs, 20 based on Foata normal form. 31/199 useless extension candidates. Maximal degree in co-relation 188. Up to 51 conditions per place. [2023-11-29 02:32:55,610 INFO L140 encePairwiseOnDemand]: 73/89 looper letters, 10 selfloop transitions, 0 changer transitions 0/68 dead transitions. [2023-11-29 02:32:55,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 68 transitions, 166 flow [2023-11-29 02:32:55,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:32:55,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 02:32:55,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 152 transitions. [2023-11-29 02:32:55,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8539325842696629 [2023-11-29 02:32:55,613 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 152 transitions. [2023-11-29 02:32:55,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 152 transitions. [2023-11-29 02:32:55,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:32:55,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 152 transitions. [2023-11-29 02:32:55,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states 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 02:32:55,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states 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 02:32:55,616 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states 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 02:32:55,616 INFO L175 Difference]: Start difference. First operand has 91 places, 89 transitions, 188 flow. Second operand 2 states and 152 transitions. [2023-11-29 02:32:55,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 68 transitions, 166 flow [2023-11-29 02:32:55,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 68 transitions, 166 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 02:32:55,619 INFO L231 Difference]: Finished difference. Result has 72 places, 68 transitions, 146 flow [2023-11-29 02:32:55,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=146, PETRI_PLACES=72, PETRI_TRANSITIONS=68} [2023-11-29 02:32:55,620 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -19 predicate places. [2023-11-29 02:32:55,620 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 68 transitions, 146 flow [2023-11-29 02:32:55,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 64.0) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states 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 02:32:55,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:32:55,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:32:55,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:32:55,621 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2023-11-29 02:32:55,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:32:55,622 INFO L85 PathProgramCache]: Analyzing trace with hash 175088931, now seen corresponding path program 1 times [2023-11-29 02:32:55,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:32:55,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623507355] [2023-11-29 02:32:55,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:32:55,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:32:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:55,667 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 02:32:55,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:32:55,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623507355] [2023-11-29 02:32:55,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623507355] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:32:55,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:32:55,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:32:55,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908298620] [2023-11-29 02:32:55,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:32:55,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:32:55,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:32:55,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:32:55,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:32:55,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 89 [2023-11-29 02:32:55,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 68 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states 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 02:32:55,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:32:55,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 89 [2023-11-29 02:32:55,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:32:55,806 INFO L124 PetriNetUnfolderBase]: 128/487 cut-off events. [2023-11-29 02:32:55,806 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-11-29 02:32:55,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 784 conditions, 487 events. 128/487 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2686 event pairs, 48 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 779. Up to 184 conditions per place. [2023-11-29 02:32:55,812 INFO L140 encePairwiseOnDemand]: 73/89 looper letters, 31 selfloop transitions, 12 changer transitions 0/87 dead transitions. [2023-11-29 02:32:55,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 87 transitions, 275 flow [2023-11-29 02:32:55,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:32:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:32:55,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2023-11-29 02:32:55,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7265917602996255 [2023-11-29 02:32:55,814 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 194 transitions. [2023-11-29 02:32:55,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 194 transitions. [2023-11-29 02:32:55,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:32:55,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 194 transitions. [2023-11-29 02:32:55,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states 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 02:32:55,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states 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 02:32:55,818 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states 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 02:32:55,818 INFO L175 Difference]: Start difference. First operand has 72 places, 68 transitions, 146 flow. Second operand 3 states and 194 transitions. [2023-11-29 02:32:55,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 87 transitions, 275 flow [2023-11-29 02:32:55,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 87 transitions, 275 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 02:32:55,821 INFO L231 Difference]: Finished difference. Result has 76 places, 80 transitions, 250 flow [2023-11-29 02:32:55,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=76, PETRI_TRANSITIONS=80} [2023-11-29 02:32:55,822 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -15 predicate places. [2023-11-29 02:32:55,822 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 80 transitions, 250 flow [2023-11-29 02:32:55,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states 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 02:32:55,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:32:55,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:32:55,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 02:32:55,823 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2023-11-29 02:32:55,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:32:55,824 INFO L85 PathProgramCache]: Analyzing trace with hash 867806860, now seen corresponding path program 1 times [2023-11-29 02:32:55,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:32:55,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146849995] [2023-11-29 02:32:55,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:32:55,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:32:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:55,867 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 02:32:55,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:32:55,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146849995] [2023-11-29 02:32:55,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146849995] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:32:55,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:32:55,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:32:55,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331639350] [2023-11-29 02:32:55,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:32:55,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:32:55,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:32:55,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:32:55,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:32:55,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 89 [2023-11-29 02:32:55,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 80 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states 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 02:32:55,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:32:55,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 89 [2023-11-29 02:32:55,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:32:56,000 INFO L124 PetriNetUnfolderBase]: 164/573 cut-off events. [2023-11-29 02:32:56,000 INFO L125 PetriNetUnfolderBase]: For 222/230 co-relation queries the response was YES. [2023-11-29 02:32:56,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1191 conditions, 573 events. 164/573 cut-off events. For 222/230 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3286 event pairs, 73 based on Foata normal form. 5/517 useless extension candidates. Maximal degree in co-relation 1184. Up to 259 conditions per place. [2023-11-29 02:32:56,006 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 30 selfloop transitions, 10 changer transitions 0/92 dead transitions. [2023-11-29 02:32:56,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 92 transitions, 379 flow [2023-11-29 02:32:56,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:32:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:32:56,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 190 transitions. [2023-11-29 02:32:56,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7116104868913857 [2023-11-29 02:32:56,008 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 190 transitions. [2023-11-29 02:32:56,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 190 transitions. [2023-11-29 02:32:56,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:32:56,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 190 transitions. [2023-11-29 02:32:56,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states 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 02:32:56,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states 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 02:32:56,011 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states 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 02:32:56,011 INFO L175 Difference]: Start difference. First operand has 76 places, 80 transitions, 250 flow. Second operand 3 states and 190 transitions. [2023-11-29 02:32:56,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 92 transitions, 379 flow [2023-11-29 02:32:56,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 92 transitions, 347 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:32:56,018 INFO L231 Difference]: Finished difference. Result has 78 places, 88 transitions, 312 flow [2023-11-29 02:32:56,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=78, PETRI_TRANSITIONS=88} [2023-11-29 02:32:56,019 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -13 predicate places. [2023-11-29 02:32:56,019 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 88 transitions, 312 flow [2023-11-29 02:32:56,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states 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 02:32:56,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:32:56,035 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:32:56,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 02:32:56,035 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2023-11-29 02:32:56,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:32:56,036 INFO L85 PathProgramCache]: Analyzing trace with hash -132699638, now seen corresponding path program 1 times [2023-11-29 02:32:56,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:32:56,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991810811] [2023-11-29 02:32:56,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:32:56,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:32:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:32:56,053 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:32:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:32:56,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:32:56,068 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 02:32:56,069 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 31 remaining) [2023-11-29 02:32:56,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (29 of 31 remaining) [2023-11-29 02:32:56,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (28 of 31 remaining) [2023-11-29 02:32:56,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (27 of 31 remaining) [2023-11-29 02:32:56,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (26 of 31 remaining) [2023-11-29 02:32:56,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (25 of 31 remaining) [2023-11-29 02:32:56,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (24 of 31 remaining) [2023-11-29 02:32:56,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (23 of 31 remaining) [2023-11-29 02:32:56,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (22 of 31 remaining) [2023-11-29 02:32:56,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (21 of 31 remaining) [2023-11-29 02:32:56,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (20 of 31 remaining) [2023-11-29 02:32:56,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (19 of 31 remaining) [2023-11-29 02:32:56,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 31 remaining) [2023-11-29 02:32:56,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (17 of 31 remaining) [2023-11-29 02:32:56,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 31 remaining) [2023-11-29 02:32:56,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (15 of 31 remaining) [2023-11-29 02:32:56,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (14 of 31 remaining) [2023-11-29 02:32:56,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (13 of 31 remaining) [2023-11-29 02:32:56,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (12 of 31 remaining) [2023-11-29 02:32:56,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (11 of 31 remaining) [2023-11-29 02:32:56,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (10 of 31 remaining) [2023-11-29 02:32:56,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 31 remaining) [2023-11-29 02:32:56,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (8 of 31 remaining) [2023-11-29 02:32:56,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 31 remaining) [2023-11-29 02:32:56,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 31 remaining) [2023-11-29 02:32:56,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (5 of 31 remaining) [2023-11-29 02:32:56,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 31 remaining) [2023-11-29 02:32:56,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (3 of 31 remaining) [2023-11-29 02:32:56,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (2 of 31 remaining) [2023-11-29 02:32:56,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (1 of 31 remaining) [2023-11-29 02:32:56,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (0 of 31 remaining) [2023-11-29 02:32:56,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 02:32:56,076 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-29 02:32:56,077 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 02:32:56,077 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-29 02:32:56,112 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 02:32:56,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 121 transitions, 260 flow [2023-11-29 02:32:56,137 INFO L124 PetriNetUnfolderBase]: 7/158 cut-off events. [2023-11-29 02:32:56,137 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-29 02:32:56,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 158 events. 7/158 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 474 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 117. Up to 8 conditions per place. [2023-11-29 02:32:56,138 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 121 transitions, 260 flow [2023-11-29 02:32:56,141 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 121 transitions, 260 flow [2023-11-29 02:32:56,142 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:32:56,143 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;@24def2c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:32:56,143 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-11-29 02:32:56,147 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 02:32:56,148 INFO L124 PetriNetUnfolderBase]: 2/30 cut-off events. [2023-11-29 02:32:56,148 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:32:56,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:32:56,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:32:56,148 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2023-11-29 02:32:56,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:32:56,149 INFO L85 PathProgramCache]: Analyzing trace with hash 697206650, now seen corresponding path program 1 times [2023-11-29 02:32:56,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:32:56,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038534269] [2023-11-29 02:32:56,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:32:56,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:32:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:56,171 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 02:32:56,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:32:56,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038534269] [2023-11-29 02:32:56,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038534269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:32:56,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:32:56,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:32:56,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706883727] [2023-11-29 02:32:56,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:32:56,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:32:56,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:32:56,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:32:56,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:32:56,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 121 [2023-11-29 02:32:56,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 121 transitions, 260 flow. Second operand has 2 states, 2 states have (on average 84.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 0 states 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 02:32:56,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:32:56,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 121 [2023-11-29 02:32:56,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:32:56,315 INFO L124 PetriNetUnfolderBase]: 247/989 cut-off events. [2023-11-29 02:32:56,315 INFO L125 PetriNetUnfolderBase]: For 169/169 co-relation queries the response was YES. [2023-11-29 02:32:56,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1486 conditions, 989 events. 247/989 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 7052 event pairs, 220 based on Foata normal form. 156/990 useless extension candidates. Maximal degree in co-relation 1070. Up to 376 conditions per place. [2023-11-29 02:32:56,323 INFO L140 encePairwiseOnDemand]: 98/121 looper letters, 15 selfloop transitions, 0 changer transitions 0/93 dead transitions. [2023-11-29 02:32:56,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 93 transitions, 234 flow [2023-11-29 02:32:56,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:32:56,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 02:32:56,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 204 transitions. [2023-11-29 02:32:56,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8429752066115702 [2023-11-29 02:32:56,324 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 204 transitions. [2023-11-29 02:32:56,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 204 transitions. [2023-11-29 02:32:56,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:32:56,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 204 transitions. [2023-11-29 02:32:56,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 102.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 0 states 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 02:32:56,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states 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 02:32:56,327 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states 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 02:32:56,327 INFO L175 Difference]: Start difference. First operand has 124 places, 121 transitions, 260 flow. Second operand 2 states and 204 transitions. [2023-11-29 02:32:56,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 93 transitions, 234 flow [2023-11-29 02:32:56,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 93 transitions, 232 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-29 02:32:56,330 INFO L231 Difference]: Finished difference. Result has 98 places, 93 transitions, 202 flow [2023-11-29 02:32:56,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=202, PETRI_PLACES=98, PETRI_TRANSITIONS=93} [2023-11-29 02:32:56,331 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, -26 predicate places. [2023-11-29 02:32:56,331 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 93 transitions, 202 flow [2023-11-29 02:32:56,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 84.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 0 states 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 02:32:56,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:32:56,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:32:56,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 02:32:56,332 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2023-11-29 02:32:56,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:32:56,332 INFO L85 PathProgramCache]: Analyzing trace with hash 711069, now seen corresponding path program 1 times [2023-11-29 02:32:56,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:32:56,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787756842] [2023-11-29 02:32:56,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:32:56,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:32:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:56,362 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 02:32:56,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:32:56,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787756842] [2023-11-29 02:32:56,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787756842] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:32:56,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:32:56,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:32:56,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800570157] [2023-11-29 02:32:56,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:32:56,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:32:56,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:32:56,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:32:56,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:32:56,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 121 [2023-11-29 02:32:56,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 93 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states 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 02:32:56,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:32:56,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 121 [2023-11-29 02:32:56,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:32:57,602 INFO L124 PetriNetUnfolderBase]: 3441/7965 cut-off events. [2023-11-29 02:32:57,603 INFO L125 PetriNetUnfolderBase]: For 442/442 co-relation queries the response was YES. [2023-11-29 02:32:57,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13739 conditions, 7965 events. 3441/7965 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 73537 event pairs, 1354 based on Foata normal form. 0/7037 useless extension candidates. Maximal degree in co-relation 13733. Up to 3764 conditions per place. [2023-11-29 02:32:57,697 INFO L140 encePairwiseOnDemand]: 97/121 looper letters, 47 selfloop transitions, 18 changer transitions 0/122 dead transitions. [2023-11-29 02:32:57,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 122 transitions, 400 flow [2023-11-29 02:32:57,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:32:57,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:32:57,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2023-11-29 02:32:57,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7079889807162535 [2023-11-29 02:32:57,699 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 257 transitions. [2023-11-29 02:32:57,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 257 transitions. [2023-11-29 02:32:57,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:32:57,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 257 transitions. [2023-11-29 02:32:57,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states 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 02:32:57,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states 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 02:32:57,703 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states 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 02:32:57,704 INFO L175 Difference]: Start difference. First operand has 98 places, 93 transitions, 202 flow. Second operand 3 states and 257 transitions. [2023-11-29 02:32:57,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 122 transitions, 400 flow [2023-11-29 02:32:57,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 122 transitions, 400 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 02:32:57,708 INFO L231 Difference]: Finished difference. Result has 102 places, 111 transitions, 358 flow [2023-11-29 02:32:57,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=102, PETRI_TRANSITIONS=111} [2023-11-29 02:32:57,709 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, -22 predicate places. [2023-11-29 02:32:57,709 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 111 transitions, 358 flow [2023-11-29 02:32:57,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states 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 02:32:57,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:32:57,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:32:57,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 02:32:57,710 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2023-11-29 02:32:57,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:32:57,711 INFO L85 PathProgramCache]: Analyzing trace with hash -585476730, now seen corresponding path program 1 times [2023-11-29 02:32:57,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:32:57,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308320887] [2023-11-29 02:32:57,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:32:57,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:32:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:57,751 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 02:32:57,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:32:57,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308320887] [2023-11-29 02:32:57,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308320887] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:32:57,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:32:57,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:32:57,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592101913] [2023-11-29 02:32:57,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:32:57,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:32:57,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:32:57,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:32:57,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:32:57,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 121 [2023-11-29 02:32:57,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 111 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states 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 02:32:57,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:32:57,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 121 [2023-11-29 02:32:57,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:32:59,044 INFO L124 PetriNetUnfolderBase]: 4459/10346 cut-off events. [2023-11-29 02:32:59,044 INFO L125 PetriNetUnfolderBase]: For 4869/5233 co-relation queries the response was YES. [2023-11-29 02:32:59,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23022 conditions, 10346 events. 4459/10346 cut-off events. For 4869/5233 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 99074 event pairs, 2185 based on Foata normal form. 65/9126 useless extension candidates. Maximal degree in co-relation 23014. Up to 5397 conditions per place. [2023-11-29 02:32:59,157 INFO L140 encePairwiseOnDemand]: 109/121 looper letters, 46 selfloop transitions, 20 changer transitions 0/137 dead transitions. [2023-11-29 02:32:59,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 137 transitions, 600 flow [2023-11-29 02:32:59,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:32:59,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:32:59,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2023-11-29 02:32:59,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7079889807162535 [2023-11-29 02:32:59,159 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 257 transitions. [2023-11-29 02:32:59,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 257 transitions. [2023-11-29 02:32:59,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:32:59,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 257 transitions. [2023-11-29 02:32:59,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states 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 02:32:59,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states 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 02:32:59,163 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states 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 02:32:59,163 INFO L175 Difference]: Start difference. First operand has 102 places, 111 transitions, 358 flow. Second operand 3 states and 257 transitions. [2023-11-29 02:32:59,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 137 transitions, 600 flow [2023-11-29 02:32:59,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 137 transitions, 548 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:32:59,194 INFO L231 Difference]: Finished difference. Result has 104 places, 129 transitions, 508 flow [2023-11-29 02:32:59,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=104, PETRI_TRANSITIONS=129} [2023-11-29 02:32:59,195 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, -20 predicate places. [2023-11-29 02:32:59,195 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 129 transitions, 508 flow [2023-11-29 02:32:59,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states 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 02:32:59,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:32:59,196 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] [2023-11-29 02:32:59,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 02:32:59,196 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2023-11-29 02:32:59,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:32:59,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1646743242, now seen corresponding path program 1 times [2023-11-29 02:32:59,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:32:59,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512602489] [2023-11-29 02:32:59,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:32:59,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:32:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:59,240 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 02:32:59,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:32:59,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512602489] [2023-11-29 02:32:59,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512602489] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:32:59,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:32:59,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:32:59,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475119222] [2023-11-29 02:32:59,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:32:59,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:32:59,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:32:59,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:32:59,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:32:59,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 121 [2023-11-29 02:32:59,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 129 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states 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 02:32:59,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:32:59,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 121 [2023-11-29 02:32:59,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:33:00,653 INFO L124 PetriNetUnfolderBase]: 5887/12869 cut-off events. [2023-11-29 02:33:00,653 INFO L125 PetriNetUnfolderBase]: For 10991/11639 co-relation queries the response was YES. [2023-11-29 02:33:00,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31991 conditions, 12869 events. 5887/12869 cut-off events. For 10991/11639 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 122170 event pairs, 2461 based on Foata normal form. 93/11098 useless extension candidates. Maximal degree in co-relation 31982. Up to 6949 conditions per place. [2023-11-29 02:33:00,751 INFO L140 encePairwiseOnDemand]: 109/121 looper letters, 59 selfloop transitions, 28 changer transitions 0/160 dead transitions. [2023-11-29 02:33:00,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 160 transitions, 841 flow [2023-11-29 02:33:00,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:33:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:33:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 256 transitions. [2023-11-29 02:33:00,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7052341597796143 [2023-11-29 02:33:00,753 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 256 transitions. [2023-11-29 02:33:00,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 256 transitions. [2023-11-29 02:33:00,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:33:00,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 256 transitions. [2023-11-29 02:33:00,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states 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 02:33:00,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states 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 02:33:00,756 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states 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 02:33:00,757 INFO L175 Difference]: Start difference. First operand has 104 places, 129 transitions, 508 flow. Second operand 3 states and 256 transitions. [2023-11-29 02:33:00,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 160 transitions, 841 flow [2023-11-29 02:33:00,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 160 transitions, 785 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:33:00,826 INFO L231 Difference]: Finished difference. Result has 106 places, 153 transitions, 754 flow [2023-11-29 02:33:00,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=106, PETRI_TRANSITIONS=153} [2023-11-29 02:33:00,827 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, -18 predicate places. [2023-11-29 02:33:00,827 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 153 transitions, 754 flow [2023-11-29 02:33:00,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states 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 02:33:00,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:33:00,827 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:33:00,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 02:33:00,828 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2023-11-29 02:33:00,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:33:00,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1516770557, now seen corresponding path program 1 times [2023-11-29 02:33:00,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:33:00,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392458210] [2023-11-29 02:33:00,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:33:00,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:33:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:33:00,845 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:33:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:33:00,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:33:00,863 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 02:33:00,863 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 41 remaining) [2023-11-29 02:33:00,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (39 of 41 remaining) [2023-11-29 02:33:00,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (38 of 41 remaining) [2023-11-29 02:33:00,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (37 of 41 remaining) [2023-11-29 02:33:00,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (36 of 41 remaining) [2023-11-29 02:33:00,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (35 of 41 remaining) [2023-11-29 02:33:00,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (34 of 41 remaining) [2023-11-29 02:33:00,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (33 of 41 remaining) [2023-11-29 02:33:00,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (32 of 41 remaining) [2023-11-29 02:33:00,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (31 of 41 remaining) [2023-11-29 02:33:00,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (30 of 41 remaining) [2023-11-29 02:33:00,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (29 of 41 remaining) [2023-11-29 02:33:00,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (28 of 41 remaining) [2023-11-29 02:33:00,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (27 of 41 remaining) [2023-11-29 02:33:00,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (26 of 41 remaining) [2023-11-29 02:33:00,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (25 of 41 remaining) [2023-11-29 02:33:00,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (24 of 41 remaining) [2023-11-29 02:33:00,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (23 of 41 remaining) [2023-11-29 02:33:00,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (22 of 41 remaining) [2023-11-29 02:33:00,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (21 of 41 remaining) [2023-11-29 02:33:00,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (20 of 41 remaining) [2023-11-29 02:33:00,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (19 of 41 remaining) [2023-11-29 02:33:00,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 41 remaining) [2023-11-29 02:33:00,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (17 of 41 remaining) [2023-11-29 02:33:00,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 41 remaining) [2023-11-29 02:33:00,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (15 of 41 remaining) [2023-11-29 02:33:00,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (14 of 41 remaining) [2023-11-29 02:33:00,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (13 of 41 remaining) [2023-11-29 02:33:00,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (12 of 41 remaining) [2023-11-29 02:33:00,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (11 of 41 remaining) [2023-11-29 02:33:00,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (10 of 41 remaining) [2023-11-29 02:33:00,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 41 remaining) [2023-11-29 02:33:00,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (8 of 41 remaining) [2023-11-29 02:33:00,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 41 remaining) [2023-11-29 02:33:00,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 41 remaining) [2023-11-29 02:33:00,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (5 of 41 remaining) [2023-11-29 02:33:00,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 41 remaining) [2023-11-29 02:33:00,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (3 of 41 remaining) [2023-11-29 02:33:00,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (2 of 41 remaining) [2023-11-29 02:33:00,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (1 of 41 remaining) [2023-11-29 02:33:00,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (0 of 41 remaining) [2023-11-29 02:33:00,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 02:33:00,871 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-29 02:33:00,872 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 02:33:00,872 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-29 02:33:00,911 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 02:33:00,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 153 transitions, 334 flow [2023-11-29 02:33:00,947 INFO L124 PetriNetUnfolderBase]: 9/203 cut-off events. [2023-11-29 02:33:00,947 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-29 02:33:00,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 203 events. 9/203 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 651 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 166. Up to 10 conditions per place. [2023-11-29 02:33:00,948 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 153 transitions, 334 flow [2023-11-29 02:33:00,952 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 153 transitions, 334 flow [2023-11-29 02:33:00,953 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:33:00,954 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;@24def2c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:33:00,954 INFO L358 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2023-11-29 02:33:00,957 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 02:33:00,957 INFO L124 PetriNetUnfolderBase]: 2/30 cut-off events. [2023-11-29 02:33:00,957 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:33:00,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:33:00,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:33:00,957 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 02:33:00,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:33:00,958 INFO L85 PathProgramCache]: Analyzing trace with hash -957345869, now seen corresponding path program 1 times [2023-11-29 02:33:00,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:33:00,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748922084] [2023-11-29 02:33:00,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:33:00,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:33:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:00,977 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 02:33:00,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:33:00,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748922084] [2023-11-29 02:33:00,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748922084] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:33:00,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:33:00,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:33:00,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648589811] [2023-11-29 02:33:00,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:33:00,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:33:00,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:33:00,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:33:00,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:33:00,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 153 [2023-11-29 02:33:00,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 153 transitions, 334 flow. Second operand has 2 states, 2 states have (on average 104.0) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states 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 02:33:00,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:33:00,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 153 [2023-11-29 02:33:00,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:33:01,616 INFO L124 PetriNetUnfolderBase]: 1848/5380 cut-off events. [2023-11-29 02:33:01,616 INFO L125 PetriNetUnfolderBase]: For 1422/1422 co-relation queries the response was YES. [2023-11-29 02:33:01,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8628 conditions, 5380 events. 1848/5380 cut-off events. For 1422/1422 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 51653 event pairs, 1720 based on Foata normal form. 781/5387 useless extension candidates. Maximal degree in co-relation 6272. Up to 2501 conditions per place. [2023-11-29 02:33:01,647 INFO L140 encePairwiseOnDemand]: 123/153 looper letters, 20 selfloop transitions, 0 changer transitions 0/118 dead transitions. [2023-11-29 02:33:01,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 118 transitions, 304 flow [2023-11-29 02:33:01,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:33:01,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 02:33:01,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 256 transitions. [2023-11-29 02:33:01,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8366013071895425 [2023-11-29 02:33:01,649 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 256 transitions. [2023-11-29 02:33:01,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 256 transitions. [2023-11-29 02:33:01,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:33:01,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 256 transitions. [2023-11-29 02:33:01,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 128.0) internal successors, (256), 2 states have internal predecessors, (256), 0 states have call successors, (0), 0 states 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 02:33:01,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states 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 02:33:01,651 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states 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 02:33:01,651 INFO L175 Difference]: Start difference. First operand has 157 places, 153 transitions, 334 flow. Second operand 2 states and 256 transitions. [2023-11-29 02:33:01,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 118 transitions, 304 flow [2023-11-29 02:33:01,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 118 transitions, 298 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-29 02:33:01,653 INFO L231 Difference]: Finished difference. Result has 124 places, 118 transitions, 258 flow [2023-11-29 02:33:01,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=258, PETRI_PLACES=124, PETRI_TRANSITIONS=118} [2023-11-29 02:33:01,653 INFO L281 CegarLoopForPetriNet]: 157 programPoint places, -33 predicate places. [2023-11-29 02:33:01,654 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 118 transitions, 258 flow [2023-11-29 02:33:01,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 104.0) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states 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 02:33:01,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:33:01,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:33:01,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 02:33:01,654 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 02:33:01,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:33:01,654 INFO L85 PathProgramCache]: Analyzing trace with hash -886354282, now seen corresponding path program 1 times [2023-11-29 02:33:01,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:33:01,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139787254] [2023-11-29 02:33:01,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:33:01,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:33:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:01,680 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 02:33:01,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:33:01,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139787254] [2023-11-29 02:33:01,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139787254] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:33:01,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:33:01,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:33:01,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503068401] [2023-11-29 02:33:01,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:33:01,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:33:01,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:33:01,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:33:01,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:33:01,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 153 [2023-11-29 02:33:01,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 118 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states 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 02:33:01,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:33:01,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 153 [2023-11-29 02:33:01,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:33:13,199 INFO L124 PetriNetUnfolderBase]: 69719/128084 cut-off events. [2023-11-29 02:33:13,199 INFO L125 PetriNetUnfolderBase]: For 6259/6259 co-relation queries the response was YES. [2023-11-29 02:33:13,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230019 conditions, 128084 events. 69719/128084 cut-off events. For 6259/6259 co-relation queries the response was YES. Maximal size of possible extension queue 4977. Compared 1422997 event pairs, 26548 based on Foata normal form. 0/113759 useless extension candidates. Maximal degree in co-relation 230012. Up to 66562 conditions per place. [2023-11-29 02:33:14,225 INFO L140 encePairwiseOnDemand]: 121/153 looper letters, 63 selfloop transitions, 24 changer transitions 0/157 dead transitions. [2023-11-29 02:33:14,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 157 transitions, 525 flow [2023-11-29 02:33:14,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:33:14,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:33:14,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2023-11-29 02:33:14,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6971677559912854 [2023-11-29 02:33:14,228 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2023-11-29 02:33:14,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2023-11-29 02:33:14,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:33:14,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2023-11-29 02:33:14,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states 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 02:33:14,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states 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 02:33:14,231 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states 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 02:33:14,231 INFO L175 Difference]: Start difference. First operand has 124 places, 118 transitions, 258 flow. Second operand 3 states and 320 transitions. [2023-11-29 02:33:14,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 157 transitions, 525 flow [2023-11-29 02:33:14,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 157 transitions, 525 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 02:33:14,239 INFO L231 Difference]: Finished difference. Result has 128 places, 142 transitions, 466 flow [2023-11-29 02:33:14,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=128, PETRI_TRANSITIONS=142} [2023-11-29 02:33:14,240 INFO L281 CegarLoopForPetriNet]: 157 programPoint places, -29 predicate places. [2023-11-29 02:33:14,240 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 142 transitions, 466 flow [2023-11-29 02:33:14,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states 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 02:33:14,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:33:14,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:33:14,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 02:33:14,241 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 02:33:14,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:33:14,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1260610177, now seen corresponding path program 1 times [2023-11-29 02:33:14,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:33:14,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062674580] [2023-11-29 02:33:14,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:33:14,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:33:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:14,273 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 02:33:14,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:33:14,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062674580] [2023-11-29 02:33:14,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062674580] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:33:14,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:33:14,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:33:14,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372978098] [2023-11-29 02:33:14,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:33:14,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:33:14,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:33:14,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:33:14,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:33:14,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 153 [2023-11-29 02:33:14,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 142 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:33:14,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:33:14,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 153 [2023-11-29 02:33:14,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:33:31,512 INFO L124 PetriNetUnfolderBase]: 88759/169991 cut-off events. [2023-11-29 02:33:31,512 INFO L125 PetriNetUnfolderBase]: For 89428/95146 co-relation queries the response was YES. [2023-11-29 02:33:32,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396519 conditions, 169991 events. 88759/169991 cut-off events. For 89428/95146 co-relation queries the response was YES. Maximal size of possible extension queue 6347. Compared 2027048 event pairs, 45072 based on Foata normal form. 749/148527 useless extension candidates. Maximal degree in co-relation 396510. Up to 95746 conditions per place. [2023-11-29 02:33:33,058 INFO L140 encePairwiseOnDemand]: 137/153 looper letters, 62 selfloop transitions, 28 changer transitions 0/180 dead transitions. [2023-11-29 02:33:33,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 180 transitions, 809 flow [2023-11-29 02:33:33,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:33:33,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:33:33,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-11-29 02:33:33,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2023-11-29 02:33:33,060 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-11-29 02:33:33,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-11-29 02:33:33,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:33:33,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-11-29 02:33:33,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:33:33,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states 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 02:33:33,062 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states 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 02:33:33,062 INFO L175 Difference]: Start difference. First operand has 128 places, 142 transitions, 466 flow. Second operand 3 states and 324 transitions. [2023-11-29 02:33:33,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 180 transitions, 809 flow [2023-11-29 02:33:33,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 180 transitions, 737 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:33:33,533 INFO L231 Difference]: Finished difference. Result has 130 places, 168 transitions, 684 flow [2023-11-29 02:33:33,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=130, PETRI_TRANSITIONS=168} [2023-11-29 02:33:33,534 INFO L281 CegarLoopForPetriNet]: 157 programPoint places, -27 predicate places. [2023-11-29 02:33:33,534 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 168 transitions, 684 flow [2023-11-29 02:33:33,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:33:33,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:33:33,534 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] [2023-11-29 02:33:33,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 02:33:33,534 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 02:33:33,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:33:33,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1160340279, now seen corresponding path program 1 times [2023-11-29 02:33:33,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:33:33,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3710101] [2023-11-29 02:33:33,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:33:33,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:33:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:33,569 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 02:33:33,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:33:33,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3710101] [2023-11-29 02:33:33,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3710101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:33:33,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:33:33,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:33:33,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265633491] [2023-11-29 02:33:33,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:33:33,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:33:33,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:33:33,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:33:33,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:33:33,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 153 [2023-11-29 02:33:33,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 168 transitions, 684 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states 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 02:33:33,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:33:33,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 153 [2023-11-29 02:33:33,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:33:42,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L717-1-->L718: Formula: (= |v_#race~value~0_1| 0) InVars {} OutVars{#race~value~0=|v_#race~value~0_1|} AuxVars[] AssignedVars[#race~value~0][74], [114#L718true, Black: 163#true, 91#L722-2true, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 119#L724true, 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, 11#L719-1true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:42,003 INFO L294 olderBase$Statistics]: this new event has 70 ancestors and is cut-off event [2023-11-29 02:33:42,003 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2023-11-29 02:33:42,003 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2023-11-29 02:33:42,003 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2023-11-29 02:33:45,137 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([690] L723-2-->L723-3: Formula: (= |v_thr1Thread4of4ForFork0_#t~nondet6#1_3| |v_#race~value~0_7|) InVars {thr1Thread4of4ForFork0_#t~nondet6#1=|v_thr1Thread4of4ForFork0_#t~nondet6#1_3|} OutVars{thr1Thread4of4ForFork0_#t~nondet6#1=|v_thr1Thread4of4ForFork0_#t~nondet6#1_3|, #race~value~0=|v_#race~value~0_7|} AuxVars[] AssignedVars[#race~value~0][195], [110#L719-1true, Black: 165#(= |#race~value~0| 0), Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 52#L723-4true, 101#L719-1true, 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, 64#L723-3true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:45,137 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-29 02:33:45,137 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 02:33:45,137 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 02:33:45,137 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 02:33:47,071 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L724-1-->L727: Formula: (and (< (mod |v_thr1Thread2of4ForFork0_~v~0#1_7| 4294967296) (mod v_~value~0_17 4294967296)) (= |v_#race~value~0_19| 0) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|)) InVars {thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|} OutVars{thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2|, #race~value~0=|v_#race~value~0_19|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][200], [Black: 163#true, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 52#L723-4true, 150#L727true, 143#L718-1true, 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, 129#L718-1true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:47,071 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-29 02:33:47,072 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 02:33:47,072 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 02:33:47,072 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 02:33:48,053 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L722-->L722-1: Formula: (= |v_#race~value~0_4| 0) InVars {} OutVars{#race~value~0=|v_#race~value~0_4|} AuxVars[] AssignedVars[#race~value~0][147], [8#L724-1true, Black: 163#true, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 52#L723-4true, 125#L722-1true, 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, 129#L718-1true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:48,053 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-29 02:33:48,053 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-29 02:33:48,053 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-29 02:33:48,053 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-29 02:33:48,054 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([682] L722-->L722-1: Formula: (= |v_#race~value~0_4| 0) InVars {} OutVars{#race~value~0=|v_#race~value~0_4|} AuxVars[] AssignedVars[#race~value~0][182], [8#L724-1true, 37#L722-1true, Black: 163#true, 52#L723-4true, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 143#L718-1true, 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:48,055 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-29 02:33:48,055 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-29 02:33:48,055 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-29 02:33:48,055 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-29 02:33:48,213 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L724-1-->L727: Formula: (and (< (mod |v_thr1Thread2of4ForFork0_~v~0#1_7| 4294967296) (mod v_~value~0_17 4294967296)) (= |v_#race~value~0_19| 0) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|)) InVars {thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|} OutVars{thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2|, #race~value~0=|v_#race~value~0_19|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][119], [Black: 163#true, 105#thr1Err6ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 150#L727true, 143#L718-1true, 39#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 175#true, 160#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:48,213 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-29 02:33:48,213 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 02:33:48,213 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 02:33:48,213 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 02:33:48,248 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([752] L723-2-->L723-3: Formula: (= |v_#race~value~0_7| |v_thr1Thread2of4ForFork0_#t~nondet6#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet6#1=|v_thr1Thread2of4ForFork0_#t~nondet6#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet6#1=|v_thr1Thread2of4ForFork0_#t~nondet6#1_3|, #race~value~0=|v_#race~value~0_7|} AuxVars[] AssignedVars[#race~value~0][140], [72#L722-2true, Black: 165#(= |#race~value~0| 0), 54#L723-3true, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 52#L723-4true, 177#(= |#race~value~0| |thr1Thread2of4ForFork0_#t~nondet6#1|), 101#L719-1true, 160#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:48,248 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-29 02:33:48,249 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-29 02:33:48,249 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-29 02:33:48,249 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-29 02:33:49,067 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L724-1-->L727: Formula: (and (< (mod |v_thr1Thread2of4ForFork0_~v~0#1_7| 4294967296) (mod v_~value~0_17 4294967296)) (= |v_#race~value~0_19| 0) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|)) InVars {thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|} OutVars{thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2|, #race~value~0=|v_#race~value~0_19|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][119], [44#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, Black: 163#true, 105#thr1Err6ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 150#L727true, 160#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 175#true, 169#true, thr1Thread2of4ForFork0InUse, 129#L718-1true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:49,068 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is not cut-off event [2023-11-29 02:33:49,068 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is not cut-off event [2023-11-29 02:33:49,068 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is not cut-off event [2023-11-29 02:33:49,068 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is not cut-off event [2023-11-29 02:33:49,302 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([690] L723-2-->L723-3: Formula: (= |v_thr1Thread4of4ForFork0_#t~nondet6#1_3| |v_#race~value~0_7|) InVars {thr1Thread4of4ForFork0_#t~nondet6#1=|v_thr1Thread4of4ForFork0_#t~nondet6#1_3|} OutVars{thr1Thread4of4ForFork0_#t~nondet6#1=|v_thr1Thread4of4ForFork0_#t~nondet6#1_3|, #race~value~0=|v_#race~value~0_7|} AuxVars[] AssignedVars[#race~value~0][195], [Black: 165#(= |#race~value~0| 0), 52#L723-4true, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 101#L719-1true, 160#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 175#true, 128#L723-2true, 169#true, thr1Thread2of4ForFork0InUse, 64#L723-3true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:49,302 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-11-29 02:33:49,302 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-29 02:33:49,302 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-29 02:33:49,302 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-29 02:33:50,131 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L724-1-->L727: Formula: (and (< (mod |v_thr1Thread2of4ForFork0_~v~0#1_7| 4294967296) (mod v_~value~0_17 4294967296)) (= |v_#race~value~0_19| 0) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|)) InVars {thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|} OutVars{thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2|, #race~value~0=|v_#race~value~0_19|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][200], [Black: 163#true, 52#L723-4true, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 150#L727true, 160#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 175#true, 169#true, thr1Thread2of4ForFork0InUse, 93#L722-2true, 129#L718-1true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:50,131 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-11-29 02:33:50,131 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-11-29 02:33:50,131 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-11-29 02:33:50,131 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-11-29 02:33:50,145 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L722-->L722-1: Formula: (= |v_#race~value~0_4| 0) InVars {} OutVars{#race~value~0=|v_#race~value~0_4|} AuxVars[] AssignedVars[#race~value~0][71], [8#L724-1true, Black: 163#true, 105#thr1Err6ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 125#L722-1true, 39#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:50,145 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is not cut-off event [2023-11-29 02:33:50,145 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is not cut-off event [2023-11-29 02:33:50,145 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is not cut-off event [2023-11-29 02:33:50,146 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is not cut-off event [2023-11-29 02:33:50,160 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L724-1-->L727: Formula: (and (< (mod |v_thr1Thread2of4ForFork0_~v~0#1_7| 4294967296) (mod v_~value~0_17 4294967296)) (= |v_#race~value~0_19| 0) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|)) InVars {thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|} OutVars{thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2|, #race~value~0=|v_#race~value~0_19|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][200], [72#L722-2true, Black: 163#true, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 52#L723-4true, 150#L727true, 143#L718-1true, 175#true, 160#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:50,160 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-11-29 02:33:50,161 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-11-29 02:33:50,161 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-11-29 02:33:50,161 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-11-29 02:33:50,169 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([682] L722-->L722-1: Formula: (= |v_#race~value~0_4| 0) InVars {} OutVars{#race~value~0=|v_#race~value~0_4|} AuxVars[] AssignedVars[#race~value~0][122], [8#L724-1true, 37#L722-1true, 44#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, Black: 163#true, 105#thr1Err6ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:50,169 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is not cut-off event [2023-11-29 02:33:50,169 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is not cut-off event [2023-11-29 02:33:50,169 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is not cut-off event [2023-11-29 02:33:50,169 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is not cut-off event [2023-11-29 02:33:51,090 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([682] L722-->L722-1: Formula: (= |v_#race~value~0_4| 0) InVars {} OutVars{#race~value~0=|v_#race~value~0_4|} AuxVars[] AssignedVars[#race~value~0][182], [8#L724-1true, 37#L722-1true, Black: 163#true, 52#L723-4true, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 160#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 175#true, 169#true, thr1Thread2of4ForFork0InUse, 93#L722-2true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:51,091 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-11-29 02:33:51,091 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-29 02:33:51,091 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-29 02:33:51,091 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-29 02:33:51,103 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L724-1-->L727: Formula: (and (< (mod |v_thr1Thread2of4ForFork0_~v~0#1_7| 4294967296) (mod v_~value~0_17 4294967296)) (= |v_#race~value~0_19| 0) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|)) InVars {thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|} OutVars{thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2|, #race~value~0=|v_#race~value~0_19|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][119], [Black: 163#true, 105#thr1Err6ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 150#L727true, 39#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, 93#L722-2true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:51,103 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-11-29 02:33:51,103 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-11-29 02:33:51,103 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-11-29 02:33:51,103 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-11-29 02:33:51,108 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L722-->L722-1: Formula: (= |v_#race~value~0_4| 0) InVars {} OutVars{#race~value~0=|v_#race~value~0_4|} AuxVars[] AssignedVars[#race~value~0][147], [72#L722-2true, 8#L724-1true, Black: 163#true, 52#L723-4true, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 125#L722-1true, 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:51,108 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-11-29 02:33:51,108 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-29 02:33:51,108 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-29 02:33:51,108 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-29 02:33:51,244 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L724-1-->L727: Formula: (and (< (mod |v_thr1Thread2of4ForFork0_~v~0#1_7| 4294967296) (mod v_~value~0_17 4294967296)) (= |v_#race~value~0_19| 0) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|)) InVars {thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|} OutVars{thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2|, #race~value~0=|v_#race~value~0_19|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][119], [Black: 163#true, 105#thr1Err6ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 150#L727true, 116#thr1Err5ASSERT_VIOLATIONDATA_RACEtrue, 143#L718-1true, 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:51,245 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-11-29 02:33:51,245 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-11-29 02:33:51,245 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-11-29 02:33:51,245 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-11-29 02:33:51,931 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L724-1-->L727: Formula: (and (< (mod |v_thr1Thread2of4ForFork0_~v~0#1_7| 4294967296) (mod v_~value~0_17 4294967296)) (= |v_#race~value~0_19| 0) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|)) InVars {thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|} OutVars{thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2|, #race~value~0=|v_#race~value~0_19|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][200], [Black: 163#true, 52#L723-4true, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 150#L727true, 160#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 175#true, 169#true, 11#L719-1true, thr1Thread2of4ForFork0InUse, 93#L722-2true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:51,931 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-11-29 02:33:51,931 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-29 02:33:51,931 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-29 02:33:51,931 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-29 02:33:51,936 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L724-1-->L727: Formula: (and (< (mod |v_thr1Thread2of4ForFork0_~v~0#1_7| 4294967296) (mod v_~value~0_17 4294967296)) (= |v_#race~value~0_19| 0) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|)) InVars {thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|} OutVars{thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2|, #race~value~0=|v_#race~value~0_19|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][119], [Black: 163#true, 47#thr1Err5ASSERT_VIOLATIONDATA_RACEtrue, 105#thr1Err6ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 150#L727true, 175#true, 160#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, 129#L718-1true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:51,936 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is not cut-off event [2023-11-29 02:33:51,936 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is not cut-off event [2023-11-29 02:33:51,936 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is not cut-off event [2023-11-29 02:33:51,936 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is not cut-off event [2023-11-29 02:33:51,968 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L724-1-->L727: Formula: (and (< (mod |v_thr1Thread2of4ForFork0_~v~0#1_7| 4294967296) (mod v_~value~0_17 4294967296)) (= |v_#race~value~0_19| 0) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|)) InVars {thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|} OutVars{thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2|, #race~value~0=|v_#race~value~0_19|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][119], [72#L722-2true, 44#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, Black: 163#true, 105#thr1Err6ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 150#L727true, 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:51,968 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is not cut-off event [2023-11-29 02:33:51,968 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is not cut-off event [2023-11-29 02:33:51,968 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is not cut-off event [2023-11-29 02:33:51,968 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is not cut-off event [2023-11-29 02:33:52,085 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([659] L723-2-->L723-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet6#1_3| |v_#race~value~0_7|) InVars {thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_3|} OutVars{thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_3|, #race~value~0=|v_#race~value~0_7|} AuxVars[] AssignedVars[#race~value~0][208], [99#L723-3true, Black: 165#(= |#race~value~0| 0), 52#L723-4true, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 160#true, 67#L723-4true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, 11#L719-1true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:52,085 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2023-11-29 02:33:52,085 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:33:52,085 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:33:52,085 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:33:52,086 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([659] L723-2-->L723-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet6#1_3| |v_#race~value~0_7|) InVars {thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_3|} OutVars{thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_3|, #race~value~0=|v_#race~value~0_7|} AuxVars[] AssignedVars[#race~value~0][208], [99#L723-3true, Black: 165#(= |#race~value~0| 0), 52#L723-4true, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 67#L723-4true, 169#true, thr1Thread2of4ForFork0InUse, 11#L719-1true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:52,086 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2023-11-29 02:33:52,086 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:33:52,086 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:33:52,086 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:33:52,087 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:33:52,535 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([659] L723-2-->L723-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet6#1_3| |v_#race~value~0_7|) InVars {thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_3|} OutVars{thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_3|, #race~value~0=|v_#race~value~0_7|} AuxVars[] AssignedVars[#race~value~0][175], [8#L724-1true, 99#L723-3true, Black: 165#(= |#race~value~0| 0), 52#L723-4true, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, 11#L719-1true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:52,535 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2023-11-29 02:33:52,535 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-29 02:33:52,535 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-29 02:33:52,536 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-29 02:33:52,536 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([659] L723-2-->L723-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet6#1_3| |v_#race~value~0_7|) InVars {thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_3|} OutVars{thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_3|, #race~value~0=|v_#race~value~0_7|} AuxVars[] AssignedVars[#race~value~0][175], [8#L724-1true, 99#L723-3true, Black: 165#(= |#race~value~0| 0), Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 52#L723-4true, 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, 129#L718-1true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:52,536 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2023-11-29 02:33:52,536 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:33:52,536 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:33:52,536 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:33:52,541 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L724-1-->L727: Formula: (and (< (mod |v_thr1Thread2of4ForFork0_~v~0#1_7| 4294967296) (mod v_~value~0_17 4294967296)) (= |v_#race~value~0_19| 0) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|)) InVars {thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|} OutVars{thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2|, #race~value~0=|v_#race~value~0_19|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][200], [72#L722-2true, Black: 163#true, 52#L723-4true, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 150#L727true, 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, 93#L722-2true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:52,541 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2023-11-29 02:33:52,541 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:33:52,541 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:33:52,541 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:33:52,546 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([682] L722-->L722-1: Formula: (= |v_#race~value~0_4| 0) InVars {} OutVars{#race~value~0=|v_#race~value~0_4|} AuxVars[] AssignedVars[#race~value~0][122], [8#L724-1true, 37#L722-1true, Black: 163#true, 47#thr1Err5ASSERT_VIOLATIONDATA_RACEtrue, 105#thr1Err6ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 175#true, 160#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:52,546 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is not cut-off event [2023-11-29 02:33:52,546 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is not cut-off event [2023-11-29 02:33:52,546 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is not cut-off event [2023-11-29 02:33:52,546 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is not cut-off event [2023-11-29 02:33:52,552 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L722-->L722-1: Formula: (= |v_#race~value~0_4| 0) InVars {} OutVars{#race~value~0=|v_#race~value~0_4|} AuxVars[] AssignedVars[#race~value~0][71], [8#L724-1true, Black: 163#true, 105#thr1Err6ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 125#L722-1true, 116#thr1Err5ASSERT_VIOLATIONDATA_RACEtrue, 175#true, 160#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:52,552 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is not cut-off event [2023-11-29 02:33:52,552 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is not cut-off event [2023-11-29 02:33:52,552 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is not cut-off event [2023-11-29 02:33:52,552 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is not cut-off event [2023-11-29 02:33:52,564 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([690] L723-2-->L723-3: Formula: (= |v_thr1Thread4of4ForFork0_#t~nondet6#1_3| |v_#race~value~0_7|) InVars {thr1Thread4of4ForFork0_#t~nondet6#1=|v_thr1Thread4of4ForFork0_#t~nondet6#1_3|} OutVars{thr1Thread4of4ForFork0_#t~nondet6#1=|v_thr1Thread4of4ForFork0_#t~nondet6#1_3|, #race~value~0=|v_#race~value~0_7|} AuxVars[] AssignedVars[#race~value~0][195], [8#L724-1true, Black: 165#(= |#race~value~0| 0), Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 52#L723-4true, 143#L718-1true, 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, 64#L723-3true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:52,565 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2023-11-29 02:33:52,565 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:33:52,565 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:33:52,565 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:33:53,280 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([659] L723-2-->L723-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet6#1_3| |v_#race~value~0_7|) InVars {thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_3|} OutVars{thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_3|, #race~value~0=|v_#race~value~0_7|} AuxVars[] AssignedVars[#race~value~0][103], [8#L724-1true, 99#L723-3true, Black: 165#(= |#race~value~0| 0), 105#thr1Err6ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 39#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:53,280 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2023-11-29 02:33:53,280 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:33:53,280 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:33:53,280 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:33:53,281 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L724-1-->L727: Formula: (and (< (mod |v_thr1Thread2of4ForFork0_~v~0#1_7| 4294967296) (mod v_~value~0_17 4294967296)) (= |v_#race~value~0_19| 0) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|)) InVars {thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|} OutVars{thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2|, #race~value~0=|v_#race~value~0_19|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][119], [Black: 163#true, 105#thr1Err6ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 150#L727true, 116#thr1Err5ASSERT_VIOLATIONDATA_RACEtrue, 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, 93#L722-2true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:53,281 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2023-11-29 02:33:53,281 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:33:53,281 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:33:53,281 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:33:53,311 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([690] L723-2-->L723-3: Formula: (= |v_thr1Thread4of4ForFork0_#t~nondet6#1_3| |v_#race~value~0_7|) InVars {thr1Thread4of4ForFork0_#t~nondet6#1=|v_thr1Thread4of4ForFork0_#t~nondet6#1_3|} OutVars{thr1Thread4of4ForFork0_#t~nondet6#1=|v_thr1Thread4of4ForFork0_#t~nondet6#1_3|, #race~value~0=|v_#race~value~0_7|} AuxVars[] AssignedVars[#race~value~0][146], [8#L724-1true, 44#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, Black: 165#(= |#race~value~0| 0), 105#thr1Err6ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, 64#L723-3true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:53,311 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2023-11-29 02:33:53,311 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:33:53,311 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:33:53,311 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:33:53,745 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L724-1-->L727: Formula: (and (< (mod |v_thr1Thread2of4ForFork0_~v~0#1_7| 4294967296) (mod v_~value~0_17 4294967296)) (= |v_#race~value~0_19| 0) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|)) InVars {thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|} OutVars{thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2|, #race~value~0=|v_#race~value~0_19|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][119], [72#L722-2true, Black: 163#true, 47#thr1Err5ASSERT_VIOLATIONDATA_RACEtrue, 105#thr1Err6ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 150#L727true, 160#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 175#true, 169#true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:53,745 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is not cut-off event [2023-11-29 02:33:53,745 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2023-11-29 02:33:53,745 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2023-11-29 02:33:53,745 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2023-11-29 02:33:54,267 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L724-1-->L727: Formula: (and (< (mod |v_thr1Thread2of4ForFork0_~v~0#1_7| 4294967296) (mod v_~value~0_17 4294967296)) (= |v_#race~value~0_19| 0) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|)) InVars {thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|} OutVars{thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2|, #race~value~0=|v_#race~value~0_19|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][165], [99#L723-3true, Black: 163#true, 52#L723-4true, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 150#L727true, 39#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:54,267 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is not cut-off event [2023-11-29 02:33:54,267 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is not cut-off event [2023-11-29 02:33:54,267 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is not cut-off event [2023-11-29 02:33:54,267 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is not cut-off event [2023-11-29 02:33:54,315 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([659] L723-2-->L723-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet6#1_3| |v_#race~value~0_7|) InVars {thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_3|} OutVars{thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_3|, #race~value~0=|v_#race~value~0_7|} AuxVars[] AssignedVars[#race~value~0][175], [72#L722-2true, 8#L724-1true, 99#L723-3true, Black: 165#(= |#race~value~0| 0), 52#L723-4true, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:54,315 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2023-11-29 02:33:54,315 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 02:33:54,315 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 02:33:54,315 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 02:33:54,319 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([690] L723-2-->L723-3: Formula: (= |v_thr1Thread4of4ForFork0_#t~nondet6#1_3| |v_#race~value~0_7|) InVars {thr1Thread4of4ForFork0_#t~nondet6#1=|v_thr1Thread4of4ForFork0_#t~nondet6#1_3|} OutVars{thr1Thread4of4ForFork0_#t~nondet6#1=|v_thr1Thread4of4ForFork0_#t~nondet6#1_3|, #race~value~0=|v_#race~value~0_7|} AuxVars[] AssignedVars[#race~value~0][195], [8#L724-1true, Black: 165#(= |#race~value~0| 0), 52#L723-4true, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 160#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 175#true, 169#true, thr1Thread2of4ForFork0InUse, 64#L723-3true, 93#L722-2true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:54,319 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2023-11-29 02:33:54,319 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 02:33:54,319 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 02:33:54,319 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 02:33:54,684 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([690] L723-2-->L723-3: Formula: (= |v_thr1Thread4of4ForFork0_#t~nondet6#1_3| |v_#race~value~0_7|) InVars {thr1Thread4of4ForFork0_#t~nondet6#1=|v_thr1Thread4of4ForFork0_#t~nondet6#1_3|} OutVars{thr1Thread4of4ForFork0_#t~nondet6#1=|v_thr1Thread4of4ForFork0_#t~nondet6#1_3|, #race~value~0=|v_#race~value~0_7|} AuxVars[] AssignedVars[#race~value~0][146], [8#L724-1true, Black: 165#(= |#race~value~0| 0), 47#thr1Err5ASSERT_VIOLATIONDATA_RACEtrue, 105#thr1Err6ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, 64#L723-3true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:54,685 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2023-11-29 02:33:54,685 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 02:33:54,685 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 02:33:54,685 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 02:33:54,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([659] L723-2-->L723-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet6#1_3| |v_#race~value~0_7|) InVars {thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_3|} OutVars{thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_3|, #race~value~0=|v_#race~value~0_7|} AuxVars[] AssignedVars[#race~value~0][103], [8#L724-1true, 99#L723-3true, Black: 165#(= |#race~value~0| 0), 105#thr1Err6ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 116#thr1Err5ASSERT_VIOLATIONDATA_RACEtrue, 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:54,687 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2023-11-29 02:33:54,687 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 02:33:54,687 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 02:33:54,687 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 02:33:54,957 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([667] L724-1-->L727: Formula: (and (< (mod |v_thr1Thread3of4ForFork0_~v~0#1_7| 4294967296) (mod v_~value~0_17 4294967296)) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_1|) (= |v_#race~value~0_19| 0) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_1|)) InVars {thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_1|, ~value~0=v_~value~0_17, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_1|} OutVars{thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_2|, ~value~0=v_~value~0_17, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_2|, #race~value~0=|v_#race~value~0_19|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][191], [8#L724-1true, Black: 163#true, 52#L723-4true, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 39#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 160#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 175#true, 169#true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 92#L727true, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:54,957 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-11-29 02:33:54,957 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-29 02:33:54,957 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-29 02:33:54,957 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-29 02:33:55,466 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L724-1-->L727: Formula: (and (< (mod |v_thr1Thread2of4ForFork0_~v~0#1_7| 4294967296) (mod v_~value~0_17 4294967296)) (= |v_#race~value~0_19| 0) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|)) InVars {thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|} OutVars{thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2|, #race~value~0=|v_#race~value~0_19|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][165], [99#L723-3true, Black: 163#true, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 52#L723-4true, 150#L727true, 116#thr1Err5ASSERT_VIOLATIONDATA_RACEtrue, 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:55,466 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is not cut-off event [2023-11-29 02:33:55,466 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2023-11-29 02:33:55,466 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2023-11-29 02:33:55,466 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2023-11-29 02:33:55,469 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L724-1-->L727: Formula: (and (< (mod |v_thr1Thread2of4ForFork0_~v~0#1_7| 4294967296) (mod v_~value~0_17 4294967296)) (= |v_#race~value~0_19| 0) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|)) InVars {thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|} OutVars{thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2|, #race~value~0=|v_#race~value~0_19|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][165], [120#L724-1true, Black: 163#true, 52#L723-4true, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 150#L727true, 39#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:55,469 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is not cut-off event [2023-11-29 02:33:55,469 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2023-11-29 02:33:55,469 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2023-11-29 02:33:55,469 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2023-11-29 02:33:55,523 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L724-1-->L727: Formula: (and (< (mod |v_thr1Thread2of4ForFork0_~v~0#1_7| 4294967296) (mod v_~value~0_17 4294967296)) (= |v_#race~value~0_19| 0) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|)) InVars {thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|} OutVars{thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2|, #race~value~0=|v_#race~value~0_19|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][200], [Black: 163#true, 52#L723-4true, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 150#L727true, 143#L718-1true, 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, 82#L727true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:55,523 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-11-29 02:33:55,523 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 02:33:55,524 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 02:33:55,524 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 02:33:55,528 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([651] L722-->L722-1: Formula: (= |v_#race~value~0_4| 0) InVars {} OutVars{#race~value~0=|v_#race~value~0_4|} AuxVars[] AssignedVars[#race~value~0][147], [8#L724-1true, Black: 163#true, 52#L723-4true, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 125#L722-1true, 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, 82#L727true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:55,528 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2023-11-29 02:33:55,528 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-29 02:33:55,528 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-29 02:33:55,528 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-29 02:33:56,077 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([667] L724-1-->L727: Formula: (and (< (mod |v_thr1Thread3of4ForFork0_~v~0#1_7| 4294967296) (mod v_~value~0_17 4294967296)) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_1|) (= |v_#race~value~0_19| 0) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_1|)) InVars {thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_1|, ~value~0=v_~value~0_17, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_1|} OutVars{thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_2|, ~value~0=v_~value~0_17, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_2|, #race~value~0=|v_#race~value~0_19|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][191], [8#L724-1true, Black: 163#true, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 52#L723-4true, 116#thr1Err5ASSERT_VIOLATIONDATA_RACEtrue, 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 92#L727true, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:56,077 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-29 02:33:56,077 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 02:33:56,077 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 02:33:56,077 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 02:33:56,261 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L724-1-->L727: Formula: (and (< (mod |v_thr1Thread2of4ForFork0_~v~0#1_7| 4294967296) (mod v_~value~0_17 4294967296)) (= |v_#race~value~0_19| 0) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|)) InVars {thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|} OutVars{thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2|, #race~value~0=|v_#race~value~0_19|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][165], [120#L724-1true, Black: 163#true, 52#L723-4true, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 150#L727true, 116#thr1Err5ASSERT_VIOLATIONDATA_RACEtrue, 160#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 175#true, 169#true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:56,261 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is not cut-off event [2023-11-29 02:33:56,261 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is not cut-off event [2023-11-29 02:33:56,262 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is not cut-off event [2023-11-29 02:33:56,262 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is not cut-off event [2023-11-29 02:33:56,278 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L724-1-->L727: Formula: (and (< (mod |v_thr1Thread2of4ForFork0_~v~0#1_7| 4294967296) (mod v_~value~0_17 4294967296)) (= |v_#race~value~0_19| 0) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|) (= |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|)) InVars {thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_1|} OutVars{thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of4ForFork0_~v~0#1=|v_thr1Thread2of4ForFork0_~v~0#1_7|, ~value~0=v_~value~0_17, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_2|, #race~value~0=|v_#race~value~0_19|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][200], [Black: 163#true, 52#L723-4true, Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 150#L727true, 160#true, 175#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, 93#L722-2true, 82#L727true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:56,278 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-29 02:33:56,278 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:33:56,278 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:33:56,279 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:33:56,469 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([659] L723-2-->L723-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet6#1_3| |v_#race~value~0_7|) InVars {thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_3|} OutVars{thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_3|, #race~value~0=|v_#race~value~0_7|} AuxVars[] AssignedVars[#race~value~0][175], [8#L724-1true, 99#L723-3true, Black: 165#(= |#race~value~0| 0), Black: 171#(= |#race~value~0| |thr1Thread1of4ForFork0_#t~nondet6#1|), 52#L723-4true, 175#true, 160#true, thr1Thread1of4ForFork0InUse, 12#L733-5true, 169#true, thr1Thread2of4ForFork0InUse, 82#L727true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse]) [2023-11-29 02:33:56,469 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-29 02:33:56,469 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:33:56,469 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:33:56,469 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:33:56,905 INFO L124 PetriNetUnfolderBase]: 122622/225043 cut-off events. [2023-11-29 02:33:56,906 INFO L125 PetriNetUnfolderBase]: For 220616/234868 co-relation queries the response was YES. [2023-11-29 02:33:57,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587648 conditions, 225043 events. 122622/225043 cut-off events. For 220616/234868 co-relation queries the response was YES. Maximal size of possible extension queue 7951. Compared 2641826 event pairs, 53837 based on Foata normal form. 1184/188707 useless extension candidates. Maximal degree in co-relation 587638. Up to 130566 conditions per place. [2023-11-29 02:33:58,874 INFO L140 encePairwiseOnDemand]: 137/153 looper letters, 83 selfloop transitions, 46 changer transitions 0/221 dead transitions. [2023-11-29 02:33:58,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 221 transitions, 1242 flow [2023-11-29 02:33:58,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:33:58,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:33:58,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-11-29 02:33:58,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2023-11-29 02:33:58,876 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-11-29 02:33:58,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-11-29 02:33:58,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:33:58,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-11-29 02:33:58,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:33:58,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states 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 02:33:58,878 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states 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 02:33:58,878 INFO L175 Difference]: Start difference. First operand has 130 places, 168 transitions, 684 flow. Second operand 3 states and 323 transitions. [2023-11-29 02:33:58,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 221 transitions, 1242 flow [2023-11-29 02:34:06,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 221 transitions, 1150 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:34:06,701 INFO L231 Difference]: Finished difference. Result has 132 places, 210 transitions, 1130 flow [2023-11-29 02:34:06,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1130, PETRI_PLACES=132, PETRI_TRANSITIONS=210} [2023-11-29 02:34:06,702 INFO L281 CegarLoopForPetriNet]: 157 programPoint places, -25 predicate places. [2023-11-29 02:34:06,702 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 210 transitions, 1130 flow [2023-11-29 02:34:06,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states 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 02:34:06,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:34:06,703 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 02:34:06,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 02:34:06,703 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 02:34:06,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:34:06,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1293252773, now seen corresponding path program 1 times [2023-11-29 02:34:06,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:34:06,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151803061] [2023-11-29 02:34:06,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:34:06,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:34:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:06,767 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 02:34:06,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:34:06,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151803061] [2023-11-29 02:34:06,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151803061] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:34:06,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:34:06,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:34:06,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014448560] [2023-11-29 02:34:06,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:34:06,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:34:06,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:34:06,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:34:06,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:34:06,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 153 [2023-11-29 02:34:06,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 210 transitions, 1130 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states 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 02:34:06,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:34:06,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 153 [2023-11-29 02:34:06,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:34:07,931 INFO L124 PetriNetUnfolderBase]: 3136/10671 cut-off events. [2023-11-29 02:34:07,931 INFO L125 PetriNetUnfolderBase]: For 11106/11734 co-relation queries the response was YES. [2023-11-29 02:34:07,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26288 conditions, 10671 events. 3136/10671 cut-off events. For 11106/11734 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 111458 event pairs, 841 based on Foata normal form. 690/10739 useless extension candidates. Maximal degree in co-relation 26277. Up to 3825 conditions per place. [2023-11-29 02:34:07,985 INFO L140 encePairwiseOnDemand]: 141/153 looper letters, 36 selfloop transitions, 12 changer transitions 0/145 dead transitions. [2023-11-29 02:34:07,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 145 transitions, 705 flow [2023-11-29 02:34:07,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:34:07,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:34:07,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2023-11-29 02:34:07,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7363834422657952 [2023-11-29 02:34:07,987 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 338 transitions. [2023-11-29 02:34:07,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 338 transitions. [2023-11-29 02:34:07,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:34:07,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 338 transitions. [2023-11-29 02:34:07,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states 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 02:34:07,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states 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 02:34:07,990 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states 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 02:34:07,990 INFO L175 Difference]: Start difference. First operand has 132 places, 210 transitions, 1130 flow. Second operand 3 states and 338 transitions. [2023-11-29 02:34:07,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 145 transitions, 705 flow [2023-11-29 02:34:08,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 145 transitions, 671 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-11-29 02:34:08,010 INFO L231 Difference]: Finished difference. Result has 124 places, 134 transitions, 522 flow [2023-11-29 02:34:08,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=522, PETRI_PLACES=124, PETRI_TRANSITIONS=134} [2023-11-29 02:34:08,011 INFO L281 CegarLoopForPetriNet]: 157 programPoint places, -33 predicate places. [2023-11-29 02:34:08,011 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 134 transitions, 522 flow [2023-11-29 02:34:08,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states 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 02:34:08,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:34:08,011 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:34:08,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 02:34:08,012 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 02:34:08,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:34:08,012 INFO L85 PathProgramCache]: Analyzing trace with hash 723629824, now seen corresponding path program 1 times [2023-11-29 02:34:08,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:34:08,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823420734] [2023-11-29 02:34:08,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:34:08,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:34:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:08,049 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-29 02:34:08,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:34:08,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823420734] [2023-11-29 02:34:08,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823420734] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:34:08,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:34:08,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:34:08,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246222366] [2023-11-29 02:34:08,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:34:08,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:34:08,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:34:08,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:34:08,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:34:08,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 153 [2023-11-29 02:34:08,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 134 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states 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 02:34:08,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:34:08,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 153 [2023-11-29 02:34:08,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:34:09,368 INFO L124 PetriNetUnfolderBase]: 3660/11168 cut-off events. [2023-11-29 02:34:09,369 INFO L125 PetriNetUnfolderBase]: For 12324/13028 co-relation queries the response was YES. [2023-11-29 02:34:09,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30979 conditions, 11168 events. 3660/11168 cut-off events. For 12324/13028 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 114632 event pairs, 1799 based on Foata normal form. 0/10609 useless extension candidates. Maximal degree in co-relation 30968. Up to 5818 conditions per place. [2023-11-29 02:34:09,427 INFO L140 encePairwiseOnDemand]: 146/153 looper letters, 56 selfloop transitions, 9 changer transitions 0/143 dead transitions. [2023-11-29 02:34:09,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 143 transitions, 703 flow [2023-11-29 02:34:09,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:34:09,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:34:09,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2023-11-29 02:34:09,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6623093681917211 [2023-11-29 02:34:09,429 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2023-11-29 02:34:09,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2023-11-29 02:34:09,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:34:09,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2023-11-29 02:34:09,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states 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 02:34:09,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states 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 02:34:09,431 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states 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 02:34:09,431 INFO L175 Difference]: Start difference. First operand has 124 places, 134 transitions, 522 flow. Second operand 3 states and 304 transitions. [2023-11-29 02:34:09,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 143 transitions, 703 flow [2023-11-29 02:34:09,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 143 transitions, 691 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 02:34:09,436 INFO L231 Difference]: Finished difference. Result has 127 places, 142 transitions, 608 flow [2023-11-29 02:34:09,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=127, PETRI_TRANSITIONS=142} [2023-11-29 02:34:09,437 INFO L281 CegarLoopForPetriNet]: 157 programPoint places, -30 predicate places. [2023-11-29 02:34:09,437 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 142 transitions, 608 flow [2023-11-29 02:34:09,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states 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 02:34:09,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:34:09,437 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:34:09,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 02:34:09,437 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 02:34:09,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:34:09,438 INFO L85 PathProgramCache]: Analyzing trace with hash -739857369, now seen corresponding path program 1 times [2023-11-29 02:34:09,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:34:09,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834470384] [2023-11-29 02:34:09,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:34:09,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:34:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:34:09,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:34:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:34:09,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:34:09,465 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 02:34:09,465 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 51 remaining) [2023-11-29 02:34:09,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (49 of 51 remaining) [2023-11-29 02:34:09,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (48 of 51 remaining) [2023-11-29 02:34:09,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (47 of 51 remaining) [2023-11-29 02:34:09,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (46 of 51 remaining) [2023-11-29 02:34:09,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (45 of 51 remaining) [2023-11-29 02:34:09,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (44 of 51 remaining) [2023-11-29 02:34:09,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (43 of 51 remaining) [2023-11-29 02:34:09,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (42 of 51 remaining) [2023-11-29 02:34:09,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (41 of 51 remaining) [2023-11-29 02:34:09,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (40 of 51 remaining) [2023-11-29 02:34:09,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (39 of 51 remaining) [2023-11-29 02:34:09,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (38 of 51 remaining) [2023-11-29 02:34:09,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (37 of 51 remaining) [2023-11-29 02:34:09,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (36 of 51 remaining) [2023-11-29 02:34:09,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (35 of 51 remaining) [2023-11-29 02:34:09,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (34 of 51 remaining) [2023-11-29 02:34:09,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (33 of 51 remaining) [2023-11-29 02:34:09,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (32 of 51 remaining) [2023-11-29 02:34:09,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (31 of 51 remaining) [2023-11-29 02:34:09,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (30 of 51 remaining) [2023-11-29 02:34:09,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (29 of 51 remaining) [2023-11-29 02:34:09,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (28 of 51 remaining) [2023-11-29 02:34:09,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (27 of 51 remaining) [2023-11-29 02:34:09,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (26 of 51 remaining) [2023-11-29 02:34:09,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (25 of 51 remaining) [2023-11-29 02:34:09,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (24 of 51 remaining) [2023-11-29 02:34:09,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (23 of 51 remaining) [2023-11-29 02:34:09,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (22 of 51 remaining) [2023-11-29 02:34:09,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (21 of 51 remaining) [2023-11-29 02:34:09,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (20 of 51 remaining) [2023-11-29 02:34:09,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (19 of 51 remaining) [2023-11-29 02:34:09,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 51 remaining) [2023-11-29 02:34:09,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (17 of 51 remaining) [2023-11-29 02:34:09,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 51 remaining) [2023-11-29 02:34:09,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (15 of 51 remaining) [2023-11-29 02:34:09,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (14 of 51 remaining) [2023-11-29 02:34:09,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (13 of 51 remaining) [2023-11-29 02:34:09,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (12 of 51 remaining) [2023-11-29 02:34:09,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (11 of 51 remaining) [2023-11-29 02:34:09,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (10 of 51 remaining) [2023-11-29 02:34:09,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 51 remaining) [2023-11-29 02:34:09,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (8 of 51 remaining) [2023-11-29 02:34:09,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 51 remaining) [2023-11-29 02:34:09,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 51 remaining) [2023-11-29 02:34:09,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (5 of 51 remaining) [2023-11-29 02:34:09,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 51 remaining) [2023-11-29 02:34:09,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (3 of 51 remaining) [2023-11-29 02:34:09,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (2 of 51 remaining) [2023-11-29 02:34:09,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (1 of 51 remaining) [2023-11-29 02:34:09,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (0 of 51 remaining) [2023-11-29 02:34:09,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 02:34:09,471 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:34:09,472 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 02:34:09,472 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-11-29 02:34:09,506 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 02:34:09,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 185 transitions, 410 flow [2023-11-29 02:34:09,533 INFO L124 PetriNetUnfolderBase]: 11/248 cut-off events. [2023-11-29 02:34:09,533 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-29 02:34:09,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 248 events. 11/248 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 848 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 216. Up to 12 conditions per place. [2023-11-29 02:34:09,534 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 185 transitions, 410 flow [2023-11-29 02:34:09,536 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 190 places, 185 transitions, 410 flow [2023-11-29 02:34:09,537 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:34:09,537 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;@24def2c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:34:09,538 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2023-11-29 02:34:09,539 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 02:34:09,539 INFO L124 PetriNetUnfolderBase]: 2/30 cut-off events. [2023-11-29 02:34:09,539 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:34:09,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:34:09,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:34:09,540 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-29 02:34:09,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:34:09,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1330052210, now seen corresponding path program 1 times [2023-11-29 02:34:09,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:34:09,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064681812] [2023-11-29 02:34:09,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:34:09,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:34:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:09,553 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 02:34:09,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:34:09,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064681812] [2023-11-29 02:34:09,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064681812] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:34:09,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:34:09,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:34:09,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25946731] [2023-11-29 02:34:09,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:34:09,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:34:09,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:34:09,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:34:09,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:34:09,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 185 [2023-11-29 02:34:09,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 185 transitions, 410 flow. Second operand has 2 states, 2 states have (on average 124.0) internal successors, (248), 2 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:34:09,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:34:09,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 185 [2023-11-29 02:34:09,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:34:12,623 INFO L124 PetriNetUnfolderBase]: 12349/29771 cut-off events. [2023-11-29 02:34:12,623 INFO L125 PetriNetUnfolderBase]: For 10801/10801 co-relation queries the response was YES. [2023-11-29 02:34:12,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49895 conditions, 29771 events. 12349/29771 cut-off events. For 10801/10801 co-relation queries the response was YES. Maximal size of possible extension queue 1208. Compared 342859 event pairs, 11720 based on Foata normal form. 3906/29820 useless extension candidates. Maximal degree in co-relation 36274. Up to 15626 conditions per place. [2023-11-29 02:34:12,883 INFO L140 encePairwiseOnDemand]: 148/185 looper letters, 25 selfloop transitions, 0 changer transitions 0/143 dead transitions. [2023-11-29 02:34:12,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 143 transitions, 376 flow [2023-11-29 02:34:12,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:34:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 02:34:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 308 transitions. [2023-11-29 02:34:12,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8324324324324325 [2023-11-29 02:34:12,885 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 308 transitions. [2023-11-29 02:34:12,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 308 transitions. [2023-11-29 02:34:12,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:34:12,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 308 transitions. [2023-11-29 02:34:12,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 154.0) internal successors, (308), 2 states have internal predecessors, (308), 0 states have call successors, (0), 0 states 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 02:34:12,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states 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 02:34:12,887 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states 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 02:34:12,888 INFO L175 Difference]: Start difference. First operand has 190 places, 185 transitions, 410 flow. Second operand 2 states and 308 transitions. [2023-11-29 02:34:12,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 143 transitions, 376 flow [2023-11-29 02:34:12,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 143 transitions, 364 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-11-29 02:34:12,892 INFO L231 Difference]: Finished difference. Result has 150 places, 143 transitions, 314 flow [2023-11-29 02:34:12,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=314, PETRI_PLACES=150, PETRI_TRANSITIONS=143} [2023-11-29 02:34:12,893 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, -40 predicate places. [2023-11-29 02:34:12,893 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 143 transitions, 314 flow [2023-11-29 02:34:12,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 124.0) internal successors, (248), 2 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:34:12,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:34:12,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] [2023-11-29 02:34:12,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 02:34:12,894 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-29 02:34:12,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:34:12,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1720109809, now seen corresponding path program 1 times [2023-11-29 02:34:12,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:34:12,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630417825] [2023-11-29 02:34:12,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:34:12,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:34:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:12,917 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 02:34:12,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:34:12,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630417825] [2023-11-29 02:34:12,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630417825] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:34:12,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:34:12,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:34:12,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430617112] [2023-11-29 02:34:12,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:34:12,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:34:12,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:34:12,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:34:12,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:34:12,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 185 [2023-11-29 02:34:12,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 143 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:34:12,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:34:12,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 185 [2023-11-29 02:34:12,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand