./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5dd003755f1e361f3bbf00c3bfecbc1131b6df98a7806f5bb08971966b13d6ac --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:32:03,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:32:03,708 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:32:03,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:32:03,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:32:03,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:32:03,744 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:32:03,745 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:32:03,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:32:03,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:32:03,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:32:03,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:32:03,745 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:32:03,746 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:32:03,746 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:32:03,746 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:32:03,747 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:32:03,747 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:32:03,747 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:32:03,747 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:32:03,747 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:32:03,747 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:32:03,748 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:32:03,748 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:32:03,748 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:32:03,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:32:03,748 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:32:03,748 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:32:03,748 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:32:03,748 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:32:03,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:32:03,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:32:03,748 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:32:03,748 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:32:03,749 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:32:03,749 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:32:03,749 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:32:03,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:32:03,749 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:32:03,749 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:32:03,749 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:32:03,749 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:32:03,750 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5dd003755f1e361f3bbf00c3bfecbc1131b6df98a7806f5bb08971966b13d6ac [2025-02-06 09:32:03,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:32:03,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:32:03,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:32:03,985 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:32:03,985 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:32:03,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-02-06 09:32:05,161 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f8227d65c/a8f75fee9a674b14a3f9904bb2e06bd7/FLAG2e84d34d8 [2025-02-06 09:32:05,498 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:32:05,499 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-02-06 09:32:05,507 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f8227d65c/a8f75fee9a674b14a3f9904bb2e06bd7/FLAG2e84d34d8 [2025-02-06 09:32:05,759 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f8227d65c/a8f75fee9a674b14a3f9904bb2e06bd7 [2025-02-06 09:32:05,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:32:05,763 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:32:05,766 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:32:05,766 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:32:05,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:32:05,770 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:32:05" (1/1) ... [2025-02-06 09:32:05,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18e5863a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:05, skipping insertion in model container [2025-02-06 09:32:05,771 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:32:05" (1/1) ... [2025-02-06 09:32:05,798 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:32:06,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:32:06,080 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:32:06,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:32:06,136 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:32:06,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:06 WrapperNode [2025-02-06 09:32:06,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:32:06,138 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:32:06,138 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:32:06,138 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:32:06,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:06" (1/1) ... [2025-02-06 09:32:06,152 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:06" (1/1) ... [2025-02-06 09:32:06,191 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 17, calls inlined = 19, statements flattened = 520 [2025-02-06 09:32:06,192 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:32:06,192 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:32:06,193 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:32:06,193 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:32:06,204 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:06" (1/1) ... [2025-02-06 09:32:06,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:06" (1/1) ... [2025-02-06 09:32:06,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:06" (1/1) ... [2025-02-06 09:32:06,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:06" (1/1) ... [2025-02-06 09:32:06,225 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:06" (1/1) ... [2025-02-06 09:32:06,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:06" (1/1) ... [2025-02-06 09:32:06,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:06" (1/1) ... [2025-02-06 09:32:06,231 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:06" (1/1) ... [2025-02-06 09:32:06,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:32:06,234 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:32:06,234 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:32:06,234 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:32:06,235 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:06" (1/1) ... [2025-02-06 09:32:06,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:32:06,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:32:06,273 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:32:06,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:32:06,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:32:06,299 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 09:32:06,299 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 09:32:06,299 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 09:32:06,299 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 09:32:06,300 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 09:32:06,300 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 09:32:06,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:32:06,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:32:06,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 09:32:06,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 09:32:06,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:32:06,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:32:06,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:32:06,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:32:06,302 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:32:06,380 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:32:06,381 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:32:06,937 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:32:06,938 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:32:07,162 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:32:07,162 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:32:07,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:32:07 BoogieIcfgContainer [2025-02-06 09:32:07,162 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:32:07,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:32:07,164 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:32:07,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:32:07,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:32:05" (1/3) ... [2025-02-06 09:32:07,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3970a1bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:32:07, skipping insertion in model container [2025-02-06 09:32:07,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:06" (2/3) ... [2025-02-06 09:32:07,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3970a1bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:32:07, skipping insertion in model container [2025-02-06 09:32:07,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:32:07" (3/3) ... [2025-02-06 09:32:07,169 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-3-nl.wvr.c [2025-02-06 09:32:07,180 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:32:07,181 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-queue-add-3-nl.wvr.c that has 4 procedures, 430 locations, 1 initial locations, 5 loop locations, and 86 error locations. [2025-02-06 09:32:07,181 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:32:07,331 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 09:32:07,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 439 places, 445 transitions, 911 flow [2025-02-06 09:32:07,551 INFO L124 PetriNetUnfolderBase]: 16/442 cut-off events. [2025-02-06 09:32:07,555 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 09:32:07,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 442 events. 16/442 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 851 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 350. Up to 2 conditions per place. [2025-02-06 09:32:07,569 INFO L82 GeneralOperation]: Start removeDead. Operand has 439 places, 445 transitions, 911 flow [2025-02-06 09:32:07,584 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 417 places, 421 transitions, 860 flow [2025-02-06 09:32:07,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:32:07,618 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;@13398213, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:32:07,621 INFO L334 AbstractCegarLoop]: Starting to check reachability of 152 error locations. [2025-02-06 09:32:07,627 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:32:07,629 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-02-06 09:32:07,629 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:32:07,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:07,630 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] [2025-02-06 09:32:07,630 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:07,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:07,638 INFO L85 PathProgramCache]: Analyzing trace with hash 271349584, now seen corresponding path program 1 times [2025-02-06 09:32:07,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:07,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129546090] [2025-02-06 09:32:07,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:07,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:07,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 09:32:07,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 09:32:07,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:07,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:07,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:07,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:07,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129546090] [2025-02-06 09:32:07,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129546090] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:07,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:07,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:07,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848589975] [2025-02-06 09:32:07,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:07,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:07,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:07,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:07,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:07,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 445 [2025-02-06 09:32:07,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 421 transitions, 860 flow. Second operand has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:07,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:07,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 445 [2025-02-06 09:32:07,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:08,267 INFO L124 PetriNetUnfolderBase]: 195/1505 cut-off events. [2025-02-06 09:32:08,267 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-02-06 09:32:08,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1864 conditions, 1505 events. 195/1505 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 9919 event pairs, 128 based on Foata normal form. 93/1323 useless extension candidates. Maximal degree in co-relation 1493. Up to 285 conditions per place. [2025-02-06 09:32:08,280 INFO L140 encePairwiseOnDemand]: 390/445 looper letters, 18 selfloop transitions, 2 changer transitions 5/368 dead transitions. [2025-02-06 09:32:08,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 368 transitions, 794 flow [2025-02-06 09:32:08,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:08,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1180 transitions. [2025-02-06 09:32:08,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8838951310861424 [2025-02-06 09:32:08,292 INFO L175 Difference]: Start difference. First operand has 417 places, 421 transitions, 860 flow. Second operand 3 states and 1180 transitions. [2025-02-06 09:32:08,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 368 transitions, 794 flow [2025-02-06 09:32:08,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 368 transitions, 782 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 09:32:08,301 INFO L231 Difference]: Finished difference. Result has 368 places, 363 transitions, 736 flow [2025-02-06 09:32:08,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=736, PETRI_PLACES=368, PETRI_TRANSITIONS=363} [2025-02-06 09:32:08,305 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -49 predicate places. [2025-02-06 09:32:08,305 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 363 transitions, 736 flow [2025-02-06 09:32:08,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:08,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:08,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] [2025-02-06 09:32:08,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:32:08,307 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:08,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:08,307 INFO L85 PathProgramCache]: Analyzing trace with hash 563931854, now seen corresponding path program 1 times [2025-02-06 09:32:08,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:08,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668335490] [2025-02-06 09:32:08,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:08,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:08,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 09:32:08,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 09:32:08,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:08,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:08,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:08,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668335490] [2025-02-06 09:32:08,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668335490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:08,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:08,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:08,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217851106] [2025-02-06 09:32:08,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:08,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:08,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:08,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:08,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:08,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 445 [2025-02-06 09:32:08,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 363 transitions, 736 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:08,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:08,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 445 [2025-02-06 09:32:08,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:08,571 INFO L124 PetriNetUnfolderBase]: 86/1145 cut-off events. [2025-02-06 09:32:08,571 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2025-02-06 09:32:08,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1299 conditions, 1145 events. 86/1145 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6250 event pairs, 51 based on Foata normal form. 0/929 useless extension candidates. Maximal degree in co-relation 1260. Up to 131 conditions per place. [2025-02-06 09:32:08,580 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 17 selfloop transitions, 2 changer transitions 0/362 dead transitions. [2025-02-06 09:32:08,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 362 transitions, 772 flow [2025-02-06 09:32:08,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:08,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2025-02-06 09:32:08,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.846441947565543 [2025-02-06 09:32:08,582 INFO L175 Difference]: Start difference. First operand has 368 places, 363 transitions, 736 flow. Second operand 3 states and 1130 transitions. [2025-02-06 09:32:08,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 362 transitions, 772 flow [2025-02-06 09:32:08,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 362 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:08,588 INFO L231 Difference]: Finished difference. Result has 362 places, 362 transitions, 734 flow [2025-02-06 09:32:08,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=362, PETRI_TRANSITIONS=362} [2025-02-06 09:32:08,589 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -55 predicate places. [2025-02-06 09:32:08,589 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 362 transitions, 734 flow [2025-02-06 09:32:08,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:08,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:08,590 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-02-06 09:32:08,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:32:08,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:08,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:08,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1658965128, now seen corresponding path program 1 times [2025-02-06 09:32:08,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:08,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782681693] [2025-02-06 09:32:08,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:08,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:08,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 09:32:08,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 09:32:08,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:08,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:08,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:08,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:08,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782681693] [2025-02-06 09:32:08,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782681693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:08,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:08,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:08,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577241716] [2025-02-06 09:32:08,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:08,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:08,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:08,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:08,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:08,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 445 [2025-02-06 09:32:08,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 362 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:08,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:08,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 445 [2025-02-06 09:32:08,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:08,774 INFO L124 PetriNetUnfolderBase]: 76/929 cut-off events. [2025-02-06 09:32:08,774 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-02-06 09:32:08,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1057 conditions, 929 events. 76/929 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4628 event pairs, 38 based on Foata normal form. 0/765 useless extension candidates. Maximal degree in co-relation 1010. Up to 109 conditions per place. [2025-02-06 09:32:08,782 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 15 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2025-02-06 09:32:08,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 361 transitions, 766 flow [2025-02-06 09:32:08,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:08,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1134 transitions. [2025-02-06 09:32:08,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.849438202247191 [2025-02-06 09:32:08,786 INFO L175 Difference]: Start difference. First operand has 362 places, 362 transitions, 734 flow. Second operand 3 states and 1134 transitions. [2025-02-06 09:32:08,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 361 transitions, 766 flow [2025-02-06 09:32:08,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 361 transitions, 762 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:08,791 INFO L231 Difference]: Finished difference. Result has 361 places, 361 transitions, 732 flow [2025-02-06 09:32:08,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=361, PETRI_TRANSITIONS=361} [2025-02-06 09:32:08,792 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -56 predicate places. [2025-02-06 09:32:08,792 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 361 transitions, 732 flow [2025-02-06 09:32:08,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:08,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:08,793 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] [2025-02-06 09:32:08,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:32:08,793 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:08,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:08,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1925389009, now seen corresponding path program 1 times [2025-02-06 09:32:08,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:08,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914890524] [2025-02-06 09:32:08,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:08,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:08,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 09:32:08,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:32:08,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:08,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:08,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:08,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:08,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914890524] [2025-02-06 09:32:08,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914890524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:08,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:08,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:08,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309690603] [2025-02-06 09:32:08,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:08,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:08,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:08,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:08,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:08,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 445 [2025-02-06 09:32:08,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 361 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:08,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:08,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 445 [2025-02-06 09:32:08,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:08,992 INFO L124 PetriNetUnfolderBase]: 76/928 cut-off events. [2025-02-06 09:32:08,993 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-02-06 09:32:08,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 928 events. 76/928 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4614 event pairs, 38 based on Foata normal form. 0/765 useless extension candidates. Maximal degree in co-relation 1001. Up to 109 conditions per place. [2025-02-06 09:32:09,001 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 15 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2025-02-06 09:32:09,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 360 transitions, 764 flow [2025-02-06 09:32:09,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:09,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1134 transitions. [2025-02-06 09:32:09,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.849438202247191 [2025-02-06 09:32:09,003 INFO L175 Difference]: Start difference. First operand has 361 places, 361 transitions, 732 flow. Second operand 3 states and 1134 transitions. [2025-02-06 09:32:09,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 360 transitions, 764 flow [2025-02-06 09:32:09,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 360 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:09,008 INFO L231 Difference]: Finished difference. Result has 360 places, 360 transitions, 730 flow [2025-02-06 09:32:09,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=360, PETRI_TRANSITIONS=360} [2025-02-06 09:32:09,010 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -57 predicate places. [2025-02-06 09:32:09,010 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 360 transitions, 730 flow [2025-02-06 09:32:09,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:09,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:09,011 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] [2025-02-06 09:32:09,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:32:09,011 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:09,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:09,012 INFO L85 PathProgramCache]: Analyzing trace with hash 729507122, now seen corresponding path program 1 times [2025-02-06 09:32:09,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:09,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913514697] [2025-02-06 09:32:09,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:09,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:09,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 09:32:09,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 09:32:09,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:09,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:09,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:09,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:09,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913514697] [2025-02-06 09:32:09,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913514697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:09,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:09,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:09,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194395005] [2025-02-06 09:32:09,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:09,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:09,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:09,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:09,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:09,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 445 [2025-02-06 09:32:09,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 360 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:09,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:09,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 445 [2025-02-06 09:32:09,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:09,181 INFO L124 PetriNetUnfolderBase]: 76/927 cut-off events. [2025-02-06 09:32:09,181 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-02-06 09:32:09,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 927 events. 76/927 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4626 event pairs, 38 based on Foata normal form. 0/765 useless extension candidates. Maximal degree in co-relation 992. Up to 109 conditions per place. [2025-02-06 09:32:09,188 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 15 selfloop transitions, 2 changer transitions 0/359 dead transitions. [2025-02-06 09:32:09,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 359 transitions, 762 flow [2025-02-06 09:32:09,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:09,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:09,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1134 transitions. [2025-02-06 09:32:09,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.849438202247191 [2025-02-06 09:32:09,190 INFO L175 Difference]: Start difference. First operand has 360 places, 360 transitions, 730 flow. Second operand 3 states and 1134 transitions. [2025-02-06 09:32:09,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 359 transitions, 762 flow [2025-02-06 09:32:09,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 359 transitions, 758 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:09,195 INFO L231 Difference]: Finished difference. Result has 359 places, 359 transitions, 728 flow [2025-02-06 09:32:09,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=728, PETRI_PLACES=359, PETRI_TRANSITIONS=359} [2025-02-06 09:32:09,196 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -58 predicate places. [2025-02-06 09:32:09,196 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 359 transitions, 728 flow [2025-02-06 09:32:09,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:09,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:09,198 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:32:09,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:32:09,198 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:09,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:09,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1976835414, now seen corresponding path program 1 times [2025-02-06 09:32:09,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:09,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515696761] [2025-02-06 09:32:09,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:09,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:09,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 09:32:09,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 09:32:09,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:09,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:09,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:09,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:09,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515696761] [2025-02-06 09:32:09,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515696761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:09,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:09,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:09,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858009834] [2025-02-06 09:32:09,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:09,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:09,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:09,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:09,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:09,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 445 [2025-02-06 09:32:09,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 359 transitions, 728 flow. Second operand has 3 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:09,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:09,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 445 [2025-02-06 09:32:09,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:09,342 INFO L124 PetriNetUnfolderBase]: 73/827 cut-off events. [2025-02-06 09:32:09,342 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-06 09:32:09,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 954 conditions, 827 events. 73/827 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3632 event pairs, 7 based on Foata normal form. 0/692 useless extension candidates. Maximal degree in co-relation 883. Up to 81 conditions per place. [2025-02-06 09:32:09,348 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 18 selfloop transitions, 2 changer transitions 0/364 dead transitions. [2025-02-06 09:32:09,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 364 transitions, 780 flow [2025-02-06 09:32:09,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:09,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1149 transitions. [2025-02-06 09:32:09,351 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8606741573033708 [2025-02-06 09:32:09,351 INFO L175 Difference]: Start difference. First operand has 359 places, 359 transitions, 728 flow. Second operand 3 states and 1149 transitions. [2025-02-06 09:32:09,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 364 transitions, 780 flow [2025-02-06 09:32:09,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 364 transitions, 776 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:09,355 INFO L231 Difference]: Finished difference. Result has 359 places, 359 transitions, 732 flow [2025-02-06 09:32:09,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=359, PETRI_TRANSITIONS=359} [2025-02-06 09:32:09,356 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -58 predicate places. [2025-02-06 09:32:09,356 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 359 transitions, 732 flow [2025-02-06 09:32:09,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:09,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:09,357 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:32:09,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:32:09,357 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:09,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:09,358 INFO L85 PathProgramCache]: Analyzing trace with hash -117949937, now seen corresponding path program 1 times [2025-02-06 09:32:09,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:09,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521330781] [2025-02-06 09:32:09,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:09,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:09,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 09:32:09,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 09:32:09,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:09,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:09,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:09,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:09,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521330781] [2025-02-06 09:32:09,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521330781] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:09,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:09,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:09,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983471581] [2025-02-06 09:32:09,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:09,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:09,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:09,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:09,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:09,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 445 [2025-02-06 09:32:09,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 359 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:09,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:09,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 445 [2025-02-06 09:32:09,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:09,513 INFO L124 PetriNetUnfolderBase]: 76/929 cut-off events. [2025-02-06 09:32:09,513 INFO L125 PetriNetUnfolderBase]: For 31/32 co-relation queries the response was YES. [2025-02-06 09:32:09,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1091 conditions, 929 events. 76/929 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4669 event pairs, 38 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 410. Up to 110 conditions per place. [2025-02-06 09:32:09,520 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 15 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2025-02-06 09:32:09,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 358 transitions, 764 flow [2025-02-06 09:32:09,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:09,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:09,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2025-02-06 09:32:09,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.850936329588015 [2025-02-06 09:32:09,523 INFO L175 Difference]: Start difference. First operand has 359 places, 359 transitions, 732 flow. Second operand 3 states and 1136 transitions. [2025-02-06 09:32:09,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 358 transitions, 764 flow [2025-02-06 09:32:09,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 358 transitions, 762 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:32:09,527 INFO L231 Difference]: Finished difference. Result has 359 places, 358 transitions, 732 flow [2025-02-06 09:32:09,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=359, PETRI_TRANSITIONS=358} [2025-02-06 09:32:09,528 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -58 predicate places. [2025-02-06 09:32:09,528 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 358 transitions, 732 flow [2025-02-06 09:32:09,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:09,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:09,528 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:32:09,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:32:09,529 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:09,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:09,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1383897224, now seen corresponding path program 1 times [2025-02-06 09:32:09,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:09,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061107862] [2025-02-06 09:32:09,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:09,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:09,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-06 09:32:09,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-06 09:32:09,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:09,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:09,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:09,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061107862] [2025-02-06 09:32:09,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061107862] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:09,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:09,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:09,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188132828] [2025-02-06 09:32:09,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:09,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:09,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:09,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:09,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:09,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 445 [2025-02-06 09:32:09,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 358 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:09,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:09,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 445 [2025-02-06 09:32:09,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:09,667 INFO L124 PetriNetUnfolderBase]: 76/928 cut-off events. [2025-02-06 09:32:09,668 INFO L125 PetriNetUnfolderBase]: For 30/31 co-relation queries the response was YES. [2025-02-06 09:32:09,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1082 conditions, 928 events. 76/928 cut-off events. For 30/31 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4704 event pairs, 38 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 1002. Up to 111 conditions per place. [2025-02-06 09:32:09,674 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 16 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2025-02-06 09:32:09,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 357 transitions, 766 flow [2025-02-06 09:32:09,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:09,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:09,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1134 transitions. [2025-02-06 09:32:09,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.849438202247191 [2025-02-06 09:32:09,679 INFO L175 Difference]: Start difference. First operand has 359 places, 358 transitions, 732 flow. Second operand 3 states and 1134 transitions. [2025-02-06 09:32:09,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 357 transitions, 766 flow [2025-02-06 09:32:09,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 357 transitions, 762 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:09,683 INFO L231 Difference]: Finished difference. Result has 358 places, 357 transitions, 730 flow [2025-02-06 09:32:09,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=358, PETRI_TRANSITIONS=357} [2025-02-06 09:32:09,684 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -59 predicate places. [2025-02-06 09:32:09,685 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 357 transitions, 730 flow [2025-02-06 09:32:09,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:09,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:09,685 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] [2025-02-06 09:32:09,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:32:09,686 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:09,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:09,686 INFO L85 PathProgramCache]: Analyzing trace with hash -394337692, now seen corresponding path program 1 times [2025-02-06 09:32:09,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:09,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147768486] [2025-02-06 09:32:09,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:09,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:09,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 09:32:09,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 09:32:09,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:09,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:09,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:09,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147768486] [2025-02-06 09:32:09,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147768486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:09,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:09,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:09,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098590429] [2025-02-06 09:32:09,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:09,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:09,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:09,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:09,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:09,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 445 [2025-02-06 09:32:09,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 357 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:09,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:09,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 445 [2025-02-06 09:32:09,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:09,830 INFO L124 PetriNetUnfolderBase]: 84/1028 cut-off events. [2025-02-06 09:32:09,830 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-02-06 09:32:09,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 1028 events. 84/1028 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5295 event pairs, 20 based on Foata normal form. 0/853 useless extension candidates. Maximal degree in co-relation 1104. Up to 66 conditions per place. [2025-02-06 09:32:09,840 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 21 selfloop transitions, 2 changer transitions 0/364 dead transitions. [2025-02-06 09:32:09,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 364 transitions, 796 flow [2025-02-06 09:32:09,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:09,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:09,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1150 transitions. [2025-02-06 09:32:09,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8614232209737828 [2025-02-06 09:32:09,842 INFO L175 Difference]: Start difference. First operand has 358 places, 357 transitions, 730 flow. Second operand 3 states and 1150 transitions. [2025-02-06 09:32:09,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 364 transitions, 796 flow [2025-02-06 09:32:09,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 364 transitions, 792 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:09,846 INFO L231 Difference]: Finished difference. Result has 358 places, 357 transitions, 734 flow [2025-02-06 09:32:09,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=358, PETRI_TRANSITIONS=357} [2025-02-06 09:32:09,848 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -59 predicate places. [2025-02-06 09:32:09,848 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 357 transitions, 734 flow [2025-02-06 09:32:09,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:09,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:09,848 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] [2025-02-06 09:32:09,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:32:09,849 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:09,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:09,851 INFO L85 PathProgramCache]: Analyzing trace with hash -241917127, now seen corresponding path program 1 times [2025-02-06 09:32:09,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:09,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843029857] [2025-02-06 09:32:09,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:09,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:09,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 09:32:09,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 09:32:09,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:09,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:09,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:09,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843029857] [2025-02-06 09:32:09,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843029857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:09,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:09,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:09,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256607323] [2025-02-06 09:32:09,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:09,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:09,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:09,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:09,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:09,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 445 [2025-02-06 09:32:09,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 357 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:09,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:09,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 445 [2025-02-06 09:32:09,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:10,012 INFO L124 PetriNetUnfolderBase]: 84/944 cut-off events. [2025-02-06 09:32:10,012 INFO L125 PetriNetUnfolderBase]: For 57/58 co-relation queries the response was YES. [2025-02-06 09:32:10,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 944 events. 84/944 cut-off events. For 57/58 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4760 event pairs, 38 based on Foata normal form. 0/780 useless extension candidates. Maximal degree in co-relation 651. Up to 123 conditions per place. [2025-02-06 09:32:10,019 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 16 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2025-02-06 09:32:10,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 356 transitions, 768 flow [2025-02-06 09:32:10,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:10,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:10,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2025-02-06 09:32:10,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.850936329588015 [2025-02-06 09:32:10,021 INFO L175 Difference]: Start difference. First operand has 358 places, 357 transitions, 734 flow. Second operand 3 states and 1136 transitions. [2025-02-06 09:32:10,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 356 transitions, 768 flow [2025-02-06 09:32:10,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 356 transitions, 766 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:32:10,026 INFO L231 Difference]: Finished difference. Result has 358 places, 356 transitions, 734 flow [2025-02-06 09:32:10,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=358, PETRI_TRANSITIONS=356} [2025-02-06 09:32:10,027 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -59 predicate places. [2025-02-06 09:32:10,028 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 356 transitions, 734 flow [2025-02-06 09:32:10,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:10,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:10,028 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-02-06 09:32:10,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:32:10,029 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:10,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:10,029 INFO L85 PathProgramCache]: Analyzing trace with hash 3195393, now seen corresponding path program 1 times [2025-02-06 09:32:10,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:10,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505515258] [2025-02-06 09:32:10,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:10,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:10,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 09:32:10,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 09:32:10,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:10,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:10,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:10,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505515258] [2025-02-06 09:32:10,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505515258] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:10,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:10,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:10,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744670174] [2025-02-06 09:32:10,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:10,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:10,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:10,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:10,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:10,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 445 [2025-02-06 09:32:10,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 356 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:10,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:10,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 445 [2025-02-06 09:32:10,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:10,217 INFO L124 PetriNetUnfolderBase]: 84/943 cut-off events. [2025-02-06 09:32:10,220 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2025-02-06 09:32:10,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 943 events. 84/943 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4752 event pairs, 38 based on Foata normal form. 0/780 useless extension candidates. Maximal degree in co-relation 1038. Up to 121 conditions per place. [2025-02-06 09:32:10,226 INFO L140 encePairwiseOnDemand]: 443/445 looper letters, 15 selfloop transitions, 1 changer transitions 0/355 dead transitions. [2025-02-06 09:32:10,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 355 transitions, 764 flow [2025-02-06 09:32:10,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:10,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:10,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1143 transitions. [2025-02-06 09:32:10,228 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8561797752808988 [2025-02-06 09:32:10,228 INFO L175 Difference]: Start difference. First operand has 358 places, 356 transitions, 734 flow. Second operand 3 states and 1143 transitions. [2025-02-06 09:32:10,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 355 transitions, 764 flow [2025-02-06 09:32:10,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 355 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:10,232 INFO L231 Difference]: Finished difference. Result has 357 places, 355 transitions, 730 flow [2025-02-06 09:32:10,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=357, PETRI_TRANSITIONS=355} [2025-02-06 09:32:10,233 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -60 predicate places. [2025-02-06 09:32:10,233 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 355 transitions, 730 flow [2025-02-06 09:32:10,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:10,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:10,234 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] [2025-02-06 09:32:10,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:32:10,234 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:10,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:10,235 INFO L85 PathProgramCache]: Analyzing trace with hash 862089001, now seen corresponding path program 1 times [2025-02-06 09:32:10,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:10,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541039403] [2025-02-06 09:32:10,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:10,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:10,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 09:32:10,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 09:32:10,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:10,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:10,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:10,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541039403] [2025-02-06 09:32:10,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541039403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:10,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:10,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:10,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931048373] [2025-02-06 09:32:10,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:10,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:10,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:10,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:10,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:10,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 445 [2025-02-06 09:32:10,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 355 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:10,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:10,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 445 [2025-02-06 09:32:10,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:10,416 INFO L124 PetriNetUnfolderBase]: 84/942 cut-off events. [2025-02-06 09:32:10,417 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2025-02-06 09:32:10,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 942 events. 84/942 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4766 event pairs, 38 based on Foata normal form. 0/780 useless extension candidates. Maximal degree in co-relation 1038. Up to 123 conditions per place. [2025-02-06 09:32:10,422 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 16 selfloop transitions, 2 changer transitions 0/354 dead transitions. [2025-02-06 09:32:10,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 354 transitions, 764 flow [2025-02-06 09:32:10,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:10,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:10,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2025-02-06 09:32:10,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.850936329588015 [2025-02-06 09:32:10,425 INFO L175 Difference]: Start difference. First operand has 357 places, 355 transitions, 730 flow. Second operand 3 states and 1136 transitions. [2025-02-06 09:32:10,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 354 transitions, 764 flow [2025-02-06 09:32:10,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 354 transitions, 763 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:32:10,428 INFO L231 Difference]: Finished difference. Result has 357 places, 354 transitions, 731 flow [2025-02-06 09:32:10,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=731, PETRI_PLACES=357, PETRI_TRANSITIONS=354} [2025-02-06 09:32:10,430 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -60 predicate places. [2025-02-06 09:32:10,431 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 354 transitions, 731 flow [2025-02-06 09:32:10,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:10,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:10,431 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] [2025-02-06 09:32:10,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:32:10,432 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:10,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:10,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1765430545, now seen corresponding path program 1 times [2025-02-06 09:32:10,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:10,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382765060] [2025-02-06 09:32:10,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:10,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:10,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 09:32:10,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 09:32:10,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:10,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:11,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:11,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:11,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382765060] [2025-02-06 09:32:11,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382765060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:11,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:11,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:32:11,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626183429] [2025-02-06 09:32:11,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:11,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:32:11,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:11,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:32:11,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:32:11,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 445 [2025-02-06 09:32:11,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 354 transitions, 731 flow. Second operand has 6 states, 6 states have (on average 353.5) internal successors, (2121), 6 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:11,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:11,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 445 [2025-02-06 09:32:11,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:11,412 INFO L124 PetriNetUnfolderBase]: 84/940 cut-off events. [2025-02-06 09:32:11,412 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2025-02-06 09:32:11,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1156 conditions, 940 events. 84/940 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4751 event pairs, 38 based on Foata normal form. 0/780 useless extension candidates. Maximal degree in co-relation 1060. Up to 136 conditions per place. [2025-02-06 09:32:11,419 INFO L140 encePairwiseOnDemand]: 433/445 looper letters, 29 selfloop transitions, 10 changer transitions 0/352 dead transitions. [2025-02-06 09:32:11,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 352 transitions, 805 flow [2025-02-06 09:32:11,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:32:11,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:32:11,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2151 transitions. [2025-02-06 09:32:11,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8056179775280898 [2025-02-06 09:32:11,423 INFO L175 Difference]: Start difference. First operand has 357 places, 354 transitions, 731 flow. Second operand 6 states and 2151 transitions. [2025-02-06 09:32:11,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 352 transitions, 805 flow [2025-02-06 09:32:11,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 352 transitions, 801 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:11,428 INFO L231 Difference]: Finished difference. Result has 358 places, 352 transitions, 743 flow [2025-02-06 09:32:11,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=743, PETRI_PLACES=358, PETRI_TRANSITIONS=352} [2025-02-06 09:32:11,429 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -59 predicate places. [2025-02-06 09:32:11,429 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 352 transitions, 743 flow [2025-02-06 09:32:11,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 353.5) internal successors, (2121), 6 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:11,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:11,430 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] [2025-02-06 09:32:11,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:32:11,430 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:11,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:11,431 INFO L85 PathProgramCache]: Analyzing trace with hash -751607571, now seen corresponding path program 1 times [2025-02-06 09:32:11,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:11,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465184654] [2025-02-06 09:32:11,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:11,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:11,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 09:32:11,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 09:32:11,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:11,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:11,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:11,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:11,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465184654] [2025-02-06 09:32:11,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465184654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:11,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:11,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:11,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594221818] [2025-02-06 09:32:11,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:11,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:11,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:11,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:11,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:11,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 445 [2025-02-06 09:32:11,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 352 transitions, 743 flow. Second operand has 3 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:11,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:11,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 445 [2025-02-06 09:32:11,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:11,580 INFO L124 PetriNetUnfolderBase]: 84/939 cut-off events. [2025-02-06 09:32:11,580 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2025-02-06 09:32:11,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1140 conditions, 939 events. 84/939 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4742 event pairs, 38 based on Foata normal form. 0/780 useless extension candidates. Maximal degree in co-relation 1105. Up to 121 conditions per place. [2025-02-06 09:32:11,587 INFO L140 encePairwiseOnDemand]: 443/445 looper letters, 15 selfloop transitions, 1 changer transitions 0/351 dead transitions. [2025-02-06 09:32:11,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 351 transitions, 773 flow [2025-02-06 09:32:11,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:11,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:11,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1143 transitions. [2025-02-06 09:32:11,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8561797752808988 [2025-02-06 09:32:11,590 INFO L175 Difference]: Start difference. First operand has 358 places, 352 transitions, 743 flow. Second operand 3 states and 1143 transitions. [2025-02-06 09:32:11,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 351 transitions, 773 flow [2025-02-06 09:32:11,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 351 transitions, 753 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:32:11,595 INFO L231 Difference]: Finished difference. Result has 354 places, 351 transitions, 723 flow [2025-02-06 09:32:11,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=723, PETRI_PLACES=354, PETRI_TRANSITIONS=351} [2025-02-06 09:32:11,596 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -63 predicate places. [2025-02-06 09:32:11,597 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 351 transitions, 723 flow [2025-02-06 09:32:11,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:11,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:11,597 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:32:11,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:32:11,598 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:11,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:11,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1974108052, now seen corresponding path program 1 times [2025-02-06 09:32:11,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:11,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535765650] [2025-02-06 09:32:11,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:11,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:11,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 09:32:11,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 09:32:11,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:11,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:11,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:11,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:11,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535765650] [2025-02-06 09:32:11,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535765650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:11,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:11,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:11,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323010199] [2025-02-06 09:32:11,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:11,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:11,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:11,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:11,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:11,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 445 [2025-02-06 09:32:11,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 351 transitions, 723 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:11,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:11,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 445 [2025-02-06 09:32:11,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:11,771 INFO L124 PetriNetUnfolderBase]: 84/938 cut-off events. [2025-02-06 09:32:11,771 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2025-02-06 09:32:11,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1132 conditions, 938 events. 84/938 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4725 event pairs, 38 based on Foata normal form. 0/780 useless extension candidates. Maximal degree in co-relation 1035. Up to 123 conditions per place. [2025-02-06 09:32:11,777 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 16 selfloop transitions, 2 changer transitions 0/350 dead transitions. [2025-02-06 09:32:11,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 350 transitions, 757 flow [2025-02-06 09:32:11,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:11,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:11,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2025-02-06 09:32:11,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.850936329588015 [2025-02-06 09:32:11,780 INFO L175 Difference]: Start difference. First operand has 354 places, 351 transitions, 723 flow. Second operand 3 states and 1136 transitions. [2025-02-06 09:32:11,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 350 transitions, 757 flow [2025-02-06 09:32:11,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 350 transitions, 756 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:32:11,785 INFO L231 Difference]: Finished difference. Result has 354 places, 350 transitions, 724 flow [2025-02-06 09:32:11,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=724, PETRI_PLACES=354, PETRI_TRANSITIONS=350} [2025-02-06 09:32:11,786 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -63 predicate places. [2025-02-06 09:32:11,786 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 350 transitions, 724 flow [2025-02-06 09:32:11,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:11,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:11,787 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] [2025-02-06 09:32:11,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:32:11,787 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:11,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:11,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1728139268, now seen corresponding path program 1 times [2025-02-06 09:32:11,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:11,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141031896] [2025-02-06 09:32:11,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:11,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:11,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 09:32:11,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 09:32:11,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:11,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:11,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:11,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141031896] [2025-02-06 09:32:11,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141031896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:11,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:11,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:11,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504372505] [2025-02-06 09:32:11,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:11,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:11,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:11,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:11,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:11,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 445 [2025-02-06 09:32:11,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 350 transitions, 724 flow. Second operand has 3 states, 3 states have (on average 371.0) internal successors, (1113), 3 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:11,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:11,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 445 [2025-02-06 09:32:11,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:11,971 INFO L124 PetriNetUnfolderBase]: 113/1283 cut-off events. [2025-02-06 09:32:11,971 INFO L125 PetriNetUnfolderBase]: For 81/83 co-relation queries the response was YES. [2025-02-06 09:32:11,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 1283 events. 113/1283 cut-off events. For 81/83 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 7640 event pairs, 64 based on Foata normal form. 1/1050 useless extension candidates. Maximal degree in co-relation 1462. Up to 171 conditions per place. [2025-02-06 09:32:11,978 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 17 selfloop transitions, 1 changer transitions 2/347 dead transitions. [2025-02-06 09:32:11,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 347 transitions, 756 flow [2025-02-06 09:32:11,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:11,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2025-02-06 09:32:11,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.846441947565543 [2025-02-06 09:32:11,981 INFO L175 Difference]: Start difference. First operand has 354 places, 350 transitions, 724 flow. Second operand 3 states and 1130 transitions. [2025-02-06 09:32:11,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 347 transitions, 756 flow [2025-02-06 09:32:11,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 347 transitions, 752 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:11,985 INFO L231 Difference]: Finished difference. Result has 351 places, 345 transitions, 712 flow [2025-02-06 09:32:11,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=712, PETRI_PLACES=351, PETRI_TRANSITIONS=345} [2025-02-06 09:32:11,986 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -66 predicate places. [2025-02-06 09:32:11,986 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 345 transitions, 712 flow [2025-02-06 09:32:11,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.0) internal successors, (1113), 3 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:11,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:11,987 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:32:11,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:32:11,988 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:11,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:11,988 INFO L85 PathProgramCache]: Analyzing trace with hash -2101326091, now seen corresponding path program 1 times [2025-02-06 09:32:11,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:11,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628137587] [2025-02-06 09:32:11,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:11,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:11,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 09:32:12,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 09:32:12,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:12,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:12,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:12,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:12,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628137587] [2025-02-06 09:32:12,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628137587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:12,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:12,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:12,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351041712] [2025-02-06 09:32:12,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:12,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:12,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:12,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:12,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:12,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 445 [2025-02-06 09:32:12,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 345 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:12,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:12,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 445 [2025-02-06 09:32:12,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:12,406 INFO L124 PetriNetUnfolderBase]: 198/1700 cut-off events. [2025-02-06 09:32:12,406 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2025-02-06 09:32:12,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2164 conditions, 1700 events. 198/1700 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 12480 event pairs, 62 based on Foata normal form. 0/1394 useless extension candidates. Maximal degree in co-relation 2068. Up to 178 conditions per place. [2025-02-06 09:32:12,415 INFO L140 encePairwiseOnDemand]: 436/445 looper letters, 25 selfloop transitions, 5 changer transitions 0/348 dead transitions. [2025-02-06 09:32:12,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 348 transitions, 788 flow [2025-02-06 09:32:12,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:12,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:12,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2025-02-06 09:32:12,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8449438202247191 [2025-02-06 09:32:12,417 INFO L175 Difference]: Start difference. First operand has 351 places, 345 transitions, 712 flow. Second operand 3 states and 1128 transitions. [2025-02-06 09:32:12,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 348 transitions, 788 flow [2025-02-06 09:32:12,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 348 transitions, 787 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:32:12,421 INFO L231 Difference]: Finished difference. Result has 346 places, 341 transitions, 713 flow [2025-02-06 09:32:12,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=713, PETRI_PLACES=346, PETRI_TRANSITIONS=341} [2025-02-06 09:32:12,422 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -71 predicate places. [2025-02-06 09:32:12,422 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 341 transitions, 713 flow [2025-02-06 09:32:12,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:12,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:12,423 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-02-06 09:32:12,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:32:12,423 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:12,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:12,423 INFO L85 PathProgramCache]: Analyzing trace with hash -739698056, now seen corresponding path program 1 times [2025-02-06 09:32:12,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:12,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171790709] [2025-02-06 09:32:12,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:12,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:12,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-06 09:32:12,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-06 09:32:12,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:12,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:12,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:12,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:12,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171790709] [2025-02-06 09:32:12,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171790709] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:12,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:12,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:12,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546826758] [2025-02-06 09:32:12,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:12,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:12,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:12,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:12,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:12,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 445 [2025-02-06 09:32:12,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 341 transitions, 713 flow. Second operand has 3 states, 3 states have (on average 368.6666666666667) internal successors, (1106), 3 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:12,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:12,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 445 [2025-02-06 09:32:12,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:12,756 INFO L124 PetriNetUnfolderBase]: 490/2366 cut-off events. [2025-02-06 09:32:12,756 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2025-02-06 09:32:12,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3385 conditions, 2366 events. 490/2366 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 18069 event pairs, 104 based on Foata normal form. 0/2064 useless extension candidates. Maximal degree in co-relation 3288. Up to 661 conditions per place. [2025-02-06 09:32:12,771 INFO L140 encePairwiseOnDemand]: 437/445 looper letters, 29 selfloop transitions, 4 changer transitions 0/348 dead transitions. [2025-02-06 09:32:12,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 348 transitions, 799 flow [2025-02-06 09:32:12,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:12,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:12,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2025-02-06 09:32:12,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.850936329588015 [2025-02-06 09:32:12,774 INFO L175 Difference]: Start difference. First operand has 346 places, 341 transitions, 713 flow. Second operand 3 states and 1136 transitions. [2025-02-06 09:32:12,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 348 transitions, 799 flow [2025-02-06 09:32:12,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 348 transitions, 789 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:12,779 INFO L231 Difference]: Finished difference. Result has 343 places, 341 transitions, 723 flow [2025-02-06 09:32:12,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=723, PETRI_PLACES=343, PETRI_TRANSITIONS=341} [2025-02-06 09:32:12,780 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -74 predicate places. [2025-02-06 09:32:12,780 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 341 transitions, 723 flow [2025-02-06 09:32:12,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.6666666666667) internal successors, (1106), 3 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:12,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:12,780 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:32:12,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 09:32:12,781 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:12,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:12,781 INFO L85 PathProgramCache]: Analyzing trace with hash -840202374, now seen corresponding path program 1 times [2025-02-06 09:32:12,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:12,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247200340] [2025-02-06 09:32:12,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:12,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:12,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-06 09:32:12,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-06 09:32:12,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:12,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:12,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:12,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:12,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247200340] [2025-02-06 09:32:12,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247200340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:12,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:12,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:12,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166750169] [2025-02-06 09:32:12,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:12,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:12,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:12,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:12,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:12,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 445 [2025-02-06 09:32:12,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 341 transitions, 723 flow. Second operand has 3 states, 3 states have (on average 374.6666666666667) internal successors, (1124), 3 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:12,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:12,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 445 [2025-02-06 09:32:12,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:13,145 INFO L124 PetriNetUnfolderBase]: 481/2404 cut-off events. [2025-02-06 09:32:13,146 INFO L125 PetriNetUnfolderBase]: For 224/243 co-relation queries the response was YES. [2025-02-06 09:32:13,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3418 conditions, 2404 events. 481/2404 cut-off events. For 224/243 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 18831 event pairs, 164 based on Foata normal form. 0/2017 useless extension candidates. Maximal degree in co-relation 3322. Up to 507 conditions per place. [2025-02-06 09:32:13,159 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 23 selfloop transitions, 2 changer transitions 0/346 dead transitions. [2025-02-06 09:32:13,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 346 transitions, 789 flow [2025-02-06 09:32:13,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:13,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:13,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1142 transitions. [2025-02-06 09:32:13,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8554307116104869 [2025-02-06 09:32:13,162 INFO L175 Difference]: Start difference. First operand has 343 places, 341 transitions, 723 flow. Second operand 3 states and 1142 transitions. [2025-02-06 09:32:13,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 346 transitions, 789 flow [2025-02-06 09:32:13,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 346 transitions, 789 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:32:13,166 INFO L231 Difference]: Finished difference. Result has 344 places, 340 transitions, 725 flow [2025-02-06 09:32:13,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=725, PETRI_PLACES=344, PETRI_TRANSITIONS=340} [2025-02-06 09:32:13,167 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -73 predicate places. [2025-02-06 09:32:13,167 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 340 transitions, 725 flow [2025-02-06 09:32:13,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.6666666666667) internal successors, (1124), 3 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:13,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:13,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:32:13,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 09:32:13,168 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:13,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:13,169 INFO L85 PathProgramCache]: Analyzing trace with hash 789655933, now seen corresponding path program 1 times [2025-02-06 09:32:13,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:13,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791775058] [2025-02-06 09:32:13,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:13,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:13,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-06 09:32:13,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-06 09:32:13,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:13,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:13,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:13,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:13,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791775058] [2025-02-06 09:32:13,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791775058] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:13,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:13,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:13,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789106265] [2025-02-06 09:32:13,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:13,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:13,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:13,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:13,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:13,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 445 [2025-02-06 09:32:13,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 340 transitions, 725 flow. Second operand has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:13,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:13,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 445 [2025-02-06 09:32:13,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:13,479 INFO L124 PetriNetUnfolderBase]: 383/2460 cut-off events. [2025-02-06 09:32:13,480 INFO L125 PetriNetUnfolderBase]: For 214/217 co-relation queries the response was YES. [2025-02-06 09:32:13,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3385 conditions, 2460 events. 383/2460 cut-off events. For 214/217 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 19466 event pairs, 165 based on Foata normal form. 0/2056 useless extension candidates. Maximal degree in co-relation 3288. Up to 414 conditions per place. [2025-02-06 09:32:13,495 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 27 selfloop transitions, 2 changer transitions 0/346 dead transitions. [2025-02-06 09:32:13,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 346 transitions, 805 flow [2025-02-06 09:32:13,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:13,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:13,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2025-02-06 09:32:13,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.850936329588015 [2025-02-06 09:32:13,497 INFO L175 Difference]: Start difference. First operand has 344 places, 340 transitions, 725 flow. Second operand 3 states and 1136 transitions. [2025-02-06 09:32:13,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 346 transitions, 805 flow [2025-02-06 09:32:13,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 346 transitions, 801 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:13,501 INFO L231 Difference]: Finished difference. Result has 343 places, 339 transitions, 723 flow [2025-02-06 09:32:13,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=723, PETRI_PLACES=343, PETRI_TRANSITIONS=339} [2025-02-06 09:32:13,502 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -74 predicate places. [2025-02-06 09:32:13,502 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 339 transitions, 723 flow [2025-02-06 09:32:13,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:13,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:13,502 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] [2025-02-06 09:32:13,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 09:32:13,502 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:13,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:13,503 INFO L85 PathProgramCache]: Analyzing trace with hash 606928512, now seen corresponding path program 1 times [2025-02-06 09:32:13,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:13,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128335333] [2025-02-06 09:32:13,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:13,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:13,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-06 09:32:13,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-06 09:32:13,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:13,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:13,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:13,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:13,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128335333] [2025-02-06 09:32:13,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128335333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:13,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:13,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:13,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458230294] [2025-02-06 09:32:13,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:13,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:13,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:13,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:13,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:13,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 445 [2025-02-06 09:32:13,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 339 transitions, 723 flow. Second operand has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:13,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:13,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 445 [2025-02-06 09:32:13,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:13,843 INFO L124 PetriNetUnfolderBase]: 368/2542 cut-off events. [2025-02-06 09:32:13,843 INFO L125 PetriNetUnfolderBase]: For 219/220 co-relation queries the response was YES. [2025-02-06 09:32:13,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3459 conditions, 2542 events. 368/2542 cut-off events. For 219/220 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 20974 event pairs, 168 based on Foata normal form. 0/2137 useless extension candidates. Maximal degree in co-relation 3362. Up to 407 conditions per place. [2025-02-06 09:32:13,860 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 27 selfloop transitions, 2 changer transitions 0/345 dead transitions. [2025-02-06 09:32:13,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 345 transitions, 803 flow [2025-02-06 09:32:13,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:13,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:13,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2025-02-06 09:32:13,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.850936329588015 [2025-02-06 09:32:13,862 INFO L175 Difference]: Start difference. First operand has 343 places, 339 transitions, 723 flow. Second operand 3 states and 1136 transitions. [2025-02-06 09:32:13,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 345 transitions, 803 flow [2025-02-06 09:32:13,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 345 transitions, 799 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:13,866 INFO L231 Difference]: Finished difference. Result has 342 places, 338 transitions, 721 flow [2025-02-06 09:32:13,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=721, PETRI_PLACES=342, PETRI_TRANSITIONS=338} [2025-02-06 09:32:13,867 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -75 predicate places. [2025-02-06 09:32:13,867 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 338 transitions, 721 flow [2025-02-06 09:32:13,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:13,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:13,868 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] [2025-02-06 09:32:13,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 09:32:13,868 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:13,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:13,869 INFO L85 PathProgramCache]: Analyzing trace with hash 966344422, now seen corresponding path program 1 times [2025-02-06 09:32:13,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:13,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739356272] [2025-02-06 09:32:13,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:13,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:13,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-06 09:32:13,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-06 09:32:13,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:13,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:13,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:13,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:13,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739356272] [2025-02-06 09:32:13,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739356272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:13,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:13,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:13,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297996797] [2025-02-06 09:32:13,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:13,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:13,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:13,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:13,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:13,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 445 [2025-02-06 09:32:13,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 338 transitions, 721 flow. Second operand has 3 states, 3 states have (on average 377.3333333333333) internal successors, (1132), 3 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:13,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:13,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 445 [2025-02-06 09:32:13,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:14,158 INFO L124 PetriNetUnfolderBase]: 405/1756 cut-off events. [2025-02-06 09:32:14,158 INFO L125 PetriNetUnfolderBase]: For 217/218 co-relation queries the response was YES. [2025-02-06 09:32:14,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2630 conditions, 1756 events. 405/1756 cut-off events. For 217/218 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 11153 event pairs, 129 based on Foata normal form. 0/1520 useless extension candidates. Maximal degree in co-relation 2533. Up to 367 conditions per place. [2025-02-06 09:32:14,170 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 21 selfloop transitions, 2 changer transitions 0/343 dead transitions. [2025-02-06 09:32:14,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 343 transitions, 783 flow [2025-02-06 09:32:14,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:14,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:14,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1146 transitions. [2025-02-06 09:32:14,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8584269662921349 [2025-02-06 09:32:14,173 INFO L175 Difference]: Start difference. First operand has 342 places, 338 transitions, 721 flow. Second operand 3 states and 1146 transitions. [2025-02-06 09:32:14,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 343 transitions, 783 flow [2025-02-06 09:32:14,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 343 transitions, 779 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:14,178 INFO L231 Difference]: Finished difference. Result has 341 places, 337 transitions, 719 flow [2025-02-06 09:32:14,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=719, PETRI_PLACES=341, PETRI_TRANSITIONS=337} [2025-02-06 09:32:14,179 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -76 predicate places. [2025-02-06 09:32:14,179 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 337 transitions, 719 flow [2025-02-06 09:32:14,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 377.3333333333333) internal successors, (1132), 3 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:14,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:14,179 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] [2025-02-06 09:32:14,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 09:32:14,180 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:14,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:14,180 INFO L85 PathProgramCache]: Analyzing trace with hash 791847858, now seen corresponding path program 1 times [2025-02-06 09:32:14,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:14,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300183261] [2025-02-06 09:32:14,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:14,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:14,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-06 09:32:14,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-06 09:32:14,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:14,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:14,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:14,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:14,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300183261] [2025-02-06 09:32:14,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300183261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:14,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:14,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:14,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382334958] [2025-02-06 09:32:14,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:14,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:14,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:14,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:14,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:14,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 445 [2025-02-06 09:32:14,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 337 transitions, 719 flow. Second operand has 3 states, 3 states have (on average 374.0) internal successors, (1122), 3 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:14,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:14,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 445 [2025-02-06 09:32:14,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:14,611 INFO L124 PetriNetUnfolderBase]: 545/2341 cut-off events. [2025-02-06 09:32:14,611 INFO L125 PetriNetUnfolderBase]: For 257/292 co-relation queries the response was YES. [2025-02-06 09:32:14,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3460 conditions, 2341 events. 545/2341 cut-off events. For 257/292 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 17457 event pairs, 214 based on Foata normal form. 0/2006 useless extension candidates. Maximal degree in co-relation 3363. Up to 570 conditions per place. [2025-02-06 09:32:14,626 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 25 selfloop transitions, 2 changer transitions 0/343 dead transitions. [2025-02-06 09:32:14,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 343 transitions, 791 flow [2025-02-06 09:32:14,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:14,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:14,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1141 transitions. [2025-02-06 09:32:14,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.854681647940075 [2025-02-06 09:32:14,629 INFO L175 Difference]: Start difference. First operand has 341 places, 337 transitions, 719 flow. Second operand 3 states and 1141 transitions. [2025-02-06 09:32:14,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 343 transitions, 791 flow [2025-02-06 09:32:14,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 343 transitions, 787 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:14,633 INFO L231 Difference]: Finished difference. Result has 340 places, 336 transitions, 717 flow [2025-02-06 09:32:14,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=717, PETRI_PLACES=340, PETRI_TRANSITIONS=336} [2025-02-06 09:32:14,634 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -77 predicate places. [2025-02-06 09:32:14,634 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 336 transitions, 717 flow [2025-02-06 09:32:14,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.0) internal successors, (1122), 3 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:14,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:14,635 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] [2025-02-06 09:32:14,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 09:32:14,635 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:14,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:14,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1043685288, now seen corresponding path program 1 times [2025-02-06 09:32:14,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:14,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802498210] [2025-02-06 09:32:14,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:14,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:14,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-06 09:32:14,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-06 09:32:14,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:14,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:14,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:14,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:14,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802498210] [2025-02-06 09:32:14,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802498210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:14,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:14,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:14,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718291336] [2025-02-06 09:32:14,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:14,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:14,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:14,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:14,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:14,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 445 [2025-02-06 09:32:14,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 336 transitions, 717 flow. Second operand has 3 states, 3 states have (on average 376.0) internal successors, (1128), 3 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:14,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:14,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 445 [2025-02-06 09:32:14,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:14,888 INFO L124 PetriNetUnfolderBase]: 511/1837 cut-off events. [2025-02-06 09:32:14,889 INFO L125 PetriNetUnfolderBase]: For 267/268 co-relation queries the response was YES. [2025-02-06 09:32:14,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2907 conditions, 1837 events. 511/1837 cut-off events. For 267/268 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 11556 event pairs, 187 based on Foata normal form. 0/1607 useless extension candidates. Maximal degree in co-relation 2810. Up to 521 conditions per place. [2025-02-06 09:32:14,899 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 23 selfloop transitions, 2 changer transitions 0/341 dead transitions. [2025-02-06 09:32:14,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 341 transitions, 783 flow [2025-02-06 09:32:14,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:14,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:14,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1142 transitions. [2025-02-06 09:32:14,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8554307116104869 [2025-02-06 09:32:14,902 INFO L175 Difference]: Start difference. First operand has 340 places, 336 transitions, 717 flow. Second operand 3 states and 1142 transitions. [2025-02-06 09:32:14,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 341 transitions, 783 flow [2025-02-06 09:32:14,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 341 transitions, 779 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:14,906 INFO L231 Difference]: Finished difference. Result has 339 places, 335 transitions, 715 flow [2025-02-06 09:32:14,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=715, PETRI_PLACES=339, PETRI_TRANSITIONS=335} [2025-02-06 09:32:14,907 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -78 predicate places. [2025-02-06 09:32:14,907 INFO L471 AbstractCegarLoop]: Abstraction has has 339 places, 335 transitions, 715 flow [2025-02-06 09:32:14,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.0) internal successors, (1128), 3 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:14,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:14,907 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] [2025-02-06 09:32:14,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 09:32:14,908 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:14,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:14,908 INFO L85 PathProgramCache]: Analyzing trace with hash 750889494, now seen corresponding path program 1 times [2025-02-06 09:32:14,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:14,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727843] [2025-02-06 09:32:14,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:14,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:14,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-06 09:32:14,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-06 09:32:14,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:14,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:14,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:14,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:14,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727843] [2025-02-06 09:32:14,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:14,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:14,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:14,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760598685] [2025-02-06 09:32:14,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:14,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:14,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:14,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:14,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:14,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 445 [2025-02-06 09:32:14,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 335 transitions, 715 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:14,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:14,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 445 [2025-02-06 09:32:14,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:15,163 INFO L124 PetriNetUnfolderBase]: 416/2172 cut-off events. [2025-02-06 09:32:15,164 INFO L125 PetriNetUnfolderBase]: For 192/199 co-relation queries the response was YES. [2025-02-06 09:32:15,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3075 conditions, 2172 events. 416/2172 cut-off events. For 192/199 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 16560 event pairs, 140 based on Foata normal form. 1/1930 useless extension candidates. Maximal degree in co-relation 2978. Up to 369 conditions per place. [2025-02-06 09:32:15,173 INFO L140 encePairwiseOnDemand]: 440/445 looper letters, 22 selfloop transitions, 2 changer transitions 6/340 dead transitions. [2025-02-06 09:32:15,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 340 transitions, 781 flow [2025-02-06 09:32:15,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:15,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:15,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1140 transitions. [2025-02-06 09:32:15,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8539325842696629 [2025-02-06 09:32:15,176 INFO L175 Difference]: Start difference. First operand has 339 places, 335 transitions, 715 flow. Second operand 3 states and 1140 transitions. [2025-02-06 09:32:15,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 340 transitions, 781 flow [2025-02-06 09:32:15,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 340 transitions, 777 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:15,179 INFO L231 Difference]: Finished difference. Result has 337 places, 327 transitions, 699 flow [2025-02-06 09:32:15,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=699, PETRI_PLACES=337, PETRI_TRANSITIONS=327} [2025-02-06 09:32:15,180 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -80 predicate places. [2025-02-06 09:32:15,180 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 327 transitions, 699 flow [2025-02-06 09:32:15,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:15,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:15,180 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] [2025-02-06 09:32:15,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 09:32:15,181 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:15,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:15,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1161656541, now seen corresponding path program 1 times [2025-02-06 09:32:15,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:15,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020205645] [2025-02-06 09:32:15,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:15,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:15,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-06 09:32:15,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-06 09:32:15,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:15,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:15,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:15,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:15,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020205645] [2025-02-06 09:32:15,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020205645] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:15,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:15,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:15,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782941391] [2025-02-06 09:32:15,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:15,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:15,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:15,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:15,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:15,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 445 [2025-02-06 09:32:15,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 327 transitions, 699 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:15,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:15,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 445 [2025-02-06 09:32:15,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:15,375 INFO L124 PetriNetUnfolderBase]: 322/1598 cut-off events. [2025-02-06 09:32:15,375 INFO L125 PetriNetUnfolderBase]: For 160/164 co-relation queries the response was YES. [2025-02-06 09:32:15,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2323 conditions, 1598 events. 322/1598 cut-off events. For 160/164 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 10556 event pairs, 92 based on Foata normal form. 1/1461 useless extension candidates. Maximal degree in co-relation 2226. Up to 258 conditions per place. [2025-02-06 09:32:15,384 INFO L140 encePairwiseOnDemand]: 440/445 looper letters, 21 selfloop transitions, 3 changer transitions 0/331 dead transitions. [2025-02-06 09:32:15,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 331 transitions, 761 flow [2025-02-06 09:32:15,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:15,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:15,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1142 transitions. [2025-02-06 09:32:15,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8554307116104869 [2025-02-06 09:32:15,386 INFO L175 Difference]: Start difference. First operand has 337 places, 327 transitions, 699 flow. Second operand 3 states and 1142 transitions. [2025-02-06 09:32:15,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 331 transitions, 761 flow [2025-02-06 09:32:15,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 331 transitions, 757 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:15,390 INFO L231 Difference]: Finished difference. Result has 330 places, 325 transitions, 697 flow [2025-02-06 09:32:15,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=330, PETRI_TRANSITIONS=325} [2025-02-06 09:32:15,390 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -87 predicate places. [2025-02-06 09:32:15,390 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 325 transitions, 697 flow [2025-02-06 09:32:15,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:15,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:15,391 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] [2025-02-06 09:32:15,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 09:32:15,391 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:15,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:15,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1139428952, now seen corresponding path program 1 times [2025-02-06 09:32:15,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:15,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716913410] [2025-02-06 09:32:15,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:15,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:15,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-06 09:32:15,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-06 09:32:15,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:15,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:15,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:15,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716913410] [2025-02-06 09:32:15,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716913410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:15,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:15,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:15,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226925014] [2025-02-06 09:32:15,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:15,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:15,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:15,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:15,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:15,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 445 [2025-02-06 09:32:15,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 325 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:15,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:15,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 445 [2025-02-06 09:32:15,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:15,694 INFO L124 PetriNetUnfolderBase]: 521/2217 cut-off events. [2025-02-06 09:32:15,694 INFO L125 PetriNetUnfolderBase]: For 236/245 co-relation queries the response was YES. [2025-02-06 09:32:15,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3298 conditions, 2217 events. 521/2217 cut-off events. For 236/245 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 16696 event pairs, 204 based on Foata normal form. 0/2011 useless extension candidates. Maximal degree in co-relation 3201. Up to 527 conditions per place. [2025-02-06 09:32:15,703 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 24 selfloop transitions, 2 changer transitions 0/331 dead transitions. [2025-02-06 09:32:15,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 331 transitions, 767 flow [2025-02-06 09:32:15,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:15,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:15,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1140 transitions. [2025-02-06 09:32:15,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8539325842696629 [2025-02-06 09:32:15,705 INFO L175 Difference]: Start difference. First operand has 330 places, 325 transitions, 697 flow. Second operand 3 states and 1140 transitions. [2025-02-06 09:32:15,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 331 transitions, 767 flow [2025-02-06 09:32:15,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 331 transitions, 761 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:15,709 INFO L231 Difference]: Finished difference. Result has 329 places, 324 transitions, 693 flow [2025-02-06 09:32:15,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=329, PETRI_TRANSITIONS=324} [2025-02-06 09:32:15,709 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -88 predicate places. [2025-02-06 09:32:15,710 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 324 transitions, 693 flow [2025-02-06 09:32:15,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:15,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:15,711 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] [2025-02-06 09:32:15,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 09:32:15,711 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:15,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:15,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1602911899, now seen corresponding path program 1 times [2025-02-06 09:32:15,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:15,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124236528] [2025-02-06 09:32:15,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:15,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:15,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-06 09:32:15,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-06 09:32:15,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:15,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:15,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:15,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124236528] [2025-02-06 09:32:15,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124236528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:15,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:15,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:15,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952273431] [2025-02-06 09:32:15,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:15,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:15,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:15,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:15,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:15,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 445 [2025-02-06 09:32:15,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 324 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:15,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:15,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 445 [2025-02-06 09:32:15,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:15,939 INFO L124 PetriNetUnfolderBase]: 353/1744 cut-off events. [2025-02-06 09:32:15,939 INFO L125 PetriNetUnfolderBase]: For 169/175 co-relation queries the response was YES. [2025-02-06 09:32:15,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2508 conditions, 1744 events. 353/1744 cut-off events. For 169/175 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 11752 event pairs, 100 based on Foata normal form. 1/1625 useless extension candidates. Maximal degree in co-relation 2411. Up to 277 conditions per place. [2025-02-06 09:32:15,950 INFO L140 encePairwiseOnDemand]: 440/445 looper letters, 20 selfloop transitions, 2 changer transitions 10/329 dead transitions. [2025-02-06 09:32:15,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 329 transitions, 757 flow [2025-02-06 09:32:15,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:15,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:15,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1142 transitions. [2025-02-06 09:32:15,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8554307116104869 [2025-02-06 09:32:15,952 INFO L175 Difference]: Start difference. First operand has 329 places, 324 transitions, 693 flow. Second operand 3 states and 1142 transitions. [2025-02-06 09:32:15,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 329 transitions, 757 flow [2025-02-06 09:32:15,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 329 transitions, 753 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:15,956 INFO L231 Difference]: Finished difference. Result has 327 places, 312 transitions, 668 flow [2025-02-06 09:32:15,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=668, PETRI_PLACES=327, PETRI_TRANSITIONS=312} [2025-02-06 09:32:15,956 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -90 predicate places. [2025-02-06 09:32:15,956 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 312 transitions, 668 flow [2025-02-06 09:32:15,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:15,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:15,957 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] [2025-02-06 09:32:15,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 09:32:15,957 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:15,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:15,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1540056480, now seen corresponding path program 1 times [2025-02-06 09:32:15,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:15,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857418366] [2025-02-06 09:32:15,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:15,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:15,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-06 09:32:15,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-06 09:32:15,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:15,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:16,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:16,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:16,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857418366] [2025-02-06 09:32:16,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857418366] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:16,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:16,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:16,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619600810] [2025-02-06 09:32:16,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:16,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:16,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:16,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:16,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:16,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 445 [2025-02-06 09:32:16,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 312 transitions, 668 flow. Second operand has 3 states, 3 states have (on average 375.6666666666667) internal successors, (1127), 3 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:16,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:16,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 445 [2025-02-06 09:32:16,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:16,362 INFO L124 PetriNetUnfolderBase]: 366/1606 cut-off events. [2025-02-06 09:32:16,362 INFO L125 PetriNetUnfolderBase]: For 183/186 co-relation queries the response was YES. [2025-02-06 09:32:16,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2435 conditions, 1606 events. 366/1606 cut-off events. For 183/186 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 10317 event pairs, 139 based on Foata normal form. 0/1487 useless extension candidates. Maximal degree in co-relation 2338. Up to 386 conditions per place. [2025-02-06 09:32:16,385 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 21 selfloop transitions, 2 changer transitions 0/317 dead transitions. [2025-02-06 09:32:16,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 317 transitions, 730 flow [2025-02-06 09:32:16,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:16,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:16,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1140 transitions. [2025-02-06 09:32:16,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8539325842696629 [2025-02-06 09:32:16,392 INFO L175 Difference]: Start difference. First operand has 327 places, 312 transitions, 668 flow. Second operand 3 states and 1140 transitions. [2025-02-06 09:32:16,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 317 transitions, 730 flow [2025-02-06 09:32:16,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 317 transitions, 726 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:16,397 INFO L231 Difference]: Finished difference. Result has 316 places, 311 transitions, 666 flow [2025-02-06 09:32:16,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=666, PETRI_PLACES=316, PETRI_TRANSITIONS=311} [2025-02-06 09:32:16,398 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -101 predicate places. [2025-02-06 09:32:16,398 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 311 transitions, 666 flow [2025-02-06 09:32:16,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.6666666666667) internal successors, (1127), 3 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:16,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:16,399 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] [2025-02-06 09:32:16,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 09:32:16,399 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-02-06 09:32:16,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:16,400 INFO L85 PathProgramCache]: Analyzing trace with hash 602315486, now seen corresponding path program 1 times [2025-02-06 09:32:16,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:16,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970520883] [2025-02-06 09:32:16,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:16,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:16,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-06 09:32:16,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-06 09:32:16,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:16,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:16,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-02-06 09:32:16,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:16,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970520883] [2025-02-06 09:32:16,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970520883] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:16,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:16,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:16,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423883067] [2025-02-06 09:32:16,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:16,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:16,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:16,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:16,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:16,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 445 [2025-02-06 09:32:16,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 311 transitions, 666 flow. Second operand has 3 states, 3 states have (on average 375.6666666666667) internal successors, (1127), 3 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:16,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:16,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 445 [2025-02-06 09:32:16,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:16,662 INFO L124 PetriNetUnfolderBase]: 420/1934 cut-off events. [2025-02-06 09:32:16,662 INFO L125 PetriNetUnfolderBase]: For 203/213 co-relation queries the response was YES. [2025-02-06 09:32:16,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2856 conditions, 1934 events. 420/1934 cut-off events. For 203/213 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 13472 event pairs, 158 based on Foata normal form. 0/1807 useless extension candidates. Maximal degree in co-relation 2759. Up to 429 conditions per place. [2025-02-06 09:32:16,669 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 0 selfloop transitions, 0 changer transitions 317/317 dead transitions. [2025-02-06 09:32:16,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 317 transitions, 732 flow [2025-02-06 09:32:16,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:16,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:16,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1141 transitions. [2025-02-06 09:32:16,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.854681647940075 [2025-02-06 09:32:16,671 INFO L175 Difference]: Start difference. First operand has 316 places, 311 transitions, 666 flow. Second operand 3 states and 1141 transitions. [2025-02-06 09:32:16,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 317 transitions, 732 flow [2025-02-06 09:32:16,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 317 transitions, 728 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:16,674 INFO L231 Difference]: Finished difference. Result has 315 places, 0 transitions, 0 flow [2025-02-06 09:32:16,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=315, PETRI_TRANSITIONS=0} [2025-02-06 09:32:16,675 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -102 predicate places. [2025-02-06 09:32:16,676 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 0 transitions, 0 flow [2025-02-06 09:32:16,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.6666666666667) internal successors, (1127), 3 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:16,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (151 of 152 remaining) [2025-02-06 09:32:16,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (150 of 152 remaining) [2025-02-06 09:32:16,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (149 of 152 remaining) [2025-02-06 09:32:16,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (148 of 152 remaining) [2025-02-06 09:32:16,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (147 of 152 remaining) [2025-02-06 09:32:16,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (146 of 152 remaining) [2025-02-06 09:32:16,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (145 of 152 remaining) [2025-02-06 09:32:16,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (144 of 152 remaining) [2025-02-06 09:32:16,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (143 of 152 remaining) [2025-02-06 09:32:16,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (142 of 152 remaining) [2025-02-06 09:32:16,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (141 of 152 remaining) [2025-02-06 09:32:16,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (140 of 152 remaining) [2025-02-06 09:32:16,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (139 of 152 remaining) [2025-02-06 09:32:16,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (138 of 152 remaining) [2025-02-06 09:32:16,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (137 of 152 remaining) [2025-02-06 09:32:16,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (136 of 152 remaining) [2025-02-06 09:32:16,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (135 of 152 remaining) [2025-02-06 09:32:16,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (134 of 152 remaining) [2025-02-06 09:32:16,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (133 of 152 remaining) [2025-02-06 09:32:16,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (132 of 152 remaining) [2025-02-06 09:32:16,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (131 of 152 remaining) [2025-02-06 09:32:16,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (130 of 152 remaining) [2025-02-06 09:32:16,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (129 of 152 remaining) [2025-02-06 09:32:16,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (128 of 152 remaining) [2025-02-06 09:32:16,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (127 of 152 remaining) [2025-02-06 09:32:16,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (126 of 152 remaining) [2025-02-06 09:32:16,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (125 of 152 remaining) [2025-02-06 09:32:16,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (124 of 152 remaining) [2025-02-06 09:32:16,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (123 of 152 remaining) [2025-02-06 09:32:16,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (122 of 152 remaining) [2025-02-06 09:32:16,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (121 of 152 remaining) [2025-02-06 09:32:16,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (120 of 152 remaining) [2025-02-06 09:32:16,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (119 of 152 remaining) [2025-02-06 09:32:16,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (118 of 152 remaining) [2025-02-06 09:32:16,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (117 of 152 remaining) [2025-02-06 09:32:16,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (116 of 152 remaining) [2025-02-06 09:32:16,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (115 of 152 remaining) [2025-02-06 09:32:16,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (114 of 152 remaining) [2025-02-06 09:32:16,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (113 of 152 remaining) [2025-02-06 09:32:16,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (112 of 152 remaining) [2025-02-06 09:32:16,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (111 of 152 remaining) [2025-02-06 09:32:16,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (110 of 152 remaining) [2025-02-06 09:32:16,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (109 of 152 remaining) [2025-02-06 09:32:16,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (108 of 152 remaining) [2025-02-06 09:32:16,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (107 of 152 remaining) [2025-02-06 09:32:16,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (106 of 152 remaining) [2025-02-06 09:32:16,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (105 of 152 remaining) [2025-02-06 09:32:16,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (104 of 152 remaining) [2025-02-06 09:32:16,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (103 of 152 remaining) [2025-02-06 09:32:16,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (102 of 152 remaining) [2025-02-06 09:32:16,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (101 of 152 remaining) [2025-02-06 09:32:16,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (100 of 152 remaining) [2025-02-06 09:32:16,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (99 of 152 remaining) [2025-02-06 09:32:16,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (98 of 152 remaining) [2025-02-06 09:32:16,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (97 of 152 remaining) [2025-02-06 09:32:16,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (96 of 152 remaining) [2025-02-06 09:32:16,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (95 of 152 remaining) [2025-02-06 09:32:16,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (94 of 152 remaining) [2025-02-06 09:32:16,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (93 of 152 remaining) [2025-02-06 09:32:16,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (92 of 152 remaining) [2025-02-06 09:32:16,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (91 of 152 remaining) [2025-02-06 09:32:16,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (90 of 152 remaining) [2025-02-06 09:32:16,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (89 of 152 remaining) [2025-02-06 09:32:16,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (88 of 152 remaining) [2025-02-06 09:32:16,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (87 of 152 remaining) [2025-02-06 09:32:16,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (86 of 152 remaining) [2025-02-06 09:32:16,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (85 of 152 remaining) [2025-02-06 09:32:16,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (84 of 152 remaining) [2025-02-06 09:32:16,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (83 of 152 remaining) [2025-02-06 09:32:16,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (82 of 152 remaining) [2025-02-06 09:32:16,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (81 of 152 remaining) [2025-02-06 09:32:16,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (80 of 152 remaining) [2025-02-06 09:32:16,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (79 of 152 remaining) [2025-02-06 09:32:16,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (78 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (77 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (76 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (75 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (74 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (73 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (72 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (71 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (70 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (69 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (68 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (67 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (66 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (65 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (64 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (63 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (62 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (61 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (60 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (59 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (58 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (57 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (56 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (55 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (54 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (53 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (52 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (51 of 152 remaining) [2025-02-06 09:32:16,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (50 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (49 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (48 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (47 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (46 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (45 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (44 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (43 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (42 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (41 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (40 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (39 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (38 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (37 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (36 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (35 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (34 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (33 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (32 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (31 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (30 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (29 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (28 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (27 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (26 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (25 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (24 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (23 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (22 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (21 of 152 remaining) [2025-02-06 09:32:16,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 152 remaining) [2025-02-06 09:32:16,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (19 of 152 remaining) [2025-02-06 09:32:16,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (18 of 152 remaining) [2025-02-06 09:32:16,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (17 of 152 remaining) [2025-02-06 09:32:16,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (16 of 152 remaining) [2025-02-06 09:32:16,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (15 of 152 remaining) [2025-02-06 09:32:16,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (14 of 152 remaining) [2025-02-06 09:32:16,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (13 of 152 remaining) [2025-02-06 09:32:16,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (12 of 152 remaining) [2025-02-06 09:32:16,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (11 of 152 remaining) [2025-02-06 09:32:16,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 152 remaining) [2025-02-06 09:32:16,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 152 remaining) [2025-02-06 09:32:16,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 152 remaining) [2025-02-06 09:32:16,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 152 remaining) [2025-02-06 09:32:16,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 152 remaining) [2025-02-06 09:32:16,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 152 remaining) [2025-02-06 09:32:16,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 152 remaining) [2025-02-06 09:32:16,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 152 remaining) [2025-02-06 09:32:16,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 152 remaining) [2025-02-06 09:32:16,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 152 remaining) [2025-02-06 09:32:16,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 152 remaining) [2025-02-06 09:32:16,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 09:32:16,690 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:32:16,696 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 09:32:16,696 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:32:16,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:32:16 BasicIcfg [2025-02-06 09:32:16,702 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:32:16,703 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:32:16,703 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:32:16,703 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:32:16,703 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:32:07" (3/4) ... [2025-02-06 09:32:16,705 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 09:32:16,707 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-06 09:32:16,707 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-06 09:32:16,707 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-06 09:32:16,715 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-02-06 09:32:16,715 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 09:32:16,716 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 09:32:16,716 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 09:32:16,795 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:32:16,795 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:32:16,795 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:32:16,796 INFO L158 Benchmark]: Toolchain (without parser) took 11033.11ms. Allocated memory was 142.6MB in the beginning and 771.8MB in the end (delta: 629.1MB). Free memory was 103.2MB in the beginning and 622.5MB in the end (delta: -519.3MB). Peak memory consumption was 111.5MB. Max. memory is 16.1GB. [2025-02-06 09:32:16,797 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 226.5MB. Free memory is still 142.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:32:16,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.70ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 89.5MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 09:32:16,797 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.87ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 86.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:32:16,797 INFO L158 Benchmark]: Boogie Preprocessor took 41.09ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 84.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:32:16,798 INFO L158 Benchmark]: IcfgBuilder took 928.93ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 49.3MB in the end (delta: 34.8MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. [2025-02-06 09:32:16,798 INFO L158 Benchmark]: TraceAbstraction took 9538.38ms. Allocated memory was 142.6MB in the beginning and 771.8MB in the end (delta: 629.1MB). Free memory was 48.6MB in the beginning and 630.9MB in the end (delta: -582.3MB). Peak memory consumption was 406.5MB. Max. memory is 16.1GB. [2025-02-06 09:32:16,799 INFO L158 Benchmark]: Witness Printer took 92.31ms. Allocated memory is still 771.8MB. Free memory was 630.9MB in the beginning and 622.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:32:16,799 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40ms. Allocated memory is still 226.5MB. Free memory is still 142.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.70ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 89.5MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.87ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 86.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.09ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 84.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 928.93ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 49.3MB in the end (delta: 34.8MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9538.38ms. Allocated memory was 142.6MB in the beginning and 771.8MB in the end (delta: 629.1MB). Free memory was 48.6MB in the beginning and 630.9MB in the end (delta: -582.3MB). Peak memory consumption was 406.5MB. Max. memory is 16.1GB. * Witness Printer took 92.31ms. Allocated memory is still 771.8MB. Free memory was 630.9MB in the beginning and 622.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 146]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 146]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 587 locations, 152 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.3s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 678 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 297 mSDsluCounter, 104 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1264 IncrementalHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 104 mSDtfsCounter, 1264 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=860occurred in iteration=0, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 4006 NumberOfCodeBlocks, 4006 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 3976 ConstructedInterpolants, 0 QuantifiedInterpolants, 4149 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 86 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 09:32:16,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE