./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5dd003755f1e361f3bbf00c3bfecbc1131b6df98a7806f5bb08971966b13d6ac --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:55:47,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:55:47,185 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:55:47,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:55:47,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:55:47,204 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:55:47,205 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:55:47,205 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:55:47,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:55:47,206 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:55:47,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:55:47,207 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:55:47,207 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:55:47,207 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:55:47,207 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:55:47,208 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:55:47,208 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:55:47,208 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:55:47,208 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:55:47,208 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:55:47,208 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:55:47,208 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:55:47,208 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:55:47,208 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:55:47,209 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:55:47,209 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:55:47,209 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:55:47,209 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:55:47,209 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:55:47,209 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:55:47,209 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:55:47,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:55:47,210 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:55:47,210 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:55:47,210 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:55:47,210 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:55:47,210 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:55:47,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:55:47,210 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:55:47,210 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:55:47,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:55:47,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:55:47,211 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5dd003755f1e361f3bbf00c3bfecbc1131b6df98a7806f5bb08971966b13d6ac [2025-03-04 06:55:47,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:55:47,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:55:47,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:55:47,433 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:55:47,433 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:55:47,434 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-03-04 06:55:48,603 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/448b64e7d/929d7d72564249d3a9dfbe937c4d9101/FLAG8826c1ea7 [2025-03-04 06:55:48,874 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:55:48,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-03-04 06:55:48,884 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/448b64e7d/929d7d72564249d3a9dfbe937c4d9101/FLAG8826c1ea7 [2025-03-04 06:55:49,182 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/448b64e7d/929d7d72564249d3a9dfbe937c4d9101 [2025-03-04 06:55:49,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:55:49,185 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:55:49,186 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:55:49,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:55:49,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:55:49,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:55:49" (1/1) ... [2025-03-04 06:55:49,191 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@353fc2b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49, skipping insertion in model container [2025-03-04 06:55:49,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:55:49" (1/1) ... [2025-03-04 06:55:49,208 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:55:49,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:55:49,367 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:55:49,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:55:49,420 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:55:49,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49 WrapperNode [2025-03-04 06:55:49,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:55:49,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:55:49,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:55:49,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:55:49,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49" (1/1) ... [2025-03-04 06:55:49,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49" (1/1) ... [2025-03-04 06:55:49,462 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 17, calls inlined = 19, statements flattened = 520 [2025-03-04 06:55:49,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:55:49,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:55:49,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:55:49,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:55:49,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49" (1/1) ... [2025-03-04 06:55:49,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49" (1/1) ... [2025-03-04 06:55:49,471 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49" (1/1) ... [2025-03-04 06:55:49,471 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49" (1/1) ... [2025-03-04 06:55:49,483 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49" (1/1) ... [2025-03-04 06:55:49,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49" (1/1) ... [2025-03-04 06:55:49,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49" (1/1) ... [2025-03-04 06:55:49,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49" (1/1) ... [2025-03-04 06:55:49,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:55:49,495 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:55:49,495 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:55:49,495 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:55:49,496 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49" (1/1) ... [2025-03-04 06:55:49,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:55:49,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:55:49,523 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:55:49,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:55:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:55:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 06:55:49,543 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 06:55:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 06:55:49,543 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 06:55:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 06:55:49,543 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 06:55:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:55:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:55:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 06:55:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 06:55:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:55:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:55:49,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:55:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:55:49,544 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:55:49,636 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:55:49,638 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:55:50,233 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:55:50,233 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:55:50,493 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:55:50,493 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:55:50,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:55:50 BoogieIcfgContainer [2025-03-04 06:55:50,494 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:55:50,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:55:50,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:55:50,498 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:55:50,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:55:49" (1/3) ... [2025-03-04 06:55:50,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a6ec2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:55:50, skipping insertion in model container [2025-03-04 06:55:50,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49" (2/3) ... [2025-03-04 06:55:50,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a6ec2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:55:50, skipping insertion in model container [2025-03-04 06:55:50,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:55:50" (3/3) ... [2025-03-04 06:55:50,501 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-3-nl.wvr.c [2025-03-04 06:55:50,512 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:55:50,515 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-queue-add-3-nl.wvr.c that has 4 procedures, 428 locations, 1 initial locations, 5 loop locations, and 86 error locations. [2025-03-04 06:55:50,515 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:55:50,644 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 06:55:50,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 437 places, 443 transitions, 907 flow [2025-03-04 06:55:50,787 INFO L124 PetriNetUnfolderBase]: 16/440 cut-off events. [2025-03-04 06:55:50,789 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:55:50,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 440 events. 16/440 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 845 event pairs, 0 based on Foata normal form. 0/338 useless extension candidates. Maximal degree in co-relation 349. Up to 2 conditions per place. [2025-03-04 06:55:50,796 INFO L82 GeneralOperation]: Start removeDead. Operand has 437 places, 443 transitions, 907 flow [2025-03-04 06:55:50,806 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 415 places, 419 transitions, 856 flow [2025-03-04 06:55:50,813 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:55:50,822 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;@728b5f6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:55:50,822 INFO L334 AbstractCegarLoop]: Starting to check reachability of 152 error locations. [2025-03-04 06:55:50,829 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:55:50,830 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-03-04 06:55:50,830 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:55:50,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:50,830 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-03-04 06:55:50,831 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-03-04 06:55:50,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:50,836 INFO L85 PathProgramCache]: Analyzing trace with hash 564630382, now seen corresponding path program 1 times [2025-03-04 06:55:50,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:50,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049587530] [2025-03-04 06:55:50,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:50,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:50,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 06:55:50,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 06:55:50,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:50,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:50,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:50,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:50,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049587530] [2025-03-04 06:55:50,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049587530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:50,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:50,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:50,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99687038] [2025-03-04 06:55:50,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:50,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:50,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:51,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:51,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:51,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 443 [2025-03-04 06:55:51,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 419 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:51,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:51,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 443 [2025-03-04 06:55:51,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:51,385 INFO L124 PetriNetUnfolderBase]: 195/1476 cut-off events. [2025-03-04 06:55:51,385 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-03-04 06:55:51,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1835 conditions, 1476 events. 195/1476 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 9723 event pairs, 128 based on Foata normal form. 35/1236 useless extension candidates. Maximal degree in co-relation 1465. Up to 285 conditions per place. [2025-03-04 06:55:51,402 INFO L140 encePairwiseOnDemand]: 388/443 looper letters, 18 selfloop transitions, 2 changer transitions 5/366 dead transitions. [2025-03-04 06:55:51,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 366 transitions, 790 flow [2025-03-04 06:55:51,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:51,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:51,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1174 transitions. [2025-03-04 06:55:51,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8833709556057185 [2025-03-04 06:55:51,421 INFO L175 Difference]: Start difference. First operand has 415 places, 419 transitions, 856 flow. Second operand 3 states and 1174 transitions. [2025-03-04 06:55:51,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 366 transitions, 790 flow [2025-03-04 06:55:51,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 366 transitions, 778 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 06:55:51,438 INFO L231 Difference]: Finished difference. Result has 366 places, 361 transitions, 732 flow [2025-03-04 06:55:51,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=366, PETRI_TRANSITIONS=361} [2025-03-04 06:55:51,443 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -49 predicate places. [2025-03-04 06:55:51,444 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 361 transitions, 732 flow [2025-03-04 06:55:51,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:51,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:51,446 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-03-04 06:55:51,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:55:51,446 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-03-04 06:55:51,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:51,447 INFO L85 PathProgramCache]: Analyzing trace with hash 275488314, now seen corresponding path program 1 times [2025-03-04 06:55:51,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:51,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717713334] [2025-03-04 06:55:51,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:51,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:51,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 06:55:51,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 06:55:51,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:51,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:51,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:51,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717713334] [2025-03-04 06:55:51,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717713334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:51,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:51,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:51,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225329739] [2025-03-04 06:55:51,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:51,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:51,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:51,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:51,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:51,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 443 [2025-03-04 06:55:51,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 361 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 369.3333333333333) internal successors, (1108), 3 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:51,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:51,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 443 [2025-03-04 06:55:51,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:51,775 INFO L124 PetriNetUnfolderBase]: 86/1124 cut-off events. [2025-03-04 06:55:51,775 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2025-03-04 06:55:51,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1278 conditions, 1124 events. 86/1124 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 6089 event pairs, 51 based on Foata normal form. 0/908 useless extension candidates. Maximal degree in co-relation 1239. Up to 131 conditions per place. [2025-03-04 06:55:51,786 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 17 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2025-03-04 06:55:51,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 360 transitions, 768 flow [2025-03-04 06:55:51,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:51,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:51,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1124 transitions. [2025-03-04 06:55:51,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8457486832204665 [2025-03-04 06:55:51,790 INFO L175 Difference]: Start difference. First operand has 366 places, 361 transitions, 732 flow. Second operand 3 states and 1124 transitions. [2025-03-04 06:55:51,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 360 transitions, 768 flow [2025-03-04 06:55:51,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 360 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:51,796 INFO L231 Difference]: Finished difference. Result has 360 places, 360 transitions, 730 flow [2025-03-04 06:55:51,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, 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-03-04 06:55:51,797 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -55 predicate places. [2025-03-04 06:55:51,797 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 360 transitions, 730 flow [2025-03-04 06:55:51,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 369.3333333333333) internal successors, (1108), 3 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:51,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:51,798 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:51,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:55:51,799 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-03-04 06:55:51,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:51,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1639662899, now seen corresponding path program 1 times [2025-03-04 06:55:51,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:51,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050888354] [2025-03-04 06:55:51,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:51,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:51,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 06:55:51,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 06:55:51,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:51,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:51,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:51,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:51,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050888354] [2025-03-04 06:55:51,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050888354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:51,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:51,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:51,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981266508] [2025-03-04 06:55:51,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:51,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:51,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:51,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:51,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:51,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 443 [2025-03-04 06:55:51,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 360 transitions, 730 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-03-04 06:55:51,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:51,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 443 [2025-03-04 06:55:51,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:52,043 INFO L124 PetriNetUnfolderBase]: 76/914 cut-off events. [2025-03-04 06:55:52,043 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-04 06:55:52,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1042 conditions, 914 events. 76/914 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4540 event pairs, 38 based on Foata normal form. 0/748 useless extension candidates. Maximal degree in co-relation 995. Up to 109 conditions per place. [2025-03-04 06:55:52,049 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 15 selfloop transitions, 2 changer transitions 0/359 dead transitions. [2025-03-04 06:55:52,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 359 transitions, 762 flow [2025-03-04 06:55:52,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:52,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2025-03-04 06:55:52,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8487584650112867 [2025-03-04 06:55:52,051 INFO L175 Difference]: Start difference. First operand has 360 places, 360 transitions, 730 flow. Second operand 3 states and 1128 transitions. [2025-03-04 06:55:52,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 359 transitions, 762 flow [2025-03-04 06:55:52,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 359 transitions, 758 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:52,059 INFO L231 Difference]: Finished difference. Result has 359 places, 359 transitions, 728 flow [2025-03-04 06:55:52,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, 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-03-04 06:55:52,060 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -56 predicate places. [2025-03-04 06:55:52,060 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 359 transitions, 728 flow [2025-03-04 06:55:52,061 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-03-04 06:55:52,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:52,061 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-03-04 06:55:52,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:55:52,061 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-03-04 06:55:52,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:52,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1149075053, now seen corresponding path program 1 times [2025-03-04 06:55:52,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:52,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224747418] [2025-03-04 06:55:52,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:52,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:52,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 06:55:52,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 06:55:52,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:52,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:52,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:52,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224747418] [2025-03-04 06:55:52,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224747418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:52,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:52,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:52,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692089594] [2025-03-04 06:55:52,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:52,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:52,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:52,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:52,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:52,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 443 [2025-03-04 06:55:52,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 359 transitions, 728 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-03-04 06:55:52,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:52,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 443 [2025-03-04 06:55:52,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:52,234 INFO L124 PetriNetUnfolderBase]: 76/913 cut-off events. [2025-03-04 06:55:52,234 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-04 06:55:52,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1041 conditions, 913 events. 76/913 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4559 event pairs, 38 based on Foata normal form. 0/748 useless extension candidates. Maximal degree in co-relation 986. Up to 109 conditions per place. [2025-03-04 06:55:52,241 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 15 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2025-03-04 06:55:52,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 358 transitions, 760 flow [2025-03-04 06:55:52,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:52,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:52,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2025-03-04 06:55:52,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8487584650112867 [2025-03-04 06:55:52,244 INFO L175 Difference]: Start difference. First operand has 359 places, 359 transitions, 728 flow. Second operand 3 states and 1128 transitions. [2025-03-04 06:55:52,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 358 transitions, 760 flow [2025-03-04 06:55:52,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 358 transitions, 756 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:52,248 INFO L231 Difference]: Finished difference. Result has 358 places, 358 transitions, 726 flow [2025-03-04 06:55:52,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=356, 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=726, PETRI_PLACES=358, PETRI_TRANSITIONS=358} [2025-03-04 06:55:52,249 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -57 predicate places. [2025-03-04 06:55:52,249 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 358 transitions, 726 flow [2025-03-04 06:55:52,250 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-03-04 06:55:52,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:52,250 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-03-04 06:55:52,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:55:52,250 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-03-04 06:55:52,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:52,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1315751904, now seen corresponding path program 1 times [2025-03-04 06:55:52,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:52,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470164109] [2025-03-04 06:55:52,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:52,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:52,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 06:55:52,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 06:55:52,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:52,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:52,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:52,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:52,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470164109] [2025-03-04 06:55:52,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470164109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:52,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:52,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:52,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950079035] [2025-03-04 06:55:52,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:52,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:52,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:52,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:52,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:52,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 443 [2025-03-04 06:55:52,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 358 transitions, 726 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-03-04 06:55:52,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:52,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 443 [2025-03-04 06:55:52,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:52,419 INFO L124 PetriNetUnfolderBase]: 76/912 cut-off events. [2025-03-04 06:55:52,419 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-04 06:55:52,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 912 events. 76/912 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4556 event pairs, 38 based on Foata normal form. 0/748 useless extension candidates. Maximal degree in co-relation 977. Up to 109 conditions per place. [2025-03-04 06:55:52,425 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 15 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2025-03-04 06:55:52,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 357 transitions, 758 flow [2025-03-04 06:55:52,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:52,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:52,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2025-03-04 06:55:52,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8487584650112867 [2025-03-04 06:55:52,428 INFO L175 Difference]: Start difference. First operand has 358 places, 358 transitions, 726 flow. Second operand 3 states and 1128 transitions. [2025-03-04 06:55:52,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 357 transitions, 758 flow [2025-03-04 06:55:52,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 357 transitions, 754 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:52,432 INFO L231 Difference]: Finished difference. Result has 357 places, 357 transitions, 724 flow [2025-03-04 06:55:52,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=355, 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=724, PETRI_PLACES=357, PETRI_TRANSITIONS=357} [2025-03-04 06:55:52,433 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -58 predicate places. [2025-03-04 06:55:52,433 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 357 transitions, 724 flow [2025-03-04 06:55:52,434 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-03-04 06:55:52,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:52,434 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-03-04 06:55:52,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:55:52,434 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-03-04 06:55:52,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:52,435 INFO L85 PathProgramCache]: Analyzing trace with hash 992926040, now seen corresponding path program 1 times [2025-03-04 06:55:52,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:52,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891314224] [2025-03-04 06:55:52,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:52,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:52,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 06:55:52,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 06:55:52,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:52,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:52,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:52,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891314224] [2025-03-04 06:55:52,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891314224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:52,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:52,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:52,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243046847] [2025-03-04 06:55:52,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:52,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:52,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:52,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:52,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:52,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 443 [2025-03-04 06:55:52,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 357 transitions, 724 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-03-04 06:55:52,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:52,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 443 [2025-03-04 06:55:52,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:52,639 INFO L124 PetriNetUnfolderBase]: 73/812 cut-off events. [2025-03-04 06:55:52,639 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-04 06:55:52,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 939 conditions, 812 events. 73/812 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3514 event pairs, 7 based on Foata normal form. 0/677 useless extension candidates. Maximal degree in co-relation 868. Up to 81 conditions per place. [2025-03-04 06:55:52,644 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 18 selfloop transitions, 2 changer transitions 0/362 dead transitions. [2025-03-04 06:55:52,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 362 transitions, 776 flow [2025-03-04 06:55:52,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:52,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:52,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1143 transitions. [2025-03-04 06:55:52,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8600451467268623 [2025-03-04 06:55:52,647 INFO L175 Difference]: Start difference. First operand has 357 places, 357 transitions, 724 flow. Second operand 3 states and 1143 transitions. [2025-03-04 06:55:52,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 362 transitions, 776 flow [2025-03-04 06:55:52,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 362 transitions, 772 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:52,654 INFO L231 Difference]: Finished difference. Result has 357 places, 357 transitions, 728 flow [2025-03-04 06:55:52,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=354, 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=728, PETRI_PLACES=357, PETRI_TRANSITIONS=357} [2025-03-04 06:55:52,655 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -58 predicate places. [2025-03-04 06:55:52,655 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 357 transitions, 728 flow [2025-03-04 06:55:52,655 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-03-04 06:55:52,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:52,655 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-03-04 06:55:52,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:55:52,656 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-03-04 06:55:52,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:52,656 INFO L85 PathProgramCache]: Analyzing trace with hash -316181614, now seen corresponding path program 1 times [2025-03-04 06:55:52,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:52,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964533342] [2025-03-04 06:55:52,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:52,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:52,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 06:55:52,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 06:55:52,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:52,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:52,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:52,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:52,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964533342] [2025-03-04 06:55:52,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964533342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:52,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:52,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:52,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270806459] [2025-03-04 06:55:52,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:52,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:52,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:52,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:52,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:52,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 443 [2025-03-04 06:55:52,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 357 transitions, 728 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:52,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:52,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 443 [2025-03-04 06:55:52,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:52,817 INFO L124 PetriNetUnfolderBase]: 76/912 cut-off events. [2025-03-04 06:55:52,818 INFO L125 PetriNetUnfolderBase]: For 31/32 co-relation queries the response was YES. [2025-03-04 06:55:52,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 912 events. 76/912 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4584 event pairs, 38 based on Foata normal form. 0/750 useless extension candidates. Maximal degree in co-relation 406. Up to 110 conditions per place. [2025-03-04 06:55:52,824 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 15 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2025-03-04 06:55:52,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 356 transitions, 760 flow [2025-03-04 06:55:52,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:52,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:52,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2025-03-04 06:55:52,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8502633559066968 [2025-03-04 06:55:52,827 INFO L175 Difference]: Start difference. First operand has 357 places, 357 transitions, 728 flow. Second operand 3 states and 1130 transitions. [2025-03-04 06:55:52,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 356 transitions, 760 flow [2025-03-04 06:55:52,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 356 transitions, 758 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:52,832 INFO L231 Difference]: Finished difference. Result has 357 places, 356 transitions, 728 flow [2025-03-04 06:55:52,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=355, 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=728, PETRI_PLACES=357, PETRI_TRANSITIONS=356} [2025-03-04 06:55:52,833 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -58 predicate places. [2025-03-04 06:55:52,833 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 356 transitions, 728 flow [2025-03-04 06:55:52,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:52,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:52,834 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-03-04 06:55:52,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:55:52,834 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-03-04 06:55:52,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:52,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1108176051, now seen corresponding path program 1 times [2025-03-04 06:55:52,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:52,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002684623] [2025-03-04 06:55:52,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:52,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:52,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 06:55:52,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 06:55:52,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:52,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:52,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:52,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:52,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002684623] [2025-03-04 06:55:52,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002684623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:52,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:52,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:52,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110997689] [2025-03-04 06:55:52,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:52,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:52,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:52,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:52,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:52,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 443 [2025-03-04 06:55:52,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 356 transitions, 728 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-03-04 06:55:52,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:52,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 443 [2025-03-04 06:55:52,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:52,983 INFO L124 PetriNetUnfolderBase]: 76/911 cut-off events. [2025-03-04 06:55:52,983 INFO L125 PetriNetUnfolderBase]: For 30/31 co-relation queries the response was YES. [2025-03-04 06:55:52,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1065 conditions, 911 events. 76/911 cut-off events. For 30/31 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4561 event pairs, 38 based on Foata normal form. 0/750 useless extension candidates. Maximal degree in co-relation 985. Up to 111 conditions per place. [2025-03-04 06:55:52,989 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 16 selfloop transitions, 2 changer transitions 0/355 dead transitions. [2025-03-04 06:55:52,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 355 transitions, 762 flow [2025-03-04 06:55:52,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:52,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:52,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2025-03-04 06:55:52,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8487584650112867 [2025-03-04 06:55:52,991 INFO L175 Difference]: Start difference. First operand has 357 places, 356 transitions, 728 flow. Second operand 3 states and 1128 transitions. [2025-03-04 06:55:52,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 355 transitions, 762 flow [2025-03-04 06:55:52,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 355 transitions, 758 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:53,012 INFO L231 Difference]: Finished difference. Result has 356 places, 355 transitions, 726 flow [2025-03-04 06:55:53,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=726, PETRI_PLACES=356, PETRI_TRANSITIONS=355} [2025-03-04 06:55:53,014 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -59 predicate places. [2025-03-04 06:55:53,015 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 355 transitions, 726 flow [2025-03-04 06:55:53,016 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-03-04 06:55:53,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:53,016 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-03-04 06:55:53,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:55:53,016 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-03-04 06:55:53,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:53,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1908143371, now seen corresponding path program 1 times [2025-03-04 06:55:53,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:53,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628289843] [2025-03-04 06:55:53,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:53,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:53,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 06:55:53,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 06:55:53,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:53,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:53,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:53,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:53,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628289843] [2025-03-04 06:55:53,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628289843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:53,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:53,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:53,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447723071] [2025-03-04 06:55:53,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:53,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:53,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:53,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:53,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:53,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 443 [2025-03-04 06:55:53,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 355 transitions, 726 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-03-04 06:55:53,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:53,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 443 [2025-03-04 06:55:53,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:53,167 INFO L124 PetriNetUnfolderBase]: 84/1002 cut-off events. [2025-03-04 06:55:53,167 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-04 06:55:53,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1166 conditions, 1002 events. 84/1002 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5115 event pairs, 20 based on Foata normal form. 0/826 useless extension candidates. Maximal degree in co-relation 1078. Up to 66 conditions per place. [2025-03-04 06:55:53,173 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 21 selfloop transitions, 2 changer transitions 0/362 dead transitions. [2025-03-04 06:55:53,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 362 transitions, 792 flow [2025-03-04 06:55:53,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:53,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:53,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1144 transitions. [2025-03-04 06:55:53,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8607975921745673 [2025-03-04 06:55:53,176 INFO L175 Difference]: Start difference. First operand has 356 places, 355 transitions, 726 flow. Second operand 3 states and 1144 transitions. [2025-03-04 06:55:53,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 362 transitions, 792 flow [2025-03-04 06:55:53,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 362 transitions, 788 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:53,180 INFO L231 Difference]: Finished difference. Result has 356 places, 355 transitions, 730 flow [2025-03-04 06:55:53,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=356, PETRI_TRANSITIONS=355} [2025-03-04 06:55:53,181 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -59 predicate places. [2025-03-04 06:55:53,181 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 355 transitions, 730 flow [2025-03-04 06:55:53,181 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-03-04 06:55:53,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:53,181 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-03-04 06:55:53,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:55:53,182 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-03-04 06:55:53,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:53,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1691507990, now seen corresponding path program 1 times [2025-03-04 06:55:53,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:53,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594560871] [2025-03-04 06:55:53,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:53,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:53,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 06:55:53,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 06:55:53,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:53,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:53,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:53,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:53,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594560871] [2025-03-04 06:55:53,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594560871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:53,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:53,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:53,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549577522] [2025-03-04 06:55:53,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:53,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:53,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:53,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:53,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:53,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 443 [2025-03-04 06:55:53,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 355 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:53,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:53,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 443 [2025-03-04 06:55:53,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:53,298 INFO L124 PetriNetUnfolderBase]: 84/922 cut-off events. [2025-03-04 06:55:53,299 INFO L125 PetriNetUnfolderBase]: For 57/58 co-relation queries the response was YES. [2025-03-04 06:55:53,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1127 conditions, 922 events. 84/922 cut-off events. For 57/58 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4636 event pairs, 38 based on Foata normal form. 0/756 useless extension candidates. Maximal degree in co-relation 637. Up to 123 conditions per place. [2025-03-04 06:55:53,305 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 16 selfloop transitions, 2 changer transitions 0/354 dead transitions. [2025-03-04 06:55:53,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 354 transitions, 764 flow [2025-03-04 06:55:53,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:53,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:53,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2025-03-04 06:55:53,308 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8502633559066968 [2025-03-04 06:55:53,308 INFO L175 Difference]: Start difference. First operand has 356 places, 355 transitions, 730 flow. Second operand 3 states and 1130 transitions. [2025-03-04 06:55:53,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 354 transitions, 764 flow [2025-03-04 06:55:53,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 354 transitions, 762 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:53,312 INFO L231 Difference]: Finished difference. Result has 356 places, 354 transitions, 730 flow [2025-03-04 06:55:53,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=354, 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=730, PETRI_PLACES=356, PETRI_TRANSITIONS=354} [2025-03-04 06:55:53,313 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -59 predicate places. [2025-03-04 06:55:53,313 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 354 transitions, 730 flow [2025-03-04 06:55:53,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:53,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:53,314 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:53,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:55:53,314 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-03-04 06:55:53,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:53,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1137963981, now seen corresponding path program 1 times [2025-03-04 06:55:53,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:53,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62059304] [2025-03-04 06:55:53,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:53,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:53,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 06:55:53,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 06:55:53,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:53,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:53,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:53,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:53,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62059304] [2025-03-04 06:55:53,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62059304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:53,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:53,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:53,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511235207] [2025-03-04 06:55:53,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:53,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:53,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:53,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:53,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:53,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 443 [2025-03-04 06:55:53,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 354 transitions, 730 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-03-04 06:55:53,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:53,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 443 [2025-03-04 06:55:53,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:53,462 INFO L124 PetriNetUnfolderBase]: 84/921 cut-off events. [2025-03-04 06:55:53,463 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2025-03-04 06:55:53,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1113 conditions, 921 events. 84/921 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4625 event pairs, 38 based on Foata normal form. 0/756 useless extension candidates. Maximal degree in co-relation 1016. Up to 121 conditions per place. [2025-03-04 06:55:53,469 INFO L140 encePairwiseOnDemand]: 441/443 looper letters, 15 selfloop transitions, 1 changer transitions 0/353 dead transitions. [2025-03-04 06:55:53,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 353 transitions, 760 flow [2025-03-04 06:55:53,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:53,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:53,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2025-03-04 06:55:53,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8555304740406321 [2025-03-04 06:55:53,472 INFO L175 Difference]: Start difference. First operand has 356 places, 354 transitions, 730 flow. Second operand 3 states and 1137 transitions. [2025-03-04 06:55:53,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 353 transitions, 760 flow [2025-03-04 06:55:53,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 353 transitions, 756 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:53,477 INFO L231 Difference]: Finished difference. Result has 355 places, 353 transitions, 726 flow [2025-03-04 06:55:53,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=726, PETRI_PLACES=355, PETRI_TRANSITIONS=353} [2025-03-04 06:55:53,478 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -60 predicate places. [2025-03-04 06:55:53,478 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 353 transitions, 726 flow [2025-03-04 06:55:53,479 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-03-04 06:55:53,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:53,479 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-03-04 06:55:53,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:55:53,479 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-03-04 06:55:53,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:53,480 INFO L85 PathProgramCache]: Analyzing trace with hash -818725646, now seen corresponding path program 1 times [2025-03-04 06:55:53,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:53,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325029557] [2025-03-04 06:55:53,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:53,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:53,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 06:55:53,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 06:55:53,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:53,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:53,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:53,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325029557] [2025-03-04 06:55:53,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325029557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:53,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:53,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:53,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963095568] [2025-03-04 06:55:53,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:53,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:53,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:53,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:53,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:53,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 443 [2025-03-04 06:55:53,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 353 transitions, 726 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:53,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:53,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 443 [2025-03-04 06:55:53,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:53,660 INFO L124 PetriNetUnfolderBase]: 84/920 cut-off events. [2025-03-04 06:55:53,660 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2025-03-04 06:55:53,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1113 conditions, 920 events. 84/920 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4619 event pairs, 38 based on Foata normal form. 0/756 useless extension candidates. Maximal degree in co-relation 1016. Up to 123 conditions per place. [2025-03-04 06:55:53,666 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 16 selfloop transitions, 2 changer transitions 0/352 dead transitions. [2025-03-04 06:55:53,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 352 transitions, 760 flow [2025-03-04 06:55:53,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:53,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2025-03-04 06:55:53,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8502633559066968 [2025-03-04 06:55:53,673 INFO L175 Difference]: Start difference. First operand has 355 places, 353 transitions, 726 flow. Second operand 3 states and 1130 transitions. [2025-03-04 06:55:53,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 352 transitions, 760 flow [2025-03-04 06:55:53,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 352 transitions, 759 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:53,678 INFO L231 Difference]: Finished difference. Result has 355 places, 352 transitions, 727 flow [2025-03-04 06:55:53,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=727, PETRI_PLACES=355, PETRI_TRANSITIONS=352} [2025-03-04 06:55:53,679 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -60 predicate places. [2025-03-04 06:55:53,680 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 352 transitions, 727 flow [2025-03-04 06:55:53,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:53,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:53,681 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-03-04 06:55:53,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:55:53,681 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-03-04 06:55:53,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:53,682 INFO L85 PathProgramCache]: Analyzing trace with hash 48519026, now seen corresponding path program 1 times [2025-03-04 06:55:53,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:53,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022798878] [2025-03-04 06:55:53,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:53,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:53,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 06:55:53,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 06:55:53,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:53,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:54,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:54,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:54,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022798878] [2025-03-04 06:55:54,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022798878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:54,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:54,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:55:54,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004183679] [2025-03-04 06:55:54,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:54,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:55:54,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:54,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:55:54,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:55:54,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 443 [2025-03-04 06:55:54,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 352 transitions, 727 flow. Second operand has 6 states, 6 states have (on average 351.5) internal successors, (2109), 6 states have internal predecessors, (2109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:54,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:54,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 443 [2025-03-04 06:55:54,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:54,394 INFO L124 PetriNetUnfolderBase]: 84/918 cut-off events. [2025-03-04 06:55:54,395 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2025-03-04 06:55:54,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1134 conditions, 918 events. 84/918 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4609 event pairs, 38 based on Foata normal form. 0/756 useless extension candidates. Maximal degree in co-relation 1038. Up to 136 conditions per place. [2025-03-04 06:55:54,401 INFO L140 encePairwiseOnDemand]: 431/443 looper letters, 29 selfloop transitions, 10 changer transitions 0/350 dead transitions. [2025-03-04 06:55:54,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 350 transitions, 801 flow [2025-03-04 06:55:54,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:55:54,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:55:54,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2139 transitions. [2025-03-04 06:55:54,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8047404063205418 [2025-03-04 06:55:54,404 INFO L175 Difference]: Start difference. First operand has 355 places, 352 transitions, 727 flow. Second operand 6 states and 2139 transitions. [2025-03-04 06:55:54,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 350 transitions, 801 flow [2025-03-04 06:55:54,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 350 transitions, 797 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:54,408 INFO L231 Difference]: Finished difference. Result has 356 places, 350 transitions, 739 flow [2025-03-04 06:55:54,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=739, PETRI_PLACES=356, PETRI_TRANSITIONS=350} [2025-03-04 06:55:54,409 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -59 predicate places. [2025-03-04 06:55:54,410 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 350 transitions, 739 flow [2025-03-04 06:55:54,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 351.5) internal successors, (2109), 6 states have internal predecessors, (2109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:54,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:54,411 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-03-04 06:55:54,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:55:54,411 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-03-04 06:55:54,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:54,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1525246646, now seen corresponding path program 1 times [2025-03-04 06:55:54,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:54,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101559990] [2025-03-04 06:55:54,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:54,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:54,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 06:55:54,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 06:55:54,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:54,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:54,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:54,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:54,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101559990] [2025-03-04 06:55:54,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101559990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:54,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:54,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:54,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045149149] [2025-03-04 06:55:54,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:54,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:54,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:54,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:54,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:54,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 443 [2025-03-04 06:55:54,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 350 transitions, 739 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-03-04 06:55:54,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:54,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 443 [2025-03-04 06:55:54,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:54,543 INFO L124 PetriNetUnfolderBase]: 84/917 cut-off events. [2025-03-04 06:55:54,543 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2025-03-04 06:55:54,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1118 conditions, 917 events. 84/917 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4604 event pairs, 38 based on Foata normal form. 0/756 useless extension candidates. Maximal degree in co-relation 1083. Up to 121 conditions per place. [2025-03-04 06:55:54,550 INFO L140 encePairwiseOnDemand]: 441/443 looper letters, 15 selfloop transitions, 1 changer transitions 0/349 dead transitions. [2025-03-04 06:55:54,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 349 transitions, 769 flow [2025-03-04 06:55:54,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:54,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:54,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2025-03-04 06:55:54,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8555304740406321 [2025-03-04 06:55:54,553 INFO L175 Difference]: Start difference. First operand has 356 places, 350 transitions, 739 flow. Second operand 3 states and 1137 transitions. [2025-03-04 06:55:54,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 349 transitions, 769 flow [2025-03-04 06:55:54,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 349 transitions, 749 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:55:54,557 INFO L231 Difference]: Finished difference. Result has 352 places, 349 transitions, 719 flow [2025-03-04 06:55:54,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=719, PETRI_PLACES=352, PETRI_TRANSITIONS=349} [2025-03-04 06:55:54,559 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -63 predicate places. [2025-03-04 06:55:54,559 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 349 transitions, 719 flow [2025-03-04 06:55:54,559 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-03-04 06:55:54,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:54,559 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-03-04 06:55:54,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:55:54,560 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-03-04 06:55:54,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:54,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1144389625, now seen corresponding path program 1 times [2025-03-04 06:55:54,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:54,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918714122] [2025-03-04 06:55:54,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:54,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:54,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 06:55:54,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 06:55:54,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:54,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:54,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:54,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:54,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918714122] [2025-03-04 06:55:54,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918714122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:54,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:54,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:54,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74495506] [2025-03-04 06:55:54,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:54,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:54,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:54,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:54,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:54,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 443 [2025-03-04 06:55:54,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 349 transitions, 719 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:54,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:54,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 443 [2025-03-04 06:55:54,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:54,703 INFO L124 PetriNetUnfolderBase]: 84/916 cut-off events. [2025-03-04 06:55:54,703 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2025-03-04 06:55:54,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1110 conditions, 916 events. 84/916 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4581 event pairs, 38 based on Foata normal form. 0/756 useless extension candidates. Maximal degree in co-relation 1013. Up to 123 conditions per place. [2025-03-04 06:55:54,709 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 16 selfloop transitions, 2 changer transitions 0/348 dead transitions. [2025-03-04 06:55:54,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 348 transitions, 753 flow [2025-03-04 06:55:54,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:54,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2025-03-04 06:55:54,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8502633559066968 [2025-03-04 06:55:54,712 INFO L175 Difference]: Start difference. First operand has 352 places, 349 transitions, 719 flow. Second operand 3 states and 1130 transitions. [2025-03-04 06:55:54,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 348 transitions, 753 flow [2025-03-04 06:55:54,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 348 transitions, 752 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:54,717 INFO L231 Difference]: Finished difference. Result has 352 places, 348 transitions, 720 flow [2025-03-04 06:55:54,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=720, PETRI_PLACES=352, PETRI_TRANSITIONS=348} [2025-03-04 06:55:54,718 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -63 predicate places. [2025-03-04 06:55:54,718 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 348 transitions, 720 flow [2025-03-04 06:55:54,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:54,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:54,719 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-03-04 06:55:54,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:55:54,719 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-03-04 06:55:54,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:54,720 INFO L85 PathProgramCache]: Analyzing trace with hash -911155718, now seen corresponding path program 1 times [2025-03-04 06:55:54,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:54,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450578193] [2025-03-04 06:55:54,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:54,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:54,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 06:55:54,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 06:55:54,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:54,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:54,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:54,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450578193] [2025-03-04 06:55:54,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450578193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:54,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:54,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:54,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461089907] [2025-03-04 06:55:54,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:54,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:54,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:54,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:54,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:54,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 443 [2025-03-04 06:55:54,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 348 transitions, 720 flow. Second operand has 3 states, 3 states have (on average 369.0) internal successors, (1107), 3 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:54,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:54,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 443 [2025-03-04 06:55:54,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:54,890 INFO L124 PetriNetUnfolderBase]: 113/1251 cut-off events. [2025-03-04 06:55:54,891 INFO L125 PetriNetUnfolderBase]: For 81/83 co-relation queries the response was YES. [2025-03-04 06:55:54,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1527 conditions, 1251 events. 113/1251 cut-off events. For 81/83 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 7409 event pairs, 64 based on Foata normal form. 1/1018 useless extension candidates. Maximal degree in co-relation 1430. Up to 171 conditions per place. [2025-03-04 06:55:54,898 INFO L140 encePairwiseOnDemand]: 439/443 looper letters, 17 selfloop transitions, 1 changer transitions 2/345 dead transitions. [2025-03-04 06:55:54,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 345 transitions, 752 flow [2025-03-04 06:55:54,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:54,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1124 transitions. [2025-03-04 06:55:54,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8457486832204665 [2025-03-04 06:55:54,900 INFO L175 Difference]: Start difference. First operand has 352 places, 348 transitions, 720 flow. Second operand 3 states and 1124 transitions. [2025-03-04 06:55:54,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 345 transitions, 752 flow [2025-03-04 06:55:54,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 345 transitions, 748 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:54,904 INFO L231 Difference]: Finished difference. Result has 349 places, 343 transitions, 708 flow [2025-03-04 06:55:54,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=708, PETRI_PLACES=349, PETRI_TRANSITIONS=343} [2025-03-04 06:55:54,905 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -66 predicate places. [2025-03-04 06:55:54,905 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 343 transitions, 708 flow [2025-03-04 06:55:54,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 369.0) internal successors, (1107), 3 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:54,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:54,906 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-03-04 06:55:54,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:55:54,906 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-03-04 06:55:54,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:54,907 INFO L85 PathProgramCache]: Analyzing trace with hash 426847090, now seen corresponding path program 1 times [2025-03-04 06:55:54,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:54,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491719002] [2025-03-04 06:55:54,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:54,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:54,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 06:55:54,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 06:55:54,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:54,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:54,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:54,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:54,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491719002] [2025-03-04 06:55:54,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491719002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:54,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:54,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:54,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097957240] [2025-03-04 06:55:54,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:54,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:54,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:54,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:54,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:54,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 443 [2025-03-04 06:55:54,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 343 transitions, 708 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:54,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:54,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 443 [2025-03-04 06:55:54,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:55,126 INFO L124 PetriNetUnfolderBase]: 198/1365 cut-off events. [2025-03-04 06:55:55,126 INFO L125 PetriNetUnfolderBase]: For 128/129 co-relation queries the response was YES. [2025-03-04 06:55:55,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1829 conditions, 1365 events. 198/1365 cut-off events. For 128/129 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 8650 event pairs, 64 based on Foata normal form. 0/1125 useless extension candidates. Maximal degree in co-relation 1733. Up to 178 conditions per place. [2025-03-04 06:55:55,133 INFO L140 encePairwiseOnDemand]: 434/443 looper letters, 25 selfloop transitions, 5 changer transitions 0/346 dead transitions. [2025-03-04 06:55:55,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 346 transitions, 784 flow [2025-03-04 06:55:55,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:55,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:55,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1122 transitions. [2025-03-04 06:55:55,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8442437923250564 [2025-03-04 06:55:55,135 INFO L175 Difference]: Start difference. First operand has 349 places, 343 transitions, 708 flow. Second operand 3 states and 1122 transitions. [2025-03-04 06:55:55,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 346 transitions, 784 flow [2025-03-04 06:55:55,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 346 transitions, 783 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:55,139 INFO L231 Difference]: Finished difference. Result has 344 places, 339 transitions, 709 flow [2025-03-04 06:55:55,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=709, PETRI_PLACES=344, PETRI_TRANSITIONS=339} [2025-03-04 06:55:55,140 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -71 predicate places. [2025-03-04 06:55:55,140 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 339 transitions, 709 flow [2025-03-04 06:55:55,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:55,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:55,140 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:55,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:55:55,140 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-03-04 06:55:55,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:55,141 INFO L85 PathProgramCache]: Analyzing trace with hash -2116760779, now seen corresponding path program 1 times [2025-03-04 06:55:55,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:55,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886791930] [2025-03-04 06:55:55,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:55,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:55,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-04 06:55:55,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-04 06:55:55,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:55,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:55,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:55,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:55,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886791930] [2025-03-04 06:55:55,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886791930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:55,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:55,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:55,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598383993] [2025-03-04 06:55:55,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:55,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:55,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:55,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:55,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:55,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 443 [2025-03-04 06:55:55,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 339 transitions, 709 flow. Second operand has 3 states, 3 states have (on average 366.6666666666667) internal successors, (1100), 3 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:55,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:55,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 443 [2025-03-04 06:55:55,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:55,468 INFO L124 PetriNetUnfolderBase]: 490/2295 cut-off events. [2025-03-04 06:55:55,468 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2025-03-04 06:55:55,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3314 conditions, 2295 events. 490/2295 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 17266 event pairs, 104 based on Foata normal form. 0/1993 useless extension candidates. Maximal degree in co-relation 3217. Up to 661 conditions per place. [2025-03-04 06:55:55,476 INFO L140 encePairwiseOnDemand]: 435/443 looper letters, 29 selfloop transitions, 4 changer transitions 0/346 dead transitions. [2025-03-04 06:55:55,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 346 transitions, 795 flow [2025-03-04 06:55:55,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:55,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2025-03-04 06:55:55,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8502633559066968 [2025-03-04 06:55:55,479 INFO L175 Difference]: Start difference. First operand has 344 places, 339 transitions, 709 flow. Second operand 3 states and 1130 transitions. [2025-03-04 06:55:55,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 346 transitions, 795 flow [2025-03-04 06:55:55,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 346 transitions, 785 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:55,484 INFO L231 Difference]: Finished difference. Result has 341 places, 339 transitions, 719 flow [2025-03-04 06:55:55,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=719, PETRI_PLACES=341, PETRI_TRANSITIONS=339} [2025-03-04 06:55:55,484 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -74 predicate places. [2025-03-04 06:55:55,484 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 339 transitions, 719 flow [2025-03-04 06:55:55,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.6666666666667) internal successors, (1100), 3 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:55,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:55,485 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:55,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:55:55,485 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-03-04 06:55:55,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:55,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1508775179, now seen corresponding path program 1 times [2025-03-04 06:55:55,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:55,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198768589] [2025-03-04 06:55:55,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:55,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:55,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-04 06:55:55,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-04 06:55:55,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:55,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:55,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:55,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:55,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198768589] [2025-03-04 06:55:55,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198768589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:55,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:55,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:55,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790467852] [2025-03-04 06:55:55,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:55,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:55,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:55,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:55,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:55,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 443 [2025-03-04 06:55:55,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 339 transitions, 719 flow. Second operand has 3 states, 3 states have (on average 372.6666666666667) internal successors, (1118), 3 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:55,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:55,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 443 [2025-03-04 06:55:55,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:55,749 INFO L124 PetriNetUnfolderBase]: 489/1779 cut-off events. [2025-03-04 06:55:55,750 INFO L125 PetriNetUnfolderBase]: For 233/234 co-relation queries the response was YES. [2025-03-04 06:55:55,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2805 conditions, 1779 events. 489/1779 cut-off events. For 233/234 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 11503 event pairs, 194 based on Foata normal form. 0/1475 useless extension candidates. Maximal degree in co-relation 2709. Up to 527 conditions per place. [2025-03-04 06:55:55,762 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 23 selfloop transitions, 2 changer transitions 0/344 dead transitions. [2025-03-04 06:55:55,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 344 transitions, 785 flow [2025-03-04 06:55:55,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:55,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2025-03-04 06:55:55,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8547780285929271 [2025-03-04 06:55:55,765 INFO L175 Difference]: Start difference. First operand has 341 places, 339 transitions, 719 flow. Second operand 3 states and 1136 transitions. [2025-03-04 06:55:55,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 344 transitions, 785 flow [2025-03-04 06:55:55,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 344 transitions, 785 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:55:55,769 INFO L231 Difference]: Finished difference. Result has 342 places, 338 transitions, 721 flow [2025-03-04 06:55:55,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, 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-03-04 06:55:55,770 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -73 predicate places. [2025-03-04 06:55:55,770 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 338 transitions, 721 flow [2025-03-04 06:55:55,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.6666666666667) internal successors, (1118), 3 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:55,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:55,771 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-03-04 06:55:55,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:55:55,771 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-03-04 06:55:55,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:55,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1442161990, now seen corresponding path program 1 times [2025-03-04 06:55:55,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:55,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215730537] [2025-03-04 06:55:55,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:55,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:55,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-04 06:55:55,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-04 06:55:55,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:55,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:55,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:55,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:55,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215730537] [2025-03-04 06:55:55,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215730537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:55,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:55,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:55,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698656446] [2025-03-04 06:55:55,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:55,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:55,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:55,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:55,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:55,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 443 [2025-03-04 06:55:55,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 338 transitions, 721 flow. Second operand has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:55,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:55,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 443 [2025-03-04 06:55:55,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:56,196 INFO L124 PetriNetUnfolderBase]: 383/2391 cut-off events. [2025-03-04 06:55:56,196 INFO L125 PetriNetUnfolderBase]: For 214/217 co-relation queries the response was YES. [2025-03-04 06:55:56,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3316 conditions, 2391 events. 383/2391 cut-off events. For 214/217 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 18748 event pairs, 165 based on Foata normal form. 0/1990 useless extension candidates. Maximal degree in co-relation 3219. Up to 414 conditions per place. [2025-03-04 06:55:56,211 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 27 selfloop transitions, 2 changer transitions 0/344 dead transitions. [2025-03-04 06:55:56,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 344 transitions, 801 flow [2025-03-04 06:55:56,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:56,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:56,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2025-03-04 06:55:56,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8502633559066968 [2025-03-04 06:55:56,214 INFO L175 Difference]: Start difference. First operand has 342 places, 338 transitions, 721 flow. Second operand 3 states and 1130 transitions. [2025-03-04 06:55:56,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 344 transitions, 801 flow [2025-03-04 06:55:56,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 344 transitions, 797 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:56,219 INFO L231 Difference]: Finished difference. Result has 341 places, 337 transitions, 719 flow [2025-03-04 06:55:56,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, 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-03-04 06:55:56,219 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -74 predicate places. [2025-03-04 06:55:56,219 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 337 transitions, 719 flow [2025-03-04 06:55:56,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:56,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:56,220 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-03-04 06:55:56,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:55:56,220 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-03-04 06:55:56,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:56,221 INFO L85 PathProgramCache]: Analyzing trace with hash 140049631, now seen corresponding path program 1 times [2025-03-04 06:55:56,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:56,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826713805] [2025-03-04 06:55:56,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:56,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:56,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-04 06:55:56,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-04 06:55:56,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:56,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:56,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:56,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:56,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826713805] [2025-03-04 06:55:56,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826713805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:56,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:56,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:56,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476287809] [2025-03-04 06:55:56,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:56,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:56,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:56,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:56,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:56,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 443 [2025-03-04 06:55:56,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 337 transitions, 719 flow. Second operand has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:56,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:56,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 443 [2025-03-04 06:55:56,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:56,534 INFO L124 PetriNetUnfolderBase]: 368/2470 cut-off events. [2025-03-04 06:55:56,534 INFO L125 PetriNetUnfolderBase]: For 219/220 co-relation queries the response was YES. [2025-03-04 06:55:56,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3387 conditions, 2470 events. 368/2470 cut-off events. For 219/220 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 20207 event pairs, 168 based on Foata normal form. 0/2067 useless extension candidates. Maximal degree in co-relation 3290. Up to 407 conditions per place. [2025-03-04 06:55:56,548 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 27 selfloop transitions, 2 changer transitions 0/343 dead transitions. [2025-03-04 06:55:56,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 343 transitions, 799 flow [2025-03-04 06:55:56,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:56,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:56,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2025-03-04 06:55:56,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8502633559066968 [2025-03-04 06:55:56,551 INFO L175 Difference]: Start difference. First operand has 341 places, 337 transitions, 719 flow. Second operand 3 states and 1130 transitions. [2025-03-04 06:55:56,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 343 transitions, 799 flow [2025-03-04 06:55:56,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 343 transitions, 795 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:56,554 INFO L231 Difference]: Finished difference. Result has 340 places, 336 transitions, 717 flow [2025-03-04 06:55:56,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, 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-03-04 06:55:56,555 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -75 predicate places. [2025-03-04 06:55:56,555 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 336 transitions, 717 flow [2025-03-04 06:55:56,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:56,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:56,556 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] [2025-03-04 06:55:56,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 06:55:56,556 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-03-04 06:55:56,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:56,556 INFO L85 PathProgramCache]: Analyzing trace with hash -418502177, now seen corresponding path program 1 times [2025-03-04 06:55:56,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:56,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644333114] [2025-03-04 06:55:56,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:56,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:56,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 06:55:56,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 06:55:56,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:56,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:56,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:56,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:56,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644333114] [2025-03-04 06:55:56,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644333114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:56,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:56,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:56,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845808878] [2025-03-04 06:55:56,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:56,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:56,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:56,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:56,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:56,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 443 [2025-03-04 06:55:56,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 336 transitions, 717 flow. Second operand has 3 states, 3 states have (on average 375.3333333333333) internal successors, (1126), 3 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:56,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:56,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 443 [2025-03-04 06:55:56,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:56,805 INFO L124 PetriNetUnfolderBase]: 405/1709 cut-off events. [2025-03-04 06:55:56,805 INFO L125 PetriNetUnfolderBase]: For 217/218 co-relation queries the response was YES. [2025-03-04 06:55:56,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2583 conditions, 1709 events. 405/1709 cut-off events. For 217/218 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 10800 event pairs, 129 based on Foata normal form. 0/1470 useless extension candidates. Maximal degree in co-relation 2486. Up to 367 conditions per place. [2025-03-04 06:55:56,817 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 21 selfloop transitions, 2 changer transitions 0/341 dead transitions. [2025-03-04 06:55:56,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 341 transitions, 779 flow [2025-03-04 06:55:56,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:56,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:56,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1140 transitions. [2025-03-04 06:55:56,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8577878103837472 [2025-03-04 06:55:56,820 INFO L175 Difference]: Start difference. First operand has 340 places, 336 transitions, 717 flow. Second operand 3 states and 1140 transitions. [2025-03-04 06:55:56,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 341 transitions, 779 flow [2025-03-04 06:55:56,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 341 transitions, 775 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:56,824 INFO L231 Difference]: Finished difference. Result has 339 places, 335 transitions, 715 flow [2025-03-04 06:55:56,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, 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-03-04 06:55:56,825 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -76 predicate places. [2025-03-04 06:55:56,825 INFO L471 AbstractCegarLoop]: Abstraction has has 339 places, 335 transitions, 715 flow [2025-03-04 06:55:56,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.3333333333333) internal successors, (1126), 3 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:56,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:56,825 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-03-04 06:55:56,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 06:55:56,826 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-03-04 06:55:56,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:56,826 INFO L85 PathProgramCache]: Analyzing trace with hash -2003237600, now seen corresponding path program 1 times [2025-03-04 06:55:56,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:56,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623918832] [2025-03-04 06:55:56,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:56,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:56,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-04 06:55:56,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-04 06:55:56,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:56,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:56,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:56,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:56,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623918832] [2025-03-04 06:55:56,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623918832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:56,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:56,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:56,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215644518] [2025-03-04 06:55:56,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:56,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:56,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:56,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:56,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:56,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 443 [2025-03-04 06:55:56,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 335 transitions, 715 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-03-04 06:55:56,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:56,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 443 [2025-03-04 06:55:56,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:57,119 INFO L124 PetriNetUnfolderBase]: 546/2224 cut-off events. [2025-03-04 06:55:57,119 INFO L125 PetriNetUnfolderBase]: For 237/289 co-relation queries the response was YES. [2025-03-04 06:55:57,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3349 conditions, 2224 events. 546/2224 cut-off events. For 237/289 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 16243 event pairs, 216 based on Foata normal form. 0/1897 useless extension candidates. Maximal degree in co-relation 3252. Up to 575 conditions per place. [2025-03-04 06:55:57,132 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 25 selfloop transitions, 2 changer transitions 0/341 dead transitions. [2025-03-04 06:55:57,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 341 transitions, 787 flow [2025-03-04 06:55:57,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:57,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:57,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1135 transitions. [2025-03-04 06:55:57,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8540255831452219 [2025-03-04 06:55:57,135 INFO L175 Difference]: Start difference. First operand has 339 places, 335 transitions, 715 flow. Second operand 3 states and 1135 transitions. [2025-03-04 06:55:57,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 341 transitions, 787 flow [2025-03-04 06:55:57,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 341 transitions, 783 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:57,139 INFO L231 Difference]: Finished difference. Result has 338 places, 334 transitions, 713 flow [2025-03-04 06:55:57,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=713, PETRI_PLACES=338, PETRI_TRANSITIONS=334} [2025-03-04 06:55:57,140 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -77 predicate places. [2025-03-04 06:55:57,140 INFO L471 AbstractCegarLoop]: Abstraction has has 338 places, 334 transitions, 713 flow [2025-03-04 06:55:57,140 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-03-04 06:55:57,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:57,141 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] [2025-03-04 06:55:57,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 06:55:57,141 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-03-04 06:55:57,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:57,141 INFO L85 PathProgramCache]: Analyzing trace with hash 14142689, now seen corresponding path program 1 times [2025-03-04 06:55:57,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:57,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103606082] [2025-03-04 06:55:57,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:57,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:57,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-04 06:55:57,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 06:55:57,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:57,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:57,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:57,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:57,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103606082] [2025-03-04 06:55:57,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103606082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:57,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:57,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:57,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247163149] [2025-03-04 06:55:57,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:57,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:57,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:57,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:57,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:57,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 443 [2025-03-04 06:55:57,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 334 transitions, 713 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-03-04 06:55:57,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:57,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 443 [2025-03-04 06:55:57,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:57,422 INFO L124 PetriNetUnfolderBase]: 507/1714 cut-off events. [2025-03-04 06:55:57,422 INFO L125 PetriNetUnfolderBase]: For 264/265 co-relation queries the response was YES. [2025-03-04 06:55:57,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2774 conditions, 1714 events. 507/1714 cut-off events. For 264/265 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 10605 event pairs, 187 based on Foata normal form. 0/1496 useless extension candidates. Maximal degree in co-relation 2677. Up to 520 conditions per place. [2025-03-04 06:55:57,429 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 23 selfloop transitions, 2 changer transitions 0/339 dead transitions. [2025-03-04 06:55:57,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 339 transitions, 779 flow [2025-03-04 06:55:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:57,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:57,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2025-03-04 06:55:57,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8547780285929271 [2025-03-04 06:55:57,432 INFO L175 Difference]: Start difference. First operand has 338 places, 334 transitions, 713 flow. Second operand 3 states and 1136 transitions. [2025-03-04 06:55:57,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 339 transitions, 779 flow [2025-03-04 06:55:57,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 339 transitions, 775 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:57,435 INFO L231 Difference]: Finished difference. Result has 337 places, 333 transitions, 711 flow [2025-03-04 06:55:57,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, 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=711, PETRI_PLACES=337, PETRI_TRANSITIONS=333} [2025-03-04 06:55:57,436 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -78 predicate places. [2025-03-04 06:55:57,436 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 333 transitions, 711 flow [2025-03-04 06:55:57,436 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-03-04 06:55:57,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:57,436 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:57,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 06:55:57,437 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-03-04 06:55:57,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:57,437 INFO L85 PathProgramCache]: Analyzing trace with hash -551683794, now seen corresponding path program 1 times [2025-03-04 06:55:57,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:57,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370295992] [2025-03-04 06:55:57,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:57,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:57,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-04 06:55:57,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-04 06:55:57,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:57,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:57,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:57,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:57,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370295992] [2025-03-04 06:55:57,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370295992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:57,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:57,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:57,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609954360] [2025-03-04 06:55:57,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:57,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:57,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:57,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:57,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:57,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 443 [2025-03-04 06:55:57,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 333 transitions, 711 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:57,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:57,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 443 [2025-03-04 06:55:57,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:57,699 INFO L124 PetriNetUnfolderBase]: 422/2063 cut-off events. [2025-03-04 06:55:57,700 INFO L125 PetriNetUnfolderBase]: For 199/214 co-relation queries the response was YES. [2025-03-04 06:55:57,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2977 conditions, 2063 events. 422/2063 cut-off events. For 199/214 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 15399 event pairs, 138 based on Foata normal form. 1/1830 useless extension candidates. Maximal degree in co-relation 2880. Up to 374 conditions per place. [2025-03-04 06:55:57,713 INFO L140 encePairwiseOnDemand]: 438/443 looper letters, 22 selfloop transitions, 2 changer transitions 6/338 dead transitions. [2025-03-04 06:55:57,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 338 transitions, 777 flow [2025-03-04 06:55:57,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:57,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:57,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1134 transitions. [2025-03-04 06:55:57,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8532731376975169 [2025-03-04 06:55:57,716 INFO L175 Difference]: Start difference. First operand has 337 places, 333 transitions, 711 flow. Second operand 3 states and 1134 transitions. [2025-03-04 06:55:57,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 338 transitions, 777 flow [2025-03-04 06:55:57,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 338 transitions, 773 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:57,720 INFO L231 Difference]: Finished difference. Result has 335 places, 325 transitions, 695 flow [2025-03-04 06:55:57,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=695, PETRI_PLACES=335, PETRI_TRANSITIONS=325} [2025-03-04 06:55:57,720 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -80 predicate places. [2025-03-04 06:55:57,721 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 325 transitions, 695 flow [2025-03-04 06:55:57,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:57,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:57,721 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:57,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 06:55:57,721 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-03-04 06:55:57,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:57,722 INFO L85 PathProgramCache]: Analyzing trace with hash 419545503, now seen corresponding path program 1 times [2025-03-04 06:55:57,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:57,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803058202] [2025-03-04 06:55:57,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:57,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:57,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-04 06:55:57,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-04 06:55:57,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:57,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:57,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:57,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:57,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803058202] [2025-03-04 06:55:57,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803058202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:57,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:57,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:57,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464986161] [2025-03-04 06:55:57,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:57,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:57,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:57,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:57,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:57,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 443 [2025-03-04 06:55:57,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 325 transitions, 695 flow. Second operand has 3 states, 3 states have (on average 373.0) internal successors, (1119), 3 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:57,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:57,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 443 [2025-03-04 06:55:57,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:57,978 INFO L124 PetriNetUnfolderBase]: 322/1558 cut-off events. [2025-03-04 06:55:57,978 INFO L125 PetriNetUnfolderBase]: For 160/164 co-relation queries the response was YES. [2025-03-04 06:55:57,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2283 conditions, 1558 events. 322/1558 cut-off events. For 160/164 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 10220 event pairs, 92 based on Foata normal form. 1/1419 useless extension candidates. Maximal degree in co-relation 2186. Up to 258 conditions per place. [2025-03-04 06:55:57,988 INFO L140 encePairwiseOnDemand]: 438/443 looper letters, 21 selfloop transitions, 3 changer transitions 0/329 dead transitions. [2025-03-04 06:55:57,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 329 transitions, 757 flow [2025-03-04 06:55:57,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:57,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:57,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2025-03-04 06:55:57,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8547780285929271 [2025-03-04 06:55:57,991 INFO L175 Difference]: Start difference. First operand has 335 places, 325 transitions, 695 flow. Second operand 3 states and 1136 transitions. [2025-03-04 06:55:57,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 329 transitions, 757 flow [2025-03-04 06:55:57,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 329 transitions, 753 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:57,995 INFO L231 Difference]: Finished difference. Result has 328 places, 323 transitions, 693 flow [2025-03-04 06:55:57,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=328, PETRI_TRANSITIONS=323} [2025-03-04 06:55:57,995 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -87 predicate places. [2025-03-04 06:55:57,996 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 323 transitions, 693 flow [2025-03-04 06:55:57,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.0) internal successors, (1119), 3 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:57,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:57,996 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] [2025-03-04 06:55:57,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 06:55:57,996 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-03-04 06:55:57,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:57,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1026129936, now seen corresponding path program 1 times [2025-03-04 06:55:57,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:57,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490955337] [2025-03-04 06:55:57,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:57,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:58,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-04 06:55:58,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-04 06:55:58,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:58,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:58,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:58,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:58,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490955337] [2025-03-04 06:55:58,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490955337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:58,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:58,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:58,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669876484] [2025-03-04 06:55:58,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:58,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:58,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:58,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:58,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:58,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 443 [2025-03-04 06:55:58,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 323 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 373.0) internal successors, (1119), 3 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:58,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:58,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 443 [2025-03-04 06:55:58,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:58,308 INFO L124 PetriNetUnfolderBase]: 521/2154 cut-off events. [2025-03-04 06:55:58,309 INFO L125 PetriNetUnfolderBase]: For 236/269 co-relation queries the response was YES. [2025-03-04 06:55:58,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3235 conditions, 2154 events. 521/2154 cut-off events. For 236/269 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 16072 event pairs, 204 based on Foata normal form. 0/1946 useless extension candidates. Maximal degree in co-relation 3138. Up to 527 conditions per place. [2025-03-04 06:55:58,322 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 24 selfloop transitions, 2 changer transitions 0/329 dead transitions. [2025-03-04 06:55:58,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 329 transitions, 763 flow [2025-03-04 06:55:58,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:58,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:58,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1134 transitions. [2025-03-04 06:55:58,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8532731376975169 [2025-03-04 06:55:58,324 INFO L175 Difference]: Start difference. First operand has 328 places, 323 transitions, 693 flow. Second operand 3 states and 1134 transitions. [2025-03-04 06:55:58,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 329 transitions, 763 flow [2025-03-04 06:55:58,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 329 transitions, 757 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:58,328 INFO L231 Difference]: Finished difference. Result has 327 places, 322 transitions, 689 flow [2025-03-04 06:55:58,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, 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=689, PETRI_PLACES=327, PETRI_TRANSITIONS=322} [2025-03-04 06:55:58,329 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -88 predicate places. [2025-03-04 06:55:58,329 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 322 transitions, 689 flow [2025-03-04 06:55:58,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.0) internal successors, (1119), 3 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:58,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:58,330 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] [2025-03-04 06:55:58,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 06:55:58,331 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-03-04 06:55:58,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:58,331 INFO L85 PathProgramCache]: Analyzing trace with hash 2141826749, now seen corresponding path program 1 times [2025-03-04 06:55:58,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:58,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369346704] [2025-03-04 06:55:58,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:58,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:58,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-04 06:55:58,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 06:55:58,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:58,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:58,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:58,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:58,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369346704] [2025-03-04 06:55:58,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369346704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:58,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:58,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:58,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395342487] [2025-03-04 06:55:58,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:58,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:58,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:58,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:58,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:58,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 443 [2025-03-04 06:55:58,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 322 transitions, 689 flow. Second operand has 3 states, 3 states have (on average 373.0) internal successors, (1119), 3 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:58,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:58,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 443 [2025-03-04 06:55:58,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:58,556 INFO L124 PetriNetUnfolderBase]: 353/1711 cut-off events. [2025-03-04 06:55:58,556 INFO L125 PetriNetUnfolderBase]: For 170/176 co-relation queries the response was YES. [2025-03-04 06:55:58,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2475 conditions, 1711 events. 353/1711 cut-off events. For 170/176 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 11409 event pairs, 100 based on Foata normal form. 1/1588 useless extension candidates. Maximal degree in co-relation 2378. Up to 277 conditions per place. [2025-03-04 06:55:58,565 INFO L140 encePairwiseOnDemand]: 438/443 looper letters, 20 selfloop transitions, 2 changer transitions 10/327 dead transitions. [2025-03-04 06:55:58,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 327 transitions, 753 flow [2025-03-04 06:55:58,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:58,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:58,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2025-03-04 06:55:58,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8547780285929271 [2025-03-04 06:55:58,567 INFO L175 Difference]: Start difference. First operand has 327 places, 322 transitions, 689 flow. Second operand 3 states and 1136 transitions. [2025-03-04 06:55:58,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 327 transitions, 753 flow [2025-03-04 06:55:58,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 327 transitions, 749 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:58,570 INFO L231 Difference]: Finished difference. Result has 325 places, 310 transitions, 664 flow [2025-03-04 06:55:58,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=325, PETRI_TRANSITIONS=310} [2025-03-04 06:55:58,571 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -90 predicate places. [2025-03-04 06:55:58,571 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 310 transitions, 664 flow [2025-03-04 06:55:58,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.0) internal successors, (1119), 3 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:58,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:58,571 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-03-04 06:55:58,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 06:55:58,572 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-03-04 06:55:58,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:58,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1665843138, now seen corresponding path program 1 times [2025-03-04 06:55:58,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:58,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528792784] [2025-03-04 06:55:58,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:58,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:58,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-04 06:55:58,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 06:55:58,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:58,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:58,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:58,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:58,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528792784] [2025-03-04 06:55:58,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528792784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:58,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:58,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:58,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473462562] [2025-03-04 06:55:58,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:58,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:58,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:58,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:58,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:58,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 443 [2025-03-04 06:55:58,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 310 transitions, 664 flow. Second operand has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:58,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:58,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 443 [2025-03-04 06:55:58,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:58,778 INFO L124 PetriNetUnfolderBase]: 366/1565 cut-off events. [2025-03-04 06:55:58,779 INFO L125 PetriNetUnfolderBase]: For 183/186 co-relation queries the response was YES. [2025-03-04 06:55:58,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2394 conditions, 1565 events. 366/1565 cut-off events. For 183/186 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 9946 event pairs, 139 based on Foata normal form. 0/1444 useless extension candidates. Maximal degree in co-relation 2297. Up to 386 conditions per place. [2025-03-04 06:55:58,787 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 21 selfloop transitions, 2 changer transitions 0/315 dead transitions. [2025-03-04 06:55:58,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 315 transitions, 726 flow [2025-03-04 06:55:58,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:58,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:58,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1134 transitions. [2025-03-04 06:55:58,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8532731376975169 [2025-03-04 06:55:58,790 INFO L175 Difference]: Start difference. First operand has 325 places, 310 transitions, 664 flow. Second operand 3 states and 1134 transitions. [2025-03-04 06:55:58,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 315 transitions, 726 flow [2025-03-04 06:55:58,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 315 transitions, 722 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:58,793 INFO L231 Difference]: Finished difference. Result has 314 places, 309 transitions, 662 flow [2025-03-04 06:55:58,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=314, PETRI_TRANSITIONS=309} [2025-03-04 06:55:58,794 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -101 predicate places. [2025-03-04 06:55:58,794 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 309 transitions, 662 flow [2025-03-04 06:55:58,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:58,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:58,795 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] [2025-03-04 06:55:58,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 06:55:58,795 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-03-04 06:55:58,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:58,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1746847936, now seen corresponding path program 1 times [2025-03-04 06:55:58,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:58,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096670846] [2025-03-04 06:55:58,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:58,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:58,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-04 06:55:58,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 06:55:58,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:58,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:58,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:58,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:58,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096670846] [2025-03-04 06:55:58,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096670846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:58,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:58,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:58,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989861246] [2025-03-04 06:55:58,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:58,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:58,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:58,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:58,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:58,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 443 [2025-03-04 06:55:58,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 309 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:58,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:58,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 443 [2025-03-04 06:55:58,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:59,021 INFO L124 PetriNetUnfolderBase]: 420/1879 cut-off events. [2025-03-04 06:55:59,021 INFO L125 PetriNetUnfolderBase]: For 203/213 co-relation queries the response was YES. [2025-03-04 06:55:59,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2801 conditions, 1879 events. 420/1879 cut-off events. For 203/213 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 12909 event pairs, 158 based on Foata normal form. 0/1753 useless extension candidates. Maximal degree in co-relation 2704. Up to 429 conditions per place. [2025-03-04 06:55:59,028 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 0 selfloop transitions, 0 changer transitions 315/315 dead transitions. [2025-03-04 06:55:59,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 315 transitions, 728 flow [2025-03-04 06:55:59,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:59,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:59,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1135 transitions. [2025-03-04 06:55:59,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8540255831452219 [2025-03-04 06:55:59,030 INFO L175 Difference]: Start difference. First operand has 314 places, 309 transitions, 662 flow. Second operand 3 states and 1135 transitions. [2025-03-04 06:55:59,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 315 transitions, 728 flow [2025-03-04 06:55:59,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 315 transitions, 724 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:59,053 INFO L231 Difference]: Finished difference. Result has 313 places, 0 transitions, 0 flow [2025-03-04 06:55:59,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=313, PETRI_TRANSITIONS=0} [2025-03-04 06:55:59,054 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -102 predicate places. [2025-03-04 06:55:59,054 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 0 transitions, 0 flow [2025-03-04 06:55:59,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:59,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (151 of 152 remaining) [2025-03-04 06:55:59,057 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (150 of 152 remaining) [2025-03-04 06:55:59,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (149 of 152 remaining) [2025-03-04 06:55:59,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (148 of 152 remaining) [2025-03-04 06:55:59,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (147 of 152 remaining) [2025-03-04 06:55:59,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (146 of 152 remaining) [2025-03-04 06:55:59,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (145 of 152 remaining) [2025-03-04 06:55:59,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (144 of 152 remaining) [2025-03-04 06:55:59,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (143 of 152 remaining) [2025-03-04 06:55:59,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (142 of 152 remaining) [2025-03-04 06:55:59,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (141 of 152 remaining) [2025-03-04 06:55:59,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (140 of 152 remaining) [2025-03-04 06:55:59,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (139 of 152 remaining) [2025-03-04 06:55:59,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (138 of 152 remaining) [2025-03-04 06:55:59,059 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (137 of 152 remaining) [2025-03-04 06:55:59,059 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (136 of 152 remaining) [2025-03-04 06:55:59,059 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (135 of 152 remaining) [2025-03-04 06:55:59,059 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (134 of 152 remaining) [2025-03-04 06:55:59,059 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (133 of 152 remaining) [2025-03-04 06:55:59,059 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (132 of 152 remaining) [2025-03-04 06:55:59,059 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (131 of 152 remaining) [2025-03-04 06:55:59,059 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (130 of 152 remaining) [2025-03-04 06:55:59,059 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (129 of 152 remaining) [2025-03-04 06:55:59,059 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (128 of 152 remaining) [2025-03-04 06:55:59,059 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (127 of 152 remaining) [2025-03-04 06:55:59,059 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (126 of 152 remaining) [2025-03-04 06:55:59,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (125 of 152 remaining) [2025-03-04 06:55:59,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (124 of 152 remaining) [2025-03-04 06:55:59,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (123 of 152 remaining) [2025-03-04 06:55:59,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (122 of 152 remaining) [2025-03-04 06:55:59,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (121 of 152 remaining) [2025-03-04 06:55:59,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (120 of 152 remaining) [2025-03-04 06:55:59,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (119 of 152 remaining) [2025-03-04 06:55:59,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (118 of 152 remaining) [2025-03-04 06:55:59,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (117 of 152 remaining) [2025-03-04 06:55:59,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (116 of 152 remaining) [2025-03-04 06:55:59,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (115 of 152 remaining) [2025-03-04 06:55:59,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (114 of 152 remaining) [2025-03-04 06:55:59,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (113 of 152 remaining) [2025-03-04 06:55:59,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (112 of 152 remaining) [2025-03-04 06:55:59,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (111 of 152 remaining) [2025-03-04 06:55:59,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (110 of 152 remaining) [2025-03-04 06:55:59,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (109 of 152 remaining) [2025-03-04 06:55:59,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (108 of 152 remaining) [2025-03-04 06:55:59,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (107 of 152 remaining) [2025-03-04 06:55:59,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (106 of 152 remaining) [2025-03-04 06:55:59,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (105 of 152 remaining) [2025-03-04 06:55:59,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (104 of 152 remaining) [2025-03-04 06:55:59,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (103 of 152 remaining) [2025-03-04 06:55:59,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (102 of 152 remaining) [2025-03-04 06:55:59,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (101 of 152 remaining) [2025-03-04 06:55:59,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (100 of 152 remaining) [2025-03-04 06:55:59,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (99 of 152 remaining) [2025-03-04 06:55:59,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (98 of 152 remaining) [2025-03-04 06:55:59,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (97 of 152 remaining) [2025-03-04 06:55:59,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (96 of 152 remaining) [2025-03-04 06:55:59,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (95 of 152 remaining) [2025-03-04 06:55:59,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (94 of 152 remaining) [2025-03-04 06:55:59,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (93 of 152 remaining) [2025-03-04 06:55:59,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (92 of 152 remaining) [2025-03-04 06:55:59,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (91 of 152 remaining) [2025-03-04 06:55:59,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (90 of 152 remaining) [2025-03-04 06:55:59,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (89 of 152 remaining) [2025-03-04 06:55:59,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (88 of 152 remaining) [2025-03-04 06:55:59,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (87 of 152 remaining) [2025-03-04 06:55:59,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (86 of 152 remaining) [2025-03-04 06:55:59,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (85 of 152 remaining) [2025-03-04 06:55:59,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (84 of 152 remaining) [2025-03-04 06:55:59,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (83 of 152 remaining) [2025-03-04 06:55:59,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (82 of 152 remaining) [2025-03-04 06:55:59,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (81 of 152 remaining) [2025-03-04 06:55:59,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (80 of 152 remaining) [2025-03-04 06:55:59,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (79 of 152 remaining) [2025-03-04 06:55:59,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (78 of 152 remaining) [2025-03-04 06:55:59,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (77 of 152 remaining) [2025-03-04 06:55:59,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (76 of 152 remaining) [2025-03-04 06:55:59,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (75 of 152 remaining) [2025-03-04 06:55:59,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (74 of 152 remaining) [2025-03-04 06:55:59,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (73 of 152 remaining) [2025-03-04 06:55:59,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (72 of 152 remaining) [2025-03-04 06:55:59,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (71 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (70 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (69 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (68 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (67 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (66 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (65 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (64 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (63 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (62 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (61 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (60 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (59 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (58 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (57 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (56 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (55 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (54 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (53 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (52 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (51 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (50 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (49 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (48 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (47 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (46 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (45 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (44 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (43 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (42 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (41 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (40 of 152 remaining) [2025-03-04 06:55:59,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (39 of 152 remaining) [2025-03-04 06:55:59,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (38 of 152 remaining) [2025-03-04 06:55:59,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (37 of 152 remaining) [2025-03-04 06:55:59,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (36 of 152 remaining) [2025-03-04 06:55:59,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (35 of 152 remaining) [2025-03-04 06:55:59,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (34 of 152 remaining) [2025-03-04 06:55:59,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (33 of 152 remaining) [2025-03-04 06:55:59,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (32 of 152 remaining) [2025-03-04 06:55:59,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (31 of 152 remaining) [2025-03-04 06:55:59,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (30 of 152 remaining) [2025-03-04 06:55:59,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (29 of 152 remaining) [2025-03-04 06:55:59,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (28 of 152 remaining) [2025-03-04 06:55:59,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (27 of 152 remaining) [2025-03-04 06:55:59,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (26 of 152 remaining) [2025-03-04 06:55:59,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (25 of 152 remaining) [2025-03-04 06:55:59,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (24 of 152 remaining) [2025-03-04 06:55:59,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (23 of 152 remaining) [2025-03-04 06:55:59,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (22 of 152 remaining) [2025-03-04 06:55:59,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (21 of 152 remaining) [2025-03-04 06:55:59,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 152 remaining) [2025-03-04 06:55:59,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (19 of 152 remaining) [2025-03-04 06:55:59,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (18 of 152 remaining) [2025-03-04 06:55:59,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (17 of 152 remaining) [2025-03-04 06:55:59,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (16 of 152 remaining) [2025-03-04 06:55:59,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (15 of 152 remaining) [2025-03-04 06:55:59,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (14 of 152 remaining) [2025-03-04 06:55:59,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (13 of 152 remaining) [2025-03-04 06:55:59,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (12 of 152 remaining) [2025-03-04 06:55:59,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (11 of 152 remaining) [2025-03-04 06:55:59,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 152 remaining) [2025-03-04 06:55:59,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 152 remaining) [2025-03-04 06:55:59,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 152 remaining) [2025-03-04 06:55:59,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 152 remaining) [2025-03-04 06:55:59,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 152 remaining) [2025-03-04 06:55:59,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 152 remaining) [2025-03-04 06:55:59,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 152 remaining) [2025-03-04 06:55:59,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 152 remaining) [2025-03-04 06:55:59,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 152 remaining) [2025-03-04 06:55:59,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 152 remaining) [2025-03-04 06:55:59,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 152 remaining) [2025-03-04 06:55:59,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 06:55:59,067 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-03-04 06:55:59,073 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:55:59,073 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:55:59,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:55:59 BasicIcfg [2025-03-04 06:55:59,079 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:55:59,080 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:55:59,080 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:55:59,080 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:55:59,080 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:55:50" (3/4) ... [2025-03-04 06:55:59,082 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:55:59,083 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 06:55:59,084 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 06:55:59,084 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 06:55:59,090 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-03-04 06:55:59,090 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 06:55:59,091 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 06:55:59,091 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:55:59,162 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:55:59,163 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:55:59,163 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:55:59,164 INFO L158 Benchmark]: Toolchain (without parser) took 9978.34ms. Allocated memory was 142.6MB in the beginning and 645.9MB in the end (delta: 503.3MB). Free memory was 109.6MB in the beginning and 575.5MB in the end (delta: -466.0MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2025-03-04 06:55:59,164 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory was 126.9MB in the beginning and 126.6MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:55:59,165 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.98ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 96.2MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 06:55:59,165 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.16ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 93.0MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:55:59,167 INFO L158 Benchmark]: Boogie Preprocessor took 31.68ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 89.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:55:59,167 INFO L158 Benchmark]: IcfgBuilder took 998.74ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 52.6MB in the end (delta: 37.3MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. [2025-03-04 06:55:59,168 INFO L158 Benchmark]: TraceAbstraction took 8584.13ms. Allocated memory was 142.6MB in the beginning and 645.9MB in the end (delta: 503.3MB). Free memory was 51.9MB in the beginning and 583.9MB in the end (delta: -532.0MB). Peak memory consumption was 342.2MB. Max. memory is 16.1GB. [2025-03-04 06:55:59,168 INFO L158 Benchmark]: Witness Printer took 82.97ms. Allocated memory is still 645.9MB. Free memory was 583.9MB in the beginning and 575.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:55:59,169 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.20ms. Allocated memory is still 201.3MB. Free memory was 126.9MB in the beginning and 126.6MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.98ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 96.2MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.16ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 93.0MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.68ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 89.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 998.74ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 52.6MB in the end (delta: 37.3MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8584.13ms. Allocated memory was 142.6MB in the beginning and 645.9MB in the end (delta: 503.3MB). Free memory was 51.9MB in the beginning and 583.9MB in the end (delta: -532.0MB). Peak memory consumption was 342.2MB. Max. memory is 16.1GB. * Witness Printer took 82.97ms. Allocated memory is still 645.9MB. Free memory was 583.9MB in the beginning and 575.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, 583 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: 8.4s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 741 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 301 mSDsluCounter, 151 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1296 IncrementalHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 151 mSDtfsCounter, 1296 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=856occurred 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.4s InterpolantComputationTime, 3998 NumberOfCodeBlocks, 3998 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 3968 ConstructedInterpolants, 0 QuantifiedInterpolants, 4141 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-03-04 06:55:59,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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