./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-atomic/scull.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-atomic/scull.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 aa00f20131f5095ed14e7a46332bb5342dc26be5a17ecfa68bf5b51120e1579b --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:09:43,751 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:09:43,804 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:09:43,807 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:09:43,807 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:09:43,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:09:43,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:09:43,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:09:43,821 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:09:43,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:09:43,821 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:09:43,821 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:09:43,821 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:09:43,821 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:09:43,821 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:09:43,821 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:09:43,822 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:09:43,822 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:09:43,822 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:09:43,822 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:09:43,822 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:09:43,822 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:09:43,822 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:09:43,822 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:09:43,822 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:09:43,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:09:43,822 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:09:43,822 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:09:43,822 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:09:43,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:09:43,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:09:43,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:09:43,823 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:09:43,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:09:43,823 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:09:43,823 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:09:43,823 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:09:43,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:09:43,823 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:09:43,823 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:09:43,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:09:43,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:09:43,824 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 -> aa00f20131f5095ed14e7a46332bb5342dc26be5a17ecfa68bf5b51120e1579b [2025-02-08 05:09:44,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:09:44,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:09:44,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:09:44,030 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:09:44,030 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:09:44,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/scull.i [2025-02-08 05:09:45,172 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/592bcd570/ae9647d2b39946b98de58a578f673197/FLAGe66debbb3 [2025-02-08 05:09:45,517 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:09:45,517 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-atomic/scull.i [2025-02-08 05:09:45,533 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/592bcd570/ae9647d2b39946b98de58a578f673197/FLAGe66debbb3 [2025-02-08 05:09:45,547 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/592bcd570/ae9647d2b39946b98de58a578f673197 [2025-02-08 05:09:45,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:09:45,550 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:09:45,551 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:09:45,551 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:09:45,555 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:09:45,556 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:09:45" (1/1) ... [2025-02-08 05:09:45,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27adf4f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:45, skipping insertion in model container [2025-02-08 05:09:45,557 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:09:45" (1/1) ... [2025-02-08 05:09:45,584 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:09:45,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:09:45,871 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:09:45,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:09:45,948 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:09:45,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:45 WrapperNode [2025-02-08 05:09:45,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:09:45,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:09:45,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:09:45,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:09:45,955 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:09:45" (1/1) ... [2025-02-08 05:09:45,969 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:09:45" (1/1) ... [2025-02-08 05:09:45,990 INFO L138 Inliner]: procedures = 185, calls = 55, calls flagged for inlining = 32, calls inlined = 29, statements flattened = 531 [2025-02-08 05:09:45,991 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:09:45,991 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:09:45,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:09:45,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:09:45,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:45" (1/1) ... [2025-02-08 05:09:45,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:45" (1/1) ... [2025-02-08 05:09:46,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:45" (1/1) ... [2025-02-08 05:09:46,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:45" (1/1) ... [2025-02-08 05:09:46,016 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:45" (1/1) ... [2025-02-08 05:09:46,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:45" (1/1) ... [2025-02-08 05:09:46,025 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:45" (1/1) ... [2025-02-08 05:09:46,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:45" (1/1) ... [2025-02-08 05:09:46,029 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:09:46,029 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:09:46,029 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:09:46,030 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:09:46,030 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:45" (1/1) ... [2025-02-08 05:09:46,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:09:46,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:09:46,053 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:09:46,059 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:09:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:09:46,073 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:09:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:09:46,073 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:09:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:09:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:09:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure loader [2025-02-08 05:09:46,074 INFO L138 BoogieDeclarations]: Found implementation of procedure loader [2025-02-08 05:09:46,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:09:46,075 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:09:46,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:09:46,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:09:46,076 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:09:46,229 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:09:46,231 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:09:46,372 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L721-5: assume #race~dev_size~0 == scull_trim_#t~nondet9#1; [2025-02-08 05:09:46,372 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L721-5: assume !(#race~dev_size~0 == scull_trim_#t~nondet9#1); [2025-02-08 05:09:46,372 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L721-6: havoc scull_trim_#t~nondet9#1; [2025-02-08 05:09:46,372 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L721-7: #race~dev_size~0 := scull_trim_#t~nondet9#1; [2025-02-08 05:09:46,372 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L721-8: havoc scull_trim_#t~nondet9#1; [2025-02-08 05:09:46,372 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L721-9: ~dev_size~0 := 0; [2025-02-08 05:09:46,372 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L722-7: assume #race~dev_quantum~0 == scull_trim_#t~nondet10#1; [2025-02-08 05:09:46,372 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L722-7: assume !(#race~dev_quantum~0 == scull_trim_#t~nondet10#1); [2025-02-08 05:09:46,373 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L722-8: havoc scull_trim_#t~nondet10#1; [2025-02-08 05:09:46,373 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L722-9: #race~dev_quantum~0 := scull_trim_#t~nondet10#1; [2025-02-08 05:09:46,373 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L722-10: havoc scull_trim_#t~nondet10#1; [2025-02-08 05:09:46,373 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L722-11: assume 0 == #race~scull_quantum~0; [2025-02-08 05:09:46,373 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L722-11: assume !(0 == #race~scull_quantum~0); [2025-02-08 05:09:46,373 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L722-12: ~dev_quantum~0 := ~scull_quantum~0; [2025-02-08 05:09:46,373 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L722-13: #race~scull_quantum~0 := 0; [2025-02-08 05:09:46,373 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723-7: assume #race~dev_qset~0 == scull_trim_#t~nondet11#1; [2025-02-08 05:09:46,373 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723-7: assume !(#race~dev_qset~0 == scull_trim_#t~nondet11#1); [2025-02-08 05:09:46,373 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723-8: havoc scull_trim_#t~nondet11#1; [2025-02-08 05:09:46,373 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723-9: #race~dev_qset~0 := scull_trim_#t~nondet11#1; [2025-02-08 05:09:46,374 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723-10: havoc scull_trim_#t~nondet11#1; [2025-02-08 05:09:46,374 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723-11: assume 0 == #race~scull_qset~0; [2025-02-08 05:09:46,374 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723-11: assume !(0 == #race~scull_qset~0); [2025-02-08 05:09:46,374 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723-12: ~dev_qset~0 := ~scull_qset~0; [2025-02-08 05:09:46,374 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723-13: #race~scull_qset~0 := 0; [2025-02-08 05:09:46,374 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L897: assume { :end_inline_scull_cleanup_module } true;scull_init_module_#res#1 := scull_init_module_~result~0#1; [2025-02-08 05:09:46,374 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L897-1: havoc scull_cleanup_module_#t~nondet42#1, scull_cleanup_module_#t~ret43#1, scull_cleanup_module_~dev~4#1; [2025-02-08 05:09:46,374 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L897-2: assume { :begin_inline_scull_cleanup_module } true;havoc scull_cleanup_module_#t~nondet42#1, scull_cleanup_module_#t~ret43#1, scull_cleanup_module_~dev~4#1; [2025-02-08 05:09:46,374 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L889-4: havoc scull_cleanup_module_#t~nondet42#1; [2025-02-08 05:09:46,374 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L889-5: scull_cleanup_module_~dev~4#1 := scull_cleanup_module_#t~nondet42#1; [2025-02-08 05:09:46,374 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L889-6: assume -2147483648 <= scull_cleanup_module_#t~nondet42#1 && scull_cleanup_module_#t~nondet42#1 <= 2147483647; [2025-02-08 05:09:46,374 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L889-7: havoc scull_cleanup_module_#t~nondet42#1; [2025-02-08 05:09:46,375 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L724-5: assume #race~dev_data~0 == scull_trim_#t~nondet12#1; [2025-02-08 05:09:46,375 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L724-5: assume !(#race~dev_data~0 == scull_trim_#t~nondet12#1); [2025-02-08 05:09:46,375 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L724-6: havoc scull_trim_#t~nondet12#1; [2025-02-08 05:09:46,375 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L724-7: #race~dev_data~0 := scull_trim_#t~nondet12#1; [2025-02-08 05:09:46,375 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L724-8: havoc scull_trim_#t~nondet12#1; [2025-02-08 05:09:46,375 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L724-9: ~dev_data~0 := 0; [2025-02-08 05:09:46,375 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L725-1: scull_trim_#res#1 := 0; [2025-02-08 05:09:46,375 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L890-8: havoc scull_cleanup_module_#t~ret43#1; [2025-02-08 05:09:46,375 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L890-9: assume { :end_inline_scull_trim } true;assume -2147483648 <= scull_cleanup_module_#t~ret43#1 && scull_cleanup_module_#t~ret43#1 <= 2147483647; [2025-02-08 05:09:46,375 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L890-10: havoc scull_trim_#in~dev#1; [2025-02-08 05:09:46,375 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L890-11: havoc scull_trim_#t~nondet9#1, scull_trim_#t~nondet10#1, scull_trim_#t~nondet11#1, scull_trim_#t~nondet12#1, scull_trim_~dev#1, scull_trim_~qset~0#1; [2025-02-08 05:09:46,376 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L890-12: scull_cleanup_module_#t~ret43#1 := scull_trim_#res#1; [2025-02-08 05:09:46,376 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L890-13: havoc scull_trim_#t~nondet9#1, scull_trim_#t~nondet10#1, scull_trim_#t~nondet11#1, scull_trim_#t~nondet12#1, scull_trim_~dev#1, scull_trim_~qset~0#1; [2025-02-08 05:09:46,376 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L890-14: havoc scull_trim_#res#1; [2025-02-08 05:09:46,376 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L890-15: assume { :begin_inline_scull_trim } true;scull_trim_#in~dev#1 := scull_cleanup_module_~dev~4#1; [2025-02-08 05:09:46,376 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L718-1: scull_trim_~dev#1 := scull_trim_#in~dev#1; [2025-02-08 05:09:46,376 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-3: assume 0 == #race~dev_qset~0; [2025-02-08 05:09:46,376 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-3: assume !(0 == #race~dev_qset~0); [2025-02-08 05:09:46,376 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-4: scull_trim_~qset~0#1 := ~dev_qset~0; [2025-02-08 05:09:46,376 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-5: #race~dev_qset~0 := 0; [2025-02-08 05:09:46,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L697: havoc copy_to_user_#t~nondet5#1; [2025-02-08 05:09:46,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L741: havoc scull_follow_#t~nondet16#1; [2025-02-08 05:09:46,704 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701: havoc copy_from_user_#t~nondet6#1; [2025-02-08 05:09:46,704 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L741: havoc scull_follow_#t~nondet16#1; [2025-02-08 05:09:46,749 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:09:46,749 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:09:46,803 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:09:46,804 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:09:46,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:09:46 BoogieIcfgContainer [2025-02-08 05:09:46,804 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:09:46,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:09:46,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:09:46,809 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:09:46,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:09:45" (1/3) ... [2025-02-08 05:09:46,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670d5ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:09:46, skipping insertion in model container [2025-02-08 05:09:46,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:45" (2/3) ... [2025-02-08 05:09:46,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670d5ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:09:46, skipping insertion in model container [2025-02-08 05:09:46,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:09:46" (3/3) ... [2025-02-08 05:09:46,810 INFO L128 eAbstractionObserver]: Analyzing ICFG scull.i [2025-02-08 05:09:46,821 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:09:46,822 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG scull.i that has 4 procedures, 577 locations, 1 initial locations, 0 loop locations, and 49 error locations. [2025-02-08 05:09:46,822 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:09:46,926 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:09:46,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 586 places, 590 transitions, 1201 flow [2025-02-08 05:09:47,162 INFO L124 PetriNetUnfolderBase]: 14/587 cut-off events. [2025-02-08 05:09:47,164 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:09:47,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 587 events. 14/587 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 1075 event pairs, 0 based on Foata normal form. 0/525 useless extension candidates. Maximal degree in co-relation 545. Up to 2 conditions per place. [2025-02-08 05:09:47,178 INFO L82 GeneralOperation]: Start removeDead. Operand has 586 places, 590 transitions, 1201 flow [2025-02-08 05:09:47,186 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 578 places, 582 transitions, 1179 flow [2025-02-08 05:09:47,192 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:09:47,208 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;@5ebdd75e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:09:47,209 INFO L334 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2025-02-08 05:09:47,224 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:09:47,224 INFO L124 PetriNetUnfolderBase]: 0/91 cut-off events. [2025-02-08 05:09:47,224 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:09:47,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:47,225 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] [2025-02-08 05:09:47,225 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err17ASSERT_VIOLATIONDATA_RACE === [loaderErr6ASSERT_VIOLATIONDATA_RACE, loaderErr5ASSERT_VIOLATIONDATA_RACE, loaderErr4ASSERT_VIOLATIONDATA_RACE, loaderErr3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-02-08 05:09:47,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:47,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2040188057, now seen corresponding path program 1 times [2025-02-08 05:09:47,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:47,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427468609] [2025-02-08 05:09:47,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:47,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:47,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 05:09:47,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 05:09:47,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:47,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:47,461 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:09:47,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:47,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427468609] [2025-02-08 05:09:47,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427468609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:47,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:47,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:47,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296970284] [2025-02-08 05:09:47,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:47,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:47,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:47,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:47,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:47,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 558 out of 590 [2025-02-08 05:09:47,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 582 transitions, 1179 flow. Second operand has 3 states, 3 states have (on average 559.3333333333334) internal successors, (1678), 3 states have internal predecessors, (1678), 0 states have call successors, (0), 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:09:47,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:47,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 558 of 590 [2025-02-08 05:09:47,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:48,523 INFO L124 PetriNetUnfolderBase]: 189/4300 cut-off events. [2025-02-08 05:09:48,523 INFO L125 PetriNetUnfolderBase]: For 182/187 co-relation queries the response was YES. [2025-02-08 05:09:48,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4624 conditions, 4300 events. 189/4300 cut-off events. For 182/187 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 31054 event pairs, 112 based on Foata normal form. 100/3903 useless extension candidates. Maximal degree in co-relation 4329. Up to 241 conditions per place. [2025-02-08 05:09:48,570 INFO L140 encePairwiseOnDemand]: 578/590 looper letters, 19 selfloop transitions, 2 changer transitions 0/568 dead transitions. [2025-02-08 05:09:48,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 568 transitions, 1199 flow [2025-02-08 05:09:48,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:48,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:48,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1705 transitions. [2025-02-08 05:09:48,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.963276836158192 [2025-02-08 05:09:48,592 INFO L175 Difference]: Start difference. First operand has 578 places, 582 transitions, 1179 flow. Second operand 3 states and 1705 transitions. [2025-02-08 05:09:48,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 568 transitions, 1199 flow [2025-02-08 05:09:48,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 568 transitions, 1187 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:09:48,608 INFO L231 Difference]: Finished difference. Result has 566 places, 566 transitions, 1148 flow [2025-02-08 05:09:48,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=590, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1148, PETRI_PLACES=566, PETRI_TRANSITIONS=566} [2025-02-08 05:09:48,613 INFO L279 CegarLoopForPetriNet]: 578 programPoint places, -12 predicate places. [2025-02-08 05:09:48,614 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 566 transitions, 1148 flow [2025-02-08 05:09:48,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 559.3333333333334) internal successors, (1678), 3 states have internal predecessors, (1678), 0 states have call successors, (0), 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:09:48,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:48,616 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] [2025-02-08 05:09:48,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:09:48,617 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting loaderErr6ASSERT_VIOLATIONDATA_RACE === [loaderErr6ASSERT_VIOLATIONDATA_RACE, loaderErr5ASSERT_VIOLATIONDATA_RACE, loaderErr4ASSERT_VIOLATIONDATA_RACE, loaderErr3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-02-08 05:09:48,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:48,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1717685606, now seen corresponding path program 1 times [2025-02-08 05:09:48,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:48,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986922994] [2025-02-08 05:09:48,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:48,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:48,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 05:09:48,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 05:09:48,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:48,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:48,691 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:09:48,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:48,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986922994] [2025-02-08 05:09:48,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986922994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:48,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:48,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:48,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330008825] [2025-02-08 05:09:48,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:48,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:48,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:48,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:48,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:48,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 546 out of 590 [2025-02-08 05:09:48,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 566 transitions, 1148 flow. Second operand has 3 states, 3 states have (on average 547.0) internal successors, (1641), 3 states have internal predecessors, (1641), 0 states have call successors, (0), 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:09:48,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:48,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 546 of 590 [2025-02-08 05:09:48,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:52,210 INFO L124 PetriNetUnfolderBase]: 2139/25337 cut-off events. [2025-02-08 05:09:52,210 INFO L125 PetriNetUnfolderBase]: For 283/285 co-relation queries the response was YES. [2025-02-08 05:09:52,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28479 conditions, 25337 events. 2139/25337 cut-off events. For 283/285 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 309510 event pairs, 663 based on Foata normal form. 0/22194 useless extension candidates. Maximal degree in co-relation 19476. Up to 1868 conditions per place. [2025-02-08 05:09:52,502 INFO L140 encePairwiseOnDemand]: 572/590 looper letters, 43 selfloop transitions, 13 changer transitions 0/591 dead transitions. [2025-02-08 05:09:52,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 591 transitions, 1315 flow [2025-02-08 05:09:52,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:52,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:52,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1699 transitions. [2025-02-08 05:09:52,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9598870056497175 [2025-02-08 05:09:52,506 INFO L175 Difference]: Start difference. First operand has 566 places, 566 transitions, 1148 flow. Second operand 3 states and 1699 transitions. [2025-02-08 05:09:52,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 591 transitions, 1315 flow [2025-02-08 05:09:52,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 591 transitions, 1315 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:09:52,512 INFO L231 Difference]: Finished difference. Result has 570 places, 579 transitions, 1262 flow [2025-02-08 05:09:52,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=590, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1262, PETRI_PLACES=570, PETRI_TRANSITIONS=579} [2025-02-08 05:09:52,514 INFO L279 CegarLoopForPetriNet]: 578 programPoint places, -8 predicate places. [2025-02-08 05:09:52,514 INFO L471 AbstractCegarLoop]: Abstraction has has 570 places, 579 transitions, 1262 flow [2025-02-08 05:09:52,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 547.0) internal successors, (1641), 3 states have internal predecessors, (1641), 0 states have call successors, (0), 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:09:52,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:52,515 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] [2025-02-08 05:09:52,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:09:52,515 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting loaderErr5ASSERT_VIOLATIONDATA_RACE === [loaderErr6ASSERT_VIOLATIONDATA_RACE, loaderErr5ASSERT_VIOLATIONDATA_RACE, loaderErr4ASSERT_VIOLATIONDATA_RACE, loaderErr3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-02-08 05:09:52,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:52,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1514062426, now seen corresponding path program 1 times [2025-02-08 05:09:52,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:52,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087097766] [2025-02-08 05:09:52,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:52,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:52,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:09:52,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:09:52,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:52,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:52,593 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:09:52,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:52,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087097766] [2025-02-08 05:09:52,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087097766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:52,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:52,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:52,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335053571] [2025-02-08 05:09:52,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:52,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:52,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:52,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:52,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:52,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 590 [2025-02-08 05:09:52,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 579 transitions, 1262 flow. Second operand has 3 states, 3 states have (on average 551.6666666666666) internal successors, (1655), 3 states have internal predecessors, (1655), 0 states have call successors, (0), 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:09:52,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:52,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 590 [2025-02-08 05:09:52,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:00,800 INFO L124 PetriNetUnfolderBase]: 5215/58538 cut-off events. [2025-02-08 05:10:00,800 INFO L125 PetriNetUnfolderBase]: For 1249/1265 co-relation queries the response was YES. [2025-02-08 05:10:01,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68465 conditions, 58538 events. 5215/58538 cut-off events. For 1249/1265 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 832856 event pairs, 2749 based on Foata normal form. 0/50888 useless extension candidates. Maximal degree in co-relation 34312. Up to 5404 conditions per place. [2025-02-08 05:10:01,355 INFO L140 encePairwiseOnDemand]: 579/590 looper letters, 36 selfloop transitions, 10 changer transitions 0/598 dead transitions. [2025-02-08 05:10:01,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 598 transitions, 1395 flow [2025-02-08 05:10:01,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:10:01,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:10:01,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1697 transitions. [2025-02-08 05:10:01,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9587570621468926 [2025-02-08 05:10:01,363 INFO L175 Difference]: Start difference. First operand has 570 places, 579 transitions, 1262 flow. Second operand 3 states and 1697 transitions. [2025-02-08 05:10:01,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 598 transitions, 1395 flow [2025-02-08 05:10:01,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 598 transitions, 1369 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:10:01,377 INFO L231 Difference]: Finished difference. Result has 572 places, 588 transitions, 1314 flow [2025-02-08 05:10:01,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=590, PETRI_DIFFERENCE_MINUEND_FLOW=1236, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1314, PETRI_PLACES=572, PETRI_TRANSITIONS=588} [2025-02-08 05:10:01,378 INFO L279 CegarLoopForPetriNet]: 578 programPoint places, -6 predicate places. [2025-02-08 05:10:01,378 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 588 transitions, 1314 flow [2025-02-08 05:10:01,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.6666666666666) internal successors, (1655), 3 states have internal predecessors, (1655), 0 states have call successors, (0), 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:10:01,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:01,379 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] [2025-02-08 05:10:01,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:10:01,379 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting loaderErr4ASSERT_VIOLATIONDATA_RACE === [loaderErr6ASSERT_VIOLATIONDATA_RACE, loaderErr5ASSERT_VIOLATIONDATA_RACE, loaderErr4ASSERT_VIOLATIONDATA_RACE, loaderErr3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-02-08 05:10:01,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:01,380 INFO L85 PathProgramCache]: Analyzing trace with hash -311546497, now seen corresponding path program 1 times [2025-02-08 05:10:01,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:01,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097271356] [2025-02-08 05:10:01,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:01,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:01,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 05:10:01,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 05:10:01,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:01,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:01,415 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:10:01,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:01,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097271356] [2025-02-08 05:10:01,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097271356] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:01,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:01,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:10:01,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107231805] [2025-02-08 05:10:01,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:01,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:10:01,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:01,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:10:01,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:10:01,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 555 out of 590 [2025-02-08 05:10:01,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 588 transitions, 1314 flow. Second operand has 3 states, 3 states have (on average 556.0) internal successors, (1668), 3 states have internal predecessors, (1668), 0 states have call successors, (0), 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:10:01,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:01,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 555 of 590 [2025-02-08 05:10:01,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:08,213 INFO L124 PetriNetUnfolderBase]: 3567/52087 cut-off events. [2025-02-08 05:10:08,213 INFO L125 PetriNetUnfolderBase]: For 580/612 co-relation queries the response was YES. [2025-02-08 05:10:08,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59240 conditions, 52087 events. 3567/52087 cut-off events. For 580/612 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 729013 event pairs, 1203 based on Foata normal form. 0/45820 useless extension candidates. Maximal degree in co-relation 56814. Up to 2729 conditions per place. [2025-02-08 05:10:08,719 INFO L140 encePairwiseOnDemand]: 584/590 looper letters, 23 selfloop transitions, 3 changer transitions 0/592 dead transitions. [2025-02-08 05:10:08,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 592 transitions, 1377 flow [2025-02-08 05:10:08,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:10:08,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:10:08,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1694 transitions. [2025-02-08 05:10:08,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570621468926553 [2025-02-08 05:10:08,726 INFO L175 Difference]: Start difference. First operand has 572 places, 588 transitions, 1314 flow. Second operand 3 states and 1694 transitions. [2025-02-08 05:10:08,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 592 transitions, 1377 flow [2025-02-08 05:10:08,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 592 transitions, 1357 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:10:08,746 INFO L231 Difference]: Finished difference. Result has 570 places, 588 transitions, 1309 flow [2025-02-08 05:10:08,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=590, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1309, PETRI_PLACES=570, PETRI_TRANSITIONS=588} [2025-02-08 05:10:08,750 INFO L279 CegarLoopForPetriNet]: 578 programPoint places, -8 predicate places. [2025-02-08 05:10:08,750 INFO L471 AbstractCegarLoop]: Abstraction has has 570 places, 588 transitions, 1309 flow [2025-02-08 05:10:08,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 556.0) internal successors, (1668), 3 states have internal predecessors, (1668), 0 states have call successors, (0), 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:10:08,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:08,753 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] [2025-02-08 05:10:08,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:10:08,753 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting loaderErr3ASSERT_VIOLATIONDATA_RACE === [loaderErr6ASSERT_VIOLATIONDATA_RACE, loaderErr5ASSERT_VIOLATIONDATA_RACE, loaderErr4ASSERT_VIOLATIONDATA_RACE, loaderErr3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-02-08 05:10:08,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:08,754 INFO L85 PathProgramCache]: Analyzing trace with hash 165984513, now seen corresponding path program 1 times [2025-02-08 05:10:08,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:08,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43182679] [2025-02-08 05:10:08,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:08,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:08,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 05:10:08,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 05:10:08,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:08,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:08,805 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:10:08,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:08,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43182679] [2025-02-08 05:10:08,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43182679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:08,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:08,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:10:08,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476366824] [2025-02-08 05:10:08,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:08,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:10:08,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:08,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:10:08,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:10:08,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 553 out of 590 [2025-02-08 05:10:08,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 588 transitions, 1309 flow. Second operand has 3 states, 3 states have (on average 554.6666666666666) internal successors, (1664), 3 states have internal predecessors, (1664), 0 states have call successors, (0), 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:10:08,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:08,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 553 of 590 [2025-02-08 05:10:08,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:19,855 INFO L124 PetriNetUnfolderBase]: 6428/75710 cut-off events. [2025-02-08 05:10:19,856 INFO L125 PetriNetUnfolderBase]: For 295/295 co-relation queries the response was YES. [2025-02-08 05:10:20,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87495 conditions, 75710 events. 6428/75710 cut-off events. For 295/295 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 1123686 event pairs, 2727 based on Foata normal form. 0/66099 useless extension candidates. Maximal degree in co-relation 42437. Up to 5226 conditions per place. [2025-02-08 05:10:20,532 INFO L140 encePairwiseOnDemand]: 582/590 looper letters, 33 selfloop transitions, 7 changer transitions 0/604 dead transitions. [2025-02-08 05:10:20,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 604 transitions, 1424 flow [2025-02-08 05:10:20,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:10:20,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:10:20,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1700 transitions. [2025-02-08 05:10:20,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.96045197740113 [2025-02-08 05:10:20,536 INFO L175 Difference]: Start difference. First operand has 570 places, 588 transitions, 1309 flow. Second operand 3 states and 1700 transitions. [2025-02-08 05:10:20,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 604 transitions, 1424 flow [2025-02-08 05:10:20,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 604 transitions, 1424 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:10:20,544 INFO L231 Difference]: Finished difference. Result has 574 places, 594 transitions, 1363 flow [2025-02-08 05:10:20,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=590, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1363, PETRI_PLACES=574, PETRI_TRANSITIONS=594} [2025-02-08 05:10:20,546 INFO L279 CegarLoopForPetriNet]: 578 programPoint places, -4 predicate places. [2025-02-08 05:10:20,546 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 594 transitions, 1363 flow [2025-02-08 05:10:20,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 554.6666666666666) internal successors, (1664), 3 states have internal predecessors, (1664), 0 states have call successors, (0), 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:10:20,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:20,547 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] [2025-02-08 05:10:20,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:10:20,547 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting loaderErr2ASSERT_VIOLATIONDATA_RACE === [loaderErr6ASSERT_VIOLATIONDATA_RACE, loaderErr5ASSERT_VIOLATIONDATA_RACE, loaderErr4ASSERT_VIOLATIONDATA_RACE, loaderErr3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-02-08 05:10:20,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:20,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1338541153, now seen corresponding path program 1 times [2025-02-08 05:10:20,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:20,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497117891] [2025-02-08 05:10:20,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:20,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:20,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 05:10:20,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 05:10:20,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:20,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:20,612 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:10:20,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:20,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497117891] [2025-02-08 05:10:20,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497117891] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:20,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:20,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:10:20,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397030452] [2025-02-08 05:10:20,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:20,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:10:20,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:20,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:10:20,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:10:20,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 555 out of 590 [2025-02-08 05:10:20,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 594 transitions, 1363 flow. Second operand has 3 states, 3 states have (on average 556.0) internal successors, (1668), 3 states have internal predecessors, (1668), 0 states have call successors, (0), 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:10:20,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:20,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 555 of 590 [2025-02-08 05:10:20,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:30,587 INFO L124 PetriNetUnfolderBase]: 5110/73490 cut-off events. [2025-02-08 05:10:30,587 INFO L125 PetriNetUnfolderBase]: For 575/591 co-relation queries the response was YES. [2025-02-08 05:10:31,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84352 conditions, 73490 events. 5110/73490 cut-off events. For 575/591 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 1098367 event pairs, 1667 based on Foata normal form. 0/64863 useless extension candidates. Maximal degree in co-relation 81333. Up to 3655 conditions per place. [2025-02-08 05:10:31,217 INFO L140 encePairwiseOnDemand]: 584/590 looper letters, 23 selfloop transitions, 3 changer transitions 0/598 dead transitions. [2025-02-08 05:10:31,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 598 transitions, 1426 flow [2025-02-08 05:10:31,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:10:31,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:10:31,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1694 transitions. [2025-02-08 05:10:31,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570621468926553 [2025-02-08 05:10:31,230 INFO L175 Difference]: Start difference. First operand has 574 places, 594 transitions, 1363 flow. Second operand 3 states and 1694 transitions. [2025-02-08 05:10:31,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 598 transitions, 1426 flow [2025-02-08 05:10:31,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 598 transitions, 1412 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:10:31,254 INFO L231 Difference]: Finished difference. Result has 572 places, 594 transitions, 1364 flow [2025-02-08 05:10:31,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=590, PETRI_DIFFERENCE_MINUEND_FLOW=1343, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1364, PETRI_PLACES=572, PETRI_TRANSITIONS=594} [2025-02-08 05:10:31,258 INFO L279 CegarLoopForPetriNet]: 578 programPoint places, -6 predicate places. [2025-02-08 05:10:31,258 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 594 transitions, 1364 flow [2025-02-08 05:10:31,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 556.0) internal successors, (1668), 3 states have internal predecessors, (1668), 0 states have call successors, (0), 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:10:31,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:31,259 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] [2025-02-08 05:10:31,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:10:31,260 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting loaderErr1ASSERT_VIOLATIONDATA_RACE === [loaderErr6ASSERT_VIOLATIONDATA_RACE, loaderErr5ASSERT_VIOLATIONDATA_RACE, loaderErr4ASSERT_VIOLATIONDATA_RACE, loaderErr3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-02-08 05:10:31,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:31,260 INFO L85 PathProgramCache]: Analyzing trace with hash 2006518051, now seen corresponding path program 1 times [2025-02-08 05:10:31,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:31,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983542243] [2025-02-08 05:10:31,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:31,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:31,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 05:10:31,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 05:10:31,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:31,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:31,309 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:10:31,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:31,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983542243] [2025-02-08 05:10:31,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983542243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:31,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:31,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:10:31,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374624991] [2025-02-08 05:10:31,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:31,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:10:31,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:31,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:10:31,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:10:31,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 590 [2025-02-08 05:10:31,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 594 transitions, 1364 flow. Second operand has 3 states, 3 states have (on average 552.0) internal successors, (1656), 3 states have internal predecessors, (1656), 0 states have call successors, (0), 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:10:31,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:31,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 590 [2025-02-08 05:10:31,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:34,647 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1457] L748-2-->L748: Formula: (= |v_#race~dev_qset~0_15| 0) InVars {} OutVars{#race~dev_qset~0=|v_#race~dev_qset~0_15|} AuxVars[] AssignedVars[#race~dev_qset~0][547], [614#(= |#race~scull_qset~0| 0), Black: 609#(= |#race~dev_quantum~0| |loaderThread1of1ForFork1_scull_trim_#t~nondet10#1|), 583#true, 407#L748true, Black: 612#true, 276#L930-1true, 591#(= |#race~i~0| 0), 237#L720-1true, Black: 589#true, Black: 593#true, 181#L723-1true, 616#true, Black: 600#(= |loaderThread1of1ForFork1_scull_trim_#t~nondet9#1| |#race~dev_size~0|), 605#(= |#race~scull_quantum~0| 0), Black: 603#true]) [2025-02-08 05:10:34,648 INFO L294 olderBase$Statistics]: this new event has 234 ancestors and is cut-off event [2025-02-08 05:10:34,648 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-02-08 05:10:34,648 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-02-08 05:10:34,648 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-02-08 05:10:34,649 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1691] L781-2-->L781: Formula: (= |v_#race~dev_qset~0_30| 0) InVars {} OutVars{#race~dev_qset~0=|v_#race~dev_qset~0_30|} AuxVars[] AssignedVars[#race~dev_qset~0][546], [614#(= |#race~scull_qset~0| 0), Black: 609#(= |#race~dev_quantum~0| |loaderThread1of1ForFork1_scull_trim_#t~nondet10#1|), 583#true, Black: 612#true, 88#L781true, 276#L930-1true, 105#L720-1true, 591#(= |#race~i~0| 0), Black: 589#true, Black: 593#true, 181#L723-1true, 616#true, Black: 600#(= |loaderThread1of1ForFork1_scull_trim_#t~nondet9#1| |#race~dev_size~0|), 605#(= |#race~scull_quantum~0| 0), Black: 603#true]) [2025-02-08 05:10:34,650 INFO L294 olderBase$Statistics]: this new event has 234 ancestors and is cut-off event [2025-02-08 05:10:34,650 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-02-08 05:10:34,650 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-02-08 05:10:34,650 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-02-08 05:10:35,915 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1406] L723-2-->L723: Formula: (= |v_#race~dev_qset~0_18| |v_thread1Thread1of1ForFork0_scull_trim_#t~nondet11#1_5|) InVars {thread1Thread1of1ForFork0_scull_trim_#t~nondet11#1=|v_thread1Thread1of1ForFork0_scull_trim_#t~nondet11#1_5|} OutVars{thread1Thread1of1ForFork0_scull_trim_#t~nondet11#1=|v_thread1Thread1of1ForFork0_scull_trim_#t~nondet11#1_5|, #race~dev_qset~0=|v_#race~dev_qset~0_18|} AuxVars[] AssignedVars[#race~dev_qset~0][242], [614#(= |#race~scull_qset~0| 0), Black: 609#(= |#race~dev_quantum~0| |loaderThread1of1ForFork1_scull_trim_#t~nondet10#1|), 583#true, 59#loaderErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 612#true, 88#L781true, 276#L930-1true, 591#(= |#race~i~0| 0), Black: 589#true, Black: 595#(= |#race~dev_qset~0| 0), 480#L723true, 616#true, Black: 600#(= |loaderThread1of1ForFork1_scull_trim_#t~nondet9#1| |#race~dev_size~0|), 605#(= |#race~scull_quantum~0| 0), Black: 603#true]) [2025-02-08 05:10:35,915 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-02-08 05:10:35,916 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-02-08 05:10:35,916 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-02-08 05:10:35,916 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-02-08 05:10:35,918 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1640] L723-2-->L723: Formula: (= |v_thread2Thread1of1ForFork2_scull_trim_#t~nondet11#1_5| |v_#race~dev_qset~0_24|) InVars {thread2Thread1of1ForFork2_scull_trim_#t~nondet11#1=|v_thread2Thread1of1ForFork2_scull_trim_#t~nondet11#1_5|} OutVars{#race~dev_qset~0=|v_#race~dev_qset~0_24|, thread2Thread1of1ForFork2_scull_trim_#t~nondet11#1=|v_thread2Thread1of1ForFork2_scull_trim_#t~nondet11#1_5|} AuxVars[] AssignedVars[#race~dev_qset~0][257], [614#(= |#race~scull_qset~0| 0), Black: 609#(= |#race~dev_quantum~0| |loaderThread1of1ForFork1_scull_trim_#t~nondet10#1|), 583#true, 407#L748true, 59#loaderErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 612#true, 276#L930-1true, 363#L723true, 591#(= |#race~i~0| 0), Black: 589#true, Black: 595#(= |#race~dev_qset~0| 0), 616#true, Black: 600#(= |loaderThread1of1ForFork1_scull_trim_#t~nondet9#1| |#race~dev_size~0|), 605#(= |#race~scull_quantum~0| 0), Black: 603#true]) [2025-02-08 05:10:35,918 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-02-08 05:10:35,918 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-02-08 05:10:35,919 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-02-08 05:10:35,919 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-02-08 05:10:35,982 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1406] L723-2-->L723: Formula: (= |v_#race~dev_qset~0_18| |v_thread1Thread1of1ForFork0_scull_trim_#t~nondet11#1_5|) InVars {thread1Thread1of1ForFork0_scull_trim_#t~nondet11#1=|v_thread1Thread1of1ForFork0_scull_trim_#t~nondet11#1_5|} OutVars{thread1Thread1of1ForFork0_scull_trim_#t~nondet11#1=|v_thread1Thread1of1ForFork0_scull_trim_#t~nondet11#1_5|, #race~dev_qset~0=|v_#race~dev_qset~0_18|} AuxVars[] AssignedVars[#race~dev_qset~0][242], [278#L781-1true, 614#(= |#race~scull_qset~0| 0), Black: 609#(= |#race~dev_quantum~0| |loaderThread1of1ForFork1_scull_trim_#t~nondet10#1|), 583#true, 59#loaderErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 612#true, 276#L930-1true, 591#(= |#race~i~0| 0), Black: 589#true, Black: 595#(= |#race~dev_qset~0| 0), 480#L723true, 616#true, Black: 600#(= |loaderThread1of1ForFork1_scull_trim_#t~nondet9#1| |#race~dev_size~0|), 605#(= |#race~scull_quantum~0| 0), Black: 603#true]) [2025-02-08 05:10:35,982 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2025-02-08 05:10:35,982 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-02-08 05:10:35,983 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-02-08 05:10:35,983 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-02-08 05:10:35,984 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1640] L723-2-->L723: Formula: (= |v_thread2Thread1of1ForFork2_scull_trim_#t~nondet11#1_5| |v_#race~dev_qset~0_24|) InVars {thread2Thread1of1ForFork2_scull_trim_#t~nondet11#1=|v_thread2Thread1of1ForFork2_scull_trim_#t~nondet11#1_5|} OutVars{#race~dev_qset~0=|v_#race~dev_qset~0_24|, thread2Thread1of1ForFork2_scull_trim_#t~nondet11#1=|v_thread2Thread1of1ForFork2_scull_trim_#t~nondet11#1_5|} AuxVars[] AssignedVars[#race~dev_qset~0][257], [614#(= |#race~scull_qset~0| 0), Black: 609#(= |#race~dev_quantum~0| |loaderThread1of1ForFork1_scull_trim_#t~nondet10#1|), 583#true, 59#loaderErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 612#true, 276#L930-1true, 591#(= |#race~i~0| 0), 363#L723true, Black: 589#true, Black: 595#(= |#race~dev_qset~0| 0), 545#L748-1true, 616#true, Black: 600#(= |loaderThread1of1ForFork1_scull_trim_#t~nondet9#1| |#race~dev_size~0|), 605#(= |#race~scull_quantum~0| 0), Black: 603#true]) [2025-02-08 05:10:35,985 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2025-02-08 05:10:35,985 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-02-08 05:10:35,985 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-02-08 05:10:35,985 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event