./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 3dfcb4860b3021904fb2e25e7c2a428c9bcb0d82c2290cad723458395a0647ea --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:45:57,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:45:57,329 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:45:57,333 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:45:57,335 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:45:57,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:45:57,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:45:57,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:45:57,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:45:57,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:45:57,353 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:45:57,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:45:57,353 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:45:57,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:45:57,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:45:57,353 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:45:57,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:45:57,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:45:57,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:45:57,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:45:57,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:45:57,353 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:45:57,353 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:45:57,353 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:45:57,353 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:45:57,353 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:45:57,353 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:45:57,353 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:45:57,353 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:45:57,354 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:45:57,354 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:45:57,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:45:57,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:45:57,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:45:57,354 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:45:57,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:45:57,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:45:57,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:45:57,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:45:57,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:45:57,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:45:57,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:45:57,354 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/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 -> 3dfcb4860b3021904fb2e25e7c2a428c9bcb0d82c2290cad723458395a0647ea [2025-03-14 01:45:57,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:45:57,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:45:57,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:45:57,595 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:45:57,595 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:45:57,596 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c [2025-03-14 01:45:58,721 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6fb4fbbd/817d5e5d4f0946e99a0e10f104779791/FLAGb58abb4dd [2025-03-14 01:45:58,952 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:45:58,953 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c [2025-03-14 01:45:58,959 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6fb4fbbd/817d5e5d4f0946e99a0e10f104779791/FLAGb58abb4dd [2025-03-14 01:45:59,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6fb4fbbd/817d5e5d4f0946e99a0e10f104779791 [2025-03-14 01:45:59,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:45:59,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:45:59,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:45:59,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:45:59,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:45:59,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:45:59" (1/1) ... [2025-03-14 01:45:59,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b21d599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:59, skipping insertion in model container [2025-03-14 01:45:59,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:45:59" (1/1) ... [2025-03-14 01:45:59,308 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:45:59,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:45:59,484 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:45:59,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:45:59,539 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:45:59,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:59 WrapperNode [2025-03-14 01:45:59,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:45:59,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:45:59,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:45:59,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:45:59,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:59" (1/1) ... [2025-03-14 01:45:59,554 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:59" (1/1) ... [2025-03-14 01:45:59,591 INFO L138 Inliner]: procedures = 27, calls = 68, calls flagged for inlining = 29, calls inlined = 35, statements flattened = 817 [2025-03-14 01:45:59,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:45:59,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:45:59,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:45:59,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:45:59,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:59" (1/1) ... [2025-03-14 01:45:59,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:59" (1/1) ... [2025-03-14 01:45:59,602 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:59" (1/1) ... [2025-03-14 01:45:59,602 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:59" (1/1) ... [2025-03-14 01:45:59,621 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:59" (1/1) ... [2025-03-14 01:45:59,623 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:59" (1/1) ... [2025-03-14 01:45:59,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:59" (1/1) ... [2025-03-14 01:45:59,630 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:59" (1/1) ... [2025-03-14 01:45:59,636 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:45:59,637 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:45:59,637 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:45:59,637 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:45:59,638 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:59" (1/1) ... [2025-03-14 01:45:59,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:45:59,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:45:59,673 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:45:59,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:45:59,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:45:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-14 01:45:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:45:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:45:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-14 01:45:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:45:59,695 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:45:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:45:59,695 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:45:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:45:59,695 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:45:59,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:45:59,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 01:45:59,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 01:45:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:45:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:45:59,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:45:59,698 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:45:59,811 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:45:59,813 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:46:00,678 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:46:00,679 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:46:00,679 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:46:01,126 WARN L177 LargeBlockEncoding]: Complex 2:13 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-03-14 01:46:01,156 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:46:01,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:46:01 BoogieIcfgContainer [2025-03-14 01:46:01,157 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:46:01,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:46:01,158 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:46:01,161 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:46:01,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:45:59" (1/3) ... [2025-03-14 01:46:01,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8d37cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:46:01, skipping insertion in model container [2025-03-14 01:46:01,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:59" (2/3) ... [2025-03-14 01:46:01,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8d37cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:46:01, skipping insertion in model container [2025-03-14 01:46:01,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:46:01" (3/3) ... [2025-03-14 01:46:01,163 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons-eq.wvr.c [2025-03-14 01:46:01,175 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:46:01,176 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-prod-cons-eq.wvr.c that has 4 procedures, 808 locations, 1 initial locations, 9 loop locations, and 133 error locations. [2025-03-14 01:46:01,176 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:46:01,323 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:46:01,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 817 places, 859 transitions, 1739 flow [2025-03-14 01:46:01,633 INFO L124 PetriNetUnfolderBase]: 52/856 cut-off events. [2025-03-14 01:46:01,634 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:46:01,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 856 events. 52/856 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1668 event pairs, 0 based on Foata normal form. 0/671 useless extension candidates. Maximal degree in co-relation 612. Up to 2 conditions per place. [2025-03-14 01:46:01,646 INFO L82 GeneralOperation]: Start removeDead. Operand has 817 places, 859 transitions, 1739 flow [2025-03-14 01:46:01,666 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 798 places, 839 transitions, 1696 flow [2025-03-14 01:46:01,675 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:46:01,686 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;@221324f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:46:01,687 INFO L334 AbstractCegarLoop]: Starting to check reachability of 234 error locations. [2025-03-14 01:46:01,693 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:46:01,693 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-03-14 01:46:01,693 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:46:01,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:01,694 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] [2025-03-14 01:46:01,695 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:01,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:01,699 INFO L85 PathProgramCache]: Analyzing trace with hash 477591846, now seen corresponding path program 1 times [2025-03-14 01:46:01,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:01,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002224937] [2025-03-14 01:46:01,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:01,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:01,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:46:01,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:46:01,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:01,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:01,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:01,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002224937] [2025-03-14 01:46:01,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002224937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:01,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:01,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:01,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288112187] [2025-03-14 01:46:01,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:01,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:01,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:01,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:01,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:01,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 859 [2025-03-14 01:46:01,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 798 places, 839 transitions, 1696 flow. Second operand has 3 states, 3 states have (on average 754.3333333333334) internal successors, (2263), 3 states have internal predecessors, (2263), 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-03-14 01:46:01,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:01,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 859 [2025-03-14 01:46:01,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:02,245 INFO L124 PetriNetUnfolderBase]: 58/1094 cut-off events. [2025-03-14 01:46:02,246 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-14 01:46:02,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 1094 events. 58/1094 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3589 event pairs, 19 based on Foata normal form. 65/966 useless extension candidates. Maximal degree in co-relation 784. Up to 65 conditions per place. [2025-03-14 01:46:02,259 INFO L140 encePairwiseOnDemand]: 770/859 looper letters, 14 selfloop transitions, 2 changer transitions 12/752 dead transitions. [2025-03-14 01:46:02,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 748 places, 752 transitions, 1554 flow [2025-03-14 01:46:02,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:02,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:02,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2362 transitions. [2025-03-14 01:46:02,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.916569654637175 [2025-03-14 01:46:02,282 INFO L175 Difference]: Start difference. First operand has 798 places, 839 transitions, 1696 flow. Second operand 3 states and 2362 transitions. [2025-03-14 01:46:02,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 748 places, 752 transitions, 1554 flow [2025-03-14 01:46:02,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 742 places, 752 transitions, 1542 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:46:02,299 INFO L231 Difference]: Finished difference. Result has 742 places, 740 transitions, 1490 flow [2025-03-14 01:46:02,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1510, PETRI_DIFFERENCE_MINUEND_PLACES=740, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=750, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1490, PETRI_PLACES=742, PETRI_TRANSITIONS=740} [2025-03-14 01:46:02,304 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -56 predicate places. [2025-03-14 01:46:02,305 INFO L471 AbstractCegarLoop]: Abstraction has has 742 places, 740 transitions, 1490 flow [2025-03-14 01:46:02,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.3333333333334) internal successors, (2263), 3 states have internal predecessors, (2263), 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-03-14 01:46:02,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:02,306 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] [2025-03-14 01:46:02,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:46:02,307 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:02,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:02,307 INFO L85 PathProgramCache]: Analyzing trace with hash 507688623, now seen corresponding path program 1 times [2025-03-14 01:46:02,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:02,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140546046] [2025-03-14 01:46:02,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:02,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:02,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-14 01:46:02,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-14 01:46:02,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:02,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:02,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:02,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:02,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140546046] [2025-03-14 01:46:02,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140546046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:02,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:02,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:02,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200778055] [2025-03-14 01:46:02,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:02,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:02,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:02,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:02,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:02,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 859 [2025-03-14 01:46:02,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 742 places, 740 transitions, 1490 flow. Second operand has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 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-03-14 01:46:02,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:02,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 859 [2025-03-14 01:46:02,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:02,689 INFO L124 PetriNetUnfolderBase]: 118/1177 cut-off events. [2025-03-14 01:46:02,689 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:46:02,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 1177 events. 118/1177 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4364 event pairs, 67 based on Foata normal form. 0/984 useless extension candidates. Maximal degree in co-relation 1344. Up to 168 conditions per place. [2025-03-14 01:46:02,704 INFO L140 encePairwiseOnDemand]: 856/859 looper letters, 21 selfloop transitions, 2 changer transitions 0/739 dead transitions. [2025-03-14 01:46:02,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 731 places, 739 transitions, 1534 flow [2025-03-14 01:46:02,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:02,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:02,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2262 transitions. [2025-03-14 01:46:02,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8777648428405123 [2025-03-14 01:46:02,709 INFO L175 Difference]: Start difference. First operand has 742 places, 740 transitions, 1490 flow. Second operand 3 states and 2262 transitions. [2025-03-14 01:46:02,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 731 places, 739 transitions, 1534 flow [2025-03-14 01:46:02,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 729 places, 739 transitions, 1530 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:02,720 INFO L231 Difference]: Finished difference. Result has 729 places, 739 transitions, 1488 flow [2025-03-14 01:46:02,721 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1484, PETRI_DIFFERENCE_MINUEND_PLACES=727, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=739, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=737, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1488, PETRI_PLACES=729, PETRI_TRANSITIONS=739} [2025-03-14 01:46:02,722 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -69 predicate places. [2025-03-14 01:46:02,722 INFO L471 AbstractCegarLoop]: Abstraction has has 729 places, 739 transitions, 1488 flow [2025-03-14 01:46:02,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 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-03-14 01:46:02,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:02,723 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] [2025-03-14 01:46:02,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:46:02,724 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:02,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:02,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1046905835, now seen corresponding path program 1 times [2025-03-14 01:46:02,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:02,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084363067] [2025-03-14 01:46:02,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:02,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:02,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-14 01:46:02,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-14 01:46:02,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:02,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:02,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:02,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084363067] [2025-03-14 01:46:02,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084363067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:02,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:02,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:02,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174958375] [2025-03-14 01:46:02,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:02,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:02,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:02,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:02,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:02,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 859 [2025-03-14 01:46:02,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 729 places, 739 transitions, 1488 flow. Second operand has 3 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 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-03-14 01:46:02,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:02,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 859 [2025-03-14 01:46:02,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:03,132 INFO L124 PetriNetUnfolderBase]: 172/1301 cut-off events. [2025-03-14 01:46:03,133 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-14 01:46:03,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1615 conditions, 1301 events. 172/1301 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5370 event pairs, 99 based on Foata normal form. 0/1126 useless extension candidates. Maximal degree in co-relation 1564. Up to 235 conditions per place. [2025-03-14 01:46:03,150 INFO L140 encePairwiseOnDemand]: 850/859 looper letters, 27 selfloop transitions, 3 changer transitions 0/738 dead transitions. [2025-03-14 01:46:03,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 725 places, 738 transitions, 1548 flow [2025-03-14 01:46:03,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:03,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:03,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2256 transitions. [2025-03-14 01:46:03,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8754365541327125 [2025-03-14 01:46:03,156 INFO L175 Difference]: Start difference. First operand has 729 places, 739 transitions, 1488 flow. Second operand 3 states and 2256 transitions. [2025-03-14 01:46:03,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 725 places, 738 transitions, 1548 flow [2025-03-14 01:46:03,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 723 places, 738 transitions, 1544 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:03,164 INFO L231 Difference]: Finished difference. Result has 723 places, 733 transitions, 1478 flow [2025-03-14 01:46:03,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=721, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1478, PETRI_PLACES=723, PETRI_TRANSITIONS=733} [2025-03-14 01:46:03,167 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -75 predicate places. [2025-03-14 01:46:03,167 INFO L471 AbstractCegarLoop]: Abstraction has has 723 places, 733 transitions, 1478 flow [2025-03-14 01:46:03,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 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-03-14 01:46:03,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:03,168 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] [2025-03-14 01:46:03,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:46:03,169 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:03,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:03,169 INFO L85 PathProgramCache]: Analyzing trace with hash -503534043, now seen corresponding path program 1 times [2025-03-14 01:46:03,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:03,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141344308] [2025-03-14 01:46:03,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:03,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:03,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-14 01:46:03,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-14 01:46:03,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:03,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:03,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:03,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:03,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141344308] [2025-03-14 01:46:03,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141344308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:03,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:03,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:03,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364238291] [2025-03-14 01:46:03,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:03,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:03,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:03,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:03,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:03,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 859 [2025-03-14 01:46:03,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 723 places, 733 transitions, 1478 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 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-03-14 01:46:03,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:03,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 859 [2025-03-14 01:46:03,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:03,684 INFO L124 PetriNetUnfolderBase]: 418/2446 cut-off events. [2025-03-14 01:46:03,684 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2025-03-14 01:46:03,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3054 conditions, 2446 events. 418/2446 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 13262 event pairs, 235 based on Foata normal form. 0/2000 useless extension candidates. Maximal degree in co-relation 1984. Up to 557 conditions per place. [2025-03-14 01:46:03,701 INFO L140 encePairwiseOnDemand]: 856/859 looper letters, 26 selfloop transitions, 2 changer transitions 0/732 dead transitions. [2025-03-14 01:46:03,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 724 places, 732 transitions, 1532 flow [2025-03-14 01:46:03,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:03,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:03,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2252 transitions. [2025-03-14 01:46:03,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8738843616608459 [2025-03-14 01:46:03,706 INFO L175 Difference]: Start difference. First operand has 723 places, 733 transitions, 1478 flow. Second operand 3 states and 2252 transitions. [2025-03-14 01:46:03,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 724 places, 732 transitions, 1532 flow [2025-03-14 01:46:03,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 722 places, 732 transitions, 1526 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:03,716 INFO L231 Difference]: Finished difference. Result has 722 places, 732 transitions, 1474 flow [2025-03-14 01:46:03,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=720, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=722, PETRI_TRANSITIONS=732} [2025-03-14 01:46:03,719 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -76 predicate places. [2025-03-14 01:46:03,720 INFO L471 AbstractCegarLoop]: Abstraction has has 722 places, 732 transitions, 1474 flow [2025-03-14 01:46:03,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 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-03-14 01:46:03,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:03,721 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:03,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:46:03,721 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:03,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:03,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1340750520, now seen corresponding path program 1 times [2025-03-14 01:46:03,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:03,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19526625] [2025-03-14 01:46:03,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:03,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:03,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-14 01:46:03,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-14 01:46:03,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:03,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:03,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:03,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:03,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19526625] [2025-03-14 01:46:03,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19526625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:03,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:03,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:03,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512891478] [2025-03-14 01:46:03,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:03,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:03,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:03,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:03,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:03,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 859 [2025-03-14 01:46:03,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 722 places, 732 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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-03-14 01:46:03,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:03,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 859 [2025-03-14 01:46:03,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:03,957 INFO L124 PetriNetUnfolderBase]: 58/1053 cut-off events. [2025-03-14 01:46:03,957 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:46:03,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 1053 events. 58/1053 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3334 event pairs, 19 based on Foata normal form. 0/901 useless extension candidates. Maximal degree in co-relation 1080. Up to 67 conditions per place. [2025-03-14 01:46:03,965 INFO L140 encePairwiseOnDemand]: 856/859 looper letters, 16 selfloop transitions, 2 changer transitions 0/731 dead transitions. [2025-03-14 01:46:03,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 723 places, 731 transitions, 1508 flow [2025-03-14 01:46:03,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:03,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:03,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2025-03-14 01:46:03,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8816453240201785 [2025-03-14 01:46:03,972 INFO L175 Difference]: Start difference. First operand has 722 places, 732 transitions, 1474 flow. Second operand 3 states and 2272 transitions. [2025-03-14 01:46:03,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 723 places, 731 transitions, 1508 flow [2025-03-14 01:46:03,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 721 places, 731 transitions, 1504 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:03,980 INFO L231 Difference]: Finished difference. Result has 721 places, 731 transitions, 1472 flow [2025-03-14 01:46:03,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=719, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=731, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=729, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1472, PETRI_PLACES=721, PETRI_TRANSITIONS=731} [2025-03-14 01:46:03,983 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -77 predicate places. [2025-03-14 01:46:03,985 INFO L471 AbstractCegarLoop]: Abstraction has has 721 places, 731 transitions, 1472 flow [2025-03-14 01:46:03,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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-03-14 01:46:03,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:03,986 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] [2025-03-14 01:46:03,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:46:03,988 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:03,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:03,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1972846110, now seen corresponding path program 1 times [2025-03-14 01:46:03,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:03,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134154028] [2025-03-14 01:46:03,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:03,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:04,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-14 01:46:04,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-14 01:46:04,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:04,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:04,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:04,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:04,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134154028] [2025-03-14 01:46:04,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134154028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:04,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:04,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:04,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143111898] [2025-03-14 01:46:04,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:04,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:04,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:04,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:04,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:04,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 859 [2025-03-14 01:46:04,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 731 transitions, 1472 flow. Second operand has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 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-03-14 01:46:04,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:04,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 859 [2025-03-14 01:46:04,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:04,211 INFO L124 PetriNetUnfolderBase]: 68/1036 cut-off events. [2025-03-14 01:46:04,211 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-14 01:46:04,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 1036 events. 68/1036 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3228 event pairs, 11 based on Foata normal form. 0/891 useless extension candidates. Maximal degree in co-relation 1077. Up to 47 conditions per place. [2025-03-14 01:46:04,220 INFO L140 encePairwiseOnDemand]: 854/859 looper letters, 21 selfloop transitions, 3 changer transitions 0/737 dead transitions. [2025-03-14 01:46:04,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 737 transitions, 1536 flow [2025-03-14 01:46:04,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:04,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:04,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2285 transitions. [2025-03-14 01:46:04,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8866899495537447 [2025-03-14 01:46:04,224 INFO L175 Difference]: Start difference. First operand has 721 places, 731 transitions, 1472 flow. Second operand 3 states and 2285 transitions. [2025-03-14 01:46:04,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 737 transitions, 1536 flow [2025-03-14 01:46:04,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 737 transitions, 1532 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:04,233 INFO L231 Difference]: Finished difference. Result has 721 places, 731 transitions, 1484 flow [2025-03-14 01:46:04,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=717, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1484, PETRI_PLACES=721, PETRI_TRANSITIONS=731} [2025-03-14 01:46:04,235 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -77 predicate places. [2025-03-14 01:46:04,235 INFO L471 AbstractCegarLoop]: Abstraction has has 721 places, 731 transitions, 1484 flow [2025-03-14 01:46:04,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 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-03-14 01:46:04,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:04,236 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] [2025-03-14 01:46:04,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:46:04,236 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:04,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:04,237 INFO L85 PathProgramCache]: Analyzing trace with hash -974845592, now seen corresponding path program 1 times [2025-03-14 01:46:04,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:04,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235258173] [2025-03-14 01:46:04,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:04,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:04,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-14 01:46:04,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-14 01:46:04,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:04,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:04,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:04,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:04,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235258173] [2025-03-14 01:46:04,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235258173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:04,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:04,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:04,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661654384] [2025-03-14 01:46:04,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:04,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:04,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:04,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:04,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:04,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 859 [2025-03-14 01:46:04,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 731 transitions, 1484 flow. Second operand has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 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-03-14 01:46:04,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:04,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 859 [2025-03-14 01:46:04,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:04,606 INFO L124 PetriNetUnfolderBase]: 230/1671 cut-off events. [2025-03-14 01:46:04,607 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2025-03-14 01:46:04,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2075 conditions, 1671 events. 230/1671 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 8168 event pairs, 131 based on Foata normal form. 0/1390 useless extension candidates. Maximal degree in co-relation 1443. Up to 310 conditions per place. [2025-03-14 01:46:04,621 INFO L140 encePairwiseOnDemand]: 856/859 looper letters, 20 selfloop transitions, 2 changer transitions 0/730 dead transitions. [2025-03-14 01:46:04,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 722 places, 730 transitions, 1526 flow [2025-03-14 01:46:04,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:04,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:04,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2266 transitions. [2025-03-14 01:46:04,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8793170353123787 [2025-03-14 01:46:04,626 INFO L175 Difference]: Start difference. First operand has 721 places, 731 transitions, 1484 flow. Second operand 3 states and 2266 transitions. [2025-03-14 01:46:04,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 722 places, 730 transitions, 1526 flow [2025-03-14 01:46:04,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 720 places, 730 transitions, 1520 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:04,636 INFO L231 Difference]: Finished difference. Result has 720 places, 730 transitions, 1480 flow [2025-03-14 01:46:04,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1476, PETRI_DIFFERENCE_MINUEND_PLACES=718, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1480, PETRI_PLACES=720, PETRI_TRANSITIONS=730} [2025-03-14 01:46:04,637 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -78 predicate places. [2025-03-14 01:46:04,637 INFO L471 AbstractCegarLoop]: Abstraction has has 720 places, 730 transitions, 1480 flow [2025-03-14 01:46:04,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 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-03-14 01:46:04,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:04,639 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] [2025-03-14 01:46:04,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:46:04,639 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:04,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:04,640 INFO L85 PathProgramCache]: Analyzing trace with hash -859300546, now seen corresponding path program 1 times [2025-03-14 01:46:04,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:04,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825907647] [2025-03-14 01:46:04,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:04,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:04,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-14 01:46:04,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-14 01:46:04,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:04,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:04,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:04,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:04,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825907647] [2025-03-14 01:46:04,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825907647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:04,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:04,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:04,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892649486] [2025-03-14 01:46:04,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:04,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:04,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:04,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:04,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:04,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 752 out of 859 [2025-03-14 01:46:04,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 720 places, 730 transitions, 1480 flow. Second operand has 3 states, 3 states have (on average 753.3333333333334) internal successors, (2260), 3 states have internal predecessors, (2260), 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-03-14 01:46:04,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:04,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 752 of 859 [2025-03-14 01:46:04,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:04,866 INFO L124 PetriNetUnfolderBase]: 70/1098 cut-off events. [2025-03-14 01:46:04,866 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-14 01:46:04,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 1098 events. 70/1098 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3744 event pairs, 27 based on Foata normal form. 0/940 useless extension candidates. Maximal degree in co-relation 1148. Up to 86 conditions per place. [2025-03-14 01:46:04,876 INFO L140 encePairwiseOnDemand]: 856/859 looper letters, 16 selfloop transitions, 2 changer transitions 0/729 dead transitions. [2025-03-14 01:46:04,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 729 transitions, 1514 flow [2025-03-14 01:46:04,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:04,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:04,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2274 transitions. [2025-03-14 01:46:04,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8824214202561118 [2025-03-14 01:46:04,880 INFO L175 Difference]: Start difference. First operand has 720 places, 730 transitions, 1480 flow. Second operand 3 states and 2274 transitions. [2025-03-14 01:46:04,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 729 transitions, 1514 flow [2025-03-14 01:46:04,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 729 transitions, 1510 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:04,888 INFO L231 Difference]: Finished difference. Result has 719 places, 729 transitions, 1478 flow [2025-03-14 01:46:04,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=717, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=727, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1478, PETRI_PLACES=719, PETRI_TRANSITIONS=729} [2025-03-14 01:46:04,891 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -79 predicate places. [2025-03-14 01:46:04,892 INFO L471 AbstractCegarLoop]: Abstraction has has 719 places, 729 transitions, 1478 flow [2025-03-14 01:46:04,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 753.3333333333334) internal successors, (2260), 3 states have internal predecessors, (2260), 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-03-14 01:46:04,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:04,893 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] [2025-03-14 01:46:04,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:46:04,893 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:04,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:04,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1829522335, now seen corresponding path program 1 times [2025-03-14 01:46:04,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:04,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152306612] [2025-03-14 01:46:04,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:04,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:04,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-14 01:46:04,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-14 01:46:04,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:04,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:04,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:04,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:04,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152306612] [2025-03-14 01:46:04,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152306612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:04,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:04,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:04,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780868999] [2025-03-14 01:46:04,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:04,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:04,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:04,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:04,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:04,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 859 [2025-03-14 01:46:04,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 719 places, 729 transitions, 1478 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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-03-14 01:46:04,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:04,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 859 [2025-03-14 01:46:04,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:05,116 INFO L124 PetriNetUnfolderBase]: 110/1240 cut-off events. [2025-03-14 01:46:05,116 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-14 01:46:05,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 1240 events. 110/1240 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4978 event pairs, 53 based on Foata normal form. 0/1047 useless extension candidates. Maximal degree in co-relation 1346. Up to 142 conditions per place. [2025-03-14 01:46:05,126 INFO L140 encePairwiseOnDemand]: 856/859 looper letters, 17 selfloop transitions, 2 changer transitions 0/728 dead transitions. [2025-03-14 01:46:05,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 720 places, 728 transitions, 1514 flow [2025-03-14 01:46:05,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:05,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:05,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2025-03-14 01:46:05,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8816453240201785 [2025-03-14 01:46:05,130 INFO L175 Difference]: Start difference. First operand has 719 places, 729 transitions, 1478 flow. Second operand 3 states and 2272 transitions. [2025-03-14 01:46:05,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 720 places, 728 transitions, 1514 flow [2025-03-14 01:46:05,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 718 places, 728 transitions, 1510 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:05,138 INFO L231 Difference]: Finished difference. Result has 718 places, 728 transitions, 1476 flow [2025-03-14 01:46:05,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=716, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1476, PETRI_PLACES=718, PETRI_TRANSITIONS=728} [2025-03-14 01:46:05,139 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -80 predicate places. [2025-03-14 01:46:05,139 INFO L471 AbstractCegarLoop]: Abstraction has has 718 places, 728 transitions, 1476 flow [2025-03-14 01:46:05,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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-03-14 01:46:05,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:05,140 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] [2025-03-14 01:46:05,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:46:05,140 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:05,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:05,141 INFO L85 PathProgramCache]: Analyzing trace with hash 227343763, now seen corresponding path program 1 times [2025-03-14 01:46:05,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:05,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202939671] [2025-03-14 01:46:05,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:05,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:05,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-14 01:46:05,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-14 01:46:05,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:05,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:05,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:05,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:05,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202939671] [2025-03-14 01:46:05,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202939671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:05,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:05,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:05,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376661061] [2025-03-14 01:46:05,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:05,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:05,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:05,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:05,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:05,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 859 [2025-03-14 01:46:05,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 718 places, 728 transitions, 1476 flow. Second operand has 3 states, 3 states have (on average 748.3333333333334) internal successors, (2245), 3 states have internal predecessors, (2245), 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-03-14 01:46:05,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:05,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 859 [2025-03-14 01:46:05,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:05,428 INFO L124 PetriNetUnfolderBase]: 208/1516 cut-off events. [2025-03-14 01:46:05,428 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-14 01:46:05,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1888 conditions, 1516 events. 208/1516 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 7046 event pairs, 129 based on Foata normal form. 0/1230 useless extension candidates. Maximal degree in co-relation 1797. Up to 291 conditions per place. [2025-03-14 01:46:05,466 INFO L140 encePairwiseOnDemand]: 856/859 looper letters, 21 selfloop transitions, 2 changer transitions 0/727 dead transitions. [2025-03-14 01:46:05,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 719 places, 727 transitions, 1520 flow [2025-03-14 01:46:05,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:05,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2264 transitions. [2025-03-14 01:46:05,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8785409390764455 [2025-03-14 01:46:05,469 INFO L175 Difference]: Start difference. First operand has 718 places, 728 transitions, 1476 flow. Second operand 3 states and 2264 transitions. [2025-03-14 01:46:05,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 719 places, 727 transitions, 1520 flow [2025-03-14 01:46:05,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 717 places, 727 transitions, 1516 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:05,477 INFO L231 Difference]: Finished difference. Result has 717 places, 727 transitions, 1474 flow [2025-03-14 01:46:05,478 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=715, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=725, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=717, PETRI_TRANSITIONS=727} [2025-03-14 01:46:05,479 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -81 predicate places. [2025-03-14 01:46:05,479 INFO L471 AbstractCegarLoop]: Abstraction has has 717 places, 727 transitions, 1474 flow [2025-03-14 01:46:05,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 748.3333333333334) internal successors, (2245), 3 states have internal predecessors, (2245), 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-03-14 01:46:05,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:05,480 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] [2025-03-14 01:46:05,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:46:05,481 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:05,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:05,481 INFO L85 PathProgramCache]: Analyzing trace with hash -459089616, now seen corresponding path program 1 times [2025-03-14 01:46:05,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:05,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369880889] [2025-03-14 01:46:05,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:05,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:05,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-14 01:46:05,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-14 01:46:05,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:05,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:05,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:05,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:05,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369880889] [2025-03-14 01:46:05,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369880889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:05,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:05,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:05,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18581444] [2025-03-14 01:46:05,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:05,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:05,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:05,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:05,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:05,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 859 [2025-03-14 01:46:05,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 717 places, 727 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 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-03-14 01:46:05,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:05,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 859 [2025-03-14 01:46:05,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:05,718 INFO L124 PetriNetUnfolderBase]: 110/1238 cut-off events. [2025-03-14 01:46:05,718 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-14 01:46:05,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1430 conditions, 1238 events. 110/1238 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4939 event pairs, 53 based on Foata normal form. 0/1052 useless extension candidates. Maximal degree in co-relation 1331. Up to 145 conditions per place. [2025-03-14 01:46:05,728 INFO L140 encePairwiseOnDemand]: 856/859 looper letters, 20 selfloop transitions, 2 changer transitions 0/726 dead transitions. [2025-03-14 01:46:05,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 718 places, 726 transitions, 1516 flow [2025-03-14 01:46:05,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:05,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:05,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2266 transitions. [2025-03-14 01:46:05,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8793170353123787 [2025-03-14 01:46:05,732 INFO L175 Difference]: Start difference. First operand has 717 places, 727 transitions, 1474 flow. Second operand 3 states and 2266 transitions. [2025-03-14 01:46:05,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 718 places, 726 transitions, 1516 flow [2025-03-14 01:46:05,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 716 places, 726 transitions, 1512 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:05,740 INFO L231 Difference]: Finished difference. Result has 716 places, 726 transitions, 1472 flow [2025-03-14 01:46:05,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=714, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1472, PETRI_PLACES=716, PETRI_TRANSITIONS=726} [2025-03-14 01:46:05,741 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -82 predicate places. [2025-03-14 01:46:05,741 INFO L471 AbstractCegarLoop]: Abstraction has has 716 places, 726 transitions, 1472 flow [2025-03-14 01:46:05,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 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-03-14 01:46:05,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:05,742 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-03-14 01:46:05,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:46:05,743 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:05,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:05,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1122008711, now seen corresponding path program 1 times [2025-03-14 01:46:05,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:05,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135044709] [2025-03-14 01:46:05,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:05,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:05,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-14 01:46:05,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-14 01:46:05,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:05,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:05,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:05,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:05,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135044709] [2025-03-14 01:46:05,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135044709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:05,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:05,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:05,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318134009] [2025-03-14 01:46:05,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:05,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:05,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:05,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:05,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:05,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 859 [2025-03-14 01:46:05,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 716 places, 726 transitions, 1472 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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-03-14 01:46:05,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:05,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 859 [2025-03-14 01:46:05,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:06,001 INFO L124 PetriNetUnfolderBase]: 110/1237 cut-off events. [2025-03-14 01:46:06,003 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-14 01:46:06,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1426 conditions, 1237 events. 110/1237 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4816 event pairs, 53 based on Foata normal form. 0/1044 useless extension candidates. Maximal degree in co-relation 1319. Up to 142 conditions per place. [2025-03-14 01:46:06,009 INFO L140 encePairwiseOnDemand]: 856/859 looper letters, 17 selfloop transitions, 2 changer transitions 0/725 dead transitions. [2025-03-14 01:46:06,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 717 places, 725 transitions, 1508 flow [2025-03-14 01:46:06,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:06,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:06,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2025-03-14 01:46:06,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8816453240201785 [2025-03-14 01:46:06,013 INFO L175 Difference]: Start difference. First operand has 716 places, 726 transitions, 1472 flow. Second operand 3 states and 2272 transitions. [2025-03-14 01:46:06,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 717 places, 725 transitions, 1508 flow [2025-03-14 01:46:06,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 715 places, 725 transitions, 1504 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:06,021 INFO L231 Difference]: Finished difference. Result has 715 places, 725 transitions, 1470 flow [2025-03-14 01:46:06,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=713, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=723, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1470, PETRI_PLACES=715, PETRI_TRANSITIONS=725} [2025-03-14 01:46:06,022 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -83 predicate places. [2025-03-14 01:46:06,022 INFO L471 AbstractCegarLoop]: Abstraction has has 715 places, 725 transitions, 1470 flow [2025-03-14 01:46:06,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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-03-14 01:46:06,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:06,024 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] [2025-03-14 01:46:06,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:46:06,024 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:06,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:06,025 INFO L85 PathProgramCache]: Analyzing trace with hash -851812186, now seen corresponding path program 1 times [2025-03-14 01:46:06,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:06,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097221309] [2025-03-14 01:46:06,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:06,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:06,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-14 01:46:06,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-14 01:46:06,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:06,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:06,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:06,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:06,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097221309] [2025-03-14 01:46:06,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097221309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:06,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:06,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:06,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316627266] [2025-03-14 01:46:06,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:06,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:06,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:06,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:06,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:06,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 859 [2025-03-14 01:46:06,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 715 places, 725 transitions, 1470 flow. Second operand has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 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-03-14 01:46:06,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:06,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 859 [2025-03-14 01:46:06,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:06,747 INFO L124 PetriNetUnfolderBase]: 252/4879 cut-off events. [2025-03-14 01:46:06,747 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-03-14 01:46:06,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5148 conditions, 4879 events. 252/4879 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 35846 event pairs, 79 based on Foata normal form. 0/3902 useless extension candidates. Maximal degree in co-relation 5033. Up to 214 conditions per place. [2025-03-14 01:46:06,778 INFO L140 encePairwiseOnDemand]: 856/859 looper letters, 16 selfloop transitions, 1 changer transitions 0/723 dead transitions. [2025-03-14 01:46:06,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 715 places, 723 transitions, 1500 flow [2025-03-14 01:46:06,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:06,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:06,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2277 transitions. [2025-03-14 01:46:06,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8835855646100116 [2025-03-14 01:46:06,782 INFO L175 Difference]: Start difference. First operand has 715 places, 725 transitions, 1470 flow. Second operand 3 states and 2277 transitions. [2025-03-14 01:46:06,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 715 places, 723 transitions, 1500 flow [2025-03-14 01:46:06,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 713 places, 723 transitions, 1496 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:06,790 INFO L231 Difference]: Finished difference. Result has 713 places, 723 transitions, 1464 flow [2025-03-14 01:46:06,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=711, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1464, PETRI_PLACES=713, PETRI_TRANSITIONS=723} [2025-03-14 01:46:06,792 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -85 predicate places. [2025-03-14 01:46:06,792 INFO L471 AbstractCegarLoop]: Abstraction has has 713 places, 723 transitions, 1464 flow [2025-03-14 01:46:06,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 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-03-14 01:46:06,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:06,794 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] [2025-03-14 01:46:06,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:46:06,794 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:06,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:06,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1832934643, now seen corresponding path program 1 times [2025-03-14 01:46:06,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:06,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051437970] [2025-03-14 01:46:06,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:06,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:06,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-14 01:46:06,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-14 01:46:06,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:06,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:07,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:07,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:07,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051437970] [2025-03-14 01:46:07,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051437970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:07,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:07,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:46:07,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412870086] [2025-03-14 01:46:07,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:07,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:46:07,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:07,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:46:07,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:46:07,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 670 out of 859 [2025-03-14 01:46:07,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 723 transitions, 1464 flow. Second operand has 6 states, 6 states have (on average 671.5) internal successors, (4029), 6 states have internal predecessors, (4029), 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-03-14 01:46:07,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:07,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 670 of 859 [2025-03-14 01:46:07,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:09,097 INFO L124 PetriNetUnfolderBase]: 2081/10266 cut-off events. [2025-03-14 01:46:09,097 INFO L125 PetriNetUnfolderBase]: For 690/690 co-relation queries the response was YES. [2025-03-14 01:46:09,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13600 conditions, 10266 events. 2081/10266 cut-off events. For 690/690 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 91838 event pairs, 1421 based on Foata normal form. 0/8440 useless extension candidates. Maximal degree in co-relation 13486. Up to 2842 conditions per place. [2025-03-14 01:46:09,147 INFO L140 encePairwiseOnDemand]: 835/859 looper letters, 78 selfloop transitions, 20 changer transitions 0/719 dead transitions. [2025-03-14 01:46:09,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 719 transitions, 1652 flow [2025-03-14 01:46:09,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:46:09,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:46:09,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4121 transitions. [2025-03-14 01:46:09,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7995731470702367 [2025-03-14 01:46:09,154 INFO L175 Difference]: Start difference. First operand has 713 places, 723 transitions, 1464 flow. Second operand 6 states and 4121 transitions. [2025-03-14 01:46:09,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 719 transitions, 1652 flow [2025-03-14 01:46:09,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 713 places, 719 transitions, 1651 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:46:09,165 INFO L231 Difference]: Finished difference. Result has 713 places, 719 transitions, 1495 flow [2025-03-14 01:46:09,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1455, PETRI_DIFFERENCE_MINUEND_PLACES=708, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=719, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1495, PETRI_PLACES=713, PETRI_TRANSITIONS=719} [2025-03-14 01:46:09,167 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -85 predicate places. [2025-03-14 01:46:09,167 INFO L471 AbstractCegarLoop]: Abstraction has has 713 places, 719 transitions, 1495 flow [2025-03-14 01:46:09,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 671.5) internal successors, (4029), 6 states have internal predecessors, (4029), 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-03-14 01:46:09,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:09,173 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] [2025-03-14 01:46:09,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:46:09,173 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:09,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:09,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1525304477, now seen corresponding path program 1 times [2025-03-14 01:46:09,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:09,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566514510] [2025-03-14 01:46:09,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:09,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:09,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-14 01:46:09,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-14 01:46:09,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:09,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:09,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:09,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566514510] [2025-03-14 01:46:09,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566514510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:09,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:09,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:09,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925030914] [2025-03-14 01:46:09,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:09,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:09,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:09,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:09,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:09,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 750 out of 859 [2025-03-14 01:46:09,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 719 transitions, 1495 flow. Second operand has 3 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 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-03-14 01:46:09,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:09,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 750 of 859 [2025-03-14 01:46:09,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:09,499 INFO L124 PetriNetUnfolderBase]: 190/1516 cut-off events. [2025-03-14 01:46:09,500 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-14 01:46:09,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1851 conditions, 1516 events. 190/1516 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 7100 event pairs, 105 based on Foata normal form. 0/1265 useless extension candidates. Maximal degree in co-relation 1787. Up to 253 conditions per place. [2025-03-14 01:46:09,513 INFO L140 encePairwiseOnDemand]: 856/859 looper letters, 18 selfloop transitions, 2 changer transitions 0/718 dead transitions. [2025-03-14 01:46:09,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 718 transitions, 1533 flow [2025-03-14 01:46:09,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:09,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2270 transitions. [2025-03-14 01:46:09,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8808692277842453 [2025-03-14 01:46:09,517 INFO L175 Difference]: Start difference. First operand has 713 places, 719 transitions, 1495 flow. Second operand 3 states and 2270 transitions. [2025-03-14 01:46:09,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 718 transitions, 1533 flow [2025-03-14 01:46:09,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 709 places, 718 transitions, 1493 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:46:09,527 INFO L231 Difference]: Finished difference. Result has 709 places, 718 transitions, 1457 flow [2025-03-14 01:46:09,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=707, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=716, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1457, PETRI_PLACES=709, PETRI_TRANSITIONS=718} [2025-03-14 01:46:09,528 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -89 predicate places. [2025-03-14 01:46:09,528 INFO L471 AbstractCegarLoop]: Abstraction has has 709 places, 718 transitions, 1457 flow [2025-03-14 01:46:09,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 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-03-14 01:46:09,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:09,530 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] [2025-03-14 01:46:09,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:46:09,530 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:09,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:09,531 INFO L85 PathProgramCache]: Analyzing trace with hash 282238441, now seen corresponding path program 1 times [2025-03-14 01:46:09,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:09,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867869137] [2025-03-14 01:46:09,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:09,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:09,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-14 01:46:09,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-14 01:46:09,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:09,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:09,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:09,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:09,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867869137] [2025-03-14 01:46:09,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867869137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:09,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:09,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:09,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353897068] [2025-03-14 01:46:09,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:09,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:09,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:09,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:09,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:09,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 859 [2025-03-14 01:46:09,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 709 places, 718 transitions, 1457 flow. Second operand has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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-03-14 01:46:09,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:09,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 859 [2025-03-14 01:46:09,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:10,994 INFO L124 PetriNetUnfolderBase]: 681/9111 cut-off events. [2025-03-14 01:46:10,994 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2025-03-14 01:46:11,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9940 conditions, 9111 events. 681/9111 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 83762 event pairs, 287 based on Foata normal form. 0/7284 useless extension candidates. Maximal degree in co-relation 9825. Up to 689 conditions per place. [2025-03-14 01:46:11,049 INFO L140 encePairwiseOnDemand]: 852/859 looper letters, 24 selfloop transitions, 1 changer transitions 0/712 dead transitions. [2025-03-14 01:46:11,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 705 places, 712 transitions, 1495 flow [2025-03-14 01:46:11,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:11,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:11,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2253 transitions. [2025-03-14 01:46:11,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8742724097788126 [2025-03-14 01:46:11,052 INFO L175 Difference]: Start difference. First operand has 709 places, 718 transitions, 1457 flow. Second operand 3 states and 2253 transitions. [2025-03-14 01:46:11,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 705 places, 712 transitions, 1495 flow [2025-03-14 01:46:11,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 712 transitions, 1491 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:11,058 INFO L231 Difference]: Finished difference. Result has 703 places, 712 transitions, 1443 flow [2025-03-14 01:46:11,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1441, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1443, PETRI_PLACES=703, PETRI_TRANSITIONS=712} [2025-03-14 01:46:11,059 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -95 predicate places. [2025-03-14 01:46:11,059 INFO L471 AbstractCegarLoop]: Abstraction has has 703 places, 712 transitions, 1443 flow [2025-03-14 01:46:11,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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-03-14 01:46:11,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:11,060 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] [2025-03-14 01:46:11,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:46:11,060 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:11,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:11,061 INFO L85 PathProgramCache]: Analyzing trace with hash -841155412, now seen corresponding path program 1 times [2025-03-14 01:46:11,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:11,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276044196] [2025-03-14 01:46:11,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:11,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:11,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-14 01:46:11,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-14 01:46:11,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:11,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:11,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:11,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:11,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276044196] [2025-03-14 01:46:11,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276044196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:11,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:11,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:11,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108921679] [2025-03-14 01:46:11,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:11,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:11,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:11,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:11,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:11,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 859 [2025-03-14 01:46:11,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 712 transitions, 1443 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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-03-14 01:46:11,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:11,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 859 [2025-03-14 01:46:11,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:11,434 INFO L124 PetriNetUnfolderBase]: 131/1261 cut-off events. [2025-03-14 01:46:11,434 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-14 01:46:11,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1494 conditions, 1261 events. 131/1261 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4969 event pairs, 71 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 1379. Up to 175 conditions per place. [2025-03-14 01:46:11,440 INFO L140 encePairwiseOnDemand]: 856/859 looper letters, 17 selfloop transitions, 2 changer transitions 0/711 dead transitions. [2025-03-14 01:46:11,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 711 transitions, 1479 flow [2025-03-14 01:46:11,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:11,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:11,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2025-03-14 01:46:11,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8816453240201785 [2025-03-14 01:46:11,443 INFO L175 Difference]: Start difference. First operand has 703 places, 712 transitions, 1443 flow. Second operand 3 states and 2272 transitions. [2025-03-14 01:46:11,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 704 places, 711 transitions, 1479 flow [2025-03-14 01:46:11,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 711 transitions, 1478 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:46:11,449 INFO L231 Difference]: Finished difference. Result has 703 places, 711 transitions, 1444 flow [2025-03-14 01:46:11,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=711, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=709, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1444, PETRI_PLACES=703, PETRI_TRANSITIONS=711} [2025-03-14 01:46:11,450 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -95 predicate places. [2025-03-14 01:46:11,451 INFO L471 AbstractCegarLoop]: Abstraction has has 703 places, 711 transitions, 1444 flow [2025-03-14 01:46:11,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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-03-14 01:46:11,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:11,451 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] [2025-03-14 01:46:11,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:46:11,452 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:11,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:11,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1810543987, now seen corresponding path program 1 times [2025-03-14 01:46:11,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:11,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072686867] [2025-03-14 01:46:11,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:11,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:11,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-14 01:46:11,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-14 01:46:11,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:11,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:11,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:11,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:11,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072686867] [2025-03-14 01:46:11,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072686867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:11,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:11,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:11,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355943647] [2025-03-14 01:46:11,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:11,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:11,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:11,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:11,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:11,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 859 [2025-03-14 01:46:11,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 711 transitions, 1444 flow. Second operand has 3 states, 3 states have (on average 757.0) internal successors, (2271), 3 states have internal predecessors, (2271), 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-03-14 01:46:11,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:11,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 859 [2025-03-14 01:46:11,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:11,621 INFO L124 PetriNetUnfolderBase]: 70/1071 cut-off events. [2025-03-14 01:46:11,621 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-14 01:46:11,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 1071 events. 70/1071 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3586 event pairs, 27 based on Foata normal form. 0/940 useless extension candidates. Maximal degree in co-relation 1080. Up to 83 conditions per place. [2025-03-14 01:46:11,629 INFO L140 encePairwiseOnDemand]: 857/859 looper letters, 14 selfloop transitions, 1 changer transitions 0/710 dead transitions. [2025-03-14 01:46:11,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 710 transitions, 1472 flow [2025-03-14 01:46:11,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:11,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:11,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2283 transitions. [2025-03-14 01:46:11,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8859138533178114 [2025-03-14 01:46:11,633 INFO L175 Difference]: Start difference. First operand has 703 places, 711 transitions, 1444 flow. Second operand 3 states and 2283 transitions. [2025-03-14 01:46:11,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 704 places, 710 transitions, 1472 flow [2025-03-14 01:46:11,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 710 transitions, 1468 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:11,640 INFO L231 Difference]: Finished difference. Result has 702 places, 710 transitions, 1440 flow [2025-03-14 01:46:11,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1438, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=709, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1440, PETRI_PLACES=702, PETRI_TRANSITIONS=710} [2025-03-14 01:46:11,641 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -96 predicate places. [2025-03-14 01:46:11,641 INFO L471 AbstractCegarLoop]: Abstraction has has 702 places, 710 transitions, 1440 flow [2025-03-14 01:46:11,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 757.0) internal successors, (2271), 3 states have internal predecessors, (2271), 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-03-14 01:46:11,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:11,642 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:11,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:46:11,642 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:11,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:11,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1784870986, now seen corresponding path program 1 times [2025-03-14 01:46:11,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:11,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383912486] [2025-03-14 01:46:11,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:11,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:11,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-14 01:46:11,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-14 01:46:11,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:11,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:11,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:11,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:11,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383912486] [2025-03-14 01:46:11,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383912486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:11,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:11,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:11,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988180866] [2025-03-14 01:46:11,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:11,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:11,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:11,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:11,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:11,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 859 [2025-03-14 01:46:11,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 710 transitions, 1440 flow. Second operand has 3 states, 3 states have (on average 754.3333333333334) internal successors, (2263), 3 states have internal predecessors, (2263), 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-03-14 01:46:11,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:11,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 859 [2025-03-14 01:46:11,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:11,841 INFO L124 PetriNetUnfolderBase]: 70/1070 cut-off events. [2025-03-14 01:46:11,841 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-14 01:46:11,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 1070 events. 70/1070 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3611 event pairs, 27 based on Foata normal form. 0/940 useless extension candidates. Maximal degree in co-relation 1080. Up to 85 conditions per place. [2025-03-14 01:46:11,847 INFO L140 encePairwiseOnDemand]: 856/859 looper letters, 15 selfloop transitions, 2 changer transitions 0/709 dead transitions. [2025-03-14 01:46:11,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 709 transitions, 1472 flow [2025-03-14 01:46:11,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:11,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:11,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2276 transitions. [2025-03-14 01:46:11,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.883197516492045 [2025-03-14 01:46:11,850 INFO L175 Difference]: Start difference. First operand has 702 places, 710 transitions, 1440 flow. Second operand 3 states and 2276 transitions. [2025-03-14 01:46:11,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 709 transitions, 1472 flow [2025-03-14 01:46:11,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 709 transitions, 1471 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:46:11,856 INFO L231 Difference]: Finished difference. Result has 702 places, 709 transitions, 1441 flow [2025-03-14 01:46:11,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=709, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=707, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1441, PETRI_PLACES=702, PETRI_TRANSITIONS=709} [2025-03-14 01:46:11,857 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -96 predicate places. [2025-03-14 01:46:11,857 INFO L471 AbstractCegarLoop]: Abstraction has has 702 places, 709 transitions, 1441 flow [2025-03-14 01:46:11,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.3333333333334) internal successors, (2263), 3 states have internal predecessors, (2263), 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-03-14 01:46:11,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:11,858 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:11,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 01:46:11,858 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:11,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:11,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1590441029, now seen corresponding path program 1 times [2025-03-14 01:46:11,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:11,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765032961] [2025-03-14 01:46:11,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:11,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:11,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-14 01:46:11,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-14 01:46:11,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:11,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:11,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:11,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765032961] [2025-03-14 01:46:11,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765032961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:11,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:11,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:11,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650680791] [2025-03-14 01:46:11,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:11,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:11,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:11,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:11,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:12,073 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 700 out of 859 [2025-03-14 01:46:12,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 709 transitions, 1441 flow. Second operand has 3 states, 3 states have (on average 702.0) internal successors, (2106), 3 states have internal predecessors, (2106), 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-03-14 01:46:12,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:12,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 700 of 859 [2025-03-14 01:46:12,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:13,568 INFO L124 PetriNetUnfolderBase]: 2081/10172 cut-off events. [2025-03-14 01:46:13,568 INFO L125 PetriNetUnfolderBase]: For 690/690 co-relation queries the response was YES. [2025-03-14 01:46:13,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13483 conditions, 10172 events. 2081/10172 cut-off events. For 690/690 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 90609 event pairs, 1421 based on Foata normal form. 0/8440 useless extension candidates. Maximal degree in co-relation 13369. Up to 2833 conditions per place. [2025-03-14 01:46:13,625 INFO L140 encePairwiseOnDemand]: 856/859 looper letters, 69 selfloop transitions, 2 changer transitions 0/708 dead transitions. [2025-03-14 01:46:13,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 708 transitions, 1581 flow [2025-03-14 01:46:13,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:13,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:13,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2171 transitions. [2025-03-14 01:46:13,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8424524641055491 [2025-03-14 01:46:13,629 INFO L175 Difference]: Start difference. First operand has 702 places, 709 transitions, 1441 flow. Second operand 3 states and 2171 transitions. [2025-03-14 01:46:13,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 708 transitions, 1581 flow [2025-03-14 01:46:13,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 708 transitions, 1577 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:13,638 INFO L231 Difference]: Finished difference. Result has 701 places, 708 transitions, 1439 flow [2025-03-14 01:46:13,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=699, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=708, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=706, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1439, PETRI_PLACES=701, PETRI_TRANSITIONS=708} [2025-03-14 01:46:13,639 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -97 predicate places. [2025-03-14 01:46:13,639 INFO L471 AbstractCegarLoop]: Abstraction has has 701 places, 708 transitions, 1439 flow [2025-03-14 01:46:13,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 702.0) internal successors, (2106), 3 states have internal predecessors, (2106), 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-03-14 01:46:13,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:13,640 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:13,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 01:46:13,640 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:13,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:13,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1812499247, now seen corresponding path program 1 times [2025-03-14 01:46:13,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:13,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256159995] [2025-03-14 01:46:13,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:13,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:13,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-14 01:46:13,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-14 01:46:13,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:13,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:13,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:13,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256159995] [2025-03-14 01:46:13,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256159995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:13,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:13,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:13,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633786922] [2025-03-14 01:46:13,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:13,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:13,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:13,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:13,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:13,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 752 out of 859 [2025-03-14 01:46:13,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 708 transitions, 1439 flow. Second operand has 3 states, 3 states have (on average 753.3333333333334) internal successors, (2260), 3 states have internal predecessors, (2260), 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-03-14 01:46:13,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:13,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 752 of 859 [2025-03-14 01:46:13,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:13,944 INFO L124 PetriNetUnfolderBase]: 110/1209 cut-off events. [2025-03-14 01:46:13,944 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-14 01:46:13,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1400 conditions, 1209 events. 110/1209 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4397 event pairs, 53 based on Foata normal form. 0/1043 useless extension candidates. Maximal degree in co-relation 1387. Up to 141 conditions per place. [2025-03-14 01:46:13,954 INFO L140 encePairwiseOnDemand]: 856/859 looper letters, 16 selfloop transitions, 2 changer transitions 0/707 dead transitions. [2025-03-14 01:46:13,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 707 transitions, 1473 flow [2025-03-14 01:46:13,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:13,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:13,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2274 transitions. [2025-03-14 01:46:13,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8824214202561118 [2025-03-14 01:46:13,958 INFO L175 Difference]: Start difference. First operand has 701 places, 708 transitions, 1439 flow. Second operand 3 states and 2274 transitions. [2025-03-14 01:46:13,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 707 transitions, 1473 flow [2025-03-14 01:46:13,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 707 transitions, 1469 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:13,966 INFO L231 Difference]: Finished difference. Result has 700 places, 707 transitions, 1437 flow [2025-03-14 01:46:13,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1433, PETRI_DIFFERENCE_MINUEND_PLACES=698, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=707, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=705, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1437, PETRI_PLACES=700, PETRI_TRANSITIONS=707} [2025-03-14 01:46:13,967 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -98 predicate places. [2025-03-14 01:46:13,967 INFO L471 AbstractCegarLoop]: Abstraction has has 700 places, 707 transitions, 1437 flow [2025-03-14 01:46:13,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 753.3333333333334) internal successors, (2260), 3 states have internal predecessors, (2260), 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-03-14 01:46:13,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:13,968 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:13,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-14 01:46:13,968 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:13,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:13,969 INFO L85 PathProgramCache]: Analyzing trace with hash 848890673, now seen corresponding path program 1 times [2025-03-14 01:46:13,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:13,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622344524] [2025-03-14 01:46:13,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:13,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:13,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-03-14 01:46:13,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-03-14 01:46:13,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:13,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:14,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:14,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:14,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622344524] [2025-03-14 01:46:14,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622344524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:14,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:14,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:14,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283743704] [2025-03-14 01:46:14,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:14,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:14,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:14,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:14,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:14,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 859 [2025-03-14 01:46:14,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 707 transitions, 1437 flow. Second operand has 3 states, 3 states have (on average 745.0) internal successors, (2235), 3 states have internal predecessors, (2235), 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-03-14 01:46:14,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:14,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 859 [2025-03-14 01:46:14,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:14,827 INFO L124 PetriNetUnfolderBase]: 252/4797 cut-off events. [2025-03-14 01:46:14,827 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-03-14 01:46:14,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5075 conditions, 4797 events. 252/4797 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 35623 event pairs, 79 based on Foata normal form. 0/3907 useless extension candidates. Maximal degree in co-relation 4960. Up to 220 conditions per place. [2025-03-14 01:46:14,860 INFO L140 encePairwiseOnDemand]: 853/859 looper letters, 22 selfloop transitions, 1 changer transitions 0/702 dead transitions. [2025-03-14 01:46:14,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 702 transitions, 1473 flow [2025-03-14 01:46:14,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:14,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:14,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2259 transitions. [2025-03-14 01:46:14,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8766006984866124 [2025-03-14 01:46:14,864 INFO L175 Difference]: Start difference. First operand has 700 places, 707 transitions, 1437 flow. Second operand 3 states and 2259 transitions. [2025-03-14 01:46:14,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 697 places, 702 transitions, 1473 flow [2025-03-14 01:46:14,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 702 transitions, 1469 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:14,872 INFO L231 Difference]: Finished difference. Result has 695 places, 702 transitions, 1425 flow [2025-03-14 01:46:14,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1423, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=701, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1425, PETRI_PLACES=695, PETRI_TRANSITIONS=702} [2025-03-14 01:46:14,873 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -103 predicate places. [2025-03-14 01:46:14,873 INFO L471 AbstractCegarLoop]: Abstraction has has 695 places, 702 transitions, 1425 flow [2025-03-14 01:46:14,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 745.0) internal successors, (2235), 3 states have internal predecessors, (2235), 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-03-14 01:46:14,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:14,874 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:14,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-14 01:46:14,874 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:14,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:14,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1566193740, now seen corresponding path program 1 times [2025-03-14 01:46:14,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:14,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331444859] [2025-03-14 01:46:14,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:14,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:14,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-14 01:46:14,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-14 01:46:14,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:14,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:14,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:14,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:14,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331444859] [2025-03-14 01:46:14,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331444859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:14,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:14,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:14,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812520485] [2025-03-14 01:46:14,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:14,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:14,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:14,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:14,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:14,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 859 [2025-03-14 01:46:14,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 702 transitions, 1425 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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-03-14 01:46:14,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:14,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 859 [2025-03-14 01:46:14,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:15,180 INFO L124 PetriNetUnfolderBase]: 110/1203 cut-off events. [2025-03-14 01:46:15,180 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-14 01:46:15,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1394 conditions, 1203 events. 110/1203 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4650 event pairs, 53 based on Foata normal form. 0/1045 useless extension candidates. Maximal degree in co-relation 1279. Up to 142 conditions per place. [2025-03-14 01:46:15,187 INFO L140 encePairwiseOnDemand]: 856/859 looper letters, 17 selfloop transitions, 2 changer transitions 0/701 dead transitions. [2025-03-14 01:46:15,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 696 places, 701 transitions, 1461 flow [2025-03-14 01:46:15,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:15,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:15,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2025-03-14 01:46:15,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8816453240201785 [2025-03-14 01:46:15,191 INFO L175 Difference]: Start difference. First operand has 695 places, 702 transitions, 1425 flow. Second operand 3 states and 2272 transitions. [2025-03-14 01:46:15,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 696 places, 701 transitions, 1461 flow [2025-03-14 01:46:15,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 701 transitions, 1460 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:46:15,197 INFO L231 Difference]: Finished difference. Result has 695 places, 701 transitions, 1426 flow [2025-03-14 01:46:15,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1426, PETRI_PLACES=695, PETRI_TRANSITIONS=701} [2025-03-14 01:46:15,198 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -103 predicate places. [2025-03-14 01:46:15,199 INFO L471 AbstractCegarLoop]: Abstraction has has 695 places, 701 transitions, 1426 flow [2025-03-14 01:46:15,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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-03-14 01:46:15,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:15,199 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:15,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-14 01:46:15,200 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:15,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:15,200 INFO L85 PathProgramCache]: Analyzing trace with hash 255731451, now seen corresponding path program 1 times [2025-03-14 01:46:15,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:15,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049008100] [2025-03-14 01:46:15,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:15,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:15,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-14 01:46:15,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-14 01:46:15,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:15,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:15,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:15,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:15,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049008100] [2025-03-14 01:46:15,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049008100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:15,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:15,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:15,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966659459] [2025-03-14 01:46:15,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:15,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:15,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:15,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:15,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:15,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 859 [2025-03-14 01:46:15,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 701 transitions, 1426 flow. Second operand has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 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-03-14 01:46:15,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:15,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 859 [2025-03-14 01:46:15,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:15,924 INFO L124 PetriNetUnfolderBase]: 293/5079 cut-off events. [2025-03-14 01:46:15,925 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-03-14 01:46:15,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5418 conditions, 5079 events. 293/5079 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 37534 event pairs, 40 based on Foata normal form. 0/4166 useless extension candidates. Maximal degree in co-relation 5304. Up to 227 conditions per place. [2025-03-14 01:46:15,958 INFO L140 encePairwiseOnDemand]: 854/859 looper letters, 26 selfloop transitions, 3 changer transitions 0/711 dead transitions. [2025-03-14 01:46:15,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 695 places, 711 transitions, 1512 flow [2025-03-14 01:46:15,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:15,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:15,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2289 transitions. [2025-03-14 01:46:15,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8882421420256111 [2025-03-14 01:46:15,961 INFO L175 Difference]: Start difference. First operand has 695 places, 701 transitions, 1426 flow. Second operand 3 states and 2289 transitions. [2025-03-14 01:46:15,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 695 places, 711 transitions, 1512 flow [2025-03-14 01:46:15,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 693 places, 711 transitions, 1508 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:15,967 INFO L231 Difference]: Finished difference. Result has 694 places, 702 transitions, 1441 flow [2025-03-14 01:46:15,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=691, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=699, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1441, PETRI_PLACES=694, PETRI_TRANSITIONS=702} [2025-03-14 01:46:15,967 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -104 predicate places. [2025-03-14 01:46:15,967 INFO L471 AbstractCegarLoop]: Abstraction has has 694 places, 702 transitions, 1441 flow [2025-03-14 01:46:15,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 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-03-14 01:46:15,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:15,968 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:15,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-14 01:46:15,968 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:15,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:15,969 INFO L85 PathProgramCache]: Analyzing trace with hash 944850184, now seen corresponding path program 1 times [2025-03-14 01:46:15,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:15,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216256146] [2025-03-14 01:46:15,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:15,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:15,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-14 01:46:15,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-14 01:46:15,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:15,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:16,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:16,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:16,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216256146] [2025-03-14 01:46:16,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216256146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:16,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:16,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:16,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684655233] [2025-03-14 01:46:16,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:16,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:16,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:16,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:16,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:16,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 859 [2025-03-14 01:46:16,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 694 places, 702 transitions, 1441 flow. Second operand has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 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-03-14 01:46:16,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:16,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 859 [2025-03-14 01:46:16,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:16,840 INFO L124 PetriNetUnfolderBase]: 364/5532 cut-off events. [2025-03-14 01:46:16,840 INFO L125 PetriNetUnfolderBase]: For 183/225 co-relation queries the response was YES. [2025-03-14 01:46:16,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6060 conditions, 5532 events. 364/5532 cut-off events. For 183/225 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 41746 event pairs, 54 based on Foata normal form. 0/4545 useless extension candidates. Maximal degree in co-relation 5945. Up to 301 conditions per place. [2025-03-14 01:46:16,883 INFO L140 encePairwiseOnDemand]: 854/859 looper letters, 27 selfloop transitions, 4 changer transitions 0/713 dead transitions. [2025-03-14 01:46:16,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 713 transitions, 1540 flow [2025-03-14 01:46:16,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:16,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:16,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2289 transitions. [2025-03-14 01:46:16,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8882421420256111 [2025-03-14 01:46:16,885 INFO L175 Difference]: Start difference. First operand has 694 places, 702 transitions, 1441 flow. Second operand 3 states and 2289 transitions. [2025-03-14 01:46:16,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 713 transitions, 1540 flow [2025-03-14 01:46:16,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 694 places, 713 transitions, 1540 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:46:16,892 INFO L231 Difference]: Finished difference. Result has 695 places, 704 transitions, 1474 flow [2025-03-14 01:46:16,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=692, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=695, PETRI_TRANSITIONS=704} [2025-03-14 01:46:16,892 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -103 predicate places. [2025-03-14 01:46:16,892 INFO L471 AbstractCegarLoop]: Abstraction has has 695 places, 704 transitions, 1474 flow [2025-03-14 01:46:16,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 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-03-14 01:46:16,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:16,893 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:16,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-14 01:46:16,893 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err31ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:16,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:16,894 INFO L85 PathProgramCache]: Analyzing trace with hash -92111156, now seen corresponding path program 1 times [2025-03-14 01:46:16,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:16,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464117807] [2025-03-14 01:46:16,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:16,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:16,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-14 01:46:16,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-14 01:46:16,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:16,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:16,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:16,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:16,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464117807] [2025-03-14 01:46:16,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464117807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:16,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:16,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:16,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875283336] [2025-03-14 01:46:16,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:16,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:16,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:16,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:16,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:16,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 757 out of 859 [2025-03-14 01:46:16,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 704 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 758.0) internal successors, (2274), 3 states have internal predecessors, (2274), 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-03-14 01:46:16,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:16,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 757 of 859 [2025-03-14 01:46:16,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:17,474 INFO L124 PetriNetUnfolderBase]: 281/4298 cut-off events. [2025-03-14 01:46:17,474 INFO L125 PetriNetUnfolderBase]: For 435/689 co-relation queries the response was YES. [2025-03-14 01:46:17,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4916 conditions, 4298 events. 281/4298 cut-off events. For 435/689 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 29323 event pairs, 46 based on Foata normal form. 1/3569 useless extension candidates. Maximal degree in co-relation 4801. Up to 227 conditions per place. [2025-03-14 01:46:17,508 INFO L140 encePairwiseOnDemand]: 854/859 looper letters, 23 selfloop transitions, 4 changer transitions 0/713 dead transitions. [2025-03-14 01:46:17,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 696 places, 713 transitions, 1578 flow [2025-03-14 01:46:17,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:17,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:17,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2291 transitions. [2025-03-14 01:46:17,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8890182382615445 [2025-03-14 01:46:17,511 INFO L175 Difference]: Start difference. First operand has 695 places, 704 transitions, 1474 flow. Second operand 3 states and 2291 transitions. [2025-03-14 01:46:17,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 696 places, 713 transitions, 1578 flow [2025-03-14 01:46:17,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 696 places, 713 transitions, 1578 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:46:17,517 INFO L231 Difference]: Finished difference. Result has 697 places, 706 transitions, 1496 flow [2025-03-14 01:46:17,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=694, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1496, PETRI_PLACES=697, PETRI_TRANSITIONS=706} [2025-03-14 01:46:17,517 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -101 predicate places. [2025-03-14 01:46:17,517 INFO L471 AbstractCegarLoop]: Abstraction has has 697 places, 706 transitions, 1496 flow [2025-03-14 01:46:17,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 758.0) internal successors, (2274), 3 states have internal predecessors, (2274), 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-03-14 01:46:17,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:17,518 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:17,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-14 01:46:17,518 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err35ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:17,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:17,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1967767626, now seen corresponding path program 1 times [2025-03-14 01:46:17,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:17,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069594142] [2025-03-14 01:46:17,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:17,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:17,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-14 01:46:17,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-14 01:46:17,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:17,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:17,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:17,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:17,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069594142] [2025-03-14 01:46:17,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069594142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:17,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:17,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:17,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465312852] [2025-03-14 01:46:17,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:17,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:17,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:17,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:17,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:17,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 859 [2025-03-14 01:46:17,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 697 places, 706 transitions, 1496 flow. Second operand has 3 states, 3 states have (on average 757.6666666666666) internal successors, (2273), 3 states have internal predecessors, (2273), 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-03-14 01:46:17,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:17,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 859 [2025-03-14 01:46:17,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:18,572 INFO L124 PetriNetUnfolderBase]: 563/7838 cut-off events. [2025-03-14 01:46:18,572 INFO L125 PetriNetUnfolderBase]: For 844/890 co-relation queries the response was YES. [2025-03-14 01:46:18,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9152 conditions, 7838 events. 563/7838 cut-off events. For 844/890 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 67567 event pairs, 82 based on Foata normal form. 0/6480 useless extension candidates. Maximal degree in co-relation 9036. Up to 306 conditions per place. [2025-03-14 01:46:18,620 INFO L140 encePairwiseOnDemand]: 856/859 looper letters, 30 selfloop transitions, 2 changer transitions 0/717 dead transitions. [2025-03-14 01:46:18,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 698 places, 717 transitions, 1620 flow [2025-03-14 01:46:18,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:18,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:18,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2290 transitions. [2025-03-14 01:46:18,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8886301901435778 [2025-03-14 01:46:18,623 INFO L175 Difference]: Start difference. First operand has 697 places, 706 transitions, 1496 flow. Second operand 3 states and 2290 transitions. [2025-03-14 01:46:18,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 698 places, 717 transitions, 1620 flow [2025-03-14 01:46:18,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 697 places, 717 transitions, 1613 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:46:18,629 INFO L231 Difference]: Finished difference. Result has 697 places, 705 transitions, 1494 flow [2025-03-14 01:46:18,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=695, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=703, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1494, PETRI_PLACES=697, PETRI_TRANSITIONS=705} [2025-03-14 01:46:18,630 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -101 predicate places. [2025-03-14 01:46:18,631 INFO L471 AbstractCegarLoop]: Abstraction has has 697 places, 705 transitions, 1494 flow [2025-03-14 01:46:18,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 757.6666666666666) internal successors, (2273), 3 states have internal predecessors, (2273), 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-03-14 01:46:18,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:18,631 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:18,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-14 01:46:18,632 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:18,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:18,632 INFO L85 PathProgramCache]: Analyzing trace with hash -132102801, now seen corresponding path program 1 times [2025-03-14 01:46:18,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:18,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558036839] [2025-03-14 01:46:18,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:18,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:18,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-14 01:46:18,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-14 01:46:18,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:18,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:18,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:18,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:18,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558036839] [2025-03-14 01:46:18,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558036839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:18,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:18,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:18,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255574407] [2025-03-14 01:46:18,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:18,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:18,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:18,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:18,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:18,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 859 [2025-03-14 01:46:18,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 697 places, 705 transitions, 1494 flow. Second operand has 3 states, 3 states have (on average 754.6666666666666) internal successors, (2264), 3 states have internal predecessors, (2264), 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-03-14 01:46:18,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:18,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 859 [2025-03-14 01:46:18,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:20,443 INFO L124 PetriNetUnfolderBase]: 802/11926 cut-off events. [2025-03-14 01:46:20,443 INFO L125 PetriNetUnfolderBase]: For 1117/1431 co-relation queries the response was YES. [2025-03-14 01:46:20,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13666 conditions, 11926 events. 802/11926 cut-off events. For 1117/1431 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 115329 event pairs, 89 based on Foata normal form. 2/9815 useless extension candidates. Maximal degree in co-relation 13549. Up to 609 conditions per place. [2025-03-14 01:46:20,537 INFO L140 encePairwiseOnDemand]: 855/859 looper letters, 36 selfloop transitions, 2 changer transitions 0/719 dead transitions. [2025-03-14 01:46:20,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 719 transitions, 1639 flow [2025-03-14 01:46:20,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:20,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:20,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2288 transitions. [2025-03-14 01:46:20,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8878540939076446 [2025-03-14 01:46:20,539 INFO L175 Difference]: Start difference. First operand has 697 places, 705 transitions, 1494 flow. Second operand 3 states and 2288 transitions. [2025-03-14 01:46:20,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 697 places, 719 transitions, 1639 flow [2025-03-14 01:46:20,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 719 transitions, 1635 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:20,546 INFO L231 Difference]: Finished difference. Result has 696 places, 705 transitions, 1500 flow [2025-03-14 01:46:20,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=701, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1500, PETRI_PLACES=696, PETRI_TRANSITIONS=705} [2025-03-14 01:46:20,546 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -102 predicate places. [2025-03-14 01:46:20,546 INFO L471 AbstractCegarLoop]: Abstraction has has 696 places, 705 transitions, 1500 flow [2025-03-14 01:46:20,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.6666666666666) internal successors, (2264), 3 states have internal predecessors, (2264), 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-03-14 01:46:20,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:20,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-14 01:46:20,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-14 01:46:20,547 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:20,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:20,548 INFO L85 PathProgramCache]: Analyzing trace with hash -240796327, now seen corresponding path program 1 times [2025-03-14 01:46:20,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:20,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367125061] [2025-03-14 01:46:20,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:20,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:20,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-14 01:46:20,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-14 01:46:20,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:20,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:20,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:20,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:20,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367125061] [2025-03-14 01:46:20,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367125061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:20,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:20,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:20,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610584289] [2025-03-14 01:46:20,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:20,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:20,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:20,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:20,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:20,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 859 [2025-03-14 01:46:20,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 696 places, 705 transitions, 1500 flow. Second operand has 3 states, 3 states have (on average 748.0) internal successors, (2244), 3 states have internal predecessors, (2244), 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-03-14 01:46:20,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:20,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 859 [2025-03-14 01:46:20,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:22,311 INFO L124 PetriNetUnfolderBase]: 1392/12996 cut-off events. [2025-03-14 01:46:22,311 INFO L125 PetriNetUnfolderBase]: For 2108/2200 co-relation queries the response was YES. [2025-03-14 01:46:22,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16433 conditions, 12996 events. 1392/12996 cut-off events. For 2108/2200 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 126230 event pairs, 139 based on Foata normal form. 5/10992 useless extension candidates. Maximal degree in co-relation 16315. Up to 1242 conditions per place. [2025-03-14 01:46:22,423 INFO L140 encePairwiseOnDemand]: 852/859 looper letters, 34 selfloop transitions, 2 changer transitions 5/713 dead transitions. [2025-03-14 01:46:22,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 713 transitions, 1627 flow [2025-03-14 01:46:22,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:22,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2269 transitions. [2025-03-14 01:46:22,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8804811796662786 [2025-03-14 01:46:22,425 INFO L175 Difference]: Start difference. First operand has 696 places, 705 transitions, 1500 flow. Second operand 3 states and 2269 transitions. [2025-03-14 01:46:22,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 713 transitions, 1627 flow [2025-03-14 01:46:22,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 694 places, 713 transitions, 1627 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:46:22,432 INFO L231 Difference]: Finished difference. Result has 694 places, 696 transitions, 1481 flow [2025-03-14 01:46:22,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1492, PETRI_DIFFERENCE_MINUEND_PLACES=692, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1481, PETRI_PLACES=694, PETRI_TRANSITIONS=696} [2025-03-14 01:46:22,435 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -104 predicate places. [2025-03-14 01:46:22,435 INFO L471 AbstractCegarLoop]: Abstraction has has 694 places, 696 transitions, 1481 flow [2025-03-14 01:46:22,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 748.0) internal successors, (2244), 3 states have internal predecessors, (2244), 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-03-14 01:46:22,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:22,436 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:22,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-14 01:46:22,436 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:22,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:22,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1422244819, now seen corresponding path program 1 times [2025-03-14 01:46:22,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:22,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582502849] [2025-03-14 01:46:22,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:22,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:22,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-14 01:46:22,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-14 01:46:22,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:22,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:22,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:22,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:22,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582502849] [2025-03-14 01:46:22,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582502849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:22,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:22,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:46:22,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851514829] [2025-03-14 01:46:22,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:22,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:46:22,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:22,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:46:22,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:46:22,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 752 out of 859 [2025-03-14 01:46:22,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 694 places, 696 transitions, 1481 flow. Second operand has 4 states, 4 states have (on average 753.75) internal successors, (3015), 4 states have internal predecessors, (3015), 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-03-14 01:46:22,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:22,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 752 of 859 [2025-03-14 01:46:22,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:24,405 INFO L124 PetriNetUnfolderBase]: 745/11284 cut-off events. [2025-03-14 01:46:24,405 INFO L125 PetriNetUnfolderBase]: For 1367/1536 co-relation queries the response was YES. [2025-03-14 01:46:24,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13296 conditions, 11284 events. 745/11284 cut-off events. For 1367/1536 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 107171 event pairs, 100 based on Foata normal form. 0/9466 useless extension candidates. Maximal degree in co-relation 13176. Up to 271 conditions per place. [2025-03-14 01:46:24,506 INFO L140 encePairwiseOnDemand]: 852/859 looper letters, 35 selfloop transitions, 6 changer transitions 0/713 dead transitions. [2025-03-14 01:46:24,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 713 transitions, 1669 flow [2025-03-14 01:46:24,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:46:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:46:24,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3036 transitions. [2025-03-14 01:46:24,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8835855646100116 [2025-03-14 01:46:24,508 INFO L175 Difference]: Start difference. First operand has 694 places, 696 transitions, 1481 flow. Second operand 4 states and 3036 transitions. [2025-03-14 01:46:24,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 693 places, 713 transitions, 1669 flow [2025-03-14 01:46:24,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 713 transitions, 1665 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:24,515 INFO L231 Difference]: Finished difference. Result has 691 places, 695 transitions, 1487 flow [2025-03-14 01:46:24,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1475, PETRI_DIFFERENCE_MINUEND_PLACES=688, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=689, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1487, PETRI_PLACES=691, PETRI_TRANSITIONS=695} [2025-03-14 01:46:24,516 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -107 predicate places. [2025-03-14 01:46:24,516 INFO L471 AbstractCegarLoop]: Abstraction has has 691 places, 695 transitions, 1487 flow [2025-03-14 01:46:24,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 753.75) internal successors, (3015), 4 states have internal predecessors, (3015), 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-03-14 01:46:24,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:24,517 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:24,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-14 01:46:24,517 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err31ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:24,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:24,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1551494184, now seen corresponding path program 1 times [2025-03-14 01:46:24,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:24,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837587240] [2025-03-14 01:46:24,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:24,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:24,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-14 01:46:24,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-14 01:46:24,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:24,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:24,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:24,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:24,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837587240] [2025-03-14 01:46:24,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837587240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:24,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:24,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:24,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480937571] [2025-03-14 01:46:24,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:24,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:24,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:24,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:24,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:24,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 725 out of 859 [2025-03-14 01:46:24,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 695 transitions, 1487 flow. Second operand has 3 states, 3 states have (on average 727.0) internal successors, (2181), 3 states have internal predecessors, (2181), 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-03-14 01:46:24,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:24,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 725 of 859 [2025-03-14 01:46:24,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:26,958 INFO L124 PetriNetUnfolderBase]: 2838/15314 cut-off events. [2025-03-14 01:46:26,959 INFO L125 PetriNetUnfolderBase]: For 5183/5263 co-relation queries the response was YES. [2025-03-14 01:46:27,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23253 conditions, 15314 events. 2838/15314 cut-off events. For 5183/5263 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 154702 event pairs, 112 based on Foata normal form. 0/13633 useless extension candidates. Maximal degree in co-relation 23132. Up to 3602 conditions per place. [2025-03-14 01:46:27,038 INFO L140 encePairwiseOnDemand]: 845/859 looper letters, 50 selfloop transitions, 3 changer transitions 0/697 dead transitions. [2025-03-14 01:46:27,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 697 transitions, 1634 flow [2025-03-14 01:46:27,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:27,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:27,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2228 transitions. [2025-03-14 01:46:27,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8645712068296468 [2025-03-14 01:46:27,040 INFO L175 Difference]: Start difference. First operand has 691 places, 695 transitions, 1487 flow. Second operand 3 states and 2228 transitions. [2025-03-14 01:46:27,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 682 places, 697 transitions, 1634 flow [2025-03-14 01:46:27,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 697 transitions, 1620 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:46:27,047 INFO L231 Difference]: Finished difference. Result has 680 places, 685 transitions, 1466 flow [2025-03-14 01:46:27,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1466, PETRI_PLACES=680, PETRI_TRANSITIONS=685} [2025-03-14 01:46:27,048 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -118 predicate places. [2025-03-14 01:46:27,048 INFO L471 AbstractCegarLoop]: Abstraction has has 680 places, 685 transitions, 1466 flow [2025-03-14 01:46:27,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 727.0) internal successors, (2181), 3 states have internal predecessors, (2181), 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-03-14 01:46:27,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:27,048 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:27,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-14 01:46:27,049 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:27,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:27,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1680706484, now seen corresponding path program 1 times [2025-03-14 01:46:27,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:27,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867812171] [2025-03-14 01:46:27,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:27,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:27,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-14 01:46:27,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-14 01:46:27,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:27,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:27,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:27,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:27,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867812171] [2025-03-14 01:46:27,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867812171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:27,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:27,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 01:46:27,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674973760] [2025-03-14 01:46:27,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:27,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 01:46:27,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:27,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 01:46:27,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:46:27,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 714 out of 859 [2025-03-14 01:46:27,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 685 transitions, 1466 flow. Second operand has 8 states, 8 states have (on average 718.25) internal successors, (5746), 8 states have internal predecessors, (5746), 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-03-14 01:46:27,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:27,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 714 of 859 [2025-03-14 01:46:27,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:29,334 INFO L124 PetriNetUnfolderBase]: 709/7349 cut-off events. [2025-03-14 01:46:29,334 INFO L125 PetriNetUnfolderBase]: For 1914/2695 co-relation queries the response was YES. [2025-03-14 01:46:29,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9683 conditions, 7349 events. 709/7349 cut-off events. For 1914/2695 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 56891 event pairs, 269 based on Foata normal form. 20/6444 useless extension candidates. Maximal degree in co-relation 9561. Up to 740 conditions per place. [2025-03-14 01:46:29,417 INFO L140 encePairwiseOnDemand]: 848/859 looper letters, 94 selfloop transitions, 12 changer transitions 0/730 dead transitions. [2025-03-14 01:46:29,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 688 places, 730 transitions, 1809 flow [2025-03-14 01:46:29,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:46:29,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:46:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 6522 transitions. [2025-03-14 01:46:29,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.843616608459449 [2025-03-14 01:46:29,422 INFO L175 Difference]: Start difference. First operand has 680 places, 685 transitions, 1466 flow. Second operand 9 states and 6522 transitions. [2025-03-14 01:46:29,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 688 places, 730 transitions, 1809 flow [2025-03-14 01:46:29,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 687 places, 730 transitions, 1806 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:46:29,430 INFO L231 Difference]: Finished difference. Result has 690 places, 690 transitions, 1513 flow [2025-03-14 01:46:29,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=679, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1513, PETRI_PLACES=690, PETRI_TRANSITIONS=690} [2025-03-14 01:46:29,431 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -108 predicate places. [2025-03-14 01:46:29,431 INFO L471 AbstractCegarLoop]: Abstraction has has 690 places, 690 transitions, 1513 flow [2025-03-14 01:46:29,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 718.25) internal successors, (5746), 8 states have internal predecessors, (5746), 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-03-14 01:46:29,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:29,432 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:29,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-14 01:46:29,432 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:29,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:29,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1685183394, now seen corresponding path program 1 times [2025-03-14 01:46:29,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:29,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119502144] [2025-03-14 01:46:29,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:29,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:29,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-14 01:46:29,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-14 01:46:29,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:29,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:30,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:30,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:30,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119502144] [2025-03-14 01:46:30,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119502144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:30,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:30,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:46:30,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392356086] [2025-03-14 01:46:30,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:30,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:46:30,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:30,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:46:30,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:46:30,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 699 out of 859 [2025-03-14 01:46:30,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 690 places, 690 transitions, 1513 flow. Second operand has 6 states, 6 states have (on average 700.6666666666666) internal successors, (4204), 6 states have internal predecessors, (4204), 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-03-14 01:46:30,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:30,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 699 of 859 [2025-03-14 01:46:30,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:36,066 INFO L124 PetriNetUnfolderBase]: 6432/29512 cut-off events. [2025-03-14 01:46:36,066 INFO L125 PetriNetUnfolderBase]: For 10817/10821 co-relation queries the response was YES. [2025-03-14 01:46:36,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46828 conditions, 29512 events. 6432/29512 cut-off events. For 10817/10821 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 324399 event pairs, 3864 based on Foata normal form. 0/26341 useless extension candidates. Maximal degree in co-relation 46701. Up to 9066 conditions per place. [2025-03-14 01:46:36,236 INFO L140 encePairwiseOnDemand]: 853/859 looper letters, 70 selfloop transitions, 5 changer transitions 0/689 dead transitions. [2025-03-14 01:46:36,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 689 transitions, 1661 flow [2025-03-14 01:46:36,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:46:36,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:46:36,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4264 transitions. [2025-03-14 01:46:36,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8273185875048507 [2025-03-14 01:46:36,238 INFO L175 Difference]: Start difference. First operand has 690 places, 690 transitions, 1513 flow. Second operand 6 states and 4264 transitions. [2025-03-14 01:46:36,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 689 transitions, 1661 flow [2025-03-14 01:46:36,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 692 places, 689 transitions, 1654 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:36,247 INFO L231 Difference]: Finished difference. Result has 692 places, 689 transitions, 1514 flow [2025-03-14 01:46:36,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=687, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1514, PETRI_PLACES=692, PETRI_TRANSITIONS=689} [2025-03-14 01:46:36,248 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -106 predicate places. [2025-03-14 01:46:36,248 INFO L471 AbstractCegarLoop]: Abstraction has has 692 places, 689 transitions, 1514 flow [2025-03-14 01:46:36,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 700.6666666666666) internal successors, (4204), 6 states have internal predecessors, (4204), 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-03-14 01:46:36,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:36,249 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:36,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-14 01:46:36,249 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:36,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:36,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1407479217, now seen corresponding path program 1 times [2025-03-14 01:46:36,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:36,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402854854] [2025-03-14 01:46:36,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:36,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:36,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-14 01:46:36,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-14 01:46:36,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:36,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:36,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:36,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402854854] [2025-03-14 01:46:36,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402854854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:36,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:36,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:36,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510425993] [2025-03-14 01:46:36,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:36,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:36,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:36,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:36,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:36,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 750 out of 859 [2025-03-14 01:46:36,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 692 places, 689 transitions, 1514 flow. Second operand has 3 states, 3 states have (on average 752.0) internal successors, (2256), 3 states have internal predecessors, (2256), 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-03-14 01:46:36,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:36,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 750 of 859 [2025-03-14 01:46:36,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:39,950 INFO L124 PetriNetUnfolderBase]: 1841/19498 cut-off events. [2025-03-14 01:46:39,950 INFO L125 PetriNetUnfolderBase]: For 2966/2970 co-relation queries the response was YES. [2025-03-14 01:46:40,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24420 conditions, 19498 events. 1841/19498 cut-off events. For 2966/2970 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 212928 event pairs, 212 based on Foata normal form. 0/17447 useless extension candidates. Maximal degree in co-relation 24297. Up to 1988 conditions per place. [2025-03-14 01:46:40,071 INFO L140 encePairwiseOnDemand]: 854/859 looper letters, 33 selfloop transitions, 2 changer transitions 0/698 dead transitions. [2025-03-14 01:46:40,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 698 transitions, 1630 flow [2025-03-14 01:46:40,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:40,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:40,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2279 transitions. [2025-03-14 01:46:40,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8843616608459449 [2025-03-14 01:46:40,073 INFO L175 Difference]: Start difference. First operand has 692 places, 689 transitions, 1514 flow. Second operand 3 states and 2279 transitions. [2025-03-14 01:46:40,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 698 transitions, 1630 flow [2025-03-14 01:46:40,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 686 places, 698 transitions, 1620 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:46:40,082 INFO L231 Difference]: Finished difference. Result has 687 places, 688 transitions, 1514 flow [2025-03-14 01:46:40,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1498, PETRI_DIFFERENCE_MINUEND_PLACES=684, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1514, PETRI_PLACES=687, PETRI_TRANSITIONS=688} [2025-03-14 01:46:40,082 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -111 predicate places. [2025-03-14 01:46:40,082 INFO L471 AbstractCegarLoop]: Abstraction has has 687 places, 688 transitions, 1514 flow [2025-03-14 01:46:40,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.0) internal successors, (2256), 3 states have internal predecessors, (2256), 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-03-14 01:46:40,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:40,083 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:40,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-14 01:46:40,083 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:40,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:40,084 INFO L85 PathProgramCache]: Analyzing trace with hash -326420127, now seen corresponding path program 1 times [2025-03-14 01:46:40,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:40,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033889774] [2025-03-14 01:46:40,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:40,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:40,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-14 01:46:40,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-14 01:46:40,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:40,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:40,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:46:40,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:40,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033889774] [2025-03-14 01:46:40,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033889774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:40,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:40,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:46:40,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526627325] [2025-03-14 01:46:40,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:40,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:46:40,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:40,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:46:40,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:46:40,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 722 out of 859 [2025-03-14 01:46:40,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 687 places, 688 transitions, 1514 flow. Second operand has 6 states, 6 states have (on average 726.8333333333334) internal successors, (4361), 6 states have internal predecessors, (4361), 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-03-14 01:46:40,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:40,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 722 of 859 [2025-03-14 01:46:40,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:42,402 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2414] L52-->L58-12: Formula: (let ((.cse9 (* v_~front1~0_385 4)) (.cse10 (* v_~size1~0_295 4)) (.cse12 (* v_~state11~0_137 4))) (let ((.cse3 (+ 2 v_~produce~0.offset_79 .cse12)) (.cse8 (+ .cse9 .cse10 v_~queue1~0.offset_245)) (.cse5 (+ v_~produce~0.offset_79 .cse12)) (.cse0 (not |v_thread1_#t~short2#1_232|)) (.cse7 (+ v_~produce~0.offset_79 3 .cse12)) (.cse2 (select |v_#race_871| v_~produce~0.base_79)) (.cse6 (+ v_~produce~0.offset_79 .cse12 1)) (.cse11 (+ v_~front1~0_385 v_~size1~0_295))) (and (not (= (ite |v_thread1_#t~short2#1_231| 1 0) 0)) (let ((.cse1 (= |v_#race~state11~0_237| 0))) (or (and (= |v_#race~n_produce~0_126| |v_#race~n_produce~0_125|) .cse0 .cse1 (= |v_thread1_#t~short2#1_232| |v_thread1_#t~short2#1_231|)) (and .cse1 |v_thread1_#t~short2#1_232| (= |v_#race~n_produce~0_125| 0) (or (and (not |v_thread1_#t~short2#1_231|) (<= v_~n_produce~0_44 v_~state11~0_137)) (and (< v_~state11~0_137 v_~n_produce~0_44) |v_thread1_#t~short2#1_231|))))) (= |v_#race~queue1~0_286| 0) (= (select .cse2 .cse3) 0) (= |v_#race_871| (let ((.cse4 (store |v_#race_872| v_~queue1~0.base_245 (store (store (store (store (select |v_#race_872| v_~queue1~0.base_245) .cse8 0) (+ .cse9 .cse10 v_~queue1~0.offset_245 1) 0) (+ .cse9 2 .cse10 v_~queue1~0.offset_245) 0) (+ .cse9 3 .cse10 v_~queue1~0.offset_245) 0)))) (store .cse4 v_~produce~0.base_79 (store (store (store (store (select .cse4 v_~produce~0.base_79) .cse5 0) .cse6 0) .cse3 0) .cse7 0)))) (or (and (<= v_~n_queue~0_94 .cse11) (not |v_thread1_#t~short1#1_273|)) (and |v_thread1_#t~short1#1_273| (< .cse11 v_~n_queue~0_94))) (not (= (ite |v_thread1_#t~short1#1_273| 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_257| v_~queue1~0.base_245) .cse8) (select (select |v_#memory_int_257| v_~produce~0.base_79) .cse5)) 1 0) 0)) (= |v_#race~n_queue~0_175| 0) (= (select .cse2 .cse5) 0) |v_thread1_#t~short1#1_274| (= |v_#race~produce~0_88| 0) (or (and (<= 0 v_~state11~0_137) |v_thread1_#t~short2#1_232|) (and (< v_~state11~0_137 0) .cse0)) (= |v_#race~front1~0_560| 0) (= |v_#race~state11~0_219| 0) (= (+ v_~size1~0_295 1) v_~size1~0_294) (= (select .cse2 .cse7) 0) (= (select .cse2 .cse6) 0) (or (and (not |v_thread1_#t~short1#1_274|) (< .cse11 0)) (and |v_thread1_#t~short1#1_274| (<= 0 .cse11)))))) InVars {#race=|v_#race_872|, ~queue1~0.base=v_~queue1~0.base_245, ~state11~0=v_~state11~0_137, ~n_queue~0=v_~n_queue~0_94, ~size1~0=v_~size1~0_295, #race~n_produce~0=|v_#race~n_produce~0_126|, #memory_int=|v_#memory_int_257|, ~produce~0.base=v_~produce~0.base_79, ~n_produce~0=v_~n_produce~0_44, ~produce~0.offset=v_~produce~0.offset_79, ~queue1~0.offset=v_~queue1~0.offset_245, ~front1~0=v_~front1~0_385} OutVars{#race~produce~0=|v_#race~produce~0_88|, #race~state11~0=|v_#race~state11~0_219|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_47|, #race~size1~0=|v_#race~size1~0_397|, ~produce~0.base=v_~produce~0.base_79, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_57|, ~queue1~0.base=v_~queue1~0.base_245, #race~front1~0=|v_#race~front1~0_560|, #race~n_queue~0=|v_#race~n_queue~0_175|, ~n_queue~0=v_~n_queue~0_94, ~front1~0=v_~front1~0_385, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_27|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_51|, #race=|v_#race_871|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_15|, ~state11~0=v_~state11~0_137, ~size1~0=v_~size1~0_294, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_7|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_7|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, #race~n_produce~0=|v_#race~n_produce~0_125|, #memory_int=|v_#memory_int_257|, ~n_produce~0=v_~n_produce~0_44, ~produce~0.offset=v_~produce~0.offset_79, ~queue1~0.offset=v_~queue1~0.offset_245, #race~queue1~0=|v_#race~queue1~0_286|} AuxVars[|v_thread1_#t~short2#1_232|, |v_#race~state11~0_237|, |v_thread1_#t~short2#1_231|, |v_thread1_#t~short1#1_273|, |v_thread1_#t~short1#1_274|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][586], [Black: 894#true, 678#L58-12true, 955#(= |#race~produce~0| 0), 911#(= |#race~update~0| 0), Black: 898#true, 878#(= |#race~n_queue~0| 0), Black: 837#(= |#race~state12~0| 0), Black: 902#true, 896#(= |#race~consume~0| 0), 714#L135-1true, 900#(= |#race~n2~0| 0), Black: 909#true, Black: 931#(<= ~n_produce~0 0), Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 957#true, 872#(= |#race~n_update~0| 0), 890#(= |#race~n1~0| 0), 7#L95-28true, Black: 953#true, Black: 922#true, 607#L83true, 860#(= |#race~n_produce~0| 0)]) [2025-03-14 01:46:42,402 INFO L294 olderBase$Statistics]: this new event has 537 ancestors and is cut-off event [2025-03-14 01:46:42,402 INFO L297 olderBase$Statistics]: existing Event has 403 ancestors and is cut-off event [2025-03-14 01:46:42,402 INFO L297 olderBase$Statistics]: existing Event has 534 ancestors and is cut-off event [2025-03-14 01:46:42,402 INFO L297 olderBase$Statistics]: existing Event has 486 ancestors and is cut-off event [2025-03-14 01:46:42,414 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([2414] L52-->L58-12: Formula: (let ((.cse9 (* v_~front1~0_385 4)) (.cse10 (* v_~size1~0_295 4)) (.cse12 (* v_~state11~0_137 4))) (let ((.cse3 (+ 2 v_~produce~0.offset_79 .cse12)) (.cse8 (+ .cse9 .cse10 v_~queue1~0.offset_245)) (.cse5 (+ v_~produce~0.offset_79 .cse12)) (.cse0 (not |v_thread1_#t~short2#1_232|)) (.cse7 (+ v_~produce~0.offset_79 3 .cse12)) (.cse2 (select |v_#race_871| v_~produce~0.base_79)) (.cse6 (+ v_~produce~0.offset_79 .cse12 1)) (.cse11 (+ v_~front1~0_385 v_~size1~0_295))) (and (not (= (ite |v_thread1_#t~short2#1_231| 1 0) 0)) (let ((.cse1 (= |v_#race~state11~0_237| 0))) (or (and (= |v_#race~n_produce~0_126| |v_#race~n_produce~0_125|) .cse0 .cse1 (= |v_thread1_#t~short2#1_232| |v_thread1_#t~short2#1_231|)) (and .cse1 |v_thread1_#t~short2#1_232| (= |v_#race~n_produce~0_125| 0) (or (and (not |v_thread1_#t~short2#1_231|) (<= v_~n_produce~0_44 v_~state11~0_137)) (and (< v_~state11~0_137 v_~n_produce~0_44) |v_thread1_#t~short2#1_231|))))) (= |v_#race~queue1~0_286| 0) (= (select .cse2 .cse3) 0) (= |v_#race_871| (let ((.cse4 (store |v_#race_872| v_~queue1~0.base_245 (store (store (store (store (select |v_#race_872| v_~queue1~0.base_245) .cse8 0) (+ .cse9 .cse10 v_~queue1~0.offset_245 1) 0) (+ .cse9 2 .cse10 v_~queue1~0.offset_245) 0) (+ .cse9 3 .cse10 v_~queue1~0.offset_245) 0)))) (store .cse4 v_~produce~0.base_79 (store (store (store (store (select .cse4 v_~produce~0.base_79) .cse5 0) .cse6 0) .cse3 0) .cse7 0)))) (or (and (<= v_~n_queue~0_94 .cse11) (not |v_thread1_#t~short1#1_273|)) (and |v_thread1_#t~short1#1_273| (< .cse11 v_~n_queue~0_94))) (not (= (ite |v_thread1_#t~short1#1_273| 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_257| v_~queue1~0.base_245) .cse8) (select (select |v_#memory_int_257| v_~produce~0.base_79) .cse5)) 1 0) 0)) (= |v_#race~n_queue~0_175| 0) (= (select .cse2 .cse5) 0) |v_thread1_#t~short1#1_274| (= |v_#race~produce~0_88| 0) (or (and (<= 0 v_~state11~0_137) |v_thread1_#t~short2#1_232|) (and (< v_~state11~0_137 0) .cse0)) (= |v_#race~front1~0_560| 0) (= |v_#race~state11~0_219| 0) (= (+ v_~size1~0_295 1) v_~size1~0_294) (= (select .cse2 .cse7) 0) (= (select .cse2 .cse6) 0) (or (and (not |v_thread1_#t~short1#1_274|) (< .cse11 0)) (and |v_thread1_#t~short1#1_274| (<= 0 .cse11)))))) InVars {#race=|v_#race_872|, ~queue1~0.base=v_~queue1~0.base_245, ~state11~0=v_~state11~0_137, ~n_queue~0=v_~n_queue~0_94, ~size1~0=v_~size1~0_295, #race~n_produce~0=|v_#race~n_produce~0_126|, #memory_int=|v_#memory_int_257|, ~produce~0.base=v_~produce~0.base_79, ~n_produce~0=v_~n_produce~0_44, ~produce~0.offset=v_~produce~0.offset_79, ~queue1~0.offset=v_~queue1~0.offset_245, ~front1~0=v_~front1~0_385} OutVars{#race~produce~0=|v_#race~produce~0_88|, #race~state11~0=|v_#race~state11~0_219|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_47|, #race~size1~0=|v_#race~size1~0_397|, ~produce~0.base=v_~produce~0.base_79, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_57|, ~queue1~0.base=v_~queue1~0.base_245, #race~front1~0=|v_#race~front1~0_560|, #race~n_queue~0=|v_#race~n_queue~0_175|, ~n_queue~0=v_~n_queue~0_94, ~front1~0=v_~front1~0_385, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_27|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_51|, #race=|v_#race_871|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_15|, ~state11~0=v_~state11~0_137, ~size1~0=v_~size1~0_294, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_7|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_7|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, #race~n_produce~0=|v_#race~n_produce~0_125|, #memory_int=|v_#memory_int_257|, ~n_produce~0=v_~n_produce~0_44, ~produce~0.offset=v_~produce~0.offset_79, ~queue1~0.offset=v_~queue1~0.offset_245, #race~queue1~0=|v_#race~queue1~0_286|} AuxVars[|v_thread1_#t~short2#1_232|, |v_#race~state11~0_237|, |v_thread1_#t~short2#1_231|, |v_thread1_#t~short1#1_273|, |v_thread1_#t~short1#1_274|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][586], [Black: 894#true, 678#L58-12true, 955#(= |#race~produce~0| 0), Black: 898#true, 878#(= |#race~n_queue~0| 0), 911#(= |#race~update~0| 0), Black: 837#(= |#race~state12~0| 0), Black: 902#true, 896#(= |#race~consume~0| 0), 714#L135-1true, 900#(= |#race~n2~0| 0), Black: 909#true, Black: 931#(<= ~n_produce~0 0), Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 957#true, 872#(= |#race~n_update~0| 0), 890#(= |#race~n1~0| 0), 7#L95-28true, Black: 953#true, Black: 922#true, 607#L83true, 860#(= |#race~n_produce~0| 0)]) [2025-03-14 01:46:42,414 INFO L294 olderBase$Statistics]: this new event has 534 ancestors and is cut-off event [2025-03-14 01:46:42,414 INFO L297 olderBase$Statistics]: existing Event has 403 ancestors and is cut-off event [2025-03-14 01:46:42,414 INFO L297 olderBase$Statistics]: existing Event has 534 ancestors and is cut-off event [2025-03-14 01:46:42,414 INFO L297 olderBase$Statistics]: existing Event has 537 ancestors and is cut-off event [2025-03-14 01:46:42,414 INFO L297 olderBase$Statistics]: existing Event has 486 ancestors and is cut-off event [2025-03-14 01:46:42,420 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2414] L52-->L58-12: Formula: (let ((.cse9 (* v_~front1~0_385 4)) (.cse10 (* v_~size1~0_295 4)) (.cse12 (* v_~state11~0_137 4))) (let ((.cse3 (+ 2 v_~produce~0.offset_79 .cse12)) (.cse8 (+ .cse9 .cse10 v_~queue1~0.offset_245)) (.cse5 (+ v_~produce~0.offset_79 .cse12)) (.cse0 (not |v_thread1_#t~short2#1_232|)) (.cse7 (+ v_~produce~0.offset_79 3 .cse12)) (.cse2 (select |v_#race_871| v_~produce~0.base_79)) (.cse6 (+ v_~produce~0.offset_79 .cse12 1)) (.cse11 (+ v_~front1~0_385 v_~size1~0_295))) (and (not (= (ite |v_thread1_#t~short2#1_231| 1 0) 0)) (let ((.cse1 (= |v_#race~state11~0_237| 0))) (or (and (= |v_#race~n_produce~0_126| |v_#race~n_produce~0_125|) .cse0 .cse1 (= |v_thread1_#t~short2#1_232| |v_thread1_#t~short2#1_231|)) (and .cse1 |v_thread1_#t~short2#1_232| (= |v_#race~n_produce~0_125| 0) (or (and (not |v_thread1_#t~short2#1_231|) (<= v_~n_produce~0_44 v_~state11~0_137)) (and (< v_~state11~0_137 v_~n_produce~0_44) |v_thread1_#t~short2#1_231|))))) (= |v_#race~queue1~0_286| 0) (= (select .cse2 .cse3) 0) (= |v_#race_871| (let ((.cse4 (store |v_#race_872| v_~queue1~0.base_245 (store (store (store (store (select |v_#race_872| v_~queue1~0.base_245) .cse8 0) (+ .cse9 .cse10 v_~queue1~0.offset_245 1) 0) (+ .cse9 2 .cse10 v_~queue1~0.offset_245) 0) (+ .cse9 3 .cse10 v_~queue1~0.offset_245) 0)))) (store .cse4 v_~produce~0.base_79 (store (store (store (store (select .cse4 v_~produce~0.base_79) .cse5 0) .cse6 0) .cse3 0) .cse7 0)))) (or (and (<= v_~n_queue~0_94 .cse11) (not |v_thread1_#t~short1#1_273|)) (and |v_thread1_#t~short1#1_273| (< .cse11 v_~n_queue~0_94))) (not (= (ite |v_thread1_#t~short1#1_273| 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_257| v_~queue1~0.base_245) .cse8) (select (select |v_#memory_int_257| v_~produce~0.base_79) .cse5)) 1 0) 0)) (= |v_#race~n_queue~0_175| 0) (= (select .cse2 .cse5) 0) |v_thread1_#t~short1#1_274| (= |v_#race~produce~0_88| 0) (or (and (<= 0 v_~state11~0_137) |v_thread1_#t~short2#1_232|) (and (< v_~state11~0_137 0) .cse0)) (= |v_#race~front1~0_560| 0) (= |v_#race~state11~0_219| 0) (= (+ v_~size1~0_295 1) v_~size1~0_294) (= (select .cse2 .cse7) 0) (= (select .cse2 .cse6) 0) (or (and (not |v_thread1_#t~short1#1_274|) (< .cse11 0)) (and |v_thread1_#t~short1#1_274| (<= 0 .cse11)))))) InVars {#race=|v_#race_872|, ~queue1~0.base=v_~queue1~0.base_245, ~state11~0=v_~state11~0_137, ~n_queue~0=v_~n_queue~0_94, ~size1~0=v_~size1~0_295, #race~n_produce~0=|v_#race~n_produce~0_126|, #memory_int=|v_#memory_int_257|, ~produce~0.base=v_~produce~0.base_79, ~n_produce~0=v_~n_produce~0_44, ~produce~0.offset=v_~produce~0.offset_79, ~queue1~0.offset=v_~queue1~0.offset_245, ~front1~0=v_~front1~0_385} OutVars{#race~produce~0=|v_#race~produce~0_88|, #race~state11~0=|v_#race~state11~0_219|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_47|, #race~size1~0=|v_#race~size1~0_397|, ~produce~0.base=v_~produce~0.base_79, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_57|, ~queue1~0.base=v_~queue1~0.base_245, #race~front1~0=|v_#race~front1~0_560|, #race~n_queue~0=|v_#race~n_queue~0_175|, ~n_queue~0=v_~n_queue~0_94, ~front1~0=v_~front1~0_385, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_27|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_51|, #race=|v_#race_871|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_15|, ~state11~0=v_~state11~0_137, ~size1~0=v_~size1~0_294, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_7|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_7|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, #race~n_produce~0=|v_#race~n_produce~0_125|, #memory_int=|v_#memory_int_257|, ~n_produce~0=v_~n_produce~0_44, ~produce~0.offset=v_~produce~0.offset_79, ~queue1~0.offset=v_~queue1~0.offset_245, #race~queue1~0=|v_#race~queue1~0_286|} AuxVars[|v_thread1_#t~short2#1_232|, |v_#race~state11~0_237|, |v_thread1_#t~short2#1_231|, |v_thread1_#t~short1#1_273|, |v_thread1_#t~short1#1_274|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][586], [Black: 894#true, 678#L58-12true, 955#(= |#race~produce~0| 0), Black: 898#true, 911#(= |#race~update~0| 0), 878#(= |#race~n_queue~0| 0), Black: 837#(= |#race~state12~0| 0), Black: 902#true, 896#(= |#race~consume~0| 0), 714#L135-1true, 559#L73true, 900#(= |#race~n2~0| 0), Black: 909#true, Black: 931#(<= ~n_produce~0 0), Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 957#true, 872#(= |#race~n_update~0| 0), 890#(= |#race~n1~0| 0), 7#L95-28true, Black: 953#true, Black: 922#true, 860#(= |#race~n_produce~0| 0)]) [2025-03-14 01:46:42,420 INFO L294 olderBase$Statistics]: this new event has 535 ancestors and is cut-off event [2025-03-14 01:46:42,420 INFO L297 olderBase$Statistics]: existing Event has 487 ancestors and is cut-off event [2025-03-14 01:46:42,420 INFO L297 olderBase$Statistics]: existing Event has 404 ancestors and is cut-off event [2025-03-14 01:46:42,420 INFO L297 olderBase$Statistics]: existing Event has 535 ancestors and is cut-off event [2025-03-14 01:46:42,627 INFO L124 PetriNetUnfolderBase]: 557/10192 cut-off events. [2025-03-14 01:46:42,627 INFO L125 PetriNetUnfolderBase]: For 1753/2263 co-relation queries the response was YES. [2025-03-14 01:46:42,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11982 conditions, 10192 events. 557/10192 cut-off events. For 1753/2263 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 88593 event pairs, 110 based on Foata normal form. 49/9148 useless extension candidates. Maximal degree in co-relation 11857. Up to 424 conditions per place. [2025-03-14 01:46:42,705 INFO L140 encePairwiseOnDemand]: 847/859 looper letters, 69 selfloop transitions, 12 changer transitions 0/709 dead transitions. [2025-03-14 01:46:42,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 695 places, 709 transitions, 1727 flow [2025-03-14 01:46:42,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:46:42,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:46:42,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 6568 transitions. [2025-03-14 01:46:42,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8495666796016039 [2025-03-14 01:46:42,709 INFO L175 Difference]: Start difference. First operand has 687 places, 688 transitions, 1514 flow. Second operand 9 states and 6568 transitions. [2025-03-14 01:46:42,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 695 places, 709 transitions, 1727 flow [2025-03-14 01:46:42,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 709 transitions, 1727 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:46:42,716 INFO L231 Difference]: Finished difference. Result has 698 places, 693 transitions, 1574 flow [2025-03-14 01:46:42,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1514, PETRI_DIFFERENCE_MINUEND_PLACES=687, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=688, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1574, PETRI_PLACES=698, PETRI_TRANSITIONS=693} [2025-03-14 01:46:42,717 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -100 predicate places. [2025-03-14 01:46:42,717 INFO L471 AbstractCegarLoop]: Abstraction has has 698 places, 693 transitions, 1574 flow [2025-03-14 01:46:42,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 726.8333333333334) internal successors, (4361), 6 states have internal predecessors, (4361), 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-03-14 01:46:42,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:42,718 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:42,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-14 01:46:42,718 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread3Err26ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:42,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:42,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1634373043, now seen corresponding path program 1 times [2025-03-14 01:46:42,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:42,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638321295] [2025-03-14 01:46:42,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:42,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:42,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-14 01:46:42,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-14 01:46:42,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:42,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:43,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:43,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:43,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638321295] [2025-03-14 01:46:43,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638321295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:43,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:43,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:46:43,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741399843] [2025-03-14 01:46:43,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:43,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:46:43,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:43,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:46:43,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:46:43,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 716 out of 859 [2025-03-14 01:46:43,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 698 places, 693 transitions, 1574 flow. Second operand has 6 states, 6 states have (on average 718.0) internal successors, (4308), 6 states have internal predecessors, (4308), 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-03-14 01:46:43,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:43,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 716 of 859 [2025-03-14 01:46:43,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:48,289 INFO L124 PetriNetUnfolderBase]: 4478/24883 cut-off events. [2025-03-14 01:46:48,289 INFO L125 PetriNetUnfolderBase]: For 11826/11895 co-relation queries the response was YES. [2025-03-14 01:46:48,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38745 conditions, 24883 events. 4478/24883 cut-off events. For 11826/11895 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 270888 event pairs, 200 based on Foata normal form. 0/22903 useless extension candidates. Maximal degree in co-relation 38612. Up to 4744 conditions per place. [2025-03-14 01:46:48,526 INFO L140 encePairwiseOnDemand]: 851/859 looper letters, 101 selfloop transitions, 5 changer transitions 0/738 dead transitions. [2025-03-14 01:46:48,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 700 places, 738 transitions, 2064 flow [2025-03-14 01:46:48,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:46:48,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:46:48,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4378 transitions. [2025-03-14 01:46:48,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8494373302289484 [2025-03-14 01:46:48,528 INFO L175 Difference]: Start difference. First operand has 698 places, 693 transitions, 1574 flow. Second operand 6 states and 4378 transitions. [2025-03-14 01:46:48,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 700 places, 738 transitions, 2064 flow [2025-03-14 01:46:48,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 698 places, 738 transitions, 2057 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:48,541 INFO L231 Difference]: Finished difference. Result has 698 places, 690 transitions, 1571 flow [2025-03-14 01:46:48,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1561, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=690, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=685, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1571, PETRI_PLACES=698, PETRI_TRANSITIONS=690} [2025-03-14 01:46:48,542 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -100 predicate places. [2025-03-14 01:46:48,542 INFO L471 AbstractCegarLoop]: Abstraction has has 698 places, 690 transitions, 1571 flow [2025-03-14 01:46:48,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 718.0) internal successors, (4308), 6 states have internal predecessors, (4308), 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-03-14 01:46:48,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:48,543 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:48,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-14 01:46:48,543 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:48,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:48,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1665280262, now seen corresponding path program 1 times [2025-03-14 01:46:48,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:48,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142923825] [2025-03-14 01:46:48,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:48,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:48,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-14 01:46:48,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-14 01:46:48,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:48,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:48,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:46:48,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:48,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142923825] [2025-03-14 01:46:48,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142923825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:48,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:48,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:46:48,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040729940] [2025-03-14 01:46:48,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:48,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:46:48,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:48,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:46:48,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:46:49,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 859 [2025-03-14 01:46:49,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 698 places, 690 transitions, 1571 flow. Second operand has 6 states, 6 states have (on average 731.1666666666666) internal successors, (4387), 6 states have internal predecessors, (4387), 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-03-14 01:46:49,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:49,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 859 [2025-03-14 01:46:49,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:51,255 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2414] L52-->L58-12: Formula: (let ((.cse9 (* v_~front1~0_385 4)) (.cse10 (* v_~size1~0_295 4)) (.cse12 (* v_~state11~0_137 4))) (let ((.cse3 (+ 2 v_~produce~0.offset_79 .cse12)) (.cse8 (+ .cse9 .cse10 v_~queue1~0.offset_245)) (.cse5 (+ v_~produce~0.offset_79 .cse12)) (.cse0 (not |v_thread1_#t~short2#1_232|)) (.cse7 (+ v_~produce~0.offset_79 3 .cse12)) (.cse2 (select |v_#race_871| v_~produce~0.base_79)) (.cse6 (+ v_~produce~0.offset_79 .cse12 1)) (.cse11 (+ v_~front1~0_385 v_~size1~0_295))) (and (not (= (ite |v_thread1_#t~short2#1_231| 1 0) 0)) (let ((.cse1 (= |v_#race~state11~0_237| 0))) (or (and (= |v_#race~n_produce~0_126| |v_#race~n_produce~0_125|) .cse0 .cse1 (= |v_thread1_#t~short2#1_232| |v_thread1_#t~short2#1_231|)) (and .cse1 |v_thread1_#t~short2#1_232| (= |v_#race~n_produce~0_125| 0) (or (and (not |v_thread1_#t~short2#1_231|) (<= v_~n_produce~0_44 v_~state11~0_137)) (and (< v_~state11~0_137 v_~n_produce~0_44) |v_thread1_#t~short2#1_231|))))) (= |v_#race~queue1~0_286| 0) (= (select .cse2 .cse3) 0) (= |v_#race_871| (let ((.cse4 (store |v_#race_872| v_~queue1~0.base_245 (store (store (store (store (select |v_#race_872| v_~queue1~0.base_245) .cse8 0) (+ .cse9 .cse10 v_~queue1~0.offset_245 1) 0) (+ .cse9 2 .cse10 v_~queue1~0.offset_245) 0) (+ .cse9 3 .cse10 v_~queue1~0.offset_245) 0)))) (store .cse4 v_~produce~0.base_79 (store (store (store (store (select .cse4 v_~produce~0.base_79) .cse5 0) .cse6 0) .cse3 0) .cse7 0)))) (or (and (<= v_~n_queue~0_94 .cse11) (not |v_thread1_#t~short1#1_273|)) (and |v_thread1_#t~short1#1_273| (< .cse11 v_~n_queue~0_94))) (not (= (ite |v_thread1_#t~short1#1_273| 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_257| v_~queue1~0.base_245) .cse8) (select (select |v_#memory_int_257| v_~produce~0.base_79) .cse5)) 1 0) 0)) (= |v_#race~n_queue~0_175| 0) (= (select .cse2 .cse5) 0) |v_thread1_#t~short1#1_274| (= |v_#race~produce~0_88| 0) (or (and (<= 0 v_~state11~0_137) |v_thread1_#t~short2#1_232|) (and (< v_~state11~0_137 0) .cse0)) (= |v_#race~front1~0_560| 0) (= |v_#race~state11~0_219| 0) (= (+ v_~size1~0_295 1) v_~size1~0_294) (= (select .cse2 .cse7) 0) (= (select .cse2 .cse6) 0) (or (and (not |v_thread1_#t~short1#1_274|) (< .cse11 0)) (and |v_thread1_#t~short1#1_274| (<= 0 .cse11)))))) InVars {#race=|v_#race_872|, ~queue1~0.base=v_~queue1~0.base_245, ~state11~0=v_~state11~0_137, ~n_queue~0=v_~n_queue~0_94, ~size1~0=v_~size1~0_295, #race~n_produce~0=|v_#race~n_produce~0_126|, #memory_int=|v_#memory_int_257|, ~produce~0.base=v_~produce~0.base_79, ~n_produce~0=v_~n_produce~0_44, ~produce~0.offset=v_~produce~0.offset_79, ~queue1~0.offset=v_~queue1~0.offset_245, ~front1~0=v_~front1~0_385} OutVars{#race~produce~0=|v_#race~produce~0_88|, #race~state11~0=|v_#race~state11~0_219|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_47|, #race~size1~0=|v_#race~size1~0_397|, ~produce~0.base=v_~produce~0.base_79, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_57|, ~queue1~0.base=v_~queue1~0.base_245, #race~front1~0=|v_#race~front1~0_560|, #race~n_queue~0=|v_#race~n_queue~0_175|, ~n_queue~0=v_~n_queue~0_94, ~front1~0=v_~front1~0_385, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_27|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_51|, #race=|v_#race_871|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_15|, ~state11~0=v_~state11~0_137, ~size1~0=v_~size1~0_294, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_7|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_7|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, #race~n_produce~0=|v_#race~n_produce~0_125|, #memory_int=|v_#memory_int_257|, ~n_produce~0=v_~n_produce~0_44, ~produce~0.offset=v_~produce~0.offset_79, ~queue1~0.offset=v_~queue1~0.offset_245, #race~queue1~0=|v_#race~queue1~0_286|} AuxVars[|v_thread1_#t~short2#1_232|, |v_#race~state11~0_237|, |v_thread1_#t~short2#1_231|, |v_thread1_#t~short1#1_273|, |v_thread1_#t~short1#1_274|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][588], [Black: 894#true, 678#L58-12true, 878#(= |#race~n_queue~0| 0), Black: 898#true, Black: 837#(= |#race~state12~0| 0), Black: 902#true, 896#(= |#race~consume~0| 0), 714#L135-1true, Black: 968#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 966#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 962#(<= ~n_queue~0 0), Black: 909#true, 890#(= |#race~n1~0| 0), 7#L95-28true, Black: 922#true, 976#true, 860#(= |#race~n_produce~0| 0), 607#L83true, 955#(= |#race~produce~0| 0), 911#(= |#race~update~0| 0), 900#(= |#race~n2~0| 0), Black: 931#(<= ~n_produce~0 0), 982#true, Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 872#(= |#race~n_update~0| 0), Black: 953#true]) [2025-03-14 01:46:51,255 INFO L294 olderBase$Statistics]: this new event has 534 ancestors and is cut-off event [2025-03-14 01:46:51,255 INFO L297 olderBase$Statistics]: existing Event has 534 ancestors and is cut-off event [2025-03-14 01:46:51,255 INFO L297 olderBase$Statistics]: existing Event has 403 ancestors and is cut-off event [2025-03-14 01:46:51,255 INFO L297 olderBase$Statistics]: existing Event has 486 ancestors and is cut-off event [2025-03-14 01:46:51,263 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2414] L52-->L58-12: Formula: (let ((.cse9 (* v_~front1~0_385 4)) (.cse10 (* v_~size1~0_295 4)) (.cse12 (* v_~state11~0_137 4))) (let ((.cse3 (+ 2 v_~produce~0.offset_79 .cse12)) (.cse8 (+ .cse9 .cse10 v_~queue1~0.offset_245)) (.cse5 (+ v_~produce~0.offset_79 .cse12)) (.cse0 (not |v_thread1_#t~short2#1_232|)) (.cse7 (+ v_~produce~0.offset_79 3 .cse12)) (.cse2 (select |v_#race_871| v_~produce~0.base_79)) (.cse6 (+ v_~produce~0.offset_79 .cse12 1)) (.cse11 (+ v_~front1~0_385 v_~size1~0_295))) (and (not (= (ite |v_thread1_#t~short2#1_231| 1 0) 0)) (let ((.cse1 (= |v_#race~state11~0_237| 0))) (or (and (= |v_#race~n_produce~0_126| |v_#race~n_produce~0_125|) .cse0 .cse1 (= |v_thread1_#t~short2#1_232| |v_thread1_#t~short2#1_231|)) (and .cse1 |v_thread1_#t~short2#1_232| (= |v_#race~n_produce~0_125| 0) (or (and (not |v_thread1_#t~short2#1_231|) (<= v_~n_produce~0_44 v_~state11~0_137)) (and (< v_~state11~0_137 v_~n_produce~0_44) |v_thread1_#t~short2#1_231|))))) (= |v_#race~queue1~0_286| 0) (= (select .cse2 .cse3) 0) (= |v_#race_871| (let ((.cse4 (store |v_#race_872| v_~queue1~0.base_245 (store (store (store (store (select |v_#race_872| v_~queue1~0.base_245) .cse8 0) (+ .cse9 .cse10 v_~queue1~0.offset_245 1) 0) (+ .cse9 2 .cse10 v_~queue1~0.offset_245) 0) (+ .cse9 3 .cse10 v_~queue1~0.offset_245) 0)))) (store .cse4 v_~produce~0.base_79 (store (store (store (store (select .cse4 v_~produce~0.base_79) .cse5 0) .cse6 0) .cse3 0) .cse7 0)))) (or (and (<= v_~n_queue~0_94 .cse11) (not |v_thread1_#t~short1#1_273|)) (and |v_thread1_#t~short1#1_273| (< .cse11 v_~n_queue~0_94))) (not (= (ite |v_thread1_#t~short1#1_273| 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_257| v_~queue1~0.base_245) .cse8) (select (select |v_#memory_int_257| v_~produce~0.base_79) .cse5)) 1 0) 0)) (= |v_#race~n_queue~0_175| 0) (= (select .cse2 .cse5) 0) |v_thread1_#t~short1#1_274| (= |v_#race~produce~0_88| 0) (or (and (<= 0 v_~state11~0_137) |v_thread1_#t~short2#1_232|) (and (< v_~state11~0_137 0) .cse0)) (= |v_#race~front1~0_560| 0) (= |v_#race~state11~0_219| 0) (= (+ v_~size1~0_295 1) v_~size1~0_294) (= (select .cse2 .cse7) 0) (= (select .cse2 .cse6) 0) (or (and (not |v_thread1_#t~short1#1_274|) (< .cse11 0)) (and |v_thread1_#t~short1#1_274| (<= 0 .cse11)))))) InVars {#race=|v_#race_872|, ~queue1~0.base=v_~queue1~0.base_245, ~state11~0=v_~state11~0_137, ~n_queue~0=v_~n_queue~0_94, ~size1~0=v_~size1~0_295, #race~n_produce~0=|v_#race~n_produce~0_126|, #memory_int=|v_#memory_int_257|, ~produce~0.base=v_~produce~0.base_79, ~n_produce~0=v_~n_produce~0_44, ~produce~0.offset=v_~produce~0.offset_79, ~queue1~0.offset=v_~queue1~0.offset_245, ~front1~0=v_~front1~0_385} OutVars{#race~produce~0=|v_#race~produce~0_88|, #race~state11~0=|v_#race~state11~0_219|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_47|, #race~size1~0=|v_#race~size1~0_397|, ~produce~0.base=v_~produce~0.base_79, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_57|, ~queue1~0.base=v_~queue1~0.base_245, #race~front1~0=|v_#race~front1~0_560|, #race~n_queue~0=|v_#race~n_queue~0_175|, ~n_queue~0=v_~n_queue~0_94, ~front1~0=v_~front1~0_385, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_27|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_51|, #race=|v_#race_871|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_15|, ~state11~0=v_~state11~0_137, ~size1~0=v_~size1~0_294, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_7|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_7|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, #race~n_produce~0=|v_#race~n_produce~0_125|, #memory_int=|v_#memory_int_257|, ~n_produce~0=v_~n_produce~0_44, ~produce~0.offset=v_~produce~0.offset_79, ~queue1~0.offset=v_~queue1~0.offset_245, #race~queue1~0=|v_#race~queue1~0_286|} AuxVars[|v_thread1_#t~short2#1_232|, |v_#race~state11~0_237|, |v_thread1_#t~short2#1_231|, |v_thread1_#t~short1#1_273|, |v_thread1_#t~short1#1_274|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][588], [Black: 894#true, 678#L58-12true, 878#(= |#race~n_queue~0| 0), Black: 898#true, Black: 837#(= |#race~state12~0| 0), Black: 902#true, 896#(= |#race~consume~0| 0), 714#L135-1true, Black: 968#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 966#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 962#(<= ~n_queue~0 0), Black: 909#true, 890#(= |#race~n1~0| 0), 7#L95-28true, Black: 922#true, 976#true, 860#(= |#race~n_produce~0| 0), 955#(= |#race~produce~0| 0), 911#(= |#race~update~0| 0), 559#L73true, 900#(= |#race~n2~0| 0), Black: 931#(<= ~n_produce~0 0), 982#true, Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 872#(= |#race~n_update~0| 0), Black: 953#true]) [2025-03-14 01:46:51,263 INFO L294 olderBase$Statistics]: this new event has 535 ancestors and is cut-off event [2025-03-14 01:46:51,263 INFO L297 olderBase$Statistics]: existing Event has 535 ancestors and is cut-off event [2025-03-14 01:46:51,263 INFO L297 olderBase$Statistics]: existing Event has 404 ancestors and is cut-off event [2025-03-14 01:46:51,263 INFO L297 olderBase$Statistics]: existing Event has 487 ancestors and is cut-off event [2025-03-14 01:46:51,562 INFO L124 PetriNetUnfolderBase]: 741/10277 cut-off events. [2025-03-14 01:46:51,562 INFO L125 PetriNetUnfolderBase]: For 3030/3583 co-relation queries the response was YES. [2025-03-14 01:46:51,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13160 conditions, 10277 events. 741/10277 cut-off events. For 3030/3583 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 89017 event pairs, 128 based on Foata normal form. 53/9357 useless extension candidates. Maximal degree in co-relation 13029. Up to 542 conditions per place. [2025-03-14 01:46:51,681 INFO L140 encePairwiseOnDemand]: 853/859 looper letters, 79 selfloop transitions, 5 changer transitions 0/725 dead transitions. [2025-03-14 01:46:51,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 725 transitions, 1985 flow [2025-03-14 01:46:51,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:46:51,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:46:51,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4430 transitions. [2025-03-14 01:46:51,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8595265812960807 [2025-03-14 01:46:51,684 INFO L175 Difference]: Start difference. First operand has 698 places, 690 transitions, 1571 flow. Second operand 6 states and 4430 transitions. [2025-03-14 01:46:51,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 725 transitions, 1985 flow [2025-03-14 01:46:51,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 697 places, 725 transitions, 1975 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:46:51,693 INFO L231 Difference]: Finished difference. Result has 697 places, 689 transitions, 1569 flow [2025-03-14 01:46:51,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1559, PETRI_DIFFERENCE_MINUEND_PLACES=692, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1569, PETRI_PLACES=697, PETRI_TRANSITIONS=689} [2025-03-14 01:46:51,694 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -101 predicate places. [2025-03-14 01:46:51,694 INFO L471 AbstractCegarLoop]: Abstraction has has 697 places, 689 transitions, 1569 flow [2025-03-14 01:46:51,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 731.1666666666666) internal successors, (4387), 6 states have internal predecessors, (4387), 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-03-14 01:46:51,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:51,695 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:51,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-14 01:46:51,695 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:51,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:51,696 INFO L85 PathProgramCache]: Analyzing trace with hash 952825608, now seen corresponding path program 1 times [2025-03-14 01:46:51,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:51,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17960866] [2025-03-14 01:46:51,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:51,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:51,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-14 01:46:51,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-14 01:46:51,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:51,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:51,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:46:51,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:51,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17960866] [2025-03-14 01:46:51,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17960866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:51,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:51,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:51,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232250378] [2025-03-14 01:46:51,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:51,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:51,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:51,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:51,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:51,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 859 [2025-03-14 01:46:51,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 697 places, 689 transitions, 1569 flow. Second operand has 3 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 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-03-14 01:46:51,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:51,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 859 [2025-03-14 01:46:51,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:53,939 INFO L124 PetriNetUnfolderBase]: 883/10513 cut-off events. [2025-03-14 01:46:53,939 INFO L125 PetriNetUnfolderBase]: For 3592/4010 co-relation queries the response was YES. [2025-03-14 01:46:54,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13749 conditions, 10513 events. 883/10513 cut-off events. For 3592/4010 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 91789 event pairs, 284 based on Foata normal form. 14/9520 useless extension candidates. Maximal degree in co-relation 13619. Up to 841 conditions per place. [2025-03-14 01:46:54,068 INFO L140 encePairwiseOnDemand]: 856/859 looper letters, 35 selfloop transitions, 2 changer transitions 0/697 dead transitions. [2025-03-14 01:46:54,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 698 places, 697 transitions, 1703 flow [2025-03-14 01:46:54,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:54,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2271 transitions. [2025-03-14 01:46:54,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8812572759022119 [2025-03-14 01:46:54,070 INFO L175 Difference]: Start difference. First operand has 697 places, 689 transitions, 1569 flow. Second operand 3 states and 2271 transitions. [2025-03-14 01:46:54,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 698 places, 697 transitions, 1703 flow [2025-03-14 01:46:54,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 693 places, 697 transitions, 1693 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:46:54,079 INFO L231 Difference]: Finished difference. Result has 693 places, 688 transitions, 1561 flow [2025-03-14 01:46:54,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1557, PETRI_DIFFERENCE_MINUEND_PLACES=691, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=688, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1561, PETRI_PLACES=693, PETRI_TRANSITIONS=688} [2025-03-14 01:46:54,080 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -105 predicate places. [2025-03-14 01:46:54,080 INFO L471 AbstractCegarLoop]: Abstraction has has 693 places, 688 transitions, 1561 flow [2025-03-14 01:46:54,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 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-03-14 01:46:54,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:54,081 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:54,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-14 01:46:54,081 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread3Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:54,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:54,082 INFO L85 PathProgramCache]: Analyzing trace with hash -61750499, now seen corresponding path program 1 times [2025-03-14 01:46:54,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:54,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940351035] [2025-03-14 01:46:54,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:54,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:54,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-14 01:46:54,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-14 01:46:54,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:54,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:54,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:54,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:54,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940351035] [2025-03-14 01:46:54,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940351035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:54,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:54,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:46:54,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683808272] [2025-03-14 01:46:54,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:54,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:46:54,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:54,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:46:54,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:46:54,706 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 859 [2025-03-14 01:46:54,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 693 places, 688 transitions, 1561 flow. Second operand has 6 states, 6 states have (on average 730.0) internal successors, (4380), 6 states have internal predecessors, (4380), 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-03-14 01:46:54,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:54,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 859 [2025-03-14 01:46:54,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:57,690 INFO L124 PetriNetUnfolderBase]: 1932/14040 cut-off events. [2025-03-14 01:46:57,690 INFO L125 PetriNetUnfolderBase]: For 5632/5915 co-relation queries the response was YES. [2025-03-14 01:46:57,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20170 conditions, 14040 events. 1932/14040 cut-off events. For 5632/5915 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 132897 event pairs, 254 based on Foata normal form. 1/12866 useless extension candidates. Maximal degree in co-relation 20039. Up to 858 conditions per place. [2025-03-14 01:46:57,836 INFO L140 encePairwiseOnDemand]: 853/859 looper letters, 87 selfloop transitions, 5 changer transitions 0/731 dead transitions. [2025-03-14 01:46:57,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 731 transitions, 1979 flow [2025-03-14 01:46:57,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:46:57,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:46:57,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4438 transitions. [2025-03-14 01:46:57,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8610787737679473 [2025-03-14 01:46:57,838 INFO L175 Difference]: Start difference. First operand has 693 places, 688 transitions, 1561 flow. Second operand 6 states and 4438 transitions. [2025-03-14 01:46:57,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 697 places, 731 transitions, 1979 flow [2025-03-14 01:46:57,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 731 transitions, 1975 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:57,847 INFO L231 Difference]: Finished difference. Result has 695 places, 687 transitions, 1565 flow [2025-03-14 01:46:57,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1555, PETRI_DIFFERENCE_MINUEND_PLACES=690, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=682, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1565, PETRI_PLACES=695, PETRI_TRANSITIONS=687} [2025-03-14 01:46:57,848 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -103 predicate places. [2025-03-14 01:46:57,848 INFO L471 AbstractCegarLoop]: Abstraction has has 695 places, 687 transitions, 1565 flow [2025-03-14 01:46:57,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 730.0) internal successors, (4380), 6 states have internal predecessors, (4380), 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-03-14 01:46:57,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:57,849 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:57,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-14 01:46:57,849 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread3Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:46:57,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:57,850 INFO L85 PathProgramCache]: Analyzing trace with hash -305787611, now seen corresponding path program 1 times [2025-03-14 01:46:57,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:57,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663986835] [2025-03-14 01:46:57,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:57,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:57,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-14 01:46:57,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-14 01:46:57,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:57,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:58,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:58,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:58,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663986835] [2025-03-14 01:46:58,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663986835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:58,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:58,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:46:58,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351805355] [2025-03-14 01:46:58,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:58,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:46:58,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:58,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:46:58,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:46:58,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 729 out of 859 [2025-03-14 01:46:58,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 687 transitions, 1565 flow. Second operand has 6 states, 6 states have (on average 730.6666666666666) internal successors, (4384), 6 states have internal predecessors, (4384), 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-03-14 01:46:58,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:58,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 729 of 859 [2025-03-14 01:46:58,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:47:02,886 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2414] L52-->L58-12: Formula: (let ((.cse9 (* v_~front1~0_385 4)) (.cse10 (* v_~size1~0_295 4)) (.cse12 (* v_~state11~0_137 4))) (let ((.cse3 (+ 2 v_~produce~0.offset_79 .cse12)) (.cse8 (+ .cse9 .cse10 v_~queue1~0.offset_245)) (.cse5 (+ v_~produce~0.offset_79 .cse12)) (.cse0 (not |v_thread1_#t~short2#1_232|)) (.cse7 (+ v_~produce~0.offset_79 3 .cse12)) (.cse2 (select |v_#race_871| v_~produce~0.base_79)) (.cse6 (+ v_~produce~0.offset_79 .cse12 1)) (.cse11 (+ v_~front1~0_385 v_~size1~0_295))) (and (not (= (ite |v_thread1_#t~short2#1_231| 1 0) 0)) (let ((.cse1 (= |v_#race~state11~0_237| 0))) (or (and (= |v_#race~n_produce~0_126| |v_#race~n_produce~0_125|) .cse0 .cse1 (= |v_thread1_#t~short2#1_232| |v_thread1_#t~short2#1_231|)) (and .cse1 |v_thread1_#t~short2#1_232| (= |v_#race~n_produce~0_125| 0) (or (and (not |v_thread1_#t~short2#1_231|) (<= v_~n_produce~0_44 v_~state11~0_137)) (and (< v_~state11~0_137 v_~n_produce~0_44) |v_thread1_#t~short2#1_231|))))) (= |v_#race~queue1~0_286| 0) (= (select .cse2 .cse3) 0) (= |v_#race_871| (let ((.cse4 (store |v_#race_872| v_~queue1~0.base_245 (store (store (store (store (select |v_#race_872| v_~queue1~0.base_245) .cse8 0) (+ .cse9 .cse10 v_~queue1~0.offset_245 1) 0) (+ .cse9 2 .cse10 v_~queue1~0.offset_245) 0) (+ .cse9 3 .cse10 v_~queue1~0.offset_245) 0)))) (store .cse4 v_~produce~0.base_79 (store (store (store (store (select .cse4 v_~produce~0.base_79) .cse5 0) .cse6 0) .cse3 0) .cse7 0)))) (or (and (<= v_~n_queue~0_94 .cse11) (not |v_thread1_#t~short1#1_273|)) (and |v_thread1_#t~short1#1_273| (< .cse11 v_~n_queue~0_94))) (not (= (ite |v_thread1_#t~short1#1_273| 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_257| v_~queue1~0.base_245) .cse8) (select (select |v_#memory_int_257| v_~produce~0.base_79) .cse5)) 1 0) 0)) (= |v_#race~n_queue~0_175| 0) (= (select .cse2 .cse5) 0) |v_thread1_#t~short1#1_274| (= |v_#race~produce~0_88| 0) (or (and (<= 0 v_~state11~0_137) |v_thread1_#t~short2#1_232|) (and (< v_~state11~0_137 0) .cse0)) (= |v_#race~front1~0_560| 0) (= |v_#race~state11~0_219| 0) (= (+ v_~size1~0_295 1) v_~size1~0_294) (= (select .cse2 .cse7) 0) (= (select .cse2 .cse6) 0) (or (and (not |v_thread1_#t~short1#1_274|) (< .cse11 0)) (and |v_thread1_#t~short1#1_274| (<= 0 .cse11)))))) InVars {#race=|v_#race_872|, ~queue1~0.base=v_~queue1~0.base_245, ~state11~0=v_~state11~0_137, ~n_queue~0=v_~n_queue~0_94, ~size1~0=v_~size1~0_295, #race~n_produce~0=|v_#race~n_produce~0_126|, #memory_int=|v_#memory_int_257|, ~produce~0.base=v_~produce~0.base_79, ~n_produce~0=v_~n_produce~0_44, ~produce~0.offset=v_~produce~0.offset_79, ~queue1~0.offset=v_~queue1~0.offset_245, ~front1~0=v_~front1~0_385} OutVars{#race~produce~0=|v_#race~produce~0_88|, #race~state11~0=|v_#race~state11~0_219|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_47|, #race~size1~0=|v_#race~size1~0_397|, ~produce~0.base=v_~produce~0.base_79, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_57|, ~queue1~0.base=v_~queue1~0.base_245, #race~front1~0=|v_#race~front1~0_560|, #race~n_queue~0=|v_#race~n_queue~0_175|, ~n_queue~0=v_~n_queue~0_94, ~front1~0=v_~front1~0_385, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_27|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_51|, #race=|v_#race_871|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_15|, ~state11~0=v_~state11~0_137, ~size1~0=v_~size1~0_294, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_7|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_7|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, #race~n_produce~0=|v_#race~n_produce~0_125|, #memory_int=|v_#memory_int_257|, ~n_produce~0=v_~n_produce~0_44, ~produce~0.offset=v_~produce~0.offset_79, ~queue1~0.offset=v_~queue1~0.offset_245, #race~queue1~0=|v_#race~queue1~0_286|} AuxVars[|v_thread1_#t~short2#1_232|, |v_#race~state11~0_237|, |v_thread1_#t~short2#1_231|, |v_thread1_#t~short1#1_273|, |v_thread1_#t~short1#1_274|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][565], [Black: 894#true, 678#L58-12true, 878#(= |#race~n_queue~0| 0), Black: 898#true, Black: 837#(= |#race~state12~0| 0), Black: 902#true, 896#(= |#race~consume~0| 0), 714#L135-1true, Black: 968#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 966#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 962#(<= ~n_queue~0 0), Black: 909#true, 890#(= |#race~n1~0| 0), 7#L95-28true, Black: 922#true, 607#L83true, 860#(= |#race~n_produce~0| 0), 955#(= |#race~produce~0| 0), 911#(= |#race~update~0| 0), 997#true, 991#true, 900#(= |#race~n2~0| 0), Black: 931#(<= ~n_produce~0 0), Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 872#(= |#race~n_update~0| 0), Black: 953#true]) [2025-03-14 01:47:02,886 INFO L294 olderBase$Statistics]: this new event has 534 ancestors and is cut-off event [2025-03-14 01:47:02,886 INFO L297 olderBase$Statistics]: existing Event has 486 ancestors and is cut-off event [2025-03-14 01:47:02,886 INFO L297 olderBase$Statistics]: existing Event has 403 ancestors and is cut-off event [2025-03-14 01:47:02,886 INFO L297 olderBase$Statistics]: existing Event has 534 ancestors and is cut-off event [2025-03-14 01:47:02,907 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2414] L52-->L58-12: Formula: (let ((.cse9 (* v_~front1~0_385 4)) (.cse10 (* v_~size1~0_295 4)) (.cse12 (* v_~state11~0_137 4))) (let ((.cse3 (+ 2 v_~produce~0.offset_79 .cse12)) (.cse8 (+ .cse9 .cse10 v_~queue1~0.offset_245)) (.cse5 (+ v_~produce~0.offset_79 .cse12)) (.cse0 (not |v_thread1_#t~short2#1_232|)) (.cse7 (+ v_~produce~0.offset_79 3 .cse12)) (.cse2 (select |v_#race_871| v_~produce~0.base_79)) (.cse6 (+ v_~produce~0.offset_79 .cse12 1)) (.cse11 (+ v_~front1~0_385 v_~size1~0_295))) (and (not (= (ite |v_thread1_#t~short2#1_231| 1 0) 0)) (let ((.cse1 (= |v_#race~state11~0_237| 0))) (or (and (= |v_#race~n_produce~0_126| |v_#race~n_produce~0_125|) .cse0 .cse1 (= |v_thread1_#t~short2#1_232| |v_thread1_#t~short2#1_231|)) (and .cse1 |v_thread1_#t~short2#1_232| (= |v_#race~n_produce~0_125| 0) (or (and (not |v_thread1_#t~short2#1_231|) (<= v_~n_produce~0_44 v_~state11~0_137)) (and (< v_~state11~0_137 v_~n_produce~0_44) |v_thread1_#t~short2#1_231|))))) (= |v_#race~queue1~0_286| 0) (= (select .cse2 .cse3) 0) (= |v_#race_871| (let ((.cse4 (store |v_#race_872| v_~queue1~0.base_245 (store (store (store (store (select |v_#race_872| v_~queue1~0.base_245) .cse8 0) (+ .cse9 .cse10 v_~queue1~0.offset_245 1) 0) (+ .cse9 2 .cse10 v_~queue1~0.offset_245) 0) (+ .cse9 3 .cse10 v_~queue1~0.offset_245) 0)))) (store .cse4 v_~produce~0.base_79 (store (store (store (store (select .cse4 v_~produce~0.base_79) .cse5 0) .cse6 0) .cse3 0) .cse7 0)))) (or (and (<= v_~n_queue~0_94 .cse11) (not |v_thread1_#t~short1#1_273|)) (and |v_thread1_#t~short1#1_273| (< .cse11 v_~n_queue~0_94))) (not (= (ite |v_thread1_#t~short1#1_273| 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_257| v_~queue1~0.base_245) .cse8) (select (select |v_#memory_int_257| v_~produce~0.base_79) .cse5)) 1 0) 0)) (= |v_#race~n_queue~0_175| 0) (= (select .cse2 .cse5) 0) |v_thread1_#t~short1#1_274| (= |v_#race~produce~0_88| 0) (or (and (<= 0 v_~state11~0_137) |v_thread1_#t~short2#1_232|) (and (< v_~state11~0_137 0) .cse0)) (= |v_#race~front1~0_560| 0) (= |v_#race~state11~0_219| 0) (= (+ v_~size1~0_295 1) v_~size1~0_294) (= (select .cse2 .cse7) 0) (= (select .cse2 .cse6) 0) (or (and (not |v_thread1_#t~short1#1_274|) (< .cse11 0)) (and |v_thread1_#t~short1#1_274| (<= 0 .cse11)))))) InVars {#race=|v_#race_872|, ~queue1~0.base=v_~queue1~0.base_245, ~state11~0=v_~state11~0_137, ~n_queue~0=v_~n_queue~0_94, ~size1~0=v_~size1~0_295, #race~n_produce~0=|v_#race~n_produce~0_126|, #memory_int=|v_#memory_int_257|, ~produce~0.base=v_~produce~0.base_79, ~n_produce~0=v_~n_produce~0_44, ~produce~0.offset=v_~produce~0.offset_79, ~queue1~0.offset=v_~queue1~0.offset_245, ~front1~0=v_~front1~0_385} OutVars{#race~produce~0=|v_#race~produce~0_88|, #race~state11~0=|v_#race~state11~0_219|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_47|, #race~size1~0=|v_#race~size1~0_397|, ~produce~0.base=v_~produce~0.base_79, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_57|, ~queue1~0.base=v_~queue1~0.base_245, #race~front1~0=|v_#race~front1~0_560|, #race~n_queue~0=|v_#race~n_queue~0_175|, ~n_queue~0=v_~n_queue~0_94, ~front1~0=v_~front1~0_385, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_27|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_51|, #race=|v_#race_871|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_15|, ~state11~0=v_~state11~0_137, ~size1~0=v_~size1~0_294, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_7|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_7|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, #race~n_produce~0=|v_#race~n_produce~0_125|, #memory_int=|v_#memory_int_257|, ~n_produce~0=v_~n_produce~0_44, ~produce~0.offset=v_~produce~0.offset_79, ~queue1~0.offset=v_~queue1~0.offset_245, #race~queue1~0=|v_#race~queue1~0_286|} AuxVars[|v_thread1_#t~short2#1_232|, |v_#race~state11~0_237|, |v_thread1_#t~short2#1_231|, |v_thread1_#t~short1#1_273|, |v_thread1_#t~short1#1_274|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][565], [Black: 894#true, 678#L58-12true, 878#(= |#race~n_queue~0| 0), Black: 898#true, Black: 837#(= |#race~state12~0| 0), Black: 902#true, 896#(= |#race~consume~0| 0), 714#L135-1true, Black: 968#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 966#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 962#(<= ~n_queue~0 0), Black: 909#true, 890#(= |#race~n1~0| 0), 7#L95-28true, Black: 922#true, 860#(= |#race~n_produce~0| 0), 955#(= |#race~produce~0| 0), 911#(= |#race~update~0| 0), 997#true, 559#L73true, 991#true, 900#(= |#race~n2~0| 0), Black: 931#(<= ~n_produce~0 0), Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 872#(= |#race~n_update~0| 0), Black: 953#true]) [2025-03-14 01:47:02,907 INFO L294 olderBase$Statistics]: this new event has 535 ancestors and is cut-off event [2025-03-14 01:47:02,908 INFO L297 olderBase$Statistics]: existing Event has 535 ancestors and is cut-off event [2025-03-14 01:47:02,908 INFO L297 olderBase$Statistics]: existing Event has 404 ancestors and is cut-off event [2025-03-14 01:47:02,908 INFO L297 olderBase$Statistics]: existing Event has 487 ancestors and is cut-off event [2025-03-14 01:47:03,073 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2414] L52-->L58-12: Formula: (let ((.cse9 (* v_~front1~0_385 4)) (.cse10 (* v_~size1~0_295 4)) (.cse12 (* v_~state11~0_137 4))) (let ((.cse3 (+ 2 v_~produce~0.offset_79 .cse12)) (.cse8 (+ .cse9 .cse10 v_~queue1~0.offset_245)) (.cse5 (+ v_~produce~0.offset_79 .cse12)) (.cse0 (not |v_thread1_#t~short2#1_232|)) (.cse7 (+ v_~produce~0.offset_79 3 .cse12)) (.cse2 (select |v_#race_871| v_~produce~0.base_79)) (.cse6 (+ v_~produce~0.offset_79 .cse12 1)) (.cse11 (+ v_~front1~0_385 v_~size1~0_295))) (and (not (= (ite |v_thread1_#t~short2#1_231| 1 0) 0)) (let ((.cse1 (= |v_#race~state11~0_237| 0))) (or (and (= |v_#race~n_produce~0_126| |v_#race~n_produce~0_125|) .cse0 .cse1 (= |v_thread1_#t~short2#1_232| |v_thread1_#t~short2#1_231|)) (and .cse1 |v_thread1_#t~short2#1_232| (= |v_#race~n_produce~0_125| 0) (or (and (not |v_thread1_#t~short2#1_231|) (<= v_~n_produce~0_44 v_~state11~0_137)) (and (< v_~state11~0_137 v_~n_produce~0_44) |v_thread1_#t~short2#1_231|))))) (= |v_#race~queue1~0_286| 0) (= (select .cse2 .cse3) 0) (= |v_#race_871| (let ((.cse4 (store |v_#race_872| v_~queue1~0.base_245 (store (store (store (store (select |v_#race_872| v_~queue1~0.base_245) .cse8 0) (+ .cse9 .cse10 v_~queue1~0.offset_245 1) 0) (+ .cse9 2 .cse10 v_~queue1~0.offset_245) 0) (+ .cse9 3 .cse10 v_~queue1~0.offset_245) 0)))) (store .cse4 v_~produce~0.base_79 (store (store (store (store (select .cse4 v_~produce~0.base_79) .cse5 0) .cse6 0) .cse3 0) .cse7 0)))) (or (and (<= v_~n_queue~0_94 .cse11) (not |v_thread1_#t~short1#1_273|)) (and |v_thread1_#t~short1#1_273| (< .cse11 v_~n_queue~0_94))) (not (= (ite |v_thread1_#t~short1#1_273| 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_257| v_~queue1~0.base_245) .cse8) (select (select |v_#memory_int_257| v_~produce~0.base_79) .cse5)) 1 0) 0)) (= |v_#race~n_queue~0_175| 0) (= (select .cse2 .cse5) 0) |v_thread1_#t~short1#1_274| (= |v_#race~produce~0_88| 0) (or (and (<= 0 v_~state11~0_137) |v_thread1_#t~short2#1_232|) (and (< v_~state11~0_137 0) .cse0)) (= |v_#race~front1~0_560| 0) (= |v_#race~state11~0_219| 0) (= (+ v_~size1~0_295 1) v_~size1~0_294) (= (select .cse2 .cse7) 0) (= (select .cse2 .cse6) 0) (or (and (not |v_thread1_#t~short1#1_274|) (< .cse11 0)) (and |v_thread1_#t~short1#1_274| (<= 0 .cse11)))))) InVars {#race=|v_#race_872|, ~queue1~0.base=v_~queue1~0.base_245, ~state11~0=v_~state11~0_137, ~n_queue~0=v_~n_queue~0_94, ~size1~0=v_~size1~0_295, #race~n_produce~0=|v_#race~n_produce~0_126|, #memory_int=|v_#memory_int_257|, ~produce~0.base=v_~produce~0.base_79, ~n_produce~0=v_~n_produce~0_44, ~produce~0.offset=v_~produce~0.offset_79, ~queue1~0.offset=v_~queue1~0.offset_245, ~front1~0=v_~front1~0_385} OutVars{#race~produce~0=|v_#race~produce~0_88|, #race~state11~0=|v_#race~state11~0_219|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_47|, #race~size1~0=|v_#race~size1~0_397|, ~produce~0.base=v_~produce~0.base_79, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_57|, ~queue1~0.base=v_~queue1~0.base_245, #race~front1~0=|v_#race~front1~0_560|, #race~n_queue~0=|v_#race~n_queue~0_175|, ~n_queue~0=v_~n_queue~0_94, ~front1~0=v_~front1~0_385, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_27|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_51|, #race=|v_#race_871|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_15|, ~state11~0=v_~state11~0_137, ~size1~0=v_~size1~0_294, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_7|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_7|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, #race~n_produce~0=|v_#race~n_produce~0_125|, #memory_int=|v_#memory_int_257|, ~n_produce~0=v_~n_produce~0_44, ~produce~0.offset=v_~produce~0.offset_79, ~queue1~0.offset=v_~queue1~0.offset_245, #race~queue1~0=|v_#race~queue1~0_286|} AuxVars[|v_thread1_#t~short2#1_232|, |v_#race~state11~0_237|, |v_thread1_#t~short2#1_231|, |v_thread1_#t~short1#1_273|, |v_thread1_#t~short1#1_274|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][565], [Black: 894#true, 678#L58-12true, Black: 898#true, 878#(= |#race~n_queue~0| 0), Black: 835#true, Black: 902#true, 896#(= |#race~consume~0| 0), 714#L135-1true, Black: 968#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 966#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 962#(<= ~n_queue~0 0), Black: 909#true, 890#(= |#race~n1~0| 0), 7#L95-28true, Black: 922#true, 860#(= |#race~n_produce~0| 0), 955#(= |#race~produce~0| 0), 911#(= |#race~update~0| 0), 997#true, 559#L73true, 991#true, 900#(= |#race~n2~0| 0), Black: 931#(<= ~n_produce~0 0), Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 872#(= |#race~n_update~0| 0), Black: 953#true]) [2025-03-14 01:47:03,073 INFO L294 olderBase$Statistics]: this new event has 545 ancestors and is cut-off event [2025-03-14 01:47:03,073 INFO L297 olderBase$Statistics]: existing Event has 446 ancestors and is cut-off event [2025-03-14 01:47:03,073 INFO L297 olderBase$Statistics]: existing Event has 497 ancestors and is cut-off event [2025-03-14 01:47:03,073 INFO L297 olderBase$Statistics]: existing Event has 545 ancestors and is cut-off event [2025-03-14 01:47:03,257 INFO L124 PetriNetUnfolderBase]: 2968/24118 cut-off events. [2025-03-14 01:47:03,257 INFO L125 PetriNetUnfolderBase]: For 7199/7396 co-relation queries the response was YES. [2025-03-14 01:47:03,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33225 conditions, 24118 events. 2968/24118 cut-off events. For 7199/7396 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 270948 event pairs, 712 based on Foata normal form. 1/21946 useless extension candidates. Maximal degree in co-relation 33097. Up to 1968 conditions per place. [2025-03-14 01:47:03,485 INFO L140 encePairwiseOnDemand]: 853/859 looper letters, 86 selfloop transitions, 5 changer transitions 0/730 dead transitions. [2025-03-14 01:47:03,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 699 places, 730 transitions, 1981 flow [2025-03-14 01:47:03,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:47:03,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:47:03,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4443 transitions. [2025-03-14 01:47:03,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8620488940628638 [2025-03-14 01:47:03,488 INFO L175 Difference]: Start difference. First operand has 695 places, 687 transitions, 1565 flow. Second operand 6 states and 4443 transitions. [2025-03-14 01:47:03,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 699 places, 730 transitions, 1981 flow [2025-03-14 01:47:03,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 694 places, 730 transitions, 1971 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:47:03,499 INFO L231 Difference]: Finished difference. Result has 694 places, 686 transitions, 1563 flow [2025-03-14 01:47:03,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=689, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1563, PETRI_PLACES=694, PETRI_TRANSITIONS=686} [2025-03-14 01:47:03,500 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -104 predicate places. [2025-03-14 01:47:03,500 INFO L471 AbstractCegarLoop]: Abstraction has has 694 places, 686 transitions, 1563 flow [2025-03-14 01:47:03,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 730.6666666666666) internal successors, (4384), 6 states have internal predecessors, (4384), 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-03-14 01:47:03,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:47:03,501 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:47:03,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-14 01:47:03,501 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread3Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:47:03,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:47:03,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1490064935, now seen corresponding path program 1 times [2025-03-14 01:47:03,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:47:03,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314580254] [2025-03-14 01:47:03,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:47:03,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:47:03,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-14 01:47:03,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-14 01:47:03,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:47:03,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:47:03,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:47:03,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:47:03,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314580254] [2025-03-14 01:47:03,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314580254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:47:03,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:47:03,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:47:03,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10096333] [2025-03-14 01:47:03,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:47:03,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:47:03,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:47:03,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:47:03,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:47:03,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 750 out of 859 [2025-03-14 01:47:03,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 694 places, 686 transitions, 1563 flow. Second operand has 3 states, 3 states have (on average 753.0) internal successors, (2259), 3 states have internal predecessors, (2259), 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-03-14 01:47:03,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:47:03,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 750 of 859 [2025-03-14 01:47:03,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:47:07,958 INFO L124 PetriNetUnfolderBase]: 2668/24305 cut-off events. [2025-03-14 01:47:07,958 INFO L125 PetriNetUnfolderBase]: For 6216/6343 co-relation queries the response was YES. [2025-03-14 01:47:08,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32430 conditions, 24305 events. 2668/24305 cut-off events. For 6216/6343 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 275529 event pairs, 963 based on Foata normal form. 3/22213 useless extension candidates. Maximal degree in co-relation 32301. Up to 2453 conditions per place. [2025-03-14 01:47:08,164 INFO L140 encePairwiseOnDemand]: 856/859 looper letters, 34 selfloop transitions, 2 changer transitions 0/696 dead transitions. [2025-03-14 01:47:08,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 695 places, 696 transitions, 1692 flow [2025-03-14 01:47:08,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:47:08,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:47:08,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2276 transitions. [2025-03-14 01:47:08,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.883197516492045 [2025-03-14 01:47:08,166 INFO L175 Difference]: Start difference. First operand has 694 places, 686 transitions, 1563 flow. Second operand 3 states and 2276 transitions. [2025-03-14 01:47:08,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 695 places, 696 transitions, 1692 flow [2025-03-14 01:47:08,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 690 places, 696 transitions, 1682 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:47:08,180 INFO L231 Difference]: Finished difference. Result has 690 places, 685 transitions, 1555 flow [2025-03-14 01:47:08,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1551, PETRI_DIFFERENCE_MINUEND_PLACES=688, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=683, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1555, PETRI_PLACES=690, PETRI_TRANSITIONS=685} [2025-03-14 01:47:08,181 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -108 predicate places. [2025-03-14 01:47:08,181 INFO L471 AbstractCegarLoop]: Abstraction has has 690 places, 685 transitions, 1555 flow [2025-03-14 01:47:08,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 753.0) internal successors, (2259), 3 states have internal predecessors, (2259), 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-03-14 01:47:08,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:47:08,182 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:47:08,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-14 01:47:08,182 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:47:08,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:47:08,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1445151443, now seen corresponding path program 1 times [2025-03-14 01:47:08,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:47:08,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771529968] [2025-03-14 01:47:08,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:47:08,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:47:08,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-14 01:47:08,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-14 01:47:08,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:47:08,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:47:08,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:47:08,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:47:08,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771529968] [2025-03-14 01:47:08,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771529968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:47:08,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:47:08,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:47:08,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749532535] [2025-03-14 01:47:08,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:47:08,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:47:08,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:47:08,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:47:08,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:47:09,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 859 [2025-03-14 01:47:09,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 690 places, 685 transitions, 1555 flow. Second operand has 6 states, 6 states have (on average 730.0) internal successors, (4380), 6 states have internal predecessors, (4380), 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-03-14 01:47:09,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:47:09,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 859 [2025-03-14 01:47:09,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:47:11,472 INFO L124 PetriNetUnfolderBase]: 1329/11097 cut-off events. [2025-03-14 01:47:11,472 INFO L125 PetriNetUnfolderBase]: For 4050/4313 co-relation queries the response was YES. [2025-03-14 01:47:11,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15499 conditions, 11097 events. 1329/11097 cut-off events. For 4050/4313 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 97455 event pairs, 185 based on Foata normal form. 1/10229 useless extension candidates. Maximal degree in co-relation 15368. Up to 688 conditions per place. [2025-03-14 01:47:11,583 INFO L140 encePairwiseOnDemand]: 853/859 looper letters, 87 selfloop transitions, 5 changer transitions 0/728 dead transitions. [2025-03-14 01:47:11,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 728 transitions, 1973 flow [2025-03-14 01:47:11,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:47:11,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:47:11,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4438 transitions. [2025-03-14 01:47:11,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8610787737679473 [2025-03-14 01:47:11,585 INFO L175 Difference]: Start difference. First operand has 690 places, 685 transitions, 1555 flow. Second operand 6 states and 4438 transitions. [2025-03-14 01:47:11,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 728 transitions, 1973 flow [2025-03-14 01:47:11,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 692 places, 728 transitions, 1969 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:47:11,594 INFO L231 Difference]: Finished difference. Result has 692 places, 684 transitions, 1559 flow [2025-03-14 01:47:11,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1549, PETRI_DIFFERENCE_MINUEND_PLACES=687, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1559, PETRI_PLACES=692, PETRI_TRANSITIONS=684} [2025-03-14 01:47:11,595 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -106 predicate places. [2025-03-14 01:47:11,596 INFO L471 AbstractCegarLoop]: Abstraction has has 692 places, 684 transitions, 1559 flow [2025-03-14 01:47:11,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 730.0) internal successors, (4380), 6 states have internal predecessors, (4380), 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-03-14 01:47:11,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:47:11,596 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:47:11,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-14 01:47:11,597 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:47:11,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:47:11,598 INFO L85 PathProgramCache]: Analyzing trace with hash -896226001, now seen corresponding path program 1 times [2025-03-14 01:47:11,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:47:11,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157784434] [2025-03-14 01:47:11,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:47:11,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:47:11,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 395 statements into 1 equivalence classes. [2025-03-14 01:47:11,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 395 of 395 statements. [2025-03-14 01:47:11,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:47:11,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:47:11,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:47:11,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:47:11,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157784434] [2025-03-14 01:47:11,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157784434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:47:11,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:47:11,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:47:11,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865734277] [2025-03-14 01:47:11,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:47:11,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:47:11,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:47:11,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:47:11,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:47:11,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 859 [2025-03-14 01:47:11,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 692 places, 684 transitions, 1559 flow. Second operand has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 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-03-14 01:47:11,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:47:11,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 859 [2025-03-14 01:47:11,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:47:15,857 INFO L124 PetriNetUnfolderBase]: 3567/23929 cut-off events. [2025-03-14 01:47:15,857 INFO L125 PetriNetUnfolderBase]: For 9014/9104 co-relation queries the response was YES. [2025-03-14 01:47:15,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34741 conditions, 23929 events. 3567/23929 cut-off events. For 9014/9104 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 265285 event pairs, 1709 based on Foata normal form. 0/21814 useless extension candidates. Maximal degree in co-relation 34612. Up to 4397 conditions per place. [2025-03-14 01:47:16,027 INFO L140 encePairwiseOnDemand]: 856/859 looper letters, 43 selfloop transitions, 2 changer transitions 0/694 dead transitions. [2025-03-14 01:47:16,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 694 transitions, 1706 flow [2025-03-14 01:47:16,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:47:16,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:47:16,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2263 transitions. [2025-03-14 01:47:16,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8781528909584788 [2025-03-14 01:47:16,029 INFO L175 Difference]: Start difference. First operand has 692 places, 684 transitions, 1559 flow. Second operand 3 states and 2263 transitions. [2025-03-14 01:47:16,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 693 places, 694 transitions, 1706 flow [2025-03-14 01:47:16,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 688 places, 694 transitions, 1696 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:47:16,038 INFO L231 Difference]: Finished difference. Result has 688 places, 683 transitions, 1551 flow [2025-03-14 01:47:16,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1547, PETRI_DIFFERENCE_MINUEND_PLACES=686, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1551, PETRI_PLACES=688, PETRI_TRANSITIONS=683} [2025-03-14 01:47:16,039 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -110 predicate places. [2025-03-14 01:47:16,039 INFO L471 AbstractCegarLoop]: Abstraction has has 688 places, 683 transitions, 1551 flow [2025-03-14 01:47:16,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 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-03-14 01:47:16,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:47:16,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:47:16,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-14 01:47:16,040 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:47:16,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:47:16,041 INFO L85 PathProgramCache]: Analyzing trace with hash 388887020, now seen corresponding path program 1 times [2025-03-14 01:47:16,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:47:16,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824819872] [2025-03-14 01:47:16,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:47:16,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:47:16,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-03-14 01:47:16,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-03-14 01:47:16,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:47:16,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:47:16,102 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:47:16,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:47:16,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824819872] [2025-03-14 01:47:16,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824819872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:47:16,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:47:16,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:47:16,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372614596] [2025-03-14 01:47:16,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:47:16,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:47:16,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:47:16,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:47:16,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:47:16,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 859 [2025-03-14 01:47:16,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 688 places, 683 transitions, 1551 flow. Second operand has 3 states, 3 states have (on average 758.0) internal successors, (2274), 3 states have internal predecessors, (2274), 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-03-14 01:47:16,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:47:16,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 859 [2025-03-14 01:47:16,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:47:19,692 INFO L124 PetriNetUnfolderBase]: 1224/20680 cut-off events. [2025-03-14 01:47:19,693 INFO L125 PetriNetUnfolderBase]: For 2701/2892 co-relation queries the response was YES. [2025-03-14 01:47:19,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24165 conditions, 20680 events. 1224/20680 cut-off events. For 2701/2892 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 224533 event pairs, 107 based on Foata normal form. 5/19143 useless extension candidates. Maximal degree in co-relation 24037. Up to 758 conditions per place. [2025-03-14 01:47:19,849 INFO L140 encePairwiseOnDemand]: 856/859 looper letters, 33 selfloop transitions, 2 changer transitions 0/697 dead transitions. [2025-03-14 01:47:19,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 697 transitions, 1705 flow [2025-03-14 01:47:19,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:47:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:47:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2292 transitions. [2025-03-14 01:47:19,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.889406286379511 [2025-03-14 01:47:19,850 INFO L175 Difference]: Start difference. First operand has 688 places, 683 transitions, 1551 flow. Second operand 3 states and 2292 transitions. [2025-03-14 01:47:19,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 697 transitions, 1705 flow [2025-03-14 01:47:19,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 687 places, 697 transitions, 1701 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:47:19,858 INFO L231 Difference]: Finished difference. Result has 688 places, 684 transitions, 1561 flow [2025-03-14 01:47:19,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1545, PETRI_DIFFERENCE_MINUEND_PLACES=685, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1561, PETRI_PLACES=688, PETRI_TRANSITIONS=684} [2025-03-14 01:47:19,858 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -110 predicate places. [2025-03-14 01:47:19,858 INFO L471 AbstractCegarLoop]: Abstraction has has 688 places, 684 transitions, 1561 flow [2025-03-14 01:47:19,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 758.0) internal successors, (2274), 3 states have internal predecessors, (2274), 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-03-14 01:47:19,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:47:19,859 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:47:19,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-14 01:47:19,859 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:47:19,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:47:19,860 INFO L85 PathProgramCache]: Analyzing trace with hash -921703999, now seen corresponding path program 1 times [2025-03-14 01:47:19,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:47:19,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102623810] [2025-03-14 01:47:19,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:47:19,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:47:19,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-14 01:47:19,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-14 01:47:19,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:47:19,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:47:19,977 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 01:47:19,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:47:19,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102623810] [2025-03-14 01:47:19,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102623810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:47:19,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:47:19,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:47:19,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357126409] [2025-03-14 01:47:19,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:47:19,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:47:19,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:47:19,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:47:19,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:47:20,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 731 out of 859 [2025-03-14 01:47:20,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 688 places, 684 transitions, 1561 flow. Second operand has 3 states, 3 states have (on average 734.3333333333334) internal successors, (2203), 3 states have internal predecessors, (2203), 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-03-14 01:47:20,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:47:20,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 731 of 859 [2025-03-14 01:47:20,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:47:24,275 INFO L124 PetriNetUnfolderBase]: 1431/21448 cut-off events. [2025-03-14 01:47:24,275 INFO L125 PetriNetUnfolderBase]: For 3376/3567 co-relation queries the response was YES. [2025-03-14 01:47:24,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25690 conditions, 21448 events. 1431/21448 cut-off events. For 3376/3567 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 235515 event pairs, 294 based on Foata normal form. 1/19891 useless extension candidates. Maximal degree in co-relation 25559. Up to 943 conditions per place. [2025-03-14 01:47:24,406 INFO L140 encePairwiseOnDemand]: 856/859 looper letters, 56 selfloop transitions, 2 changer transitions 0/695 dead transitions. [2025-03-14 01:47:24,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 695 transitions, 1738 flow [2025-03-14 01:47:24,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:47:24,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:47:24,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2240 transitions. [2025-03-14 01:47:24,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8692277842452464 [2025-03-14 01:47:24,408 INFO L175 Difference]: Start difference. First operand has 688 places, 684 transitions, 1561 flow. Second operand 3 states and 2240 transitions. [2025-03-14 01:47:24,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 695 transitions, 1738 flow [2025-03-14 01:47:24,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 689 places, 695 transitions, 1738 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:47:24,415 INFO L231 Difference]: Finished difference. Result has 690 places, 684 transitions, 1569 flow [2025-03-14 01:47:24,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=859, PETRI_DIFFERENCE_MINUEND_FLOW=1559, PETRI_DIFFERENCE_MINUEND_PLACES=687, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1569, PETRI_PLACES=690, PETRI_TRANSITIONS=684} [2025-03-14 01:47:24,417 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -108 predicate places. [2025-03-14 01:47:24,417 INFO L471 AbstractCegarLoop]: Abstraction has has 690 places, 684 transitions, 1569 flow [2025-03-14 01:47:24,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 734.3333333333334) internal successors, (2203), 3 states have internal predecessors, (2203), 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-03-14 01:47:24,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:47:24,417 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:47:24,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-14 01:47:24,417 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-14 01:47:24,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:47:24,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1937129085, now seen corresponding path program 1 times [2025-03-14 01:47:24,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:47:24,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410446247] [2025-03-14 01:47:24,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:47:24,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:47:24,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-03-14 01:47:24,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-03-14 01:47:24,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:47:24,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:47:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 01:47:24,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:47:24,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410446247] [2025-03-14 01:47:24,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410446247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:47:24,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:47:24,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:47:24,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68095874] [2025-03-14 01:47:24,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:47:24,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:47:24,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:47:24,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:47:24,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:47:24,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 754 out of 859 [2025-03-14 01:47:24,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 690 places, 684 transitions, 1569 flow. Second operand has 3 states, 3 states have (on average 756.3333333333334) internal successors, (2269), 3 states have internal predecessors, (2269), 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-03-14 01:47:24,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:47:24,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 754 of 859 [2025-03-14 01:47:24,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand