./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/25_stack_longer-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/25_stack_longer-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --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 22f5e9b8cea3fb6414e4865b1626afaeb55342d9f0f16512cd01a49134cc1f25 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:11:02,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:11:02,502 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:11:02,505 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:11:02,506 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:11:02,519 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:11:02,520 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:11:02,520 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:11:02,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:11:02,521 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:11:02,522 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:11:02,522 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:11:02,522 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:11:02,523 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:11:02,523 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:11:02,523 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:11:02,523 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:11:02,523 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:11:02,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:11:02,523 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:11:02,523 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:11:02,523 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:11:02,524 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:11:02,524 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:11:02,524 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:11:02,524 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:11:02,524 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:11:02,524 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:11:02,524 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:11:02,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:11:02,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:11:02,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:11:02,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:11:02,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:11:02,525 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:11:02,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:11:02,525 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:11:02,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:11:02,525 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:11:02,525 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:11:02,525 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:11:02,525 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:11:02,525 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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 -> 22f5e9b8cea3fb6414e4865b1626afaeb55342d9f0f16512cd01a49134cc1f25 [2025-02-08 05:11:02,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:11:02,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:11:02,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:11:02,749 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:11:02,749 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:11:02,751 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/25_stack_longer-1.i [2025-02-08 05:11:03,918 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ea898757/ce0fd87b353b452cbbb2758715299aab/FLAG859ada18f [2025-02-08 05:11:04,225 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:11:04,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/25_stack_longer-1.i [2025-02-08 05:11:04,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ea898757/ce0fd87b353b452cbbb2758715299aab/FLAG859ada18f [2025-02-08 05:11:04,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ea898757/ce0fd87b353b452cbbb2758715299aab [2025-02-08 05:11:04,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:11:04,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:11:04,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:11:04,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:11:04,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:11:04,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:11:04" (1/1) ... [2025-02-08 05:11:04,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54e5cd1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:04, skipping insertion in model container [2025-02-08 05:11:04,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:11:04" (1/1) ... [2025-02-08 05:11:04,527 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:11:04,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:11:04,799 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:11:04,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:11:04,869 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:11:04,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:04 WrapperNode [2025-02-08 05:11:04,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:11:04,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:11:04,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:11:04,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:11:04,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:04" (1/1) ... [2025-02-08 05:11:04,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:04" (1/1) ... [2025-02-08 05:11:04,911 INFO L138 Inliner]: procedures = 171, calls = 36, calls flagged for inlining = 10, calls inlined = 9, statements flattened = 806 [2025-02-08 05:11:04,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:11:04,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:11:04,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:11:04,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:11:04,923 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:04" (1/1) ... [2025-02-08 05:11:04,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:04" (1/1) ... [2025-02-08 05:11:04,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:04" (1/1) ... [2025-02-08 05:11:04,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:04" (1/1) ... [2025-02-08 05:11:04,937 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:04" (1/1) ... [2025-02-08 05:11:04,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:04" (1/1) ... [2025-02-08 05:11:04,948 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:04" (1/1) ... [2025-02-08 05:11:04,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:04" (1/1) ... [2025-02-08 05:11:04,960 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:11:04,962 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:11:04,962 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:11:04,962 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:11:04,963 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:04" (1/1) ... [2025-02-08 05:11:04,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:11:04,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:11:04,990 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:11:04,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:11:05,009 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 05:11:05,009 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 05:11:05,009 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:11:05,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:11:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:11:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:11:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:11:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:11:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:11:05,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:11:05,011 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:11:05,118 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:11:05,120 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:11:05,380 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L721: havoc push_#t~ret8#1; [2025-02-08 05:11:05,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L721-1: [2025-02-08 05:11:05,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L721-2: SUMMARY for call push_#t~ret8#1 := #PthreadsMutexLock(~#m~0.base, ~#m~0.offset); srcloc: null [2025-02-08 05:11:05,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L721-3: [2025-02-08 05:11:05,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L722: assume 0 == #race~top~0; [2025-02-08 05:11:05,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L722: assume !(0 == #race~top~0); [2025-02-08 05:11:05,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L722-1: push_~oldTop~0#1 := ~top~0; [2025-02-08 05:11:05,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L722-2: #race~top~0 := 0; [2025-02-08 05:11:05,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723: assume #race~memory~0[1 + push_~newTop~0#1] == push_#t~nondet9#1; [2025-02-08 05:11:05,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723: assume !(#race~memory~0[1 + push_~newTop~0#1] == push_#t~nondet9#1); [2025-02-08 05:11:05,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723-1: havoc push_#t~nondet9#1; [2025-02-08 05:11:05,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723-2: #race~memory~0 := #race~memory~0[1 + push_~newTop~0#1 := push_#t~nondet9#1]; [2025-02-08 05:11:05,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723-3: havoc push_#t~nondet9#1; [2025-02-08 05:11:05,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723-4: ~memory~0 := ~memory~0[1 + push_~newTop~0#1 := push_~oldTop~0#1]; [2025-02-08 05:11:05,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L13: assume false; [2025-02-08 05:11:05,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L13: assume !false; [2025-02-08 05:11:05,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L13-1: assume false; [2025-02-08 05:11:05,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L724: ~top~0 := push_~newTop~0#1; [2025-02-08 05:11:05,382 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L716: havoc push_#t~ret6#1; [2025-02-08 05:11:05,382 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L716-1: push_~newTop~0#1 := push_#t~ret6#1; [2025-02-08 05:11:05,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L716-2: assume { :end_inline_index_malloc } true;assume -2147483648 <= push_#t~ret6#1 && push_#t~ret6#1 <= 2147483647; [2025-02-08 05:11:05,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L716-3: havoc index_malloc_#t~ret1#1, index_malloc_#t~ret2#1, index_malloc_#t~nondet3#1, index_malloc_#t~ret4#1, index_malloc_~curr_alloc_idx~0#1; [2025-02-08 05:11:05,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L716-4: push_#t~ret6#1 := index_malloc_#res#1; [2025-02-08 05:11:05,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L725: assume #race~top~0 == push_#t~nondet10#1; [2025-02-08 05:11:05,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L725: assume !(#race~top~0 == push_#t~nondet10#1); [2025-02-08 05:11:05,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L725-1: havoc push_#t~nondet10#1; [2025-02-08 05:11:05,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L725-2: #race~top~0 := push_#t~nondet10#1; [2025-02-08 05:11:05,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L725-3: havoc push_#t~nondet10#1; [2025-02-08 05:11:05,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717: assume 0 == push_~newTop~0#1; [2025-02-08 05:11:05,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717: assume !(0 == push_~newTop~0#1); [2025-02-08 05:11:05,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742: havoc push_loop_#t~ret15#1; [2025-02-08 05:11:05,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709: assume 0 == ~top~0; [2025-02-08 05:11:05,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709: assume !(0 == ~top~0); [2025-02-08 05:11:05,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-1: push_loop_~r~0#1 := push_loop_#t~ret15#1; [2025-02-08 05:11:05,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-1: assume 0 == #race~top~0; [2025-02-08 05:11:05,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-1: assume !(0 == #race~top~0); [2025-02-08 05:11:05,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-2: assume { :end_inline_push } true;assume -2147483648 <= push_loop_#t~ret15#1 && push_loop_#t~ret15#1 <= 2147483647; [2025-02-08 05:11:05,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-2: #race~top~0 := 0; [2025-02-08 05:11:05,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-3: havoc push_#in~d#1; [2025-02-08 05:11:05,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-4: havoc push_#t~ret6#1, push_#t~nondet7#1, push_#t~ret8#1, push_#t~nondet9#1, push_#t~nondet10#1, push_#t~ret11#1, push_~d#1, push_~oldTop~0#1, push_~newTop~0#1; [2025-02-08 05:11:05,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-5: push_loop_#t~ret15#1 := push_#res#1; [2025-02-08 05:11:05,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: __VERIFIER_atomic_assert_~r#1 := __VERIFIER_atomic_assert_#in~r#1; [2025-02-08 05:11:05,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L726: [2025-02-08 05:11:05,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L718-1: push_#res#1 := 0; [2025-02-08 05:11:05,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743: [2025-02-08 05:11:05,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743-1: havoc __VERIFIER_atomic_assert_#in~r#1;assume { :end_inline___VERIFIER_atomic_assert } true; [2025-02-08 05:11:05,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743-2: havoc __VERIFIER_atomic_assert_#t~ret12#1, __VERIFIER_atomic_assert_#t~short13#1, __VERIFIER_atomic_assert_~r#1; [2025-02-08 05:11:05,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-1: isEmpty_#res#1 := 1; [2025-02-08 05:11:05,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743-3: havoc __VERIFIER_atomic_assert_#t~ret12#1, __VERIFIER_atomic_assert_#t~short13#1, __VERIFIER_atomic_assert_~r#1; [2025-02-08 05:11:05,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743-4: assume { :begin_inline___VERIFIER_atomic_assert } true;__VERIFIER_atomic_assert_#in~r#1 := push_loop_~r~0#1; [2025-02-08 05:11:05,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L727: havoc push_#t~ret11#1; [2025-02-08 05:11:05,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L727-1: [2025-02-08 05:11:05,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L727-2: SUMMARY for call push_#t~ret11#1 := #PthreadsMutexUnlock(~#m~0.base, ~#m~0.offset); srcloc: null [2025-02-08 05:11:05,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L727-3: [2025-02-08 05:11:05,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736: assume { :end_inline_reach_error } true;assume false; [2025-02-08 05:11:05,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:11:05,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-2: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:11:05,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-3: havoc __VERIFIER_atomic_assert_#t~short13#1; [2025-02-08 05:11:05,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-4: havoc __VERIFIER_atomic_assert_#t~short13#1; [2025-02-08 05:11:05,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-5: assume !!__VERIFIER_atomic_assert_#t~short13#1; [2025-02-08 05:11:05,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-5: assume !!!__VERIFIER_atomic_assert_#t~short13#1; [2025-02-08 05:11:05,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-6: havoc __VERIFIER_atomic_assert_#t~ret12#1; [2025-02-08 05:11:05,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-7: havoc __VERIFIER_atomic_assert_#t~ret12#1; [2025-02-08 05:11:05,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-8: __VERIFIER_atomic_assert_#t~short13#1 := 0 == __VERIFIER_atomic_assert_#t~ret12#1; [2025-02-08 05:11:05,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-9: assume { :end_inline_isEmpty } true;assume -2147483648 <= __VERIFIER_atomic_assert_#t~ret12#1 && __VERIFIER_atomic_assert_#t~ret12#1 <= 2147483647; [2025-02-08 05:11:05,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L728-1: push_#res#1 := 1; [2025-02-08 05:11:05,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-10: __VERIFIER_atomic_assert_#t~ret12#1 := isEmpty_#res#1; [2025-02-08 05:11:05,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-11: assume __VERIFIER_atomic_assert_#t~short13#1; [2025-02-08 05:11:05,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-11: assume !__VERIFIER_atomic_assert_#t~short13#1; [2025-02-08 05:11:05,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-12: assume { :begin_inline_isEmpty } true;havoc isEmpty_#res#1; [2025-02-08 05:11:05,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-13: __VERIFIER_atomic_assert_#t~short13#1 := 0 == __VERIFIER_atomic_assert_~r#1; [2025-02-08 05:11:05,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: assume #race~memory~0[push_~newTop~0#1] == push_#t~nondet7#1; [2025-02-08 05:11:05,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: assume !(#race~memory~0[push_~newTop~0#1] == push_#t~nondet7#1); [2025-02-08 05:11:05,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-1: havoc push_#t~nondet7#1; [2025-02-08 05:11:05,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-2: #race~memory~0 := #race~memory~0[push_~newTop~0#1 := push_#t~nondet7#1]; [2025-02-08 05:11:05,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-3: havoc push_#t~nondet7#1; [2025-02-08 05:11:05,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-4: ~memory~0 := ~memory~0[push_~newTop~0#1 := push_~d#1]; [2025-02-08 05:11:05,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-1: isEmpty_#res#1 := 0; [2025-02-08 05:11:05,830 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:11:05,830 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:11:05,859 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:11:05,859 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:11:05,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:11:05 BoogieIcfgContainer [2025-02-08 05:11:05,860 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:11:05,861 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:11:05,861 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:11:05,865 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:11:05,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:11:04" (1/3) ... [2025-02-08 05:11:05,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c154cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:11:05, skipping insertion in model container [2025-02-08 05:11:05,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:04" (2/3) ... [2025-02-08 05:11:05,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c154cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:11:05, skipping insertion in model container [2025-02-08 05:11:05,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:11:05" (3/3) ... [2025-02-08 05:11:05,866 INFO L128 eAbstractionObserver]: Analyzing ICFG 25_stack_longer-1.i [2025-02-08 05:11:05,876 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:11:05,878 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 25_stack_longer-1.i that has 2 procedures, 753 locations, 1 initial locations, 2 loop locations, and 12 error locations. [2025-02-08 05:11:05,878 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:11:05,953 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:06,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 756 places, 755 transitions, 1514 flow [2025-02-08 05:11:06,219 INFO L124 PetriNetUnfolderBase]: 2/762 cut-off events. [2025-02-08 05:11:06,221 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:06,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 762 events. 2/762 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 134 event pairs, 0 based on Foata normal form. 0/749 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2025-02-08 05:11:06,224 INFO L82 GeneralOperation]: Start removeDead. Operand has 756 places, 755 transitions, 1514 flow [2025-02-08 05:11:06,229 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 756 places, 755 transitions, 1514 flow [2025-02-08 05:11:06,234 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:06,240 INFO L333 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, 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;@2da2c3a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:06,240 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-02-08 05:11:06,342 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:06,342 INFO L124 PetriNetUnfolderBase]: 0/688 cut-off events. [2025-02-08 05:11:06,342 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:06,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:06,345 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:06,346 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err11ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-08 05:11:06,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:06,354 INFO L85 PathProgramCache]: Analyzing trace with hash 752419247, now seen corresponding path program 1 times [2025-02-08 05:11:06,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:06,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574091674] [2025-02-08 05:11:06,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:06,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:06,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 676 statements into 1 equivalence classes. [2025-02-08 05:11:06,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 676 of 676 statements. [2025-02-08 05:11:06,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:06,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:07,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:07,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574091674] [2025-02-08 05:11:07,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574091674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:07,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:07,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:07,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242704018] [2025-02-08 05:11:07,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:07,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:07,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:07,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:07,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:07,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 755 [2025-02-08 05:11:07,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 756 places, 755 transitions, 1514 flow. Second operand has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:07,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:07,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 755 [2025-02-08 05:11:07,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:07,563 INFO L124 PetriNetUnfolderBase]: 2/804 cut-off events. [2025-02-08 05:11:07,564 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:11:07,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 822 conditions, 804 events. 2/804 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 228 event pairs, 0 based on Foata normal form. 16/805 useless extension candidates. Maximal degree in co-relation 144. Up to 8 conditions per place. [2025-02-08 05:11:07,567 INFO L140 encePairwiseOnDemand]: 750/755 looper letters, 11 selfloop transitions, 2 changer transitions 0/752 dead transitions. [2025-02-08 05:11:07,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 751 places, 752 transitions, 1534 flow [2025-02-08 05:11:07,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:07,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2247 transitions. [2025-02-08 05:11:07,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9920529801324504 [2025-02-08 05:11:07,588 INFO L175 Difference]: Start difference. First operand has 756 places, 755 transitions, 1514 flow. Second operand 3 states and 2247 transitions. [2025-02-08 05:11:07,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 751 places, 752 transitions, 1534 flow [2025-02-08 05:11:07,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 751 places, 752 transitions, 1534 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:07,611 INFO L231 Difference]: Finished difference. Result has 751 places, 748 transitions, 1504 flow [2025-02-08 05:11:07,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=755, PETRI_DIFFERENCE_MINUEND_FLOW=1500, PETRI_DIFFERENCE_MINUEND_PLACES=749, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=748, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=746, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1504, PETRI_PLACES=751, PETRI_TRANSITIONS=748} [2025-02-08 05:11:07,617 INFO L279 CegarLoopForPetriNet]: 756 programPoint places, -5 predicate places. [2025-02-08 05:11:07,617 INFO L471 AbstractCegarLoop]: Abstraction has has 751 places, 748 transitions, 1504 flow [2025-02-08 05:11:07,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:07,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:07,619 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:07,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:11:07,619 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-08 05:11:07,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:07,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1780217, now seen corresponding path program 1 times [2025-02-08 05:11:07,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:07,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917926936] [2025-02-08 05:11:07,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:07,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:07,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes. [2025-02-08 05:11:07,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements. [2025-02-08 05:11:07,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:07,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:07,959 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:11:07,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes. [2025-02-08 05:11:08,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements. [2025-02-08 05:11:08,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:08,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:08,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:11:08,322 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:11:08,323 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-02-08 05:11:08,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-02-08 05:11:08,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-02-08 05:11:08,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-02-08 05:11:08,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-02-08 05:11:08,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-02-08 05:11:08,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2025-02-08 05:11:08,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-02-08 05:11:08,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-02-08 05:11:08,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-02-08 05:11:08,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-02-08 05:11:08,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-02-08 05:11:08,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-02-08 05:11:08,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-02-08 05:11:08,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-02-08 05:11:08,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:11:08,326 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 05:11:08,327 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:11:08,328 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:11:08,363 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:08,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 834 places, 833 transitions, 1676 flow [2025-02-08 05:11:08,492 INFO L124 PetriNetUnfolderBase]: 4/849 cut-off events. [2025-02-08 05:11:08,492 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:11:08,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 849 events. 4/849 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 540 event pairs, 0 based on Foata normal form. 0/824 useless extension candidates. Maximal degree in co-relation 763. Up to 3 conditions per place. [2025-02-08 05:11:08,496 INFO L82 GeneralOperation]: Start removeDead. Operand has 834 places, 833 transitions, 1676 flow [2025-02-08 05:11:08,500 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 834 places, 833 transitions, 1676 flow [2025-02-08 05:11:08,500 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:08,501 INFO L333 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, 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;@2da2c3a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:08,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-02-08 05:11:08,559 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:08,560 INFO L124 PetriNetUnfolderBase]: 0/686 cut-off events. [2025-02-08 05:11:08,560 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:08,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:08,561 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:08,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err11ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-08 05:11:08,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:08,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1918396209, now seen corresponding path program 1 times [2025-02-08 05:11:08,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:08,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064825043] [2025-02-08 05:11:08,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:08,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:08,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 676 statements into 1 equivalence classes. [2025-02-08 05:11:08,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 676 of 676 statements. [2025-02-08 05:11:08,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:08,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:09,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:09,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:09,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064825043] [2025-02-08 05:11:09,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064825043] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:09,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:09,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:09,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730491146] [2025-02-08 05:11:09,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:09,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:09,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:09,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:09,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:09,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 810 out of 833 [2025-02-08 05:11:09,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 834 places, 833 transitions, 1676 flow. Second operand has 3 states, 3 states have (on average 811.3333333333334) internal successors, (2434), 3 states have internal predecessors, (2434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:09,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:09,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 810 of 833 [2025-02-08 05:11:09,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:09,773 INFO L124 PetriNetUnfolderBase]: 179/2493 cut-off events. [2025-02-08 05:11:09,774 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-02-08 05:11:09,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2856 conditions, 2493 events. 179/2493 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 14842 event pairs, 56 based on Foata normal form. 200/2459 useless extension candidates. Maximal degree in co-relation 1969. Up to 162 conditions per place. [2025-02-08 05:11:09,793 INFO L140 encePairwiseOnDemand]: 822/833 looper letters, 31 selfloop transitions, 6 changer transitions 0/842 dead transitions. [2025-02-08 05:11:09,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 828 places, 842 transitions, 1773 flow [2025-02-08 05:11:09,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:09,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:09,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2475 transitions. [2025-02-08 05:11:09,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9903961584633854 [2025-02-08 05:11:09,801 INFO L175 Difference]: Start difference. First operand has 834 places, 833 transitions, 1676 flow. Second operand 3 states and 2475 transitions. [2025-02-08 05:11:09,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 828 places, 842 transitions, 1773 flow [2025-02-08 05:11:09,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 828 places, 842 transitions, 1773 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:09,814 INFO L231 Difference]: Finished difference. Result has 830 places, 831 transitions, 1712 flow [2025-02-08 05:11:09,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1660, PETRI_DIFFERENCE_MINUEND_PLACES=826, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=825, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=819, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1712, PETRI_PLACES=830, PETRI_TRANSITIONS=831} [2025-02-08 05:11:09,816 INFO L279 CegarLoopForPetriNet]: 834 programPoint places, -4 predicate places. [2025-02-08 05:11:09,816 INFO L471 AbstractCegarLoop]: Abstraction has has 830 places, 831 transitions, 1712 flow [2025-02-08 05:11:09,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 811.3333333333334) internal successors, (2434), 3 states have internal predecessors, (2434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:09,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:09,818 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:09,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:11:09,818 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-08 05:11:09,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:09,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1894140388, now seen corresponding path program 1 times [2025-02-08 05:11:09,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:09,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271776562] [2025-02-08 05:11:09,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:09,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:09,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-02-08 05:11:10,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-02-08 05:11:10,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:10,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:10,102 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:11:10,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-02-08 05:11:10,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-02-08 05:11:10,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:10,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:10,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:11:10,339 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:11:10,339 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-02-08 05:11:10,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-02-08 05:11:10,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-02-08 05:11:10,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-02-08 05:11:10,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-02-08 05:11:10,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-02-08 05:11:10,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-02-08 05:11:10,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-02-08 05:11:10,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-02-08 05:11:10,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-02-08 05:11:10,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-02-08 05:11:10,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-02-08 05:11:10,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-02-08 05:11:10,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-02-08 05:11:10,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-02-08 05:11:10,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-02-08 05:11:10,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-02-08 05:11:10,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-02-08 05:11:10,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-02-08 05:11:10,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-02-08 05:11:10,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-02-08 05:11:10,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-02-08 05:11:10,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:11:10,340 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 05:11:10,340 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:11:10,340 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:11:10,394 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:10,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 912 places, 911 transitions, 1840 flow [2025-02-08 05:11:10,516 INFO L124 PetriNetUnfolderBase]: 6/936 cut-off events. [2025-02-08 05:11:10,517 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:11:10,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 936 events. 6/936 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1026 event pairs, 0 based on Foata normal form. 0/899 useless extension candidates. Maximal degree in co-relation 853. Up to 4 conditions per place. [2025-02-08 05:11:10,519 INFO L82 GeneralOperation]: Start removeDead. Operand has 912 places, 911 transitions, 1840 flow [2025-02-08 05:11:10,523 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 912 places, 911 transitions, 1840 flow [2025-02-08 05:11:10,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:10,524 INFO L333 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, 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;@2da2c3a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:10,524 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-02-08 05:11:10,572 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:10,572 INFO L124 PetriNetUnfolderBase]: 0/688 cut-off events. [2025-02-08 05:11:10,572 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:11:10,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:10,573 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:10,573 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err11ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:11:10,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:10,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1903566238, now seen corresponding path program 1 times [2025-02-08 05:11:10,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:10,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969745638] [2025-02-08 05:11:10,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:10,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:10,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 676 statements into 1 equivalence classes. [2025-02-08 05:11:10,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 676 of 676 statements. [2025-02-08 05:11:10,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:10,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:10,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:10,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:10,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969745638] [2025-02-08 05:11:10,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969745638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:10,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:10,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:10,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406828276] [2025-02-08 05:11:10,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:10,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:10,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:10,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:10,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:10,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 877 out of 911 [2025-02-08 05:11:10,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 912 places, 911 transitions, 1840 flow. Second operand has 3 states, 3 states have (on average 878.3333333333334) internal successors, (2635), 3 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:10,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:10,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 877 of 911 [2025-02-08 05:11:10,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:14,749 INFO L124 PetriNetUnfolderBase]: 3775/22203 cut-off events. [2025-02-08 05:11:14,750 INFO L125 PetriNetUnfolderBase]: For 958/958 co-relation queries the response was YES. [2025-02-08 05:11:14,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28254 conditions, 22203 events. 3775/22203 cut-off events. For 958/958 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 283801 event pairs, 1346 based on Foata normal form. 2389/21694 useless extension candidates. Maximal degree in co-relation 19507. Up to 2781 conditions per place. [2025-02-08 05:11:14,933 INFO L140 encePairwiseOnDemand]: 895/911 looper letters, 47 selfloop transitions, 9 changer transitions 0/927 dead transitions. [2025-02-08 05:11:14,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 904 places, 927 transitions, 1996 flow [2025-02-08 05:11:14,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:14,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:14,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2025-02-08 05:11:14,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9871935601902672 [2025-02-08 05:11:14,938 INFO L175 Difference]: Start difference. First operand has 912 places, 911 transitions, 1840 flow. Second operand 3 states and 2698 transitions. [2025-02-08 05:11:14,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 904 places, 927 transitions, 1996 flow [2025-02-08 05:11:14,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 904 places, 927 transitions, 1992 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:14,949 INFO L231 Difference]: Finished difference. Result has 906 places, 910 transitions, 1896 flow [2025-02-08 05:11:14,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=911, PETRI_DIFFERENCE_MINUEND_FLOW=1818, PETRI_DIFFERENCE_MINUEND_PLACES=902, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=901, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=892, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1896, PETRI_PLACES=906, PETRI_TRANSITIONS=910} [2025-02-08 05:11:14,950 INFO L279 CegarLoopForPetriNet]: 912 programPoint places, -6 predicate places. [2025-02-08 05:11:14,951 INFO L471 AbstractCegarLoop]: Abstraction has has 906 places, 910 transitions, 1896 flow [2025-02-08 05:11:14,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 878.3333333333334) internal successors, (2635), 3 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:14,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:14,952 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:14,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:11:14,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err10ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:11:14,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:14,954 INFO L85 PathProgramCache]: Analyzing trace with hash 772047543, now seen corresponding path program 1 times [2025-02-08 05:11:14,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:14,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569144944] [2025-02-08 05:11:14,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:14,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:15,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-02-08 05:11:15,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-02-08 05:11:15,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:15,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:15,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:15,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:15,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569144944] [2025-02-08 05:11:15,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569144944] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:15,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:15,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:15,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334364484] [2025-02-08 05:11:15,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:15,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:15,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:15,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:15,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:15,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 880 out of 911 [2025-02-08 05:11:15,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 906 places, 910 transitions, 1896 flow. Second operand has 3 states, 3 states have (on average 882.0) internal successors, (2646), 3 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:15,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:15,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 880 of 911 [2025-02-08 05:11:15,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:16,996 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3525] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread2of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|, thr1Thread2of3ForFork0_#t~ret19#1=|v_thr1Thread2of3ForFork0_#t~ret19#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_#t~ret19#1][727], [913#true, 909#true, 917#(= |#race~state~0| 0), 500#L766-2true, 565#L755-2true, 911#true, 444#L758-1true, Black: 915#true, 920#true, 52#L758-1true]) [2025-02-08 05:11:16,997 INFO L294 olderBase$Statistics]: this new event has 731 ancestors and is cut-off event [2025-02-08 05:11:16,997 INFO L297 olderBase$Statistics]: existing Event has 720 ancestors and is cut-off event [2025-02-08 05:11:16,997 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-08 05:11:16,997 INFO L297 olderBase$Statistics]: existing Event has 720 ancestors and is cut-off event [2025-02-08 05:11:17,288 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3371] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][772], [913#true, 909#true, 171#L706-4true, 500#L766-2true, 911#true, 915#true, Black: 917#(= |#race~state~0| 0), 444#L758-1true, 351#L758-1true, 920#true]) [2025-02-08 05:11:17,288 INFO L294 olderBase$Statistics]: this new event has 733 ancestors and is cut-off event [2025-02-08 05:11:17,288 INFO L297 olderBase$Statistics]: existing Event has 722 ancestors and is cut-off event [2025-02-08 05:11:17,288 INFO L297 olderBase$Statistics]: existing Event has 733 ancestors and is cut-off event [2025-02-08 05:11:17,289 INFO L297 olderBase$Statistics]: existing Event has 722 ancestors and is cut-off event [2025-02-08 05:11:17,496 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3371] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][772], [913#true, 909#true, 17#L706-2true, 500#L766-2true, 911#true, 915#true, Black: 917#(= |#race~state~0| 0), 444#L758-1true, 351#L758-1true, 920#true]) [2025-02-08 05:11:17,496 INFO L294 olderBase$Statistics]: this new event has 735 ancestors and is cut-off event [2025-02-08 05:11:17,496 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-02-08 05:11:17,496 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-02-08 05:11:17,496 INFO L297 olderBase$Statistics]: existing Event has 735 ancestors and is cut-off event [2025-02-08 05:11:17,609 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3371] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][805], [913#true, 909#true, 500#L766-2true, 911#true, 915#true, Black: 917#(= |#race~state~0| 0), 444#L758-1true, 351#L758-1true, 922#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet5#1|), 237#L706true]) [2025-02-08 05:11:17,609 INFO L294 olderBase$Statistics]: this new event has 736 ancestors and is cut-off event [2025-02-08 05:11:17,609 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-02-08 05:11:17,609 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-02-08 05:11:17,609 INFO L297 olderBase$Statistics]: existing Event has 736 ancestors and is cut-off event [2025-02-08 05:11:17,714 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3371] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][805], [913#true, 909#true, 4#L706-1true, 500#L766-2true, 911#true, 915#true, Black: 917#(= |#race~state~0| 0), 444#L758-1true, 351#L758-1true, 922#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet5#1|)]) [2025-02-08 05:11:17,714 INFO L294 olderBase$Statistics]: this new event has 737 ancestors and is cut-off event [2025-02-08 05:11:17,715 INFO L297 olderBase$Statistics]: existing Event has 726 ancestors and is cut-off event [2025-02-08 05:11:17,715 INFO L297 olderBase$Statistics]: existing Event has 737 ancestors and is cut-off event [2025-02-08 05:11:17,715 INFO L297 olderBase$Statistics]: existing Event has 726 ancestors and is cut-off event [2025-02-08 05:11:17,830 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3371] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][772], [913#true, 909#true, 277#L754-1true, 500#L766-2true, 911#true, 915#true, Black: 917#(= |#race~state~0| 0), 444#L758-1true, 351#L758-1true, 920#true]) [2025-02-08 05:11:17,830 INFO L294 olderBase$Statistics]: this new event has 738 ancestors and is cut-off event [2025-02-08 05:11:17,830 INFO L297 olderBase$Statistics]: existing Event has 738 ancestors and is cut-off event [2025-02-08 05:11:17,830 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:11:17,830 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:11:17,952 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3371] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][772], [913#true, 909#true, 500#L766-2true, 911#true, 915#true, Black: 917#(= |#race~state~0| 0), 444#L758-1true, 351#L758-1true, 920#true, 163#L754true]) [2025-02-08 05:11:17,952 INFO L294 olderBase$Statistics]: this new event has 739 ancestors and is cut-off event [2025-02-08 05:11:17,952 INFO L297 olderBase$Statistics]: existing Event has 739 ancestors and is cut-off event [2025-02-08 05:11:17,952 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-02-08 05:11:17,953 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-02-08 05:11:19,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3525] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread2of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|, thr1Thread2of3ForFork0_#t~ret19#1=|v_thr1Thread2of3ForFork0_#t~ret19#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_#t~ret19#1][727], [913#true, 909#true, 917#(= |#race~state~0| 0), 500#L766-2true, 565#L755-2true, 911#true, 444#L758-1true, Black: 915#true, 269#L694true, 920#true]) [2025-02-08 05:11:19,035 INFO L294 olderBase$Statistics]: this new event has 747 ancestors and is cut-off event [2025-02-08 05:11:19,035 INFO L297 olderBase$Statistics]: existing Event has 736 ancestors and is cut-off event [2025-02-08 05:11:19,035 INFO L297 olderBase$Statistics]: existing Event has 736 ancestors and is cut-off event [2025-02-08 05:11:19,036 INFO L297 olderBase$Statistics]: existing Event has 747 ancestors and is cut-off event [2025-02-08 05:11:19,164 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3371] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][772], [913#true, 909#true, 171#L706-4true, 500#L766-2true, 911#true, 915#true, Black: 917#(= |#race~state~0| 0), 351#L758-1true, 920#true, 594#L694true]) [2025-02-08 05:11:19,164 INFO L294 olderBase$Statistics]: this new event has 749 ancestors and is cut-off event [2025-02-08 05:11:19,164 INFO L297 olderBase$Statistics]: existing Event has 738 ancestors and is cut-off event [2025-02-08 05:11:19,164 INFO L297 olderBase$Statistics]: existing Event has 738 ancestors and is cut-off event [2025-02-08 05:11:19,164 INFO L297 olderBase$Statistics]: existing Event has 749 ancestors and is cut-off event [2025-02-08 05:11:19,290 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3371] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][772], [913#true, 909#true, 17#L706-2true, 500#L766-2true, 911#true, 915#true, Black: 917#(= |#race~state~0| 0), 351#L758-1true, 920#true, 594#L694true]) [2025-02-08 05:11:19,291 INFO L294 olderBase$Statistics]: this new event has 751 ancestors and is cut-off event [2025-02-08 05:11:19,291 INFO L297 olderBase$Statistics]: existing Event has 740 ancestors and is cut-off event [2025-02-08 05:11:19,291 INFO L297 olderBase$Statistics]: existing Event has 751 ancestors and is cut-off event [2025-02-08 05:11:19,291 INFO L297 olderBase$Statistics]: existing Event has 740 ancestors and is cut-off event [2025-02-08 05:11:19,352 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3371] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][805], [913#true, 909#true, 500#L766-2true, 911#true, 915#true, Black: 917#(= |#race~state~0| 0), 351#L758-1true, 922#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet5#1|), 237#L706true, 594#L694true]) [2025-02-08 05:11:19,352 INFO L294 olderBase$Statistics]: this new event has 752 ancestors and is cut-off event [2025-02-08 05:11:19,352 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-08 05:11:19,352 INFO L297 olderBase$Statistics]: existing Event has 752 ancestors and is cut-off event [2025-02-08 05:11:19,352 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-08 05:11:19,376 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3525] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread2of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|, thr1Thread2of3ForFork0_#t~ret19#1=|v_thr1Thread2of3ForFork0_#t~ret19#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_#t~ret19#1][727], [913#true, 909#true, 917#(= |#race~state~0| 0), 500#L766-2true, 565#L755-2true, 911#true, 444#L758-1true, Black: 915#true, 920#true, 98#L696true]) [2025-02-08 05:11:19,377 INFO L294 olderBase$Statistics]: this new event has 752 ancestors and is cut-off event [2025-02-08 05:11:19,377 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-08 05:11:19,377 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-08 05:11:19,377 INFO L297 olderBase$Statistics]: existing Event has 752 ancestors and is cut-off event [2025-02-08 05:11:19,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3371] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][805], [913#true, 909#true, 4#L706-1true, 500#L766-2true, 911#true, 915#true, Black: 917#(= |#race~state~0| 0), 351#L758-1true, 922#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet5#1|), 594#L694true]) [2025-02-08 05:11:19,410 INFO L294 olderBase$Statistics]: this new event has 753 ancestors and is cut-off event [2025-02-08 05:11:19,411 INFO L297 olderBase$Statistics]: existing Event has 742 ancestors and is cut-off event [2025-02-08 05:11:19,411 INFO L297 olderBase$Statistics]: existing Event has 742 ancestors and is cut-off event [2025-02-08 05:11:19,411 INFO L297 olderBase$Statistics]: existing Event has 753 ancestors and is cut-off event [2025-02-08 05:11:19,471 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3371] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][772], [913#true, 909#true, 277#L754-1true, 500#L766-2true, 911#true, 915#true, Black: 917#(= |#race~state~0| 0), 351#L758-1true, 920#true, 594#L694true]) [2025-02-08 05:11:19,471 INFO L294 olderBase$Statistics]: this new event has 754 ancestors and is cut-off event [2025-02-08 05:11:19,471 INFO L297 olderBase$Statistics]: existing Event has 743 ancestors and is cut-off event [2025-02-08 05:11:19,472 INFO L297 olderBase$Statistics]: existing Event has 743 ancestors and is cut-off event [2025-02-08 05:11:19,472 INFO L297 olderBase$Statistics]: existing Event has 754 ancestors and is cut-off event [2025-02-08 05:11:19,491 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3371] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][772], [913#true, 909#true, 171#L706-4true, 500#L766-2true, 911#true, 915#true, Black: 917#(= |#race~state~0| 0), 282#L696true, 351#L758-1true, 920#true]) [2025-02-08 05:11:19,491 INFO L294 olderBase$Statistics]: this new event has 754 ancestors and is cut-off event [2025-02-08 05:11:19,491 INFO L297 olderBase$Statistics]: existing Event has 754 ancestors and is cut-off event [2025-02-08 05:11:19,491 INFO L297 olderBase$Statistics]: existing Event has 743 ancestors and is cut-off event [2025-02-08 05:11:19,491 INFO L297 olderBase$Statistics]: existing Event has 743 ancestors and is cut-off event [2025-02-08 05:11:19,534 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3371] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][772], [913#true, 909#true, 500#L766-2true, 911#true, 915#true, Black: 917#(= |#race~state~0| 0), 351#L758-1true, 920#true, 163#L754true, 594#L694true]) [2025-02-08 05:11:19,534 INFO L294 olderBase$Statistics]: this new event has 755 ancestors and is cut-off event [2025-02-08 05:11:19,534 INFO L297 olderBase$Statistics]: existing Event has 744 ancestors and is cut-off event [2025-02-08 05:11:19,534 INFO L297 olderBase$Statistics]: existing Event has 755 ancestors and is cut-off event [2025-02-08 05:11:19,534 INFO L297 olderBase$Statistics]: existing Event has 744 ancestors and is cut-off event [2025-02-08 05:11:19,595 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3371] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][772], [913#true, 909#true, 17#L706-2true, 500#L766-2true, 911#true, 915#true, Black: 917#(= |#race~state~0| 0), 282#L696true, 351#L758-1true, 920#true]) [2025-02-08 05:11:19,595 INFO L294 olderBase$Statistics]: this new event has 756 ancestors and is cut-off event [2025-02-08 05:11:19,595 INFO L297 olderBase$Statistics]: existing Event has 756 ancestors and is cut-off event [2025-02-08 05:11:19,596 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-02-08 05:11:19,596 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-02-08 05:11:19,647 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3371] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][805], [913#true, 909#true, 500#L766-2true, 911#true, 915#true, Black: 917#(= |#race~state~0| 0), 282#L696true, 351#L758-1true, 922#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet5#1|), 237#L706true]) [2025-02-08 05:11:19,648 INFO L294 olderBase$Statistics]: this new event has 757 ancestors and is cut-off event [2025-02-08 05:11:19,648 INFO L297 olderBase$Statistics]: existing Event has 746 ancestors and is cut-off event [2025-02-08 05:11:19,648 INFO L297 olderBase$Statistics]: existing Event has 757 ancestors and is cut-off event [2025-02-08 05:11:19,648 INFO L297 olderBase$Statistics]: existing Event has 746 ancestors and is cut-off event [2025-02-08 05:11:19,936 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3371] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][805], [913#true, 909#true, 4#L706-1true, 500#L766-2true, 911#true, 915#true, Black: 917#(= |#race~state~0| 0), 282#L696true, 351#L758-1true, 922#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet5#1|)]) [2025-02-08 05:11:19,937 INFO L294 olderBase$Statistics]: this new event has 758 ancestors and is cut-off event [2025-02-08 05:11:19,937 INFO L297 olderBase$Statistics]: existing Event has 747 ancestors and is cut-off event [2025-02-08 05:11:19,937 INFO L297 olderBase$Statistics]: existing Event has 747 ancestors and is cut-off event [2025-02-08 05:11:19,937 INFO L297 olderBase$Statistics]: existing Event has 758 ancestors and is cut-off event [2025-02-08 05:11:19,983 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3371] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][772], [913#true, 909#true, 277#L754-1true, 500#L766-2true, 911#true, 915#true, Black: 917#(= |#race~state~0| 0), 282#L696true, 351#L758-1true, 920#true]) [2025-02-08 05:11:19,983 INFO L294 olderBase$Statistics]: this new event has 759 ancestors and is cut-off event [2025-02-08 05:11:19,983 INFO L297 olderBase$Statistics]: existing Event has 748 ancestors and is cut-off event [2025-02-08 05:11:19,983 INFO L297 olderBase$Statistics]: existing Event has 759 ancestors and is cut-off event [2025-02-08 05:11:19,984 INFO L297 olderBase$Statistics]: existing Event has 748 ancestors and is cut-off event [2025-02-08 05:11:20,033 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3371] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][772], [913#true, 909#true, 500#L766-2true, 911#true, 915#true, Black: 917#(= |#race~state~0| 0), 282#L696true, 351#L758-1true, 920#true, 163#L754true]) [2025-02-08 05:11:20,033 INFO L294 olderBase$Statistics]: this new event has 760 ancestors and is cut-off event [2025-02-08 05:11:20,033 INFO L297 olderBase$Statistics]: existing Event has 760 ancestors and is cut-off event [2025-02-08 05:11:20,033 INFO L297 olderBase$Statistics]: existing Event has 749 ancestors and is cut-off event [2025-02-08 05:11:20,033 INFO L297 olderBase$Statistics]: existing Event has 749 ancestors and is cut-off event [2025-02-08 05:11:20,133 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3525] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread2of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|, thr1Thread2of3ForFork0_#t~ret19#1=|v_thr1Thread2of3ForFork0_#t~ret19#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_#t~ret19#1][727], [913#true, 909#true, 424#L701true, 917#(= |#race~state~0| 0), 500#L766-2true, 565#L755-2true, 911#true, Black: 915#true, 444#L758-1true, 920#true]) [2025-02-08 05:11:20,133 INFO L294 olderBase$Statistics]: this new event has 762 ancestors and is cut-off event [2025-02-08 05:11:20,133 INFO L297 olderBase$Statistics]: existing Event has 751 ancestors and is cut-off event [2025-02-08 05:11:20,133 INFO L297 olderBase$Statistics]: existing Event has 751 ancestors and is cut-off event [2025-02-08 05:11:20,133 INFO L297 olderBase$Statistics]: existing Event has 762 ancestors and is cut-off event [2025-02-08 05:11:20,201 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3371] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][772], [913#true, 909#true, 171#L706-4true, 500#L766-2true, 911#true, 915#true, Black: 917#(= |#race~state~0| 0), 351#L758-1true, 920#true, 108#L701true]) [2025-02-08 05:11:20,202 INFO L294 olderBase$Statistics]: this new event has 764 ancestors and is cut-off event [2025-02-08 05:11:20,202 INFO L297 olderBase$Statistics]: existing Event has 764 ancestors and is cut-off event [2025-02-08 05:11:20,202 INFO L297 olderBase$Statistics]: existing Event has 753 ancestors and is cut-off event [2025-02-08 05:11:20,202 INFO L297 olderBase$Statistics]: existing Event has 753 ancestors and is cut-off event [2025-02-08 05:11:20,272 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3371] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][772], [913#true, 909#true, 17#L706-2true, 500#L766-2true, 911#true, 915#true, Black: 917#(= |#race~state~0| 0), 351#L758-1true, 920#true, 108#L701true]) [2025-02-08 05:11:20,273 INFO L294 olderBase$Statistics]: this new event has 766 ancestors and is cut-off event [2025-02-08 05:11:20,273 INFO L297 olderBase$Statistics]: existing Event has 755 ancestors and is cut-off event [2025-02-08 05:11:20,273 INFO L297 olderBase$Statistics]: existing Event has 766 ancestors and is cut-off event [2025-02-08 05:11:20,273 INFO L297 olderBase$Statistics]: existing Event has 755 ancestors and is cut-off event [2025-02-08 05:11:20,304 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3371] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][805], [913#true, 909#true, 500#L766-2true, 911#true, 915#true, Black: 917#(= |#race~state~0| 0), 351#L758-1true, 108#L701true, 922#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet5#1|), 237#L706true]) [2025-02-08 05:11:20,305 INFO L294 olderBase$Statistics]: this new event has 767 ancestors and is cut-off event [2025-02-08 05:11:20,305 INFO L297 olderBase$Statistics]: existing Event has 767 ancestors and is cut-off event [2025-02-08 05:11:20,305 INFO L297 olderBase$Statistics]: existing Event has 756 ancestors and is cut-off event [2025-02-08 05:11:20,305 INFO L297 olderBase$Statistics]: existing Event has 756 ancestors and is cut-off event [2025-02-08 05:11:20,333 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3371] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][805], [913#true, 909#true, 4#L706-1true, 500#L766-2true, 911#true, 915#true, Black: 917#(= |#race~state~0| 0), 351#L758-1true, 108#L701true, 922#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet5#1|)]) [2025-02-08 05:11:20,334 INFO L294 olderBase$Statistics]: this new event has 768 ancestors and is cut-off event [2025-02-08 05:11:20,334 INFO L297 olderBase$Statistics]: existing Event has 768 ancestors and is cut-off event [2025-02-08 05:11:20,334 INFO L297 olderBase$Statistics]: existing Event has 757 ancestors and is cut-off event [2025-02-08 05:11:20,334 INFO L297 olderBase$Statistics]: existing Event has 757 ancestors and is cut-off event [2025-02-08 05:11:20,365 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3371] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][772], [913#true, 909#true, 277#L754-1true, 500#L766-2true, 911#true, 915#true, Black: 917#(= |#race~state~0| 0), 351#L758-1true, 920#true, 108#L701true]) [2025-02-08 05:11:20,365 INFO L294 olderBase$Statistics]: this new event has 769 ancestors and is cut-off event [2025-02-08 05:11:20,365 INFO L297 olderBase$Statistics]: existing Event has 758 ancestors and is cut-off event [2025-02-08 05:11:20,365 INFO L297 olderBase$Statistics]: existing Event has 758 ancestors and is cut-off event [2025-02-08 05:11:20,365 INFO L297 olderBase$Statistics]: existing Event has 769 ancestors and is cut-off event [2025-02-08 05:11:20,397 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3371] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][772], [913#true, 909#true, 500#L766-2true, 911#true, 915#true, Black: 917#(= |#race~state~0| 0), 351#L758-1true, 920#true, 108#L701true, 163#L754true]) [2025-02-08 05:11:20,397 INFO L294 olderBase$Statistics]: this new event has 770 ancestors and is cut-off event [2025-02-08 05:11:20,397 INFO L297 olderBase$Statistics]: existing Event has 759 ancestors and is cut-off event [2025-02-08 05:11:20,397 INFO L297 olderBase$Statistics]: existing Event has 759 ancestors and is cut-off event [2025-02-08 05:11:20,397 INFO L297 olderBase$Statistics]: existing Event has 770 ancestors and is cut-off event [2025-02-08 05:11:20,967 INFO L124 PetriNetUnfolderBase]: 5390/31765 cut-off events. [2025-02-08 05:11:20,967 INFO L125 PetriNetUnfolderBase]: For 1023/1028 co-relation queries the response was YES. [2025-02-08 05:11:21,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41135 conditions, 31765 events. 5390/31765 cut-off events. For 1023/1028 co-relation queries the response was YES. Maximal size of possible extension queue 806. Compared 446370 event pairs, 2966 based on Foata normal form. 0/27543 useless extension candidates. Maximal degree in co-relation 40223. Up to 6307 conditions per place. [2025-02-08 05:11:21,241 INFO L140 encePairwiseOnDemand]: 905/911 looper letters, 38 selfloop transitions, 5 changer transitions 0/926 dead transitions. [2025-02-08 05:11:21,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 908 places, 926 transitions, 2024 flow [2025-02-08 05:11:21,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:21,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:21,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2684 transitions. [2025-02-08 05:11:21,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.982070984266374 [2025-02-08 05:11:21,245 INFO L175 Difference]: Start difference. First operand has 906 places, 910 transitions, 1896 flow. Second operand 3 states and 2684 transitions. [2025-02-08 05:11:21,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 908 places, 926 transitions, 2024 flow [2025-02-08 05:11:21,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 906 places, 926 transitions, 2006 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:11:21,265 INFO L231 Difference]: Finished difference. Result has 908 places, 914 transitions, 1916 flow [2025-02-08 05:11:21,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=911, PETRI_DIFFERENCE_MINUEND_FLOW=1878, PETRI_DIFFERENCE_MINUEND_PLACES=904, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=910, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=905, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1916, PETRI_PLACES=908, PETRI_TRANSITIONS=914} [2025-02-08 05:11:21,267 INFO L279 CegarLoopForPetriNet]: 912 programPoint places, -4 predicate places. [2025-02-08 05:11:21,267 INFO L471 AbstractCegarLoop]: Abstraction has has 908 places, 914 transitions, 1916 flow [2025-02-08 05:11:21,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 882.0) internal successors, (2646), 3 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:21,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:21,269 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:21,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:11:21,269 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:11:21,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:21,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1301113064, now seen corresponding path program 1 times [2025-02-08 05:11:21,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:21,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708263017] [2025-02-08 05:11:21,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:21,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:21,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 689 statements into 1 equivalence classes. [2025-02-08 05:11:21,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 689 of 689 statements. [2025-02-08 05:11:21,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:21,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:21,447 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:11:21,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 689 statements into 1 equivalence classes. [2025-02-08 05:11:21,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 689 of 689 statements. [2025-02-08 05:11:21,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:21,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:21,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:11:21,637 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:11:21,637 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2025-02-08 05:11:21,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2025-02-08 05:11:21,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2025-02-08 05:11:21,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2025-02-08 05:11:21,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2025-02-08 05:11:21,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2025-02-08 05:11:21,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2025-02-08 05:11:21,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2025-02-08 05:11:21,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining) [2025-02-08 05:11:21,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2025-02-08 05:11:21,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2025-02-08 05:11:21,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2025-02-08 05:11:21,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2025-02-08 05:11:21,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2025-02-08 05:11:21,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2025-02-08 05:11:21,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (13 of 29 remaining) [2025-02-08 05:11:21,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (12 of 29 remaining) [2025-02-08 05:11:21,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2025-02-08 05:11:21,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2025-02-08 05:11:21,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2025-02-08 05:11:21,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2025-02-08 05:11:21,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2025-02-08 05:11:21,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2025-02-08 05:11:21,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2025-02-08 05:11:21,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2025-02-08 05:11:21,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2025-02-08 05:11:21,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2025-02-08 05:11:21,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2025-02-08 05:11:21,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2025-02-08 05:11:21,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:11:21,639 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 05:11:21,639 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:11:21,639 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 05:11:21,685 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:21,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 990 places, 989 transitions, 2006 flow [2025-02-08 05:11:21,811 INFO L124 PetriNetUnfolderBase]: 8/1023 cut-off events. [2025-02-08 05:11:21,812 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 05:11:21,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1042 conditions, 1023 events. 8/1023 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1553 event pairs, 0 based on Foata normal form. 0/974 useless extension candidates. Maximal degree in co-relation 944. Up to 5 conditions per place. [2025-02-08 05:11:21,818 INFO L82 GeneralOperation]: Start removeDead. Operand has 990 places, 989 transitions, 2006 flow [2025-02-08 05:11:21,827 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 990 places, 989 transitions, 2006 flow [2025-02-08 05:11:21,828 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:21,829 INFO L333 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, 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;@2da2c3a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:21,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-02-08 05:11:21,868 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:21,869 INFO L124 PetriNetUnfolderBase]: 0/688 cut-off events. [2025-02-08 05:11:21,869 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:11:21,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:21,869 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:21,869 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err11ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-02-08 05:11:21,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:21,871 INFO L85 PathProgramCache]: Analyzing trace with hash 943872130, now seen corresponding path program 1 times [2025-02-08 05:11:21,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:21,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348766376] [2025-02-08 05:11:21,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:21,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:21,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 676 statements into 1 equivalence classes. [2025-02-08 05:11:21,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 676 of 676 statements. [2025-02-08 05:11:21,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:21,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:22,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:22,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:22,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348766376] [2025-02-08 05:11:22,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348766376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:22,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:22,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:22,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051960256] [2025-02-08 05:11:22,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:22,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:22,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:22,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:22,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:22,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 989 [2025-02-08 05:11:22,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 990 places, 989 transitions, 2006 flow. Second operand has 3 states, 3 states have (on average 945.3333333333334) internal successors, (2836), 3 states have internal predecessors, (2836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:22,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:22,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 989 [2025-02-08 05:11:22,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand