./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 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/weaver/chl-file-item-trans.wvr.c -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 408d8d7e58240f749ab11087191b04ec647cfea8447827b0505b793eb68a9c0a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:30:31,010 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:30:31,073 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:30:31,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:30:31,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:30:31,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:30:31,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:30:31,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:30:31,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:30:31,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:30:31,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:30:31,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:30:31,099 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:30:31,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:30:31,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:30:31,100 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:30:31,100 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:30:31,100 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:30:31,100 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:30:31,100 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:30:31,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:30:31,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:30:31,100 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:30:31,100 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:30:31,101 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:30:31,101 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:30:31,101 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:30:31,101 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:30:31,101 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:30:31,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:31,101 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:31,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:31,102 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:30:31,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:31,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:31,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:31,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:30:31,102 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:30:31,102 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:30:31,102 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:30:31,102 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:30:31,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:30:31,102 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:30:31,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:30:31,103 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:30:31,103 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:30:31,103 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 -> 408d8d7e58240f749ab11087191b04ec647cfea8447827b0505b793eb68a9c0a [2025-01-09 21:30:31,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:30:31,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:30:31,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:30:31,326 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:30:31,327 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:30:31,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c [2025-01-09 21:30:32,500 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2df12c11a/9a3bf5b0d43d4486948f5279cdf4530c/FLAG6634d1eb0 [2025-01-09 21:30:32,779 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:30:32,786 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c [2025-01-09 21:30:32,794 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2df12c11a/9a3bf5b0d43d4486948f5279cdf4530c/FLAG6634d1eb0 [2025-01-09 21:30:33,073 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2df12c11a/9a3bf5b0d43d4486948f5279cdf4530c [2025-01-09 21:30:33,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:30:33,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:30:33,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:33,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:30:33,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:30:33,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:33" (1/1) ... [2025-01-09 21:30:33,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21b6642a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33, skipping insertion in model container [2025-01-09 21:30:33,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:33" (1/1) ... [2025-01-09 21:30:33,096 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:30:33,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:33,243 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:30:33,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:33,289 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:30:33,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33 WrapperNode [2025-01-09 21:30:33,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:33,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:33,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:30:33,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:30:33,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33" (1/1) ... [2025-01-09 21:30:33,302 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33" (1/1) ... [2025-01-09 21:30:33,328 INFO L138 Inliner]: procedures = 22, calls = 16, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 304 [2025-01-09 21:30:33,328 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:33,329 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:30:33,329 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:30:33,329 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:30:33,335 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33" (1/1) ... [2025-01-09 21:30:33,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33" (1/1) ... [2025-01-09 21:30:33,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33" (1/1) ... [2025-01-09 21:30:33,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33" (1/1) ... [2025-01-09 21:30:33,346 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33" (1/1) ... [2025-01-09 21:30:33,347 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33" (1/1) ... [2025-01-09 21:30:33,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33" (1/1) ... [2025-01-09 21:30:33,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33" (1/1) ... [2025-01-09 21:30:33,351 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33" (1/1) ... [2025-01-09 21:30:33,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:30:33,352 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:30:33,353 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:30:33,353 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:30:33,353 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33" (1/1) ... [2025-01-09 21:30:33,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:33,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:30:33,382 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-01-09 21:30:33,385 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-01-09 21:30:33,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:30:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:30:33,402 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:30:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:30:33,402 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:30:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:30:33,402 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:30:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:30:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:30:33,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:30:33,403 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:30:33,487 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:30:33,488 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:30:33,843 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:30:33,843 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:30:33,854 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:30:33,854 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:30:33,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:33 BoogieIcfgContainer [2025-01-09 21:30:33,855 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:30:33,856 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:30:33,856 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:30:33,859 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:30:33,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:30:33" (1/3) ... [2025-01-09 21:30:33,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7970b17f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:33, skipping insertion in model container [2025-01-09 21:30:33,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:33" (2/3) ... [2025-01-09 21:30:33,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7970b17f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:33, skipping insertion in model container [2025-01-09 21:30:33,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:33" (3/3) ... [2025-01-09 21:30:33,861 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-file-item-trans.wvr.c [2025-01-09 21:30:33,870 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:30:33,872 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-file-item-trans.wvr.c that has 4 procedures, 383 locations, 1 initial locations, 0 loop locations, and 39 error locations. [2025-01-09 21:30:33,872 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:30:33,971 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:30:34,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 392 places, 403 transitions, 827 flow [2025-01-09 21:30:34,132 INFO L124 PetriNetUnfolderBase]: 21/400 cut-off events. [2025-01-09 21:30:34,133 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:30:34,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 400 events. 21/400 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1056 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 283. Up to 2 conditions per place. [2025-01-09 21:30:34,147 INFO L82 GeneralOperation]: Start removeDead. Operand has 392 places, 403 transitions, 827 flow [2025-01-09 21:30:34,154 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 370 places, 379 transitions, 776 flow [2025-01-09 21:30:34,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:30:34,175 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;@48d029ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:30:34,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2025-01-09 21:30:34,205 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:30:34,205 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2025-01-09 21:30:34,205 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:30:34,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:34,206 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] [2025-01-09 21:30:34,206 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:30:34,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:34,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1689132341, now seen corresponding path program 1 times [2025-01-09 21:30:34,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:34,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543979695] [2025-01-09 21:30:34,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:34,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:34,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 21:30:34,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 21:30:34,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:34,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:34,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:34,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:34,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543979695] [2025-01-09 21:30:34,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543979695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:34,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:34,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:34,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97628673] [2025-01-09 21:30:34,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:34,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:34,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:34,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:34,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:34,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 403 [2025-01-09 21:30:34,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 379 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-01-09 21:30:34,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:34,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 403 [2025-01-09 21:30:34,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:34,507 INFO L124 PetriNetUnfolderBase]: 26/544 cut-off events. [2025-01-09 21:30:34,507 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2025-01-09 21:30:34,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 544 events. 26/544 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2190 event pairs, 5 based on Foata normal form. 19/475 useless extension candidates. Maximal degree in co-relation 434. Up to 22 conditions per place. [2025-01-09 21:30:34,514 INFO L140 encePairwiseOnDemand]: 394/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2025-01-09 21:30:34,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 372 transitions, 788 flow [2025-01-09 21:30:34,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:34,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:34,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1160 transitions. [2025-01-09 21:30:34,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9594706368899917 [2025-01-09 21:30:34,536 INFO L175 Difference]: Start difference. First operand has 370 places, 379 transitions, 776 flow. Second operand 3 states and 1160 transitions. [2025-01-09 21:30:34,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 372 transitions, 788 flow [2025-01-09 21:30:34,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 372 transitions, 776 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:30:34,547 INFO L231 Difference]: Finished difference. Result has 365 places, 372 transitions, 754 flow [2025-01-09 21:30:34,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=365, PETRI_TRANSITIONS=372} [2025-01-09 21:30:34,552 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -5 predicate places. [2025-01-09 21:30:34,552 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 372 transitions, 754 flow [2025-01-09 21:30:34,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-01-09 21:30:34,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:34,553 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] [2025-01-09 21:30:34,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:30:34,553 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:30:34,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:34,554 INFO L85 PathProgramCache]: Analyzing trace with hash 904607753, now seen corresponding path program 1 times [2025-01-09 21:30:34,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:34,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700234333] [2025-01-09 21:30:34,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:34,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:34,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 21:30:34,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 21:30:34,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:34,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:34,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:34,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:34,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700234333] [2025-01-09 21:30:34,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700234333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:34,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:34,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:34,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002072472] [2025-01-09 21:30:34,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:34,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:34,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:34,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:34,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:34,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 403 [2025-01-09 21:30:34,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 372 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-01-09 21:30:34,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:34,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 403 [2025-01-09 21:30:34,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:34,719 INFO L124 PetriNetUnfolderBase]: 36/706 cut-off events. [2025-01-09 21:30:34,720 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-01-09 21:30:34,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 706 events. 36/706 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3260 event pairs, 7 based on Foata normal form. 0/587 useless extension candidates. Maximal degree in co-relation 707. Up to 25 conditions per place. [2025-01-09 21:30:34,727 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2025-01-09 21:30:34,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 371 transitions, 778 flow [2025-01-09 21:30:34,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:34,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:34,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1154 transitions. [2025-01-09 21:30:34,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9545078577336642 [2025-01-09 21:30:34,730 INFO L175 Difference]: Start difference. First operand has 365 places, 372 transitions, 754 flow. Second operand 3 states and 1154 transitions. [2025-01-09 21:30:34,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 371 transitions, 778 flow [2025-01-09 21:30:34,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 371 transitions, 774 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:34,737 INFO L231 Difference]: Finished difference. Result has 364 places, 371 transitions, 752 flow [2025-01-09 21:30:34,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=364, PETRI_TRANSITIONS=371} [2025-01-09 21:30:34,738 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -6 predicate places. [2025-01-09 21:30:34,739 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 371 transitions, 752 flow [2025-01-09 21:30:34,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-01-09 21:30:34,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:34,740 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] [2025-01-09 21:30:34,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:30:34,740 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:30:34,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:34,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1815141124, now seen corresponding path program 1 times [2025-01-09 21:30:34,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:34,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438681238] [2025-01-09 21:30:34,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:34,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:34,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 21:30:34,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 21:30:34,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:34,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:34,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:34,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:34,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438681238] [2025-01-09 21:30:34,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438681238] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:34,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:34,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:34,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492507390] [2025-01-09 21:30:34,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:34,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:34,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:34,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:34,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:34,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 403 [2025-01-09 21:30:34,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 371 transitions, 752 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-01-09 21:30:34,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:34,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 403 [2025-01-09 21:30:34,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:34,871 INFO L124 PetriNetUnfolderBase]: 24/462 cut-off events. [2025-01-09 21:30:34,871 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-01-09 21:30:34,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 462 events. 24/462 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1676 event pairs, 7 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 452. Up to 25 conditions per place. [2025-01-09 21:30:34,877 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2025-01-09 21:30:34,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 370 transitions, 776 flow [2025-01-09 21:30:34,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:34,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1154 transitions. [2025-01-09 21:30:34,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9545078577336642 [2025-01-09 21:30:34,879 INFO L175 Difference]: Start difference. First operand has 364 places, 371 transitions, 752 flow. Second operand 3 states and 1154 transitions. [2025-01-09 21:30:34,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 370 transitions, 776 flow [2025-01-09 21:30:34,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 370 transitions, 772 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:34,884 INFO L231 Difference]: Finished difference. Result has 363 places, 370 transitions, 750 flow [2025-01-09 21:30:34,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=750, PETRI_PLACES=363, PETRI_TRANSITIONS=370} [2025-01-09 21:30:34,885 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -7 predicate places. [2025-01-09 21:30:34,885 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 370 transitions, 750 flow [2025-01-09 21:30:34,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-01-09 21:30:34,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:34,886 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] [2025-01-09 21:30:34,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:30:34,887 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:30:34,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:34,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1551951284, now seen corresponding path program 1 times [2025-01-09 21:30:34,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:34,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277005924] [2025-01-09 21:30:34,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:34,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:34,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 21:30:34,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 21:30:34,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:34,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:34,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:34,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:34,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277005924] [2025-01-09 21:30:34,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277005924] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:34,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:34,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:34,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025602193] [2025-01-09 21:30:34,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:34,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:34,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:34,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:34,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:34,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 403 [2025-01-09 21:30:34,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 370 transitions, 750 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-01-09 21:30:34,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:34,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 403 [2025-01-09 21:30:34,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:35,070 INFO L124 PetriNetUnfolderBase]: 30/607 cut-off events. [2025-01-09 21:30:35,071 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:30:35,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 607 events. 30/607 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2836 event pairs, 5 based on Foata normal form. 0/507 useless extension candidates. Maximal degree in co-relation 587. Up to 22 conditions per place. [2025-01-09 21:30:35,080 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2025-01-09 21:30:35,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 369 transitions, 774 flow [2025-01-09 21:30:35,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:35,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:35,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1154 transitions. [2025-01-09 21:30:35,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9545078577336642 [2025-01-09 21:30:35,084 INFO L175 Difference]: Start difference. First operand has 363 places, 370 transitions, 750 flow. Second operand 3 states and 1154 transitions. [2025-01-09 21:30:35,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 369 transitions, 774 flow [2025-01-09 21:30:35,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 369 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:35,088 INFO L231 Difference]: Finished difference. Result has 362 places, 369 transitions, 748 flow [2025-01-09 21:30:35,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=362, PETRI_TRANSITIONS=369} [2025-01-09 21:30:35,090 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -8 predicate places. [2025-01-09 21:30:35,090 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 369 transitions, 748 flow [2025-01-09 21:30:35,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-01-09 21:30:35,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:35,090 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] [2025-01-09 21:30:35,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:30:35,091 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:30:35,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:35,091 INFO L85 PathProgramCache]: Analyzing trace with hash 599973764, now seen corresponding path program 1 times [2025-01-09 21:30:35,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:35,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111862253] [2025-01-09 21:30:35,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:35,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:35,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 21:30:35,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 21:30:35,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:35,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:35,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:35,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:35,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111862253] [2025-01-09 21:30:35,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111862253] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:35,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:35,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:35,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537864116] [2025-01-09 21:30:35,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:35,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:35,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:35,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:35,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:35,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 403 [2025-01-09 21:30:35,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 369 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 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-01-09 21:30:35,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:35,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 403 [2025-01-09 21:30:35,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:35,258 INFO L124 PetriNetUnfolderBase]: 53/904 cut-off events. [2025-01-09 21:30:35,259 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:30:35,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 955 conditions, 904 events. 53/904 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5208 event pairs, 12 based on Foata normal form. 0/749 useless extension candidates. Maximal degree in co-relation 894. Up to 35 conditions per place. [2025-01-09 21:30:35,267 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 12 selfloop transitions, 2 changer transitions 0/368 dead transitions. [2025-01-09 21:30:35,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 368 transitions, 774 flow [2025-01-09 21:30:35,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:35,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:35,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1152 transitions. [2025-01-09 21:30:35,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9528535980148883 [2025-01-09 21:30:35,270 INFO L175 Difference]: Start difference. First operand has 362 places, 369 transitions, 748 flow. Second operand 3 states and 1152 transitions. [2025-01-09 21:30:35,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 368 transitions, 774 flow [2025-01-09 21:30:35,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 368 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:35,273 INFO L231 Difference]: Finished difference. Result has 361 places, 368 transitions, 746 flow [2025-01-09 21:30:35,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=746, PETRI_PLACES=361, PETRI_TRANSITIONS=368} [2025-01-09 21:30:35,275 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -9 predicate places. [2025-01-09 21:30:35,275 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 368 transitions, 746 flow [2025-01-09 21:30:35,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 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-01-09 21:30:35,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:35,276 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] [2025-01-09 21:30:35,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:30:35,276 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:30:35,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:35,276 INFO L85 PathProgramCache]: Analyzing trace with hash -17834254, now seen corresponding path program 1 times [2025-01-09 21:30:35,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:35,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116296174] [2025-01-09 21:30:35,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:35,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:35,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:30:35,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:30:35,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:35,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:35,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:35,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:35,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116296174] [2025-01-09 21:30:35,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116296174] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:35,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:35,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:35,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919517808] [2025-01-09 21:30:35,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:35,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:35,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:35,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:35,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:35,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 403 [2025-01-09 21:30:35,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 368 transitions, 746 flow. Second operand has 3 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 states have internal predecessors, (1138), 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-01-09 21:30:35,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:35,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 403 [2025-01-09 21:30:35,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:35,467 INFO L124 PetriNetUnfolderBase]: 65/963 cut-off events. [2025-01-09 21:30:35,467 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2025-01-09 21:30:35,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 963 events. 65/963 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5210 event pairs, 20 based on Foata normal form. 0/802 useless extension candidates. Maximal degree in co-relation 955. Up to 50 conditions per place. [2025-01-09 21:30:35,478 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 13 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2025-01-09 21:30:35,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 367 transitions, 774 flow [2025-01-09 21:30:35,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:35,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:35,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1150 transitions. [2025-01-09 21:30:35,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9511993382961125 [2025-01-09 21:30:35,480 INFO L175 Difference]: Start difference. First operand has 361 places, 368 transitions, 746 flow. Second operand 3 states and 1150 transitions. [2025-01-09 21:30:35,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 367 transitions, 774 flow [2025-01-09 21:30:35,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 367 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:35,484 INFO L231 Difference]: Finished difference. Result has 360 places, 367 transitions, 744 flow [2025-01-09 21:30:35,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=360, PETRI_TRANSITIONS=367} [2025-01-09 21:30:35,485 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -10 predicate places. [2025-01-09 21:30:35,485 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 367 transitions, 744 flow [2025-01-09 21:30:35,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 states have internal predecessors, (1138), 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-01-09 21:30:35,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:35,486 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] [2025-01-09 21:30:35,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:30:35,486 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:30:35,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:35,487 INFO L85 PathProgramCache]: Analyzing trace with hash -81682211, now seen corresponding path program 1 times [2025-01-09 21:30:35,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:35,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79290537] [2025-01-09 21:30:35,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:35,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:35,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 21:30:35,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 21:30:35,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:35,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:35,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:35,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:35,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79290537] [2025-01-09 21:30:35,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79290537] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:35,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:35,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:35,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139673234] [2025-01-09 21:30:35,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:35,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:35,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:35,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:35,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:35,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 403 [2025-01-09 21:30:35,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 367 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-01-09 21:30:35,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:35,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 403 [2025-01-09 21:30:35,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:35,644 INFO L124 PetriNetUnfolderBase]: 26/538 cut-off events. [2025-01-09 21:30:35,644 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-01-09 21:30:35,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 571 conditions, 538 events. 26/538 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2315 event pairs, 5 based on Foata normal form. 0/457 useless extension candidates. Maximal degree in co-relation 494. Up to 22 conditions per place. [2025-01-09 21:30:35,652 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/366 dead transitions. [2025-01-09 21:30:35,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 366 transitions, 768 flow [2025-01-09 21:30:35,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:35,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:35,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1154 transitions. [2025-01-09 21:30:35,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9545078577336642 [2025-01-09 21:30:35,656 INFO L175 Difference]: Start difference. First operand has 360 places, 367 transitions, 744 flow. Second operand 3 states and 1154 transitions. [2025-01-09 21:30:35,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 366 transitions, 768 flow [2025-01-09 21:30:35,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 366 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:35,660 INFO L231 Difference]: Finished difference. Result has 359 places, 366 transitions, 742 flow [2025-01-09 21:30:35,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=742, PETRI_PLACES=359, PETRI_TRANSITIONS=366} [2025-01-09 21:30:35,661 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -11 predicate places. [2025-01-09 21:30:35,662 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 366 transitions, 742 flow [2025-01-09 21:30:35,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-01-09 21:30:35,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:35,662 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] [2025-01-09 21:30:35,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:30:35,663 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:30:35,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:35,663 INFO L85 PathProgramCache]: Analyzing trace with hash -771227952, now seen corresponding path program 1 times [2025-01-09 21:30:35,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:35,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799597567] [2025-01-09 21:30:35,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:35,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:35,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:30:35,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:30:35,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:35,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:35,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:35,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:35,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799597567] [2025-01-09 21:30:35,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799597567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:35,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:35,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:35,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360362822] [2025-01-09 21:30:35,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:35,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:35,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:35,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:35,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:35,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 403 [2025-01-09 21:30:35,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 366 transitions, 742 flow. Second operand has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 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-01-09 21:30:35,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:35,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 403 [2025-01-09 21:30:35,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:35,851 INFO L124 PetriNetUnfolderBase]: 53/951 cut-off events. [2025-01-09 21:30:35,852 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-01-09 21:30:35,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1002 conditions, 951 events. 53/951 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5710 event pairs, 12 based on Foata normal form. 0/792 useless extension candidates. Maximal degree in co-relation 917. Up to 35 conditions per place. [2025-01-09 21:30:35,865 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 12 selfloop transitions, 2 changer transitions 0/365 dead transitions. [2025-01-09 21:30:35,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 365 transitions, 768 flow [2025-01-09 21:30:35,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:35,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:35,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1152 transitions. [2025-01-09 21:30:35,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9528535980148883 [2025-01-09 21:30:35,868 INFO L175 Difference]: Start difference. First operand has 359 places, 366 transitions, 742 flow. Second operand 3 states and 1152 transitions. [2025-01-09 21:30:35,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 365 transitions, 768 flow [2025-01-09 21:30:35,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 365 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:35,874 INFO L231 Difference]: Finished difference. Result has 358 places, 365 transitions, 740 flow [2025-01-09 21:30:35,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=740, PETRI_PLACES=358, PETRI_TRANSITIONS=365} [2025-01-09 21:30:35,875 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -12 predicate places. [2025-01-09 21:30:35,876 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 365 transitions, 740 flow [2025-01-09 21:30:35,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 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-01-09 21:30:35,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:35,877 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] [2025-01-09 21:30:35,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:30:35,878 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:30:35,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:35,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1482047006, now seen corresponding path program 1 times [2025-01-09 21:30:35,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:35,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014927891] [2025-01-09 21:30:35,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:35,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:35,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 21:30:35,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 21:30:35,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:35,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:35,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:35,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:35,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014927891] [2025-01-09 21:30:35,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014927891] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:35,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:35,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:35,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690088560] [2025-01-09 21:30:35,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:35,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:35,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:35,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:35,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:35,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 403 [2025-01-09 21:30:35,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 365 transitions, 740 flow. Second operand has 3 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 states have internal predecessors, (1138), 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-01-09 21:30:35,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:35,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 403 [2025-01-09 21:30:35,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:36,050 INFO L124 PetriNetUnfolderBase]: 41/556 cut-off events. [2025-01-09 21:30:36,050 INFO L125 PetriNetUnfolderBase]: For 9/13 co-relation queries the response was YES. [2025-01-09 21:30:36,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 556 events. 41/556 cut-off events. For 9/13 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2620 event pairs, 20 based on Foata normal form. 0/476 useless extension candidates. Maximal degree in co-relation 524. Up to 50 conditions per place. [2025-01-09 21:30:36,060 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 13 selfloop transitions, 2 changer transitions 0/364 dead transitions. [2025-01-09 21:30:36,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 364 transitions, 768 flow [2025-01-09 21:30:36,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:36,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:36,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1150 transitions. [2025-01-09 21:30:36,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9511993382961125 [2025-01-09 21:30:36,063 INFO L175 Difference]: Start difference. First operand has 358 places, 365 transitions, 740 flow. Second operand 3 states and 1150 transitions. [2025-01-09 21:30:36,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 364 transitions, 768 flow [2025-01-09 21:30:36,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 364 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:36,069 INFO L231 Difference]: Finished difference. Result has 357 places, 364 transitions, 738 flow [2025-01-09 21:30:36,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=357, PETRI_TRANSITIONS=364} [2025-01-09 21:30:36,070 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -13 predicate places. [2025-01-09 21:30:36,070 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 364 transitions, 738 flow [2025-01-09 21:30:36,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 states have internal predecessors, (1138), 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-01-09 21:30:36,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:36,071 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] [2025-01-09 21:30:36,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:30:36,071 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:30:36,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:36,072 INFO L85 PathProgramCache]: Analyzing trace with hash -638811393, now seen corresponding path program 1 times [2025-01-09 21:30:36,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:36,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758949770] [2025-01-09 21:30:36,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:36,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:36,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 21:30:36,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 21:30:36,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:36,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:36,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:36,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:36,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758949770] [2025-01-09 21:30:36,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758949770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:36,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:36,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:36,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123749662] [2025-01-09 21:30:36,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:36,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:36,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:36,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:36,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:36,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 403 [2025-01-09 21:30:36,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 364 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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-01-09 21:30:36,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:36,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 403 [2025-01-09 21:30:36,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:36,229 INFO L124 PetriNetUnfolderBase]: 53/916 cut-off events. [2025-01-09 21:30:36,230 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:30:36,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 963 conditions, 916 events. 53/916 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5422 event pairs, 8 based on Foata normal form. 0/767 useless extension candidates. Maximal degree in co-relation 862. Up to 31 conditions per place. [2025-01-09 21:30:36,238 INFO L140 encePairwiseOnDemand]: 399/403 looper letters, 13 selfloop transitions, 2 changer transitions 0/366 dead transitions. [2025-01-09 21:30:36,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 366 transitions, 774 flow [2025-01-09 21:30:36,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:36,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:36,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions. [2025-01-09 21:30:36,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619520264681555 [2025-01-09 21:30:36,240 INFO L175 Difference]: Start difference. First operand has 357 places, 364 transitions, 738 flow. Second operand 3 states and 1163 transitions. [2025-01-09 21:30:36,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 366 transitions, 774 flow [2025-01-09 21:30:36,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 366 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:36,244 INFO L231 Difference]: Finished difference. Result has 356 places, 364 transitions, 744 flow [2025-01-09 21:30:36,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=356, PETRI_TRANSITIONS=364} [2025-01-09 21:30:36,245 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2025-01-09 21:30:36,245 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 364 transitions, 744 flow [2025-01-09 21:30:36,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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-01-09 21:30:36,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:36,246 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] [2025-01-09 21:30:36,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:30:36,246 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:30:36,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:36,246 INFO L85 PathProgramCache]: Analyzing trace with hash 170798306, now seen corresponding path program 1 times [2025-01-09 21:30:36,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:36,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279733701] [2025-01-09 21:30:36,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:36,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:36,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 21:30:36,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 21:30:36,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:36,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:36,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:36,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:36,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279733701] [2025-01-09 21:30:36,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279733701] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:36,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:36,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:36,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015014209] [2025-01-09 21:30:36,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:36,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:36,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:36,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:36,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:36,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 403 [2025-01-09 21:30:36,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 364 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 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-01-09 21:30:36,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:36,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 403 [2025-01-09 21:30:36,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:36,467 INFO L124 PetriNetUnfolderBase]: 119/1686 cut-off events. [2025-01-09 21:30:36,467 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:30:36,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1799 conditions, 1686 events. 119/1686 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 13710 event pairs, 21 based on Foata normal form. 0/1406 useless extension candidates. Maximal degree in co-relation 1530. Up to 73 conditions per place. [2025-01-09 21:30:36,478 INFO L140 encePairwiseOnDemand]: 397/403 looper letters, 15 selfloop transitions, 3 changer transitions 0/366 dead transitions. [2025-01-09 21:30:36,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 366 transitions, 786 flow [2025-01-09 21:30:36,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:36,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:36,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1158 transitions. [2025-01-09 21:30:36,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9578163771712159 [2025-01-09 21:30:36,480 INFO L175 Difference]: Start difference. First operand has 356 places, 364 transitions, 744 flow. Second operand 3 states and 1158 transitions. [2025-01-09 21:30:36,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 366 transitions, 786 flow [2025-01-09 21:30:36,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 366 transitions, 786 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:36,484 INFO L231 Difference]: Finished difference. Result has 356 places, 364 transitions, 759 flow [2025-01-09 21:30:36,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=759, PETRI_PLACES=356, PETRI_TRANSITIONS=364} [2025-01-09 21:30:36,485 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2025-01-09 21:30:36,485 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 364 transitions, 759 flow [2025-01-09 21:30:36,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 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-01-09 21:30:36,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:36,485 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] [2025-01-09 21:30:36,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:30:36,486 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:30:36,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:36,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1282984152, now seen corresponding path program 1 times [2025-01-09 21:30:36,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:36,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849579885] [2025-01-09 21:30:36,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:36,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:36,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:30:36,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:30:36,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:36,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:36,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:36,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:36,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849579885] [2025-01-09 21:30:36,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849579885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:36,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:36,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:36,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083818632] [2025-01-09 21:30:36,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:36,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:36,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:36,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:36,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:36,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 403 [2025-01-09 21:30:36,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 364 transitions, 759 flow. Second operand has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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-01-09 21:30:36,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:36,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 403 [2025-01-09 21:30:36,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:36,658 INFO L124 PetriNetUnfolderBase]: 57/1088 cut-off events. [2025-01-09 21:30:36,658 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2025-01-09 21:30:36,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 1088 events. 57/1088 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6910 event pairs, 2 based on Foata normal form. 0/933 useless extension candidates. Maximal degree in co-relation 955. Up to 38 conditions per place. [2025-01-09 21:30:36,672 INFO L140 encePairwiseOnDemand]: 399/403 looper letters, 16 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2025-01-09 21:30:36,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 369 transitions, 810 flow [2025-01-09 21:30:36,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:36,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions. [2025-01-09 21:30:36,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9644334160463193 [2025-01-09 21:30:36,674 INFO L175 Difference]: Start difference. First operand has 356 places, 364 transitions, 759 flow. Second operand 3 states and 1166 transitions. [2025-01-09 21:30:36,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 369 transitions, 810 flow [2025-01-09 21:30:36,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 369 transitions, 810 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:36,678 INFO L231 Difference]: Finished difference. Result has 357 places, 364 transitions, 769 flow [2025-01-09 21:30:36,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=769, PETRI_PLACES=357, PETRI_TRANSITIONS=364} [2025-01-09 21:30:36,679 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -13 predicate places. [2025-01-09 21:30:36,679 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 364 transitions, 769 flow [2025-01-09 21:30:36,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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-01-09 21:30:36,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:36,679 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] [2025-01-09 21:30:36,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:30:36,680 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:30:36,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:36,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1313359499, now seen corresponding path program 1 times [2025-01-09 21:30:36,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:36,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098621941] [2025-01-09 21:30:36,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:36,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:36,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 21:30:36,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 21:30:36,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:36,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:36,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:36,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098621941] [2025-01-09 21:30:36,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098621941] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:36,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:36,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:36,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087483135] [2025-01-09 21:30:36,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:36,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:36,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:36,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:36,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:36,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 403 [2025-01-09 21:30:36,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 364 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 384.3333333333333) internal successors, (1153), 3 states have internal predecessors, (1153), 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-01-09 21:30:36,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:36,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 403 [2025-01-09 21:30:36,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:36,847 INFO L124 PetriNetUnfolderBase]: 59/1040 cut-off events. [2025-01-09 21:30:36,847 INFO L125 PetriNetUnfolderBase]: For 4/20 co-relation queries the response was YES. [2025-01-09 21:30:36,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1146 conditions, 1040 events. 59/1040 cut-off events. For 4/20 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6848 event pairs, 8 based on Foata normal form. 2/895 useless extension candidates. Maximal degree in co-relation 941. Up to 32 conditions per place. [2025-01-09 21:30:36,860 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/365 dead transitions. [2025-01-09 21:30:36,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 365 transitions, 799 flow [2025-01-09 21:30:36,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:36,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions. [2025-01-09 21:30:36,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619520264681555 [2025-01-09 21:30:36,863 INFO L175 Difference]: Start difference. First operand has 357 places, 364 transitions, 769 flow. Second operand 3 states and 1163 transitions. [2025-01-09 21:30:36,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 365 transitions, 799 flow [2025-01-09 21:30:36,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 365 transitions, 799 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:36,867 INFO L231 Difference]: Finished difference. Result has 358 places, 363 transitions, 771 flow [2025-01-09 21:30:36,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=771, PETRI_PLACES=358, PETRI_TRANSITIONS=363} [2025-01-09 21:30:36,867 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -12 predicate places. [2025-01-09 21:30:36,868 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 363 transitions, 771 flow [2025-01-09 21:30:36,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 384.3333333333333) internal successors, (1153), 3 states have internal predecessors, (1153), 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-01-09 21:30:36,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:36,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] [2025-01-09 21:30:36,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:30:36,869 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:30:36,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:36,870 INFO L85 PathProgramCache]: Analyzing trace with hash -2071790774, now seen corresponding path program 1 times [2025-01-09 21:30:36,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:36,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777044970] [2025-01-09 21:30:36,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:36,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:36,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 21:30:36,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 21:30:36,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:36,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:36,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:36,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:36,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777044970] [2025-01-09 21:30:36,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777044970] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:36,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:36,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:36,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038929863] [2025-01-09 21:30:36,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:36,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:36,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:36,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:36,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:36,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 403 [2025-01-09 21:30:36,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 363 transitions, 771 flow. Second operand has 3 states, 3 states have (on average 377.6666666666667) internal successors, (1133), 3 states have internal predecessors, (1133), 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-01-09 21:30:36,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:36,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 403 [2025-01-09 21:30:36,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:37,328 INFO L124 PetriNetUnfolderBase]: 341/3866 cut-off events. [2025-01-09 21:30:37,328 INFO L125 PetriNetUnfolderBase]: For 62/74 co-relation queries the response was YES. [2025-01-09 21:30:37,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4299 conditions, 3866 events. 341/3866 cut-off events. For 62/74 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 41144 event pairs, 56 based on Foata normal form. 0/3307 useless extension candidates. Maximal degree in co-relation 3570. Up to 320 conditions per place. [2025-01-09 21:30:37,367 INFO L140 encePairwiseOnDemand]: 395/403 looper letters, 17 selfloop transitions, 4 changer transitions 0/365 dead transitions. [2025-01-09 21:30:37,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 365 transitions, 819 flow [2025-01-09 21:30:37,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:37,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:37,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1153 transitions. [2025-01-09 21:30:37,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9536807278742763 [2025-01-09 21:30:37,369 INFO L175 Difference]: Start difference. First operand has 358 places, 363 transitions, 771 flow. Second operand 3 states and 1153 transitions. [2025-01-09 21:30:37,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 365 transitions, 819 flow [2025-01-09 21:30:37,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 365 transitions, 815 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:37,373 INFO L231 Difference]: Finished difference. Result has 355 places, 363 transitions, 787 flow [2025-01-09 21:30:37,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=787, PETRI_PLACES=355, PETRI_TRANSITIONS=363} [2025-01-09 21:30:37,374 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -15 predicate places. [2025-01-09 21:30:37,374 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 363 transitions, 787 flow [2025-01-09 21:30:37,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 377.6666666666667) internal successors, (1133), 3 states have internal predecessors, (1133), 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-01-09 21:30:37,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:37,375 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] [2025-01-09 21:30:37,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:30:37,375 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:30:37,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:37,375 INFO L85 PathProgramCache]: Analyzing trace with hash -465967603, now seen corresponding path program 1 times [2025-01-09 21:30:37,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:37,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939415887] [2025-01-09 21:30:37,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:37,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:37,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 21:30:37,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 21:30:37,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:37,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:37,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:37,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:37,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939415887] [2025-01-09 21:30:37,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939415887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:37,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:37,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:37,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120439066] [2025-01-09 21:30:37,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:37,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:37,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:37,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:37,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:37,427 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 403 [2025-01-09 21:30:37,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 363 transitions, 787 flow. Second operand has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 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-01-09 21:30:37,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:37,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 403 [2025-01-09 21:30:37,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:37,688 INFO L124 PetriNetUnfolderBase]: 151/2564 cut-off events. [2025-01-09 21:30:37,689 INFO L125 PetriNetUnfolderBase]: For 8/11 co-relation queries the response was YES. [2025-01-09 21:30:37,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2793 conditions, 2564 events. 151/2564 cut-off events. For 8/11 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 24412 event pairs, 10 based on Foata normal form. 1/2204 useless extension candidates. Maximal degree in co-relation 2402. Up to 94 conditions per place. [2025-01-09 21:30:37,715 INFO L140 encePairwiseOnDemand]: 397/403 looper letters, 18 selfloop transitions, 3 changer transitions 0/368 dead transitions. [2025-01-09 21:30:37,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 368 transitions, 844 flow [2025-01-09 21:30:37,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:37,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:37,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1161 transitions. [2025-01-09 21:30:37,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9602977667493796 [2025-01-09 21:30:37,717 INFO L175 Difference]: Start difference. First operand has 355 places, 363 transitions, 787 flow. Second operand 3 states and 1161 transitions. [2025-01-09 21:30:37,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 368 transitions, 844 flow [2025-01-09 21:30:37,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 368 transitions, 844 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:37,723 INFO L231 Difference]: Finished difference. Result has 355 places, 363 transitions, 802 flow [2025-01-09 21:30:37,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=802, PETRI_PLACES=355, PETRI_TRANSITIONS=363} [2025-01-09 21:30:37,724 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -15 predicate places. [2025-01-09 21:30:37,724 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 363 transitions, 802 flow [2025-01-09 21:30:37,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 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-01-09 21:30:37,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:37,726 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] [2025-01-09 21:30:37,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:30:37,726 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:30:37,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:37,726 INFO L85 PathProgramCache]: Analyzing trace with hash -305609868, now seen corresponding path program 1 times [2025-01-09 21:30:37,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:37,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008376901] [2025-01-09 21:30:37,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:37,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:37,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 21:30:37,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 21:30:37,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:37,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:37,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:37,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:37,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008376901] [2025-01-09 21:30:37,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008376901] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:37,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:37,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:37,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787381324] [2025-01-09 21:30:37,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:37,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:37,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:37,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:37,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:37,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 403 [2025-01-09 21:30:37,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 363 transitions, 802 flow. Second operand has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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-01-09 21:30:37,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:37,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 403 [2025-01-09 21:30:37,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:38,080 INFO L124 PetriNetUnfolderBase]: 121/2849 cut-off events. [2025-01-09 21:30:38,081 INFO L125 PetriNetUnfolderBase]: For 33/45 co-relation queries the response was YES. [2025-01-09 21:30:38,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3103 conditions, 2849 events. 121/2849 cut-off events. For 33/45 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 25322 event pairs, 6 based on Foata normal form. 2/2521 useless extension candidates. Maximal degree in co-relation 2660. Up to 114 conditions per place. [2025-01-09 21:30:38,112 INFO L140 encePairwiseOnDemand]: 399/403 looper letters, 16 selfloop transitions, 2 changer transitions 0/368 dead transitions. [2025-01-09 21:30:38,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 368 transitions, 853 flow [2025-01-09 21:30:38,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:38,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:38,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions. [2025-01-09 21:30:38,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9644334160463193 [2025-01-09 21:30:38,114 INFO L175 Difference]: Start difference. First operand has 355 places, 363 transitions, 802 flow. Second operand 3 states and 1166 transitions. [2025-01-09 21:30:38,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 368 transitions, 853 flow [2025-01-09 21:30:38,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 368 transitions, 853 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:38,118 INFO L231 Difference]: Finished difference. Result has 356 places, 363 transitions, 812 flow [2025-01-09 21:30:38,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=356, PETRI_TRANSITIONS=363} [2025-01-09 21:30:38,119 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2025-01-09 21:30:38,119 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 363 transitions, 812 flow [2025-01-09 21:30:38,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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-01-09 21:30:38,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:38,120 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] [2025-01-09 21:30:38,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:30:38,120 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:30:38,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:38,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1690903923, now seen corresponding path program 1 times [2025-01-09 21:30:38,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:38,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248268471] [2025-01-09 21:30:38,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:38,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:38,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 21:30:38,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 21:30:38,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:38,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:38,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:38,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:38,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248268471] [2025-01-09 21:30:38,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248268471] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:38,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:38,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:38,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414974534] [2025-01-09 21:30:38,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:38,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:38,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:38,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:38,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:38,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 403 [2025-01-09 21:30:38,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 363 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 384.6666666666667) internal successors, (1154), 3 states have internal predecessors, (1154), 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-01-09 21:30:38,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:38,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 403 [2025-01-09 21:30:38,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:38,482 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1138] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][349], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 100#L80true, 443#(= |#race~filename_5~0| 0), Black: 426#true, Black: 430#true, 432#(= |#race~filename_2~0| 0), 449#true, Black: 437#true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:38,483 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2025-01-09 21:30:38,483 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2025-01-09 21:30:38,483 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2025-01-09 21:30:38,483 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2025-01-09 21:30:38,484 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1138] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][349], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 100#L80true, 443#(= |#race~filename_5~0| 0), Black: 426#true, Black: 430#true, 432#(= |#race~filename_2~0| 0), 449#true, Black: 437#true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:38,484 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is not cut-off event [2025-01-09 21:30:38,484 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is not cut-off event [2025-01-09 21:30:38,484 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is not cut-off event [2025-01-09 21:30:38,484 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2025-01-09 21:30:38,484 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is not cut-off event [2025-01-09 21:30:38,486 INFO L124 PetriNetUnfolderBase]: 166/3483 cut-off events. [2025-01-09 21:30:38,486 INFO L125 PetriNetUnfolderBase]: For 35/124 co-relation queries the response was YES. [2025-01-09 21:30:38,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3920 conditions, 3483 events. 166/3483 cut-off events. For 35/124 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 34474 event pairs, 24 based on Foata normal form. 5/3082 useless extension candidates. Maximal degree in co-relation 3253. Up to 99 conditions per place. [2025-01-09 21:30:38,508 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/364 dead transitions. [2025-01-09 21:30:38,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 364 transitions, 842 flow [2025-01-09 21:30:38,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:38,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:38,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions. [2025-01-09 21:30:38,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619520264681555 [2025-01-09 21:30:38,510 INFO L175 Difference]: Start difference. First operand has 356 places, 363 transitions, 812 flow. Second operand 3 states and 1163 transitions. [2025-01-09 21:30:38,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 364 transitions, 842 flow [2025-01-09 21:30:38,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 364 transitions, 842 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:38,514 INFO L231 Difference]: Finished difference. Result has 357 places, 362 transitions, 814 flow [2025-01-09 21:30:38,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=814, PETRI_PLACES=357, PETRI_TRANSITIONS=362} [2025-01-09 21:30:38,514 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -13 predicate places. [2025-01-09 21:30:38,514 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 362 transitions, 814 flow [2025-01-09 21:30:38,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 384.6666666666667) internal successors, (1154), 3 states have internal predecessors, (1154), 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-01-09 21:30:38,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:38,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:30:38,515 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:30:38,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:38,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1633276073, now seen corresponding path program 1 times [2025-01-09 21:30:38,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:38,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261248620] [2025-01-09 21:30:38,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:38,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:38,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 21:30:38,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 21:30:38,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:38,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:38,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:38,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:38,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261248620] [2025-01-09 21:30:38,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261248620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:38,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:38,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:38,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212944443] [2025-01-09 21:30:38,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:38,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:38,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:38,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:38,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:38,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 403 [2025-01-09 21:30:38,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 362 transitions, 814 flow. Second operand has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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-01-09 21:30:38,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:38,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 403 [2025-01-09 21:30:38,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:38,855 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1138] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][366], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 100#L80true, 443#(= |#race~filename_5~0| 0), 454#(= |#race~filename_4~0| 0), Black: 426#true, Black: 430#true, 432#(= |#race~filename_2~0| 0), 449#true, Black: 437#true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:38,855 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2025-01-09 21:30:38,855 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2025-01-09 21:30:38,855 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-01-09 21:30:38,855 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-01-09 21:30:38,857 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1138] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][366], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), 100#L80true, 454#(= |#race~filename_4~0| 0), Black: 426#true, Black: 430#true, 432#(= |#race~filename_2~0| 0), 449#true, Black: 437#true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:38,857 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is not cut-off event [2025-01-09 21:30:38,857 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is not cut-off event [2025-01-09 21:30:38,857 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2025-01-09 21:30:38,857 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2025-01-09 21:30:38,857 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2025-01-09 21:30:38,863 INFO L124 PetriNetUnfolderBase]: 113/2930 cut-off events. [2025-01-09 21:30:38,864 INFO L125 PetriNetUnfolderBase]: For 17/35 co-relation queries the response was YES. [2025-01-09 21:30:38,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3260 conditions, 2930 events. 113/2930 cut-off events. For 17/35 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 26764 event pairs, 6 based on Foata normal form. 1/2619 useless extension candidates. Maximal degree in co-relation 2815. Up to 87 conditions per place. [2025-01-09 21:30:38,891 INFO L140 encePairwiseOnDemand]: 399/403 looper letters, 16 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2025-01-09 21:30:38,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 367 transitions, 865 flow [2025-01-09 21:30:38,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:38,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:38,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions. [2025-01-09 21:30:38,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9644334160463193 [2025-01-09 21:30:38,893 INFO L175 Difference]: Start difference. First operand has 357 places, 362 transitions, 814 flow. Second operand 3 states and 1166 transitions. [2025-01-09 21:30:38,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 367 transitions, 865 flow [2025-01-09 21:30:38,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 367 transitions, 861 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:38,897 INFO L231 Difference]: Finished difference. Result has 356 places, 362 transitions, 820 flow [2025-01-09 21:30:38,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=820, PETRI_PLACES=356, PETRI_TRANSITIONS=362} [2025-01-09 21:30:38,898 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2025-01-09 21:30:38,898 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 362 transitions, 820 flow [2025-01-09 21:30:38,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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-01-09 21:30:38,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:38,899 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] [2025-01-09 21:30:38,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:30:38,899 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:30:38,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:38,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1646992267, now seen corresponding path program 1 times [2025-01-09 21:30:38,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:38,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751368296] [2025-01-09 21:30:38,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:38,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:38,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 21:30:38,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 21:30:38,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:38,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:38,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:38,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:38,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751368296] [2025-01-09 21:30:38,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751368296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:38,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:38,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:38,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615940194] [2025-01-09 21:30:38,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:38,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:38,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:38,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:38,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:38,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 403 [2025-01-09 21:30:38,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 362 transitions, 820 flow. Second operand has 3 states, 3 states have (on average 377.6666666666667) internal successors, (1133), 3 states have internal predecessors, (1133), 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-01-09 21:30:38,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:38,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 403 [2025-01-09 21:30:38,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:39,803 INFO L124 PetriNetUnfolderBase]: 473/7671 cut-off events. [2025-01-09 21:30:39,803 INFO L125 PetriNetUnfolderBase]: For 134/144 co-relation queries the response was YES. [2025-01-09 21:30:39,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8649 conditions, 7671 events. 473/7671 cut-off events. For 134/144 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 91397 event pairs, 76 based on Foata normal form. 0/6925 useless extension candidates. Maximal degree in co-relation 7730. Up to 624 conditions per place. [2025-01-09 21:30:39,844 INFO L140 encePairwiseOnDemand]: 395/403 looper letters, 19 selfloop transitions, 4 changer transitions 0/366 dead transitions. [2025-01-09 21:30:39,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 366 transitions, 878 flow [2025-01-09 21:30:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:39,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:39,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1155 transitions. [2025-01-09 21:30:39,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9553349875930521 [2025-01-09 21:30:39,846 INFO L175 Difference]: Start difference. First operand has 356 places, 362 transitions, 820 flow. Second operand 3 states and 1155 transitions. [2025-01-09 21:30:39,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 366 transitions, 878 flow [2025-01-09 21:30:39,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 366 transitions, 878 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:39,850 INFO L231 Difference]: Finished difference. Result has 355 places, 362 transitions, 840 flow [2025-01-09 21:30:39,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=840, PETRI_PLACES=355, PETRI_TRANSITIONS=362} [2025-01-09 21:30:39,851 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -15 predicate places. [2025-01-09 21:30:39,851 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 362 transitions, 840 flow [2025-01-09 21:30:39,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 377.6666666666667) internal successors, (1133), 3 states have internal predecessors, (1133), 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-01-09 21:30:39,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:39,852 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] [2025-01-09 21:30:39,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:30:39,852 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:30:39,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:39,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1862235787, now seen corresponding path program 1 times [2025-01-09 21:30:39,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:39,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871307270] [2025-01-09 21:30:39,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:39,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:39,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 21:30:39,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 21:30:39,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:39,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:39,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:39,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:39,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871307270] [2025-01-09 21:30:39,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871307270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:39,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:39,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:39,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742041420] [2025-01-09 21:30:39,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:39,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:39,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:39,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:39,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:39,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 403 [2025-01-09 21:30:39,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 362 transitions, 840 flow. Second operand has 3 states, 3 states have (on average 385.0) internal successors, (1155), 3 states have internal predecessors, (1155), 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-01-09 21:30:39,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:39,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 403 [2025-01-09 21:30:39,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:40,288 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1068] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][225], [424#(= |#race~isNull_0~0| 0), 452#true, 428#(= |#race~isNull_3~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), 445#true, Black: 437#true, 45#L79true, Black: 441#true, 223#L56-40true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:40,289 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is not cut-off event [2025-01-09 21:30:40,289 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2025-01-09 21:30:40,289 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2025-01-09 21:30:40,289 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-01-09 21:30:40,327 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][307], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 223#L56-40true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:40,327 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2025-01-09 21:30:40,327 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-01-09 21:30:40,327 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:30:40,327 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-01-09 21:30:40,327 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][307], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 223#L56-40true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:40,327 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2025-01-09 21:30:40,327 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-01-09 21:30:40,327 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:30:40,327 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-01-09 21:30:40,327 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-01-09 21:30:40,328 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1068] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][225], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 223#L56-40true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:40,328 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2025-01-09 21:30:40,328 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:30:40,328 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-01-09 21:30:40,328 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-01-09 21:30:40,328 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1068] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][225], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 223#L56-40true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:40,328 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2025-01-09 21:30:40,328 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:30:40,328 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-01-09 21:30:40,328 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-01-09 21:30:40,328 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-01-09 21:30:40,328 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1068] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][225], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 223#L56-40true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:40,328 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2025-01-09 21:30:40,328 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:30:40,328 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-01-09 21:30:40,328 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:30:40,328 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-01-09 21:30:40,328 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-01-09 21:30:40,329 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([1068] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][225], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 223#L56-40true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:40,329 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2025-01-09 21:30:40,329 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:30:40,329 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-01-09 21:30:40,329 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:30:40,329 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-01-09 21:30:40,329 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-01-09 21:30:40,329 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-01-09 21:30:40,330 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 462#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 165#L56-41true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:40,330 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2025-01-09 21:30:40,330 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:40,330 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2025-01-09 21:30:40,330 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:40,331 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 462#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 165#L56-41true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:40,331 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-01-09 21:30:40,331 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:40,331 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2025-01-09 21:30:40,331 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:40,331 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-01-09 21:30:40,332 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 462#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 95#L56-42true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:40,332 INFO L294 olderBase$Statistics]: this new event has 244 ancestors and is cut-off event [2025-01-09 21:30:40,332 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-01-09 21:30:40,332 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-01-09 21:30:40,332 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-01-09 21:30:40,332 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 462#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 95#L56-42true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:40,332 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is cut-off event [2025-01-09 21:30:40,332 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-01-09 21:30:40,332 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-01-09 21:30:40,332 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2025-01-09 21:30:40,333 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-01-09 21:30:40,336 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][307], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 44#L58true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:40,336 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2025-01-09 21:30:40,336 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-01-09 21:30:40,336 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-01-09 21:30:40,336 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-01-09 21:30:40,336 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][307], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 44#L58true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:40,336 INFO L294 olderBase$Statistics]: this new event has 222 ancestors and is cut-off event [2025-01-09 21:30:40,336 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-01-09 21:30:40,336 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-01-09 21:30:40,336 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-01-09 21:30:40,336 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-01-09 21:30:40,337 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][307], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 223#L56-40true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:40,337 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is not cut-off event [2025-01-09 21:30:40,337 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is not cut-off event [2025-01-09 21:30:40,337 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is not cut-off event [2025-01-09 21:30:40,337 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is not cut-off event [2025-01-09 21:30:40,337 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2025-01-09 21:30:40,337 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is not cut-off event [2025-01-09 21:30:40,337 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 462#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), 165#L56-41true, Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:40,337 INFO L294 olderBase$Statistics]: this new event has 207 ancestors and is cut-off event [2025-01-09 21:30:40,337 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-01-09 21:30:40,337 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:40,337 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2025-01-09 21:30:40,337 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:40,337 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-01-09 21:30:40,338 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 462#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 95#L56-42true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:40,338 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-01-09 21:30:40,338 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-01-09 21:30:40,338 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-01-09 21:30:40,338 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2025-01-09 21:30:40,338 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-01-09 21:30:40,338 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2025-01-09 21:30:40,341 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][307], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 44#L58true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:40,341 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is not cut-off event [2025-01-09 21:30:40,341 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2025-01-09 21:30:40,341 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is not cut-off event [2025-01-09 21:30:40,341 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is not cut-off event [2025-01-09 21:30:40,341 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is not cut-off event [2025-01-09 21:30:40,341 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2025-01-09 21:30:40,345 INFO L124 PetriNetUnfolderBase]: 375/3955 cut-off events. [2025-01-09 21:30:40,345 INFO L125 PetriNetUnfolderBase]: For 240/323 co-relation queries the response was YES. [2025-01-09 21:30:40,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5021 conditions, 3955 events. 375/3955 cut-off events. For 240/323 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 40721 event pairs, 82 based on Foata normal form. 3/3591 useless extension candidates. Maximal degree in co-relation 4375. Up to 398 conditions per place. [2025-01-09 21:30:40,371 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/363 dead transitions. [2025-01-09 21:30:40,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 363 transitions, 870 flow [2025-01-09 21:30:40,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:40,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:40,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions. [2025-01-09 21:30:40,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619520264681555 [2025-01-09 21:30:40,373 INFO L175 Difference]: Start difference. First operand has 355 places, 362 transitions, 840 flow. Second operand 3 states and 1163 transitions. [2025-01-09 21:30:40,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 363 transitions, 870 flow [2025-01-09 21:30:40,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 363 transitions, 870 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:40,377 INFO L231 Difference]: Finished difference. Result has 356 places, 361 transitions, 842 flow [2025-01-09 21:30:40,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=356, PETRI_TRANSITIONS=361} [2025-01-09 21:30:40,378 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2025-01-09 21:30:40,378 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 361 transitions, 842 flow [2025-01-09 21:30:40,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.0) internal successors, (1155), 3 states have internal predecessors, (1155), 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-01-09 21:30:40,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:40,378 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] [2025-01-09 21:30:40,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:30:40,378 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:30:40,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:40,379 INFO L85 PathProgramCache]: Analyzing trace with hash -96543169, now seen corresponding path program 1 times [2025-01-09 21:30:40,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:40,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499172612] [2025-01-09 21:30:40,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:40,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:40,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 21:30:40,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 21:30:40,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:40,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:40,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:40,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:40,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499172612] [2025-01-09 21:30:40,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499172612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:40,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:40,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:40,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668813919] [2025-01-09 21:30:40,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:40,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:40,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:40,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:40,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:40,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 403 [2025-01-09 21:30:40,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 361 transitions, 842 flow. Second operand has 3 states, 3 states have (on average 383.6666666666667) internal successors, (1151), 3 states have internal predecessors, (1151), 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-01-09 21:30:40,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:40,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 403 [2025-01-09 21:30:40,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:40,865 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1138] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][348], [424#(= |#race~isNull_0~0| 0), 452#true, 463#true, 428#(= |#race~isNull_3~0| 0), Black: 422#true, 100#L80true, 443#(= |#race~filename_5~0| 0), Black: 456#true, Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), 445#true, Black: 437#true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:40,865 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is not cut-off event [2025-01-09 21:30:40,865 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2025-01-09 21:30:40,865 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is not cut-off event [2025-01-09 21:30:40,865 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2025-01-09 21:30:40,918 INFO L124 PetriNetUnfolderBase]: 252/5660 cut-off events. [2025-01-09 21:30:40,918 INFO L125 PetriNetUnfolderBase]: For 71/83 co-relation queries the response was YES. [2025-01-09 21:30:40,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6543 conditions, 5660 events. 252/5660 cut-off events. For 71/83 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 61192 event pairs, 20 based on Foata normal form. 0/5264 useless extension candidates. Maximal degree in co-relation 5776. Up to 304 conditions per place. [2025-01-09 21:30:40,954 INFO L140 encePairwiseOnDemand]: 399/403 looper letters, 15 selfloop transitions, 2 changer transitions 0/365 dead transitions. [2025-01-09 21:30:40,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 365 transitions, 888 flow [2025-01-09 21:30:40,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:40,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:40,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2025-01-09 21:30:40,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9636062861869313 [2025-01-09 21:30:40,956 INFO L175 Difference]: Start difference. First operand has 356 places, 361 transitions, 842 flow. Second operand 3 states and 1165 transitions. [2025-01-09 21:30:40,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 365 transitions, 888 flow [2025-01-09 21:30:40,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 365 transitions, 884 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:40,964 INFO L231 Difference]: Finished difference. Result has 355 places, 361 transitions, 848 flow [2025-01-09 21:30:40,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=848, PETRI_PLACES=355, PETRI_TRANSITIONS=361} [2025-01-09 21:30:40,964 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -15 predicate places. [2025-01-09 21:30:40,965 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 361 transitions, 848 flow [2025-01-09 21:30:40,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.6666666666667) internal successors, (1151), 3 states have internal predecessors, (1151), 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-01-09 21:30:40,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:40,965 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] [2025-01-09 21:30:40,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:30:40,965 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:30:40,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:40,966 INFO L85 PathProgramCache]: Analyzing trace with hash 2086252291, now seen corresponding path program 1 times [2025-01-09 21:30:40,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:40,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231805810] [2025-01-09 21:30:40,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:40,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:40,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 21:30:40,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 21:30:40,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:40,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:41,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:41,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:41,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231805810] [2025-01-09 21:30:41,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231805810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:41,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:41,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:41,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830228750] [2025-01-09 21:30:41,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:41,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:41,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:41,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:41,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:41,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 403 [2025-01-09 21:30:41,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 361 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 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-01-09 21:30:41,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:41,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 403 [2025-01-09 21:30:41,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:41,549 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1138] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][346], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 100#L80true, 465#(= |#race~filename_7~0| 0), 443#(= |#race~filename_5~0| 0), 467#true, Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:41,550 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2025-01-09 21:30:41,550 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-01-09 21:30:41,550 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-01-09 21:30:41,550 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-01-09 21:30:41,550 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1138] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][346], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), 465#(= |#race~filename_7~0| 0), 100#L80true, 467#true, Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:41,550 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is not cut-off event [2025-01-09 21:30:41,550 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2025-01-09 21:30:41,551 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2025-01-09 21:30:41,551 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2025-01-09 21:30:41,551 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2025-01-09 21:30:41,552 INFO L124 PetriNetUnfolderBase]: 201/5128 cut-off events. [2025-01-09 21:30:41,552 INFO L125 PetriNetUnfolderBase]: For 21/57 co-relation queries the response was YES. [2025-01-09 21:30:41,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5840 conditions, 5128 events. 201/5128 cut-off events. For 21/57 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 53987 event pairs, 6 based on Foata normal form. 0/4785 useless extension candidates. Maximal degree in co-relation 5195. Up to 140 conditions per place. [2025-01-09 21:30:41,589 INFO L140 encePairwiseOnDemand]: 401/403 looper letters, 8 selfloop transitions, 1 changer transitions 0/360 dead transitions. [2025-01-09 21:30:41,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 360 transitions, 864 flow [2025-01-09 21:30:41,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:41,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:41,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2025-01-09 21:30:41,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9636062861869313 [2025-01-09 21:30:41,591 INFO L175 Difference]: Start difference. First operand has 355 places, 361 transitions, 848 flow. Second operand 3 states and 1165 transitions. [2025-01-09 21:30:41,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 360 transitions, 864 flow [2025-01-09 21:30:41,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 360 transitions, 864 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:41,596 INFO L231 Difference]: Finished difference. Result has 356 places, 360 transitions, 848 flow [2025-01-09 21:30:41,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=848, PETRI_PLACES=356, PETRI_TRANSITIONS=360} [2025-01-09 21:30:41,596 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2025-01-09 21:30:41,596 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 360 transitions, 848 flow [2025-01-09 21:30:41,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 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-01-09 21:30:41,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:41,597 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] [2025-01-09 21:30:41,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:30:41,597 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:30:41,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:41,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1728951746, now seen corresponding path program 1 times [2025-01-09 21:30:41,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:41,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627912524] [2025-01-09 21:30:41,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:41,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:41,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 21:30:41,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 21:30:41,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:41,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:41,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:41,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:41,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627912524] [2025-01-09 21:30:41,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627912524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:41,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:41,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:41,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95153101] [2025-01-09 21:30:41,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:41,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:41,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:41,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:41,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:41,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 403 [2025-01-09 21:30:41,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 360 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 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-01-09 21:30:41,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:41,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 403 [2025-01-09 21:30:41,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:42,294 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1138] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][346], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 470#true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 465#(= |#race~filename_7~0| 0), 100#L80true, 443#(= |#race~filename_5~0| 0), 467#true, Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:42,294 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is not cut-off event [2025-01-09 21:30:42,294 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2025-01-09 21:30:42,294 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2025-01-09 21:30:42,294 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2025-01-09 21:30:42,295 INFO L124 PetriNetUnfolderBase]: 199/5606 cut-off events. [2025-01-09 21:30:42,295 INFO L125 PetriNetUnfolderBase]: For 22/66 co-relation queries the response was YES. [2025-01-09 21:30:42,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6401 conditions, 5606 events. 199/5606 cut-off events. For 22/66 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 60400 event pairs, 23 based on Foata normal form. 0/5234 useless extension candidates. Maximal degree in co-relation 6161. Up to 158 conditions per place. [2025-01-09 21:30:42,341 INFO L140 encePairwiseOnDemand]: 401/403 looper letters, 8 selfloop transitions, 1 changer transitions 0/359 dead transitions. [2025-01-09 21:30:42,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 359 transitions, 864 flow [2025-01-09 21:30:42,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:42,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2025-01-09 21:30:42,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9636062861869313 [2025-01-09 21:30:42,343 INFO L175 Difference]: Start difference. First operand has 356 places, 360 transitions, 848 flow. Second operand 3 states and 1165 transitions. [2025-01-09 21:30:42,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 359 transitions, 864 flow [2025-01-09 21:30:42,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 359 transitions, 863 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:42,347 INFO L231 Difference]: Finished difference. Result has 356 places, 359 transitions, 847 flow [2025-01-09 21:30:42,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=847, PETRI_PLACES=356, PETRI_TRANSITIONS=359} [2025-01-09 21:30:42,348 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2025-01-09 21:30:42,348 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 359 transitions, 847 flow [2025-01-09 21:30:42,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 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-01-09 21:30:42,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:42,348 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] [2025-01-09 21:30:42,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:30:42,349 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-01-09 21:30:42,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:42,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1857811918, now seen corresponding path program 1 times [2025-01-09 21:30:42,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:42,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329647553] [2025-01-09 21:30:42,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:42,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:42,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 21:30:42,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 21:30:42,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:42,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:42,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:42,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:42,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329647553] [2025-01-09 21:30:42,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329647553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:42,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:42,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:42,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992834232] [2025-01-09 21:30:42,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:42,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:42,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:42,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:42,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:42,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 403 [2025-01-09 21:30:42,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 359 transitions, 847 flow. Second operand has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 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-01-09 21:30:42,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:42,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 403 [2025-01-09 21:30:42,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:42,700 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1072] L56-40-->L56-41: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][233], [424#(= |#race~isNull_0~0| 0), 452#true, 463#true, 428#(= |#race~isNull_3~0| 0), 470#true, Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, Black: 426#true, 473#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), 445#true, 165#L56-41true, Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:42,700 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is not cut-off event [2025-01-09 21:30:42,700 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2025-01-09 21:30:42,700 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2025-01-09 21:30:42,700 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2025-01-09 21:30:42,738 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1072] L56-40-->L56-41: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][233], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 470#true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 465#(= |#race~filename_7~0| 0), 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 473#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 165#L56-41true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:42,738 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2025-01-09 21:30:42,738 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:42,738 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:42,738 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-01-09 21:30:42,748 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1072] L56-40-->L56-41: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][233], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 470#true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 465#(= |#race~filename_7~0| 0), 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 473#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), 165#L56-41true, Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:42,749 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2025-01-09 21:30:42,749 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:42,749 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:42,749 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-01-09 21:30:42,749 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-01-09 21:30:42,749 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1072] L56-40-->L56-41: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][233], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 470#true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 465#(= |#race~filename_7~0| 0), 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 473#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 165#L56-41true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:42,749 INFO L294 olderBase$Statistics]: this new event has 271 ancestors and is cut-off event [2025-01-09 21:30:42,749 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:42,749 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:42,749 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-01-09 21:30:42,749 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-01-09 21:30:42,749 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-01-09 21:30:42,749 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][304], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 470#true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 465#(= |#race~filename_7~0| 0), 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 473#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 165#L56-41true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:42,749 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2025-01-09 21:30:42,749 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:42,749 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-01-09 21:30:42,749 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:42,750 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][304], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 470#true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 465#(= |#race~filename_7~0| 0), 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 473#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 165#L56-41true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:42,750 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2025-01-09 21:30:42,750 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:42,750 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-01-09 21:30:42,750 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:42,750 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:42,750 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([1072] L56-40-->L56-41: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][233], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 470#true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 465#(= |#race~filename_7~0| 0), 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 473#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), 165#L56-41true, Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2025-01-09 21:30:42,750 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is not cut-off event [2025-01-09 21:30:42,750 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is not cut-off event [2025-01-09 21:30:42,750 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is not cut-off event [2025-01-09 21:30:42,750 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2025-01-09 21:30:42,750 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2025-01-09 21:30:42,750 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is not cut-off event [2025-01-09 21:30:42,750 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2025-01-09 21:30:42,751 INFO L124 PetriNetUnfolderBase]: 199/3881 cut-off events. [2025-01-09 21:30:42,752 INFO L125 PetriNetUnfolderBase]: For 64/102 co-relation queries the response was YES. [2025-01-09 21:30:42,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4594 conditions, 3881 events. 199/3881 cut-off events. For 64/102 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 39171 event pairs, 48 based on Foata normal form. 24/3604 useless extension candidates. Maximal degree in co-relation 4486. Up to 239 conditions per place. [2025-01-09 21:30:42,781 INFO L140 encePairwiseOnDemand]: 401/403 looper letters, 0 selfloop transitions, 0 changer transitions 358/358 dead transitions. [2025-01-09 21:30:42,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 358 transitions, 861 flow [2025-01-09 21:30:42,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:42,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1164 transitions. [2025-01-09 21:30:42,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9627791563275434 [2025-01-09 21:30:42,783 INFO L175 Difference]: Start difference. First operand has 356 places, 359 transitions, 847 flow. Second operand 3 states and 1164 transitions. [2025-01-09 21:30:42,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 358 transitions, 861 flow [2025-01-09 21:30:42,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 358 transitions, 860 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:42,787 INFO L231 Difference]: Finished difference. Result has 356 places, 0 transitions, 0 flow [2025-01-09 21:30:42,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=356, PETRI_TRANSITIONS=0} [2025-01-09 21:30:42,787 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2025-01-09 21:30:42,787 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 0 transitions, 0 flow [2025-01-09 21:30:42,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 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-01-09 21:30:42,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (68 of 69 remaining) [2025-01-09 21:30:42,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (67 of 69 remaining) [2025-01-09 21:30:42,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (66 of 69 remaining) [2025-01-09 21:30:42,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (65 of 69 remaining) [2025-01-09 21:30:42,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (64 of 69 remaining) [2025-01-09 21:30:42,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (63 of 69 remaining) [2025-01-09 21:30:42,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (62 of 69 remaining) [2025-01-09 21:30:42,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (61 of 69 remaining) [2025-01-09 21:30:42,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (60 of 69 remaining) [2025-01-09 21:30:42,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (59 of 69 remaining) [2025-01-09 21:30:42,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (58 of 69 remaining) [2025-01-09 21:30:42,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (57 of 69 remaining) [2025-01-09 21:30:42,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (56 of 69 remaining) [2025-01-09 21:30:42,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (55 of 69 remaining) [2025-01-09 21:30:42,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (54 of 69 remaining) [2025-01-09 21:30:42,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (53 of 69 remaining) [2025-01-09 21:30:42,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (52 of 69 remaining) [2025-01-09 21:30:42,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (51 of 69 remaining) [2025-01-09 21:30:42,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (50 of 69 remaining) [2025-01-09 21:30:42,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (49 of 69 remaining) [2025-01-09 21:30:42,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (48 of 69 remaining) [2025-01-09 21:30:42,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (47 of 69 remaining) [2025-01-09 21:30:42,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (46 of 69 remaining) [2025-01-09 21:30:42,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (45 of 69 remaining) [2025-01-09 21:30:42,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (44 of 69 remaining) [2025-01-09 21:30:42,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (43 of 69 remaining) [2025-01-09 21:30:42,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (42 of 69 remaining) [2025-01-09 21:30:42,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (41 of 69 remaining) [2025-01-09 21:30:42,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (40 of 69 remaining) [2025-01-09 21:30:42,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (39 of 69 remaining) [2025-01-09 21:30:42,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (38 of 69 remaining) [2025-01-09 21:30:42,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (37 of 69 remaining) [2025-01-09 21:30:42,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (36 of 69 remaining) [2025-01-09 21:30:42,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (35 of 69 remaining) [2025-01-09 21:30:42,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (34 of 69 remaining) [2025-01-09 21:30:42,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (33 of 69 remaining) [2025-01-09 21:30:42,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (32 of 69 remaining) [2025-01-09 21:30:42,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (31 of 69 remaining) [2025-01-09 21:30:42,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (30 of 69 remaining) [2025-01-09 21:30:42,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 69 remaining) [2025-01-09 21:30:42,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 69 remaining) [2025-01-09 21:30:42,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 69 remaining) [2025-01-09 21:30:42,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (26 of 69 remaining) [2025-01-09 21:30:42,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 69 remaining) [2025-01-09 21:30:42,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (24 of 69 remaining) [2025-01-09 21:30:42,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 69 remaining) [2025-01-09 21:30:42,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 69 remaining) [2025-01-09 21:30:42,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (21 of 69 remaining) [2025-01-09 21:30:42,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (20 of 69 remaining) [2025-01-09 21:30:42,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (19 of 69 remaining) [2025-01-09 21:30:42,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (18 of 69 remaining) [2025-01-09 21:30:42,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 69 remaining) [2025-01-09 21:30:42,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 69 remaining) [2025-01-09 21:30:42,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 69 remaining) [2025-01-09 21:30:42,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 69 remaining) [2025-01-09 21:30:42,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (13 of 69 remaining) [2025-01-09 21:30:42,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 69 remaining) [2025-01-09 21:30:42,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 69 remaining) [2025-01-09 21:30:42,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (10 of 69 remaining) [2025-01-09 21:30:42,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (9 of 69 remaining) [2025-01-09 21:30:42,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 69 remaining) [2025-01-09 21:30:42,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (7 of 69 remaining) [2025-01-09 21:30:42,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (6 of 69 remaining) [2025-01-09 21:30:42,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (5 of 69 remaining) [2025-01-09 21:30:42,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (4 of 69 remaining) [2025-01-09 21:30:42,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 69 remaining) [2025-01-09 21:30:42,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 69 remaining) [2025-01-09 21:30:42,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (1 of 69 remaining) [2025-01-09 21:30:42,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (0 of 69 remaining) [2025-01-09 21:30:42,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:30:42,795 INFO L422 BasicCegarLoop]: Path program 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] [2025-01-09 21:30:42,799 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:30:42,799 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:30:42,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:30:42 BasicIcfg [2025-01-09 21:30:42,803 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:30:42,804 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:30:42,804 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:30:42,804 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:30:42,804 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:33" (3/4) ... [2025-01-09 21:30:42,805 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:30:42,808 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:30:42,808 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:30:42,808 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:30:42,811 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-09 21:30:42,812 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:30:42,812 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:30:42,812 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:30:42,882 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:30:42,882 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:30:42,882 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:30:42,882 INFO L158 Benchmark]: Toolchain (without parser) took 9806.56ms. Allocated memory was 167.8MB in the beginning and 964.7MB in the end (delta: 796.9MB). Free memory was 128.2MB in the beginning and 604.3MB in the end (delta: -476.0MB). Peak memory consumption was 314.9MB. Max. memory is 16.1GB. [2025-01-09 21:30:42,882 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 226.5MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:42,883 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.20ms. Allocated memory is still 167.8MB. Free memory was 127.9MB in the beginning and 115.7MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:42,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.82ms. Allocated memory is still 167.8MB. Free memory was 115.7MB in the beginning and 113.5MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:42,883 INFO L158 Benchmark]: Boogie Preprocessor took 23.16ms. Allocated memory is still 167.8MB. Free memory was 113.5MB in the beginning and 112.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:42,883 INFO L158 Benchmark]: RCFGBuilder took 502.35ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 85.2MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:30:42,883 INFO L158 Benchmark]: TraceAbstraction took 8947.06ms. Allocated memory was 167.8MB in the beginning and 964.7MB in the end (delta: 796.9MB). Free memory was 84.9MB in the beginning and 612.6MB in the end (delta: -527.8MB). Peak memory consumption was 264.5MB. Max. memory is 16.1GB. [2025-01-09 21:30:42,884 INFO L158 Benchmark]: Witness Printer took 78.28ms. Allocated memory is still 964.7MB. Free memory was 612.6MB in the beginning and 604.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:42,884 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 226.5MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.20ms. Allocated memory is still 167.8MB. Free memory was 127.9MB in the beginning and 115.7MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.82ms. Allocated memory is still 167.8MB. Free memory was 115.7MB in the beginning and 113.5MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.16ms. Allocated memory is still 167.8MB. Free memory was 113.5MB in the beginning and 112.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 502.35ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 85.2MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8947.06ms. Allocated memory was 167.8MB in the beginning and 964.7MB in the end (delta: 796.9MB). Free memory was 84.9MB in the beginning and 612.6MB in the end (delta: -527.8MB). Peak memory consumption was 264.5MB. Max. memory is 16.1GB. * Witness Printer took 78.28ms. Allocated memory is still 964.7MB. Free memory was 612.6MB in the beginning and 604.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 611 locations, 69 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.8s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 482 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 164 mSDsluCounter, 91 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 646 IncrementalHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 91 mSDtfsCounter, 646 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=848occurred in iteration=21, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 2438 NumberOfCodeBlocks, 2438 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2414 ConstructedInterpolants, 0 QuantifiedInterpolants, 2462 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 39 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:30:42,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE