./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed 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/chl-chromosome-trans.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 f36f5593156fc25b34b4c706b0d898a2d66ee8bab5f6d91cd69ff9cf3c129193 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:04:33,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:04:33,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:04:33,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:04:33,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:04:33,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:04:33,275 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:04:33,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:04:33,276 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:04:33,276 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:04:33,277 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:04:33,277 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:04:33,277 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:04:33,277 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:04:33,278 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:04:33,278 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:04:33,278 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:04:33,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:04:33,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:04:33,278 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:04:33,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:04:33,278 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:04:33,279 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:04:33,279 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:04:33,279 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:04:33,279 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:04:33,279 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:04:33,279 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:04:33,279 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:04:33,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:04:33,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:04:33,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:04:33,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:04:33,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:04:33,280 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:04:33,280 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:04:33,280 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:04:33,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:04:33,280 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:04:33,280 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:04:33,280 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:04:33,280 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:04:33,281 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 -> f36f5593156fc25b34b4c706b0d898a2d66ee8bab5f6d91cd69ff9cf3c129193 [2025-03-08 22:04:33,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:04:33,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:04:33,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:04:33,501 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:04:33,501 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:04:33,502 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c [2025-03-08 22:04:34,611 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a9b30ac2/eb6c3312621744b4b9f919ef3ba8a9e6/FLAGa200b05cf [2025-03-08 22:04:34,809 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:04:34,810 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c [2025-03-08 22:04:34,815 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a9b30ac2/eb6c3312621744b4b9f919ef3ba8a9e6/FLAGa200b05cf [2025-03-08 22:04:35,176 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a9b30ac2/eb6c3312621744b4b9f919ef3ba8a9e6 [2025-03-08 22:04:35,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:04:35,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:04:35,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:04:35,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:04:35,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:04:35,182 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:04:35" (1/1) ... [2025-03-08 22:04:35,183 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@603b5e72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:35, skipping insertion in model container [2025-03-08 22:04:35,183 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:04:35" (1/1) ... [2025-03-08 22:04:35,193 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:04:35,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:04:35,347 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:04:35,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:04:35,395 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:04:35,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:35 WrapperNode [2025-03-08 22:04:35,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:04:35,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:04:35,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:04:35,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:04:35,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:35" (1/1) ... [2025-03-08 22:04:35,409 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:35" (1/1) ... [2025-03-08 22:04:35,444 INFO L138 Inliner]: procedures = 25, calls = 32, calls flagged for inlining = 17, calls inlined = 25, statements flattened = 424 [2025-03-08 22:04:35,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:04:35,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:04:35,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:04:35,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:04:35,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:35" (1/1) ... [2025-03-08 22:04:35,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:35" (1/1) ... [2025-03-08 22:04:35,461 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:35" (1/1) ... [2025-03-08 22:04:35,462 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:35" (1/1) ... [2025-03-08 22:04:35,471 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:35" (1/1) ... [2025-03-08 22:04:35,472 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:35" (1/1) ... [2025-03-08 22:04:35,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:35" (1/1) ... [2025-03-08 22:04:35,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:35" (1/1) ... [2025-03-08 22:04:35,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:04:35,481 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:04:35,481 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:04:35,481 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:04:35,482 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:35" (1/1) ... [2025-03-08 22:04:35,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:04:35,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:04:35,520 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-08 22:04:35,525 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-08 22:04:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:04:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 22:04:35,540 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 22:04:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 22:04:35,540 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 22:04:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 22:04:35,540 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 22:04:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:04:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:04:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:04:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:04:35,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:04:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:04:35,542 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:04:35,627 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:04:35,629 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:04:36,176 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:04:36,176 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:04:36,197 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:04:36,200 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:04:36,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:04:36 BoogieIcfgContainer [2025-03-08 22:04:36,201 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:04:36,203 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:04:36,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:04:36,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:04:36,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:04:35" (1/3) ... [2025-03-08 22:04:36,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615296b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:04:36, skipping insertion in model container [2025-03-08 22:04:36,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:35" (2/3) ... [2025-03-08 22:04:36,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615296b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:04:36, skipping insertion in model container [2025-03-08 22:04:36,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:04:36" (3/3) ... [2025-03-08 22:04:36,209 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-trans.wvr.c [2025-03-08 22:04:36,220 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:04:36,221 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-trans.wvr.c that has 4 procedures, 548 locations, 1 initial locations, 6 loop locations, and 45 error locations. [2025-03-08 22:04:36,222 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:04:36,353 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 22:04:36,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 557 places, 574 transitions, 1169 flow [2025-03-08 22:04:36,550 INFO L124 PetriNetUnfolderBase]: 27/571 cut-off events. [2025-03-08 22:04:36,551 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 22:04:36,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 571 events. 27/571 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1280 event pairs, 0 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 431. Up to 2 conditions per place. [2025-03-08 22:04:36,562 INFO L82 GeneralOperation]: Start removeDead. Operand has 557 places, 574 transitions, 1169 flow [2025-03-08 22:04:36,572 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 535 places, 550 transitions, 1118 flow [2025-03-08 22:04:36,582 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:04:36,593 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;@4573d171, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:04:36,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 81 error locations. [2025-03-08 22:04:36,602 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:04:36,602 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2025-03-08 22:04:36,602 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:04:36,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:36,603 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] [2025-03-08 22:04:36,604 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:36,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:36,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1829140298, now seen corresponding path program 1 times [2025-03-08 22:04:36,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:36,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292557308] [2025-03-08 22:04:36,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:36,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:36,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 22:04:36,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 22:04:36,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:36,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:37,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:04:37,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:37,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292557308] [2025-03-08 22:04:37,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292557308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:37,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:37,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:04:37,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543727057] [2025-03-08 22:04:37,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:37,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:04:37,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:37,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:04:37,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:04:37,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 574 [2025-03-08 22:04:37,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 550 transitions, 1118 flow. Second operand has 6 states, 6 states have (on average 486.5) internal successors, (2919), 6 states have internal predecessors, (2919), 0 states have call successors, (0), 0 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-08 22:04:37,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:37,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 574 [2025-03-08 22:04:37,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:39,757 INFO L124 PetriNetUnfolderBase]: 2075/15242 cut-off events. [2025-03-08 22:04:39,758 INFO L125 PetriNetUnfolderBase]: For 631/633 co-relation queries the response was YES. [2025-03-08 22:04:39,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18445 conditions, 15242 events. 2075/15242 cut-off events. For 631/633 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 185103 event pairs, 1520 based on Foata normal form. 641/13502 useless extension candidates. Maximal degree in co-relation 16217. Up to 2820 conditions per place. [2025-03-08 22:04:39,893 INFO L140 encePairwiseOnDemand]: 541/574 looper letters, 54 selfloop transitions, 15 changer transitions 6/532 dead transitions. [2025-03-08 22:04:39,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 532 transitions, 1220 flow [2025-03-08 22:04:39,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:04:39,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:04:39,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2997 transitions. [2025-03-08 22:04:39,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8702090592334495 [2025-03-08 22:04:39,915 INFO L175 Difference]: Start difference. First operand has 535 places, 550 transitions, 1118 flow. Second operand 6 states and 2997 transitions. [2025-03-08 22:04:39,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 532 transitions, 1220 flow [2025-03-08 22:04:39,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 531 places, 532 transitions, 1208 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 22:04:39,937 INFO L231 Difference]: Finished difference. Result has 531 places, 526 transitions, 1088 flow [2025-03-08 22:04:39,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=526, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1088, PETRI_PLACES=531, PETRI_TRANSITIONS=526} [2025-03-08 22:04:39,944 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -4 predicate places. [2025-03-08 22:04:39,944 INFO L471 AbstractCegarLoop]: Abstraction has has 531 places, 526 transitions, 1088 flow [2025-03-08 22:04:39,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 486.5) internal successors, (2919), 6 states have internal predecessors, (2919), 0 states have call successors, (0), 0 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-08 22:04:39,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:39,947 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] [2025-03-08 22:04:39,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:04:39,947 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:39,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:39,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1233924963, now seen corresponding path program 1 times [2025-03-08 22:04:39,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:39,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818570632] [2025-03-08 22:04:39,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:39,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:39,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 22:04:39,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 22:04:39,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:39,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:39,989 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-08 22:04:39,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:39,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818570632] [2025-03-08 22:04:39,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818570632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:39,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:39,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:39,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430768158] [2025-03-08 22:04:39,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:39,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:39,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:39,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:39,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:40,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 574 [2025-03-08 22:04:40,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 526 transitions, 1088 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 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-08 22:04:40,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:40,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 574 [2025-03-08 22:04:40,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:40,106 INFO L124 PetriNetUnfolderBase]: 19/741 cut-off events. [2025-03-08 22:04:40,107 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-08 22:04:40,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 787 conditions, 741 events. 19/741 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2705 event pairs, 5 based on Foata normal form. 0/648 useless extension candidates. Maximal degree in co-relation 739. Up to 22 conditions per place. [2025-03-08 22:04:40,115 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 11 selfloop transitions, 2 changer transitions 0/525 dead transitions. [2025-03-08 22:04:40,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 525 transitions, 1112 flow [2025-03-08 22:04:40,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:40,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:40,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-03-08 22:04:40,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-03-08 22:04:40,119 INFO L175 Difference]: Start difference. First operand has 531 places, 526 transitions, 1088 flow. Second operand 3 states and 1640 transitions. [2025-03-08 22:04:40,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 525 transitions, 1112 flow [2025-03-08 22:04:40,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 521 places, 525 transitions, 1082 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:04:40,127 INFO L231 Difference]: Finished difference. Result has 521 places, 525 transitions, 1060 flow [2025-03-08 22:04:40,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1060, PETRI_PLACES=521, PETRI_TRANSITIONS=525} [2025-03-08 22:04:40,128 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -14 predicate places. [2025-03-08 22:04:40,128 INFO L471 AbstractCegarLoop]: Abstraction has has 521 places, 525 transitions, 1060 flow [2025-03-08 22:04:40,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 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-08 22:04:40,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:40,129 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-08 22:04:40,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:04:40,129 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:40,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:40,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1149260577, now seen corresponding path program 1 times [2025-03-08 22:04:40,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:40,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245269089] [2025-03-08 22:04:40,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:40,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:40,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 22:04:40,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 22:04:40,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:40,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:40,181 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-08 22:04:40,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:40,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245269089] [2025-03-08 22:04:40,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245269089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:40,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:40,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:40,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405063638] [2025-03-08 22:04:40,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:40,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:40,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:40,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:40,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:40,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 574 [2025-03-08 22:04:40,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 525 transitions, 1060 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 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-08 22:04:40,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:40,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 574 [2025-03-08 22:04:40,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:40,359 INFO L124 PetriNetUnfolderBase]: 25/947 cut-off events. [2025-03-08 22:04:40,359 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-03-08 22:04:40,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 985 conditions, 947 events. 25/947 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3861 event pairs, 7 based on Foata normal form. 0/820 useless extension candidates. Maximal degree in co-relation 912. Up to 25 conditions per place. [2025-03-08 22:04:40,370 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 11 selfloop transitions, 2 changer transitions 0/524 dead transitions. [2025-03-08 22:04:40,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 524 transitions, 1084 flow [2025-03-08 22:04:40,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:40,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:40,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-03-08 22:04:40,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-03-08 22:04:40,374 INFO L175 Difference]: Start difference. First operand has 521 places, 525 transitions, 1060 flow. Second operand 3 states and 1640 transitions. [2025-03-08 22:04:40,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 522 places, 524 transitions, 1084 flow [2025-03-08 22:04:40,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 524 transitions, 1080 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:40,381 INFO L231 Difference]: Finished difference. Result has 520 places, 524 transitions, 1058 flow [2025-03-08 22:04:40,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=518, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1058, PETRI_PLACES=520, PETRI_TRANSITIONS=524} [2025-03-08 22:04:40,382 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -15 predicate places. [2025-03-08 22:04:40,383 INFO L471 AbstractCegarLoop]: Abstraction has has 520 places, 524 transitions, 1058 flow [2025-03-08 22:04:40,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 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-08 22:04:40,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:40,384 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:40,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:04:40,384 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:40,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:40,385 INFO L85 PathProgramCache]: Analyzing trace with hash 958076376, now seen corresponding path program 1 times [2025-03-08 22:04:40,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:40,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193584809] [2025-03-08 22:04:40,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:40,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:40,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 22:04:40,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 22:04:40,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:40,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:40,445 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-08 22:04:40,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:40,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193584809] [2025-03-08 22:04:40,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193584809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:40,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:40,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:40,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299792597] [2025-03-08 22:04:40,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:40,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:40,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:40,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:40,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:40,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 574 [2025-03-08 22:04:40,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 524 transitions, 1058 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 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-08 22:04:40,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:40,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 574 [2025-03-08 22:04:40,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:40,560 INFO L124 PetriNetUnfolderBase]: 19/637 cut-off events. [2025-03-08 22:04:40,560 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-03-08 22:04:40,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 637 events. 19/637 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2041 event pairs, 7 based on Foata normal form. 0/563 useless extension candidates. Maximal degree in co-relation 552. Up to 25 conditions per place. [2025-03-08 22:04:40,564 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 11 selfloop transitions, 2 changer transitions 0/523 dead transitions. [2025-03-08 22:04:40,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 523 transitions, 1082 flow [2025-03-08 22:04:40,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:40,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:40,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-03-08 22:04:40,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-03-08 22:04:40,567 INFO L175 Difference]: Start difference. First operand has 520 places, 524 transitions, 1058 flow. Second operand 3 states and 1640 transitions. [2025-03-08 22:04:40,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 523 transitions, 1082 flow [2025-03-08 22:04:40,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 523 transitions, 1078 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:40,572 INFO L231 Difference]: Finished difference. Result has 519 places, 523 transitions, 1056 flow [2025-03-08 22:04:40,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1056, PETRI_PLACES=519, PETRI_TRANSITIONS=523} [2025-03-08 22:04:40,573 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -16 predicate places. [2025-03-08 22:04:40,573 INFO L471 AbstractCegarLoop]: Abstraction has has 519 places, 523 transitions, 1056 flow [2025-03-08 22:04:40,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 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-08 22:04:40,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:40,574 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:40,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:04:40,575 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:40,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:40,575 INFO L85 PathProgramCache]: Analyzing trace with hash -954992240, now seen corresponding path program 1 times [2025-03-08 22:04:40,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:40,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338391508] [2025-03-08 22:04:40,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:40,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:40,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 22:04:40,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 22:04:40,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:40,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:40,609 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-08 22:04:40,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:40,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338391508] [2025-03-08 22:04:40,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338391508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:40,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:40,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:40,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593575089] [2025-03-08 22:04:40,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:40,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:40,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:40,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:40,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:40,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 574 [2025-03-08 22:04:40,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 523 transitions, 1056 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 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-08 22:04:40,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:40,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 574 [2025-03-08 22:04:40,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:40,700 INFO L124 PetriNetUnfolderBase]: 21/826 cut-off events. [2025-03-08 22:04:40,701 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 22:04:40,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 859 conditions, 826 events. 21/826 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3388 event pairs, 5 based on Foata normal form. 0/720 useless extension candidates. Maximal degree in co-relation 692. Up to 22 conditions per place. [2025-03-08 22:04:40,708 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 11 selfloop transitions, 2 changer transitions 0/522 dead transitions. [2025-03-08 22:04:40,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 522 transitions, 1080 flow [2025-03-08 22:04:40,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:40,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:40,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-03-08 22:04:40,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-03-08 22:04:40,711 INFO L175 Difference]: Start difference. First operand has 519 places, 523 transitions, 1056 flow. Second operand 3 states and 1640 transitions. [2025-03-08 22:04:40,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 522 transitions, 1080 flow [2025-03-08 22:04:40,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 518 places, 522 transitions, 1076 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:40,718 INFO L231 Difference]: Finished difference. Result has 518 places, 522 transitions, 1054 flow [2025-03-08 22:04:40,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1054, PETRI_PLACES=518, PETRI_TRANSITIONS=522} [2025-03-08 22:04:40,720 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -17 predicate places. [2025-03-08 22:04:40,720 INFO L471 AbstractCegarLoop]: Abstraction has has 518 places, 522 transitions, 1054 flow [2025-03-08 22:04:40,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 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-08 22:04:40,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:40,722 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] [2025-03-08 22:04:40,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:04:40,722 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:40,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:40,723 INFO L85 PathProgramCache]: Analyzing trace with hash -937154319, now seen corresponding path program 1 times [2025-03-08 22:04:40,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:40,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034643056] [2025-03-08 22:04:40,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:40,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:40,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 22:04:40,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 22:04:40,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:40,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:40,765 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-08 22:04:40,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:40,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034643056] [2025-03-08 22:04:40,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034643056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:40,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:40,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:40,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586045380] [2025-03-08 22:04:40,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:40,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:40,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:40,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:40,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:40,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 574 [2025-03-08 22:04:40,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 522 transitions, 1054 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 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-08 22:04:40,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:40,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 574 [2025-03-08 22:04:40,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:40,887 INFO L124 PetriNetUnfolderBase]: 27/1034 cut-off events. [2025-03-08 22:04:40,887 INFO L125 PetriNetUnfolderBase]: For 3/6 co-relation queries the response was YES. [2025-03-08 22:04:40,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1072 conditions, 1034 events. 27/1034 cut-off events. For 3/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4725 event pairs, 7 based on Foata normal form. 0/894 useless extension candidates. Maximal degree in co-relation 897. Up to 25 conditions per place. [2025-03-08 22:04:40,898 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 11 selfloop transitions, 2 changer transitions 0/521 dead transitions. [2025-03-08 22:04:40,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 521 transitions, 1078 flow [2025-03-08 22:04:40,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:40,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:40,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-03-08 22:04:40,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-03-08 22:04:40,902 INFO L175 Difference]: Start difference. First operand has 518 places, 522 transitions, 1054 flow. Second operand 3 states and 1640 transitions. [2025-03-08 22:04:40,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 521 transitions, 1078 flow [2025-03-08 22:04:40,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 521 transitions, 1074 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:40,908 INFO L231 Difference]: Finished difference. Result has 517 places, 521 transitions, 1052 flow [2025-03-08 22:04:40,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1052, PETRI_PLACES=517, PETRI_TRANSITIONS=521} [2025-03-08 22:04:40,910 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -18 predicate places. [2025-03-08 22:04:40,910 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 521 transitions, 1052 flow [2025-03-08 22:04:40,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 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-08 22:04:40,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:40,911 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] [2025-03-08 22:04:40,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:04:40,911 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:40,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:40,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1300924044, now seen corresponding path program 1 times [2025-03-08 22:04:40,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:40,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532219282] [2025-03-08 22:04:40,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:40,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:40,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 22:04:40,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 22:04:40,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:40,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:40,960 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-08 22:04:40,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:40,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532219282] [2025-03-08 22:04:40,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532219282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:40,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:40,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:40,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706872756] [2025-03-08 22:04:40,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:40,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:40,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:40,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:40,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:40,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 574 [2025-03-08 22:04:40,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 521 transitions, 1052 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 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-08 22:04:40,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:40,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 574 [2025-03-08 22:04:40,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:41,051 INFO L124 PetriNetUnfolderBase]: 25/898 cut-off events. [2025-03-08 22:04:41,051 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-03-08 22:04:41,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 898 events. 25/898 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3243 event pairs, 7 based on Foata normal form. 0/783 useless extension candidates. Maximal degree in co-relation 750. Up to 25 conditions per place. [2025-03-08 22:04:41,060 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 11 selfloop transitions, 2 changer transitions 0/520 dead transitions. [2025-03-08 22:04:41,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 520 transitions, 1076 flow [2025-03-08 22:04:41,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:41,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:41,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-03-08 22:04:41,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-03-08 22:04:41,064 INFO L175 Difference]: Start difference. First operand has 517 places, 521 transitions, 1052 flow. Second operand 3 states and 1640 transitions. [2025-03-08 22:04:41,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 520 transitions, 1076 flow [2025-03-08 22:04:41,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 520 transitions, 1072 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:41,069 INFO L231 Difference]: Finished difference. Result has 516 places, 520 transitions, 1050 flow [2025-03-08 22:04:41,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1050, PETRI_PLACES=516, PETRI_TRANSITIONS=520} [2025-03-08 22:04:41,071 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -19 predicate places. [2025-03-08 22:04:41,071 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 520 transitions, 1050 flow [2025-03-08 22:04:41,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 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-08 22:04:41,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:41,073 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] [2025-03-08 22:04:41,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:04:41,073 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:41,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:41,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1130005336, now seen corresponding path program 1 times [2025-03-08 22:04:41,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:41,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80165376] [2025-03-08 22:04:41,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:41,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:41,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 22:04:41,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 22:04:41,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:41,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:41,128 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-08 22:04:41,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:41,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80165376] [2025-03-08 22:04:41,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80165376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:41,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:41,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:41,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717597769] [2025-03-08 22:04:41,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:41,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:41,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:41,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:41,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:41,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 574 [2025-03-08 22:04:41,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 520 transitions, 1050 flow. Second operand has 3 states, 3 states have (on average 545.3333333333334) internal successors, (1636), 3 states have internal predecessors, (1636), 0 states have call successors, (0), 0 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-08 22:04:41,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:41,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 574 [2025-03-08 22:04:41,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:41,281 INFO L124 PetriNetUnfolderBase]: 36/1226 cut-off events. [2025-03-08 22:04:41,281 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:04:41,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1273 conditions, 1226 events. 36/1226 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6567 event pairs, 8 based on Foata normal form. 0/1064 useless extension candidates. Maximal degree in co-relation 1082. Up to 31 conditions per place. [2025-03-08 22:04:41,287 INFO L140 encePairwiseOnDemand]: 570/574 looper letters, 13 selfloop transitions, 2 changer transitions 0/522 dead transitions. [2025-03-08 22:04:41,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 522 transitions, 1086 flow [2025-03-08 22:04:41,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:41,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1649 transitions. [2025-03-08 22:04:41,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9576074332171893 [2025-03-08 22:04:41,290 INFO L175 Difference]: Start difference. First operand has 516 places, 520 transitions, 1050 flow. Second operand 3 states and 1649 transitions. [2025-03-08 22:04:41,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 522 transitions, 1086 flow [2025-03-08 22:04:41,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 522 transitions, 1082 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:41,297 INFO L231 Difference]: Finished difference. Result has 515 places, 520 transitions, 1056 flow [2025-03-08 22:04:41,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=512, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1056, PETRI_PLACES=515, PETRI_TRANSITIONS=520} [2025-03-08 22:04:41,298 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -20 predicate places. [2025-03-08 22:04:41,298 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 520 transitions, 1056 flow [2025-03-08 22:04:41,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.3333333333334) internal successors, (1636), 3 states have internal predecessors, (1636), 0 states have call successors, (0), 0 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-08 22:04:41,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:41,300 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-08 22:04:41,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:04:41,300 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:41,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:41,300 INFO L85 PathProgramCache]: Analyzing trace with hash 280863627, now seen corresponding path program 1 times [2025-03-08 22:04:41,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:41,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571725152] [2025-03-08 22:04:41,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:41,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:41,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 22:04:41,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 22:04:41,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:41,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:41,340 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-08 22:04:41,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:41,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571725152] [2025-03-08 22:04:41,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571725152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:41,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:41,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:41,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328548642] [2025-03-08 22:04:41,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:41,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:41,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:41,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:41,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:41,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 574 [2025-03-08 22:04:41,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 520 transitions, 1056 flow. Second operand has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 0 states have call successors, (0), 0 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-08 22:04:41,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:41,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 574 [2025-03-08 22:04:41,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:41,471 INFO L124 PetriNetUnfolderBase]: 49/1359 cut-off events. [2025-03-08 22:04:41,471 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 22:04:41,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1428 conditions, 1359 events. 49/1359 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 8202 event pairs, 5 based on Foata normal form. 0/1184 useless extension candidates. Maximal degree in co-relation 1127. Up to 43 conditions per place. [2025-03-08 22:04:41,485 INFO L140 encePairwiseOnDemand]: 570/574 looper letters, 13 selfloop transitions, 2 changer transitions 0/522 dead transitions. [2025-03-08 22:04:41,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 522 transitions, 1092 flow [2025-03-08 22:04:41,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:41,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:41,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1649 transitions. [2025-03-08 22:04:41,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9576074332171893 [2025-03-08 22:04:41,488 INFO L175 Difference]: Start difference. First operand has 515 places, 520 transitions, 1056 flow. Second operand 3 states and 1649 transitions. [2025-03-08 22:04:41,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 522 transitions, 1092 flow [2025-03-08 22:04:41,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 522 transitions, 1092 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:41,493 INFO L231 Difference]: Finished difference. Result has 516 places, 520 transitions, 1066 flow [2025-03-08 22:04:41,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1066, PETRI_PLACES=516, PETRI_TRANSITIONS=520} [2025-03-08 22:04:41,494 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -19 predicate places. [2025-03-08 22:04:41,495 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 520 transitions, 1066 flow [2025-03-08 22:04:41,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 0 states have call successors, (0), 0 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-08 22:04:41,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:41,496 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] [2025-03-08 22:04:41,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:04:41,496 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:41,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:41,496 INFO L85 PathProgramCache]: Analyzing trace with hash 450560803, now seen corresponding path program 1 times [2025-03-08 22:04:41,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:41,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492709842] [2025-03-08 22:04:41,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:41,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:41,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 22:04:41,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 22:04:41,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:41,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:41,534 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-08 22:04:41,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:41,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492709842] [2025-03-08 22:04:41,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492709842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:41,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:41,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:41,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156795165] [2025-03-08 22:04:41,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:41,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:41,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:41,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:41,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:41,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-03-08 22:04:41,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 520 transitions, 1066 flow. Second operand has 3 states, 3 states have (on average 542.3333333333334) internal successors, (1627), 3 states have internal predecessors, (1627), 0 states have call successors, (0), 0 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-08 22:04:41,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:41,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-03-08 22:04:41,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:41,673 INFO L124 PetriNetUnfolderBase]: 51/1185 cut-off events. [2025-03-08 22:04:41,673 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 22:04:41,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1303 conditions, 1185 events. 51/1185 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6459 event pairs, 18 based on Foata normal form. 0/1038 useless extension candidates. Maximal degree in co-relation 1002. Up to 57 conditions per place. [2025-03-08 22:04:41,687 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 15 selfloop transitions, 2 changer transitions 0/521 dead transitions. [2025-03-08 22:04:41,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 521 transitions, 1104 flow [2025-03-08 22:04:41,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:41,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1641 transitions. [2025-03-08 22:04:41,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529616724738676 [2025-03-08 22:04:41,689 INFO L175 Difference]: Start difference. First operand has 516 places, 520 transitions, 1066 flow. Second operand 3 states and 1641 transitions. [2025-03-08 22:04:41,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 521 transitions, 1104 flow [2025-03-08 22:04:41,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 521 transitions, 1104 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:41,695 INFO L231 Difference]: Finished difference. Result has 517 places, 519 transitions, 1068 flow [2025-03-08 22:04:41,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1068, PETRI_PLACES=517, PETRI_TRANSITIONS=519} [2025-03-08 22:04:41,697 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -18 predicate places. [2025-03-08 22:04:41,697 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 519 transitions, 1068 flow [2025-03-08 22:04:41,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 542.3333333333334) internal successors, (1627), 3 states have internal predecessors, (1627), 0 states have call successors, (0), 0 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-08 22:04:41,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:41,698 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] [2025-03-08 22:04:41,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:04:41,698 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:41,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:41,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1796698736, now seen corresponding path program 1 times [2025-03-08 22:04:41,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:41,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741056843] [2025-03-08 22:04:41,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:41,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:41,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 22:04:41,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 22:04:41,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:41,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:41,735 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-08 22:04:41,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:41,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741056843] [2025-03-08 22:04:41,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741056843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:41,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:41,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:41,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038180741] [2025-03-08 22:04:41,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:41,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:41,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:41,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:41,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:41,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 574 [2025-03-08 22:04:41,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 519 transitions, 1068 flow. Second operand has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 0 states have call successors, (0), 0 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-08 22:04:41,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:41,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 574 [2025-03-08 22:04:41,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:41,903 INFO L124 PetriNetUnfolderBase]: 68/1866 cut-off events. [2025-03-08 22:04:41,904 INFO L125 PetriNetUnfolderBase]: For 16/21 co-relation queries the response was YES. [2025-03-08 22:04:41,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1954 conditions, 1866 events. 68/1866 cut-off events. For 16/21 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 12153 event pairs, 15 based on Foata normal form. 0/1612 useless extension candidates. Maximal degree in co-relation 1556. Up to 56 conditions per place. [2025-03-08 22:04:41,922 INFO L140 encePairwiseOnDemand]: 570/574 looper letters, 13 selfloop transitions, 2 changer transitions 0/521 dead transitions. [2025-03-08 22:04:41,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 521 transitions, 1104 flow [2025-03-08 22:04:41,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:41,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:41,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1649 transitions. [2025-03-08 22:04:41,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9576074332171893 [2025-03-08 22:04:41,925 INFO L175 Difference]: Start difference. First operand has 517 places, 519 transitions, 1068 flow. Second operand 3 states and 1649 transitions. [2025-03-08 22:04:41,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 521 transitions, 1104 flow [2025-03-08 22:04:41,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 521 transitions, 1100 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:41,930 INFO L231 Difference]: Finished difference. Result has 516 places, 519 transitions, 1074 flow [2025-03-08 22:04:41,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1074, PETRI_PLACES=516, PETRI_TRANSITIONS=519} [2025-03-08 22:04:41,932 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -19 predicate places. [2025-03-08 22:04:41,932 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 519 transitions, 1074 flow [2025-03-08 22:04:41,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 0 states have call successors, (0), 0 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-08 22:04:41,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:41,933 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] [2025-03-08 22:04:41,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:04:41,933 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:41,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:41,933 INFO L85 PathProgramCache]: Analyzing trace with hash 287383189, now seen corresponding path program 1 times [2025-03-08 22:04:41,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:41,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653489542] [2025-03-08 22:04:41,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:41,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:41,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 22:04:41,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 22:04:41,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:41,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:41,974 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-08 22:04:41,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:41,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653489542] [2025-03-08 22:04:41,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653489542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:41,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:41,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:41,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039121326] [2025-03-08 22:04:41,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:41,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:41,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:41,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:41,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:41,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 574 [2025-03-08 22:04:41,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 519 transitions, 1074 flow. Second operand has 3 states, 3 states have (on average 545.3333333333334) internal successors, (1636), 3 states have internal predecessors, (1636), 0 states have call successors, (0), 0 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-08 22:04:41,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:41,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 574 [2025-03-08 22:04:41,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:42,218 INFO L124 PetriNetUnfolderBase]: 101/2286 cut-off events. [2025-03-08 22:04:42,219 INFO L125 PetriNetUnfolderBase]: For 19/22 co-relation queries the response was YES. [2025-03-08 22:04:42,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2434 conditions, 2286 events. 101/2286 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 15754 event pairs, 6 based on Foata normal form. 0/1974 useless extension candidates. Maximal degree in co-relation 1997. Up to 104 conditions per place. [2025-03-08 22:04:42,240 INFO L140 encePairwiseOnDemand]: 570/574 looper letters, 16 selfloop transitions, 2 changer transitions 0/524 dead transitions. [2025-03-08 22:04:42,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 524 transitions, 1125 flow [2025-03-08 22:04:42,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:42,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:42,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1652 transitions. [2025-03-08 22:04:42,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959349593495935 [2025-03-08 22:04:42,243 INFO L175 Difference]: Start difference. First operand has 516 places, 519 transitions, 1074 flow. Second operand 3 states and 1652 transitions. [2025-03-08 22:04:42,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 524 transitions, 1125 flow [2025-03-08 22:04:42,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 524 transitions, 1125 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:42,248 INFO L231 Difference]: Finished difference. Result has 517 places, 519 transitions, 1084 flow [2025-03-08 22:04:42,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1084, PETRI_PLACES=517, PETRI_TRANSITIONS=519} [2025-03-08 22:04:42,249 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -18 predicate places. [2025-03-08 22:04:42,249 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 519 transitions, 1084 flow [2025-03-08 22:04:42,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.3333333333334) internal successors, (1636), 3 states have internal predecessors, (1636), 0 states have call successors, (0), 0 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-08 22:04:42,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:42,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:04:42,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:04:42,250 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:42,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:42,251 INFO L85 PathProgramCache]: Analyzing trace with hash 318976233, now seen corresponding path program 1 times [2025-03-08 22:04:42,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:42,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823791784] [2025-03-08 22:04:42,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:42,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:42,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 22:04:42,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 22:04:42,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:42,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:42,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:04:42,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:42,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823791784] [2025-03-08 22:04:42,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823791784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:42,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:42,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:42,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63724578] [2025-03-08 22:04:42,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:42,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:42,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:42,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:42,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:42,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 574 [2025-03-08 22:04:42,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 519 transitions, 1084 flow. Second operand has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 0 states have call successors, (0), 0 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-08 22:04:42,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:42,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 574 [2025-03-08 22:04:42,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:42,594 INFO L124 PetriNetUnfolderBase]: 118/2771 cut-off events. [2025-03-08 22:04:42,594 INFO L125 PetriNetUnfolderBase]: For 6/10 co-relation queries the response was YES. [2025-03-08 22:04:42,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3033 conditions, 2771 events. 118/2771 cut-off events. For 6/10 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 20090 event pairs, 15 based on Foata normal form. 0/2426 useless extension candidates. Maximal degree in co-relation 2596. Up to 57 conditions per place. [2025-03-08 22:04:42,627 INFO L140 encePairwiseOnDemand]: 566/574 looper letters, 15 selfloop transitions, 5 changer transitions 0/521 dead transitions. [2025-03-08 22:04:42,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 521 transitions, 1130 flow [2025-03-08 22:04:42,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:42,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-03-08 22:04:42,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-03-08 22:04:42,630 INFO L175 Difference]: Start difference. First operand has 517 places, 519 transitions, 1084 flow. Second operand 3 states and 1640 transitions. [2025-03-08 22:04:42,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 521 transitions, 1130 flow [2025-03-08 22:04:42,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 521 transitions, 1130 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:42,635 INFO L231 Difference]: Finished difference. Result has 518 places, 519 transitions, 1110 flow [2025-03-08 22:04:42,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1078, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1110, PETRI_PLACES=518, PETRI_TRANSITIONS=519} [2025-03-08 22:04:42,636 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -17 predicate places. [2025-03-08 22:04:42,636 INFO L471 AbstractCegarLoop]: Abstraction has has 518 places, 519 transitions, 1110 flow [2025-03-08 22:04:42,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 0 states have call successors, (0), 0 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-08 22:04:42,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:42,637 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] [2025-03-08 22:04:42,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:04:42,637 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:42,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:42,638 INFO L85 PathProgramCache]: Analyzing trace with hash 327059527, now seen corresponding path program 1 times [2025-03-08 22:04:42,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:42,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352746336] [2025-03-08 22:04:42,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:42,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:42,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 22:04:42,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 22:04:42,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:42,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:42,680 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-08 22:04:42,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:42,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352746336] [2025-03-08 22:04:42,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352746336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:42,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:42,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:42,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835565178] [2025-03-08 22:04:42,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:42,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:42,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:42,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:42,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:42,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-03-08 22:04:42,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 519 transitions, 1110 flow. Second operand has 3 states, 3 states have (on average 542.6666666666666) internal successors, (1628), 3 states have internal predecessors, (1628), 0 states have call successors, (0), 0 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-08 22:04:42,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:42,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-03-08 22:04:42,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:42,963 INFO L124 PetriNetUnfolderBase]: 92/2232 cut-off events. [2025-03-08 22:04:42,963 INFO L125 PetriNetUnfolderBase]: For 36/118 co-relation queries the response was YES. [2025-03-08 22:04:42,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2428 conditions, 2232 events. 92/2232 cut-off events. For 36/118 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 14682 event pairs, 22 based on Foata normal form. 2/1934 useless extension candidates. Maximal degree in co-relation 1879. Up to 58 conditions per place. [2025-03-08 22:04:42,991 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 15 selfloop transitions, 2 changer transitions 0/520 dead transitions. [2025-03-08 22:04:42,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 520 transitions, 1148 flow [2025-03-08 22:04:42,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:42,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:42,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1641 transitions. [2025-03-08 22:04:42,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529616724738676 [2025-03-08 22:04:42,993 INFO L175 Difference]: Start difference. First operand has 518 places, 519 transitions, 1110 flow. Second operand 3 states and 1641 transitions. [2025-03-08 22:04:42,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 520 transitions, 1148 flow [2025-03-08 22:04:42,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 520 transitions, 1138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:42,999 INFO L231 Difference]: Finished difference. Result has 517 places, 518 transitions, 1102 flow [2025-03-08 22:04:42,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1098, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1102, PETRI_PLACES=517, PETRI_TRANSITIONS=518} [2025-03-08 22:04:43,000 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -18 predicate places. [2025-03-08 22:04:43,000 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 518 transitions, 1102 flow [2025-03-08 22:04:43,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 542.6666666666666) internal successors, (1628), 3 states have internal predecessors, (1628), 0 states have call successors, (0), 0 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-08 22:04:43,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:43,001 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] [2025-03-08 22:04:43,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:04:43,001 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:43,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:43,001 INFO L85 PathProgramCache]: Analyzing trace with hash -2110907524, now seen corresponding path program 1 times [2025-03-08 22:04:43,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:43,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302157817] [2025-03-08 22:04:43,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:43,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:43,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 22:04:43,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 22:04:43,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:43,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:43,070 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-08 22:04:43,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:43,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302157817] [2025-03-08 22:04:43,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302157817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:43,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:43,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:04:43,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505639282] [2025-03-08 22:04:43,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:43,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:04:43,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:43,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:04:43,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:04:43,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 543 out of 574 [2025-03-08 22:04:43,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 518 transitions, 1102 flow. Second operand has 4 states, 4 states have (on average 544.25) internal successors, (2177), 4 states have internal predecessors, (2177), 0 states have call successors, (0), 0 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-08 22:04:43,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:43,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 543 of 574 [2025-03-08 22:04:43,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:43,473 INFO L124 PetriNetUnfolderBase]: 124/3253 cut-off events. [2025-03-08 22:04:43,473 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2025-03-08 22:04:43,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3601 conditions, 3253 events. 124/3253 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 24219 event pairs, 24 based on Foata normal form. 2/2851 useless extension candidates. Maximal degree in co-relation 3439. Up to 67 conditions per place. [2025-03-08 22:04:43,506 INFO L140 encePairwiseOnDemand]: 569/574 looper letters, 27 selfloop transitions, 4 changer transitions 0/534 dead transitions. [2025-03-08 22:04:43,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 534 transitions, 1206 flow [2025-03-08 22:04:43,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:04:43,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 22:04:43,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2747 transitions. [2025-03-08 22:04:43,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9571428571428572 [2025-03-08 22:04:43,510 INFO L175 Difference]: Start difference. First operand has 517 places, 518 transitions, 1102 flow. Second operand 5 states and 2747 transitions. [2025-03-08 22:04:43,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 534 transitions, 1206 flow [2025-03-08 22:04:43,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 534 transitions, 1202 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:43,516 INFO L231 Difference]: Finished difference. Result has 522 places, 520 transitions, 1123 flow [2025-03-08 22:04:43,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1123, PETRI_PLACES=522, PETRI_TRANSITIONS=520} [2025-03-08 22:04:43,517 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -13 predicate places. [2025-03-08 22:04:43,517 INFO L471 AbstractCegarLoop]: Abstraction has has 522 places, 520 transitions, 1123 flow [2025-03-08 22:04:43,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 544.25) internal successors, (2177), 4 states have internal predecessors, (2177), 0 states have call successors, (0), 0 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-08 22:04:43,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:43,518 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:43,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:04:43,518 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:43,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:43,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1491004835, now seen corresponding path program 1 times [2025-03-08 22:04:43,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:43,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571761317] [2025-03-08 22:04:43,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:43,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:43,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 22:04:43,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 22:04:43,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:43,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:43,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:04:43,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:43,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571761317] [2025-03-08 22:04:43,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571761317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:43,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:43,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:04:43,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350455900] [2025-03-08 22:04:43,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:43,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:04:43,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:43,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:04:43,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:04:43,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 574 [2025-03-08 22:04:43,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 520 transitions, 1123 flow. Second operand has 5 states, 5 states have (on average 529.0) internal successors, (2645), 5 states have internal predecessors, (2645), 0 states have call successors, (0), 0 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-08 22:04:43,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:43,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 574 [2025-03-08 22:04:43,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:44,068 INFO L124 PetriNetUnfolderBase]: 47/1670 cut-off events. [2025-03-08 22:04:44,069 INFO L125 PetriNetUnfolderBase]: For 11/22 co-relation queries the response was YES. [2025-03-08 22:04:44,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1835 conditions, 1670 events. 47/1670 cut-off events. For 11/22 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8752 event pairs, 3 based on Foata normal form. 3/1481 useless extension candidates. Maximal degree in co-relation 1699. Up to 30 conditions per place. [2025-03-08 22:04:44,092 INFO L140 encePairwiseOnDemand]: 553/574 looper letters, 18 selfloop transitions, 18 changer transitions 0/523 dead transitions. [2025-03-08 22:04:44,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 523 transitions, 1201 flow [2025-03-08 22:04:44,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:04:44,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 22:04:44,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2659 transitions. [2025-03-08 22:04:44,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9264808362369338 [2025-03-08 22:04:44,097 INFO L175 Difference]: Start difference. First operand has 522 places, 520 transitions, 1123 flow. Second operand 5 states and 2659 transitions. [2025-03-08 22:04:44,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 523 transitions, 1201 flow [2025-03-08 22:04:44,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 523 transitions, 1201 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:44,104 INFO L231 Difference]: Finished difference. Result has 527 places, 523 transitions, 1183 flow [2025-03-08 22:04:44,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1183, PETRI_PLACES=527, PETRI_TRANSITIONS=523} [2025-03-08 22:04:44,105 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -8 predicate places. [2025-03-08 22:04:44,105 INFO L471 AbstractCegarLoop]: Abstraction has has 527 places, 523 transitions, 1183 flow [2025-03-08 22:04:44,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 529.0) internal successors, (2645), 5 states have internal predecessors, (2645), 0 states have call successors, (0), 0 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-08 22:04:44,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:44,106 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:44,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:04:44,106 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:44,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:44,107 INFO L85 PathProgramCache]: Analyzing trace with hash 434895472, now seen corresponding path program 1 times [2025-03-08 22:04:44,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:44,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020534710] [2025-03-08 22:04:44,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:44,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:44,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-08 22:04:44,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-08 22:04:44,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:44,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:44,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:04:44,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:44,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020534710] [2025-03-08 22:04:44,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020534710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:44,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:44,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:44,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574529087] [2025-03-08 22:04:44,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:44,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:44,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:44,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:44,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:44,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-03-08 22:04:44,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 523 transitions, 1183 flow. Second operand has 3 states, 3 states have (on average 543.0) internal successors, (1629), 3 states have internal predecessors, (1629), 0 states have call successors, (0), 0 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-08 22:04:44,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:44,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-03-08 22:04:44,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:44,938 INFO L124 PetriNetUnfolderBase]: 188/4808 cut-off events. [2025-03-08 22:04:44,938 INFO L125 PetriNetUnfolderBase]: For 59/79 co-relation queries the response was YES. [2025-03-08 22:04:44,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5351 conditions, 4808 events. 188/4808 cut-off events. For 59/79 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 39516 event pairs, 45 based on Foata normal form. 4/4214 useless extension candidates. Maximal degree in co-relation 5122. Up to 128 conditions per place. [2025-03-08 22:04:44,992 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 17 selfloop transitions, 2 changer transitions 0/524 dead transitions. [2025-03-08 22:04:44,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 524 transitions, 1225 flow [2025-03-08 22:04:44,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:44,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:44,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1641 transitions. [2025-03-08 22:04:44,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529616724738676 [2025-03-08 22:04:44,994 INFO L175 Difference]: Start difference. First operand has 527 places, 523 transitions, 1183 flow. Second operand 3 states and 1641 transitions. [2025-03-08 22:04:44,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 524 transitions, 1225 flow [2025-03-08 22:04:44,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 524 transitions, 1195 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-08 22:04:45,000 INFO L231 Difference]: Finished difference. Result has 525 places, 522 transitions, 1155 flow [2025-03-08 22:04:45,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1151, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1155, PETRI_PLACES=525, PETRI_TRANSITIONS=522} [2025-03-08 22:04:45,001 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -10 predicate places. [2025-03-08 22:04:45,001 INFO L471 AbstractCegarLoop]: Abstraction has has 525 places, 522 transitions, 1155 flow [2025-03-08 22:04:45,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.0) internal successors, (1629), 3 states have internal predecessors, (1629), 0 states have call successors, (0), 0 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-08 22:04:45,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:45,002 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:45,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:04:45,002 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:45,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:45,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1304898259, now seen corresponding path program 1 times [2025-03-08 22:04:45,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:45,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822982308] [2025-03-08 22:04:45,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:45,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:45,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-08 22:04:45,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-08 22:04:45,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:45,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:45,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:04:45,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:45,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822982308] [2025-03-08 22:04:45,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822982308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:04:45,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302237357] [2025-03-08 22:04:45,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:45,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:04:45,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:04:45,165 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:04:45,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 22:04:45,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-08 22:04:45,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-08 22:04:45,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:45,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:45,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 22:04:45,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:04:45,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:04:45,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:04:45,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:04:45,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302237357] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:04:45,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:04:45,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-08 22:04:45,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303152942] [2025-03-08 22:04:45,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:04:45,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 22:04:45,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:45,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 22:04:45,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-08 22:04:45,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 515 out of 574 [2025-03-08 22:04:45,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 522 transitions, 1155 flow. Second operand has 15 states, 15 states have (on average 518.4666666666667) internal successors, (7777), 15 states have internal predecessors, (7777), 0 states have call successors, (0), 0 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-08 22:04:45,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:45,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 515 of 574 [2025-03-08 22:04:45,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:46,362 INFO L124 PetriNetUnfolderBase]: 47/1715 cut-off events. [2025-03-08 22:04:46,362 INFO L125 PetriNetUnfolderBase]: For 20/31 co-relation queries the response was YES. [2025-03-08 22:04:46,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1942 conditions, 1715 events. 47/1715 cut-off events. For 20/31 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 8595 event pairs, 3 based on Foata normal form. 6/1535 useless extension candidates. Maximal degree in co-relation 1800. Up to 30 conditions per place. [2025-03-08 22:04:46,382 INFO L140 encePairwiseOnDemand]: 544/574 looper letters, 30 selfloop transitions, 39 changer transitions 0/546 dead transitions. [2025-03-08 22:04:46,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 546 transitions, 1347 flow [2025-03-08 22:04:46,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:04:46,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 22:04:46,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 5740 transitions. [2025-03-08 22:04:46,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2025-03-08 22:04:46,387 INFO L175 Difference]: Start difference. First operand has 525 places, 522 transitions, 1155 flow. Second operand 11 states and 5740 transitions. [2025-03-08 22:04:46,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 546 transitions, 1347 flow [2025-03-08 22:04:46,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 546 transitions, 1343 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:46,394 INFO L231 Difference]: Finished difference. Result has 536 places, 540 transitions, 1331 flow [2025-03-08 22:04:46,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1151, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1331, PETRI_PLACES=536, PETRI_TRANSITIONS=540} [2025-03-08 22:04:46,394 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 1 predicate places. [2025-03-08 22:04:46,394 INFO L471 AbstractCegarLoop]: Abstraction has has 536 places, 540 transitions, 1331 flow [2025-03-08 22:04:46,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 518.4666666666667) internal successors, (7777), 15 states have internal predecessors, (7777), 0 states have call successors, (0), 0 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-08 22:04:46,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:46,396 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:04:46,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 22:04:46,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 22:04:46,597 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:46,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:46,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1818241427, now seen corresponding path program 2 times [2025-03-08 22:04:46,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:46,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323493683] [2025-03-08 22:04:46,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:04:46,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:46,621 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 306 statements into 2 equivalence classes. [2025-03-08 22:04:46,629 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 171 of 306 statements. [2025-03-08 22:04:46,631 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:04:46,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:46,933 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 22:04:46,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:46,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323493683] [2025-03-08 22:04:46,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323493683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:46,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:46,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:04:46,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105847320] [2025-03-08 22:04:46,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:46,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:04:46,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:46,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:04:46,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:04:47,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 574 [2025-03-08 22:04:47,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 540 transitions, 1331 flow. Second operand has 6 states, 6 states have (on average 532.5) internal successors, (3195), 6 states have internal predecessors, (3195), 0 states have call successors, (0), 0 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-08 22:04:47,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:47,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 574 [2025-03-08 22:04:47,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:47,587 INFO L124 PetriNetUnfolderBase]: 100/2643 cut-off events. [2025-03-08 22:04:47,587 INFO L125 PetriNetUnfolderBase]: For 63/70 co-relation queries the response was YES. [2025-03-08 22:04:47,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3127 conditions, 2643 events. 100/2643 cut-off events. For 63/70 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 17454 event pairs, 9 based on Foata normal form. 0/2363 useless extension candidates. Maximal degree in co-relation 2992. Up to 79 conditions per place. [2025-03-08 22:04:47,617 INFO L140 encePairwiseOnDemand]: 568/574 looper letters, 30 selfloop transitions, 6 changer transitions 0/547 dead transitions. [2025-03-08 22:04:47,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 547 transitions, 1425 flow [2025-03-08 22:04:47,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:04:47,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:04:47,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3210 transitions. [2025-03-08 22:04:47,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9320557491289199 [2025-03-08 22:04:47,621 INFO L175 Difference]: Start difference. First operand has 536 places, 540 transitions, 1331 flow. Second operand 6 states and 3210 transitions. [2025-03-08 22:04:47,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 547 transitions, 1425 flow [2025-03-08 22:04:47,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 547 transitions, 1389 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-08 22:04:47,628 INFO L231 Difference]: Finished difference. Result has 537 places, 539 transitions, 1305 flow [2025-03-08 22:04:47,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1293, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=533, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1305, PETRI_PLACES=537, PETRI_TRANSITIONS=539} [2025-03-08 22:04:47,629 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 2 predicate places. [2025-03-08 22:04:47,629 INFO L471 AbstractCegarLoop]: Abstraction has has 537 places, 539 transitions, 1305 flow [2025-03-08 22:04:47,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.5) internal successors, (3195), 6 states have internal predecessors, (3195), 0 states have call successors, (0), 0 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-08 22:04:47,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:47,630 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:04:47,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:04:47,630 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:47,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:47,631 INFO L85 PathProgramCache]: Analyzing trace with hash 716294824, now seen corresponding path program 1 times [2025-03-08 22:04:47,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:47,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627896117] [2025-03-08 22:04:47,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:47,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:47,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-08 22:04:47,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-08 22:04:47,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:47,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:47,712 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 22:04:47,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:47,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627896117] [2025-03-08 22:04:47,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627896117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:47,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:47,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:47,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748890660] [2025-03-08 22:04:47,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:47,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:47,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:47,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:47,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:47,722 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 574 [2025-03-08 22:04:47,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 539 transitions, 1305 flow. Second operand has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 0 states have call successors, (0), 0 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-08 22:04:47,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:47,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 574 [2025-03-08 22:04:47,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:48,189 INFO L124 PetriNetUnfolderBase]: 125/3167 cut-off events. [2025-03-08 22:04:48,190 INFO L125 PetriNetUnfolderBase]: For 66/87 co-relation queries the response was YES. [2025-03-08 22:04:48,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3685 conditions, 3167 events. 125/3167 cut-off events. For 66/87 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 22694 event pairs, 15 based on Foata normal form. 1/2847 useless extension candidates. Maximal degree in co-relation 3355. Up to 118 conditions per place. [2025-03-08 22:04:48,233 INFO L140 encePairwiseOnDemand]: 570/574 looper letters, 16 selfloop transitions, 2 changer transitions 0/544 dead transitions. [2025-03-08 22:04:48,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 544 transitions, 1356 flow [2025-03-08 22:04:48,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:48,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:48,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1652 transitions. [2025-03-08 22:04:48,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959349593495935 [2025-03-08 22:04:48,235 INFO L175 Difference]: Start difference. First operand has 537 places, 539 transitions, 1305 flow. Second operand 3 states and 1652 transitions. [2025-03-08 22:04:48,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 544 transitions, 1356 flow [2025-03-08 22:04:48,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 532 places, 544 transitions, 1344 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:04:48,241 INFO L231 Difference]: Finished difference. Result has 533 places, 539 transitions, 1303 flow [2025-03-08 22:04:48,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1289, PETRI_DIFFERENCE_MINUEND_PLACES=530, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1303, PETRI_PLACES=533, PETRI_TRANSITIONS=539} [2025-03-08 22:04:48,242 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -2 predicate places. [2025-03-08 22:04:48,242 INFO L471 AbstractCegarLoop]: Abstraction has has 533 places, 539 transitions, 1303 flow [2025-03-08 22:04:48,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 0 states have call successors, (0), 0 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-08 22:04:48,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:48,243 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:04:48,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:04:48,243 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:48,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:48,244 INFO L85 PathProgramCache]: Analyzing trace with hash 730335133, now seen corresponding path program 1 times [2025-03-08 22:04:48,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:48,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645023730] [2025-03-08 22:04:48,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:48,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:48,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-08 22:04:48,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-08 22:04:48,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:48,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:48,321 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 22:04:48,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:48,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645023730] [2025-03-08 22:04:48,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645023730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:48,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:48,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:48,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001294588] [2025-03-08 22:04:48,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:48,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:48,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:48,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:48,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:48,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 574 [2025-03-08 22:04:48,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 539 transitions, 1303 flow. Second operand has 3 states, 3 states have (on average 540.6666666666666) internal successors, (1622), 3 states have internal predecessors, (1622), 0 states have call successors, (0), 0 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-08 22:04:48,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:48,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 574 [2025-03-08 22:04:48,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:49,120 INFO L124 PetriNetUnfolderBase]: 181/4377 cut-off events. [2025-03-08 22:04:49,121 INFO L125 PetriNetUnfolderBase]: For 75/238 co-relation queries the response was YES. [2025-03-08 22:04:49,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4905 conditions, 4377 events. 181/4377 cut-off events. For 75/238 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 33264 event pairs, 26 based on Foata normal form. 0/3856 useless extension candidates. Maximal degree in co-relation 4576. Up to 82 conditions per place. [2025-03-08 22:04:49,162 INFO L140 encePairwiseOnDemand]: 566/574 looper letters, 15 selfloop transitions, 5 changer transitions 0/541 dead transitions. [2025-03-08 22:04:49,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 532 places, 541 transitions, 1349 flow [2025-03-08 22:04:49,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:49,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-03-08 22:04:49,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-03-08 22:04:49,164 INFO L175 Difference]: Start difference. First operand has 533 places, 539 transitions, 1303 flow. Second operand 3 states and 1640 transitions. [2025-03-08 22:04:49,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 532 places, 541 transitions, 1349 flow [2025-03-08 22:04:49,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 532 places, 541 transitions, 1349 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:49,169 INFO L231 Difference]: Finished difference. Result has 534 places, 539 transitions, 1329 flow [2025-03-08 22:04:49,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1297, PETRI_DIFFERENCE_MINUEND_PLACES=530, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1329, PETRI_PLACES=534, PETRI_TRANSITIONS=539} [2025-03-08 22:04:49,170 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -1 predicate places. [2025-03-08 22:04:49,170 INFO L471 AbstractCegarLoop]: Abstraction has has 534 places, 539 transitions, 1329 flow [2025-03-08 22:04:49,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 540.6666666666666) internal successors, (1622), 3 states have internal predecessors, (1622), 0 states have call successors, (0), 0 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-08 22:04:49,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:49,171 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:04:49,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 22:04:49,171 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:49,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:49,172 INFO L85 PathProgramCache]: Analyzing trace with hash -912214923, now seen corresponding path program 1 times [2025-03-08 22:04:49,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:49,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507424208] [2025-03-08 22:04:49,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:49,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:49,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-08 22:04:49,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-08 22:04:49,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:49,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:49,249 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 22:04:49,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:49,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507424208] [2025-03-08 22:04:49,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507424208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:49,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:49,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:49,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290094952] [2025-03-08 22:04:49,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:49,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:49,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:49,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:49,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:49,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-03-08 22:04:49,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 539 transitions, 1329 flow. Second operand has 3 states, 3 states have (on average 543.0) internal successors, (1629), 3 states have internal predecessors, (1629), 0 states have call successors, (0), 0 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-08 22:04:49,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:49,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-03-08 22:04:49,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:49,826 INFO L124 PetriNetUnfolderBase]: 270/3660 cut-off events. [2025-03-08 22:04:49,826 INFO L125 PetriNetUnfolderBase]: For 219/273 co-relation queries the response was YES. [2025-03-08 22:04:49,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4395 conditions, 3660 events. 270/3660 cut-off events. For 219/273 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 29770 event pairs, 61 based on Foata normal form. 0/3168 useless extension candidates. Maximal degree in co-relation 4064. Up to 360 conditions per place. [2025-03-08 22:04:49,874 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 15 selfloop transitions, 2 changer transitions 0/540 dead transitions. [2025-03-08 22:04:49,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 540 transitions, 1367 flow [2025-03-08 22:04:49,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:49,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:49,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1641 transitions. [2025-03-08 22:04:49,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529616724738676 [2025-03-08 22:04:49,876 INFO L175 Difference]: Start difference. First operand has 534 places, 539 transitions, 1329 flow. Second operand 3 states and 1641 transitions. [2025-03-08 22:04:49,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 540 transitions, 1367 flow [2025-03-08 22:04:49,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 540 transitions, 1357 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:49,882 INFO L231 Difference]: Finished difference. Result has 533 places, 538 transitions, 1321 flow [2025-03-08 22:04:49,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=531, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1321, PETRI_PLACES=533, PETRI_TRANSITIONS=538} [2025-03-08 22:04:49,884 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -2 predicate places. [2025-03-08 22:04:49,884 INFO L471 AbstractCegarLoop]: Abstraction has has 533 places, 538 transitions, 1321 flow [2025-03-08 22:04:49,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.0) internal successors, (1629), 3 states have internal predecessors, (1629), 0 states have call successors, (0), 0 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-08 22:04:49,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:49,884 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:04:49,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 22:04:49,884 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:49,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:49,885 INFO L85 PathProgramCache]: Analyzing trace with hash -859510833, now seen corresponding path program 1 times [2025-03-08 22:04:49,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:49,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533381844] [2025-03-08 22:04:49,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:49,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:49,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-08 22:04:49,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-08 22:04:49,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:49,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:49,985 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 22:04:49,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:49,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533381844] [2025-03-08 22:04:49,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533381844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:49,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:49,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:04:49,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921336801] [2025-03-08 22:04:49,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:49,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:04:49,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:49,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:04:49,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:04:50,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 543 out of 574 [2025-03-08 22:04:50,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 538 transitions, 1321 flow. Second operand has 4 states, 4 states have (on average 544.5) internal successors, (2178), 4 states have internal predecessors, (2178), 0 states have call successors, (0), 0 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-08 22:04:50,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:50,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 543 of 574 [2025-03-08 22:04:50,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:50,848 INFO L124 PetriNetUnfolderBase]: 197/4935 cut-off events. [2025-03-08 22:04:50,848 INFO L125 PetriNetUnfolderBase]: For 97/304 co-relation queries the response was YES. [2025-03-08 22:04:50,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5635 conditions, 4935 events. 197/4935 cut-off events. For 97/304 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 40067 event pairs, 45 based on Foata normal form. 4/4378 useless extension candidates. Maximal degree in co-relation 5304. Up to 105 conditions per place. [2025-03-08 22:04:50,917 INFO L140 encePairwiseOnDemand]: 569/574 looper letters, 25 selfloop transitions, 4 changer transitions 0/552 dead transitions. [2025-03-08 22:04:50,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 552 transitions, 1415 flow [2025-03-08 22:04:50,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:04:50,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 22:04:50,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2745 transitions. [2025-03-08 22:04:50,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9564459930313589 [2025-03-08 22:04:50,920 INFO L175 Difference]: Start difference. First operand has 533 places, 538 transitions, 1321 flow. Second operand 5 states and 2745 transitions. [2025-03-08 22:04:50,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 552 transitions, 1415 flow [2025-03-08 22:04:50,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 535 places, 552 transitions, 1411 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:50,926 INFO L231 Difference]: Finished difference. Result has 538 places, 540 transitions, 1342 flow [2025-03-08 22:04:50,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1313, PETRI_DIFFERENCE_MINUEND_PLACES=531, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=533, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1342, PETRI_PLACES=538, PETRI_TRANSITIONS=540} [2025-03-08 22:04:50,926 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 3 predicate places. [2025-03-08 22:04:50,926 INFO L471 AbstractCegarLoop]: Abstraction has has 538 places, 540 transitions, 1342 flow [2025-03-08 22:04:50,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 544.5) internal successors, (2178), 4 states have internal predecessors, (2178), 0 states have call successors, (0), 0 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-08 22:04:50,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:50,927 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:04:50,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 22:04:50,927 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:50,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:50,928 INFO L85 PathProgramCache]: Analyzing trace with hash 250169363, now seen corresponding path program 1 times [2025-03-08 22:04:50,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:50,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745056396] [2025-03-08 22:04:50,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:50,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:50,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-08 22:04:50,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-08 22:04:50,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:50,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:50,992 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 22:04:50,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:50,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745056396] [2025-03-08 22:04:50,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745056396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:50,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:50,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:50,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931022736] [2025-03-08 22:04:50,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:50,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:50,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:50,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:50,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:51,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-03-08 22:04:51,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 540 transitions, 1342 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 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-08 22:04:51,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:51,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-03-08 22:04:51,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:52,044 INFO L124 PetriNetUnfolderBase]: 293/6588 cut-off events. [2025-03-08 22:04:52,044 INFO L125 PetriNetUnfolderBase]: For 202/735 co-relation queries the response was YES. [2025-03-08 22:04:52,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7495 conditions, 6588 events. 293/6588 cut-off events. For 202/735 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 60712 event pairs, 86 based on Foata normal form. 7/5815 useless extension candidates. Maximal degree in co-relation 7162. Up to 213 conditions per place. [2025-03-08 22:04:52,128 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 17 selfloop transitions, 2 changer transitions 0/541 dead transitions. [2025-03-08 22:04:52,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 541 transitions, 1384 flow [2025-03-08 22:04:52,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:52,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:52,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1641 transitions. [2025-03-08 22:04:52,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529616724738676 [2025-03-08 22:04:52,131 INFO L175 Difference]: Start difference. First operand has 538 places, 540 transitions, 1342 flow. Second operand 3 states and 1641 transitions. [2025-03-08 22:04:52,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 541 transitions, 1384 flow [2025-03-08 22:04:52,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 541 transitions, 1384 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:52,136 INFO L231 Difference]: Finished difference. Result has 539 places, 539 transitions, 1344 flow [2025-03-08 22:04:52,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=537, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1344, PETRI_PLACES=539, PETRI_TRANSITIONS=539} [2025-03-08 22:04:52,137 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 4 predicate places. [2025-03-08 22:04:52,137 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 539 transitions, 1344 flow [2025-03-08 22:04:52,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 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-08 22:04:52,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:52,137 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:04:52,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 22:04:52,137 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:52,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:52,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1489624368, now seen corresponding path program 1 times [2025-03-08 22:04:52,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:52,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929946617] [2025-03-08 22:04:52,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:52,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:52,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-08 22:04:52,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-08 22:04:52,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:52,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:52,349 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-08 22:04:52,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:52,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929946617] [2025-03-08 22:04:52,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929946617] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:04:52,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200458655] [2025-03-08 22:04:52,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:52,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:04:52,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:04:52,353 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:04:52,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 22:04:52,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-08 22:04:52,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-08 22:04:52,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:52,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:52,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 22:04:52,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:04:52,730 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-08 22:04:52,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:04:52,861 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-08 22:04:52,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200458655] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:04:52,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:04:52,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-03-08 22:04:52,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165236980] [2025-03-08 22:04:52,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:04:52,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 22:04:52,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:52,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 22:04:52,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2025-03-08 22:04:53,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 515 out of 574 [2025-03-08 22:04:53,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 539 transitions, 1344 flow. Second operand has 22 states, 22 states have (on average 518.1363636363636) internal successors, (11399), 22 states have internal predecessors, (11399), 0 states have call successors, (0), 0 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-08 22:04:53,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:53,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 515 of 574 [2025-03-08 22:04:53,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:54,001 INFO L124 PetriNetUnfolderBase]: 58/2446 cut-off events. [2025-03-08 22:04:54,001 INFO L125 PetriNetUnfolderBase]: For 78/97 co-relation queries the response was YES. [2025-03-08 22:04:54,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2908 conditions, 2446 events. 58/2446 cut-off events. For 78/97 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 14388 event pairs, 7 based on Foata normal form. 6/2225 useless extension candidates. Maximal degree in co-relation 2674. Up to 44 conditions per place. [2025-03-08 22:04:54,032 INFO L140 encePairwiseOnDemand]: 544/574 looper letters, 36 selfloop transitions, 57 changer transitions 0/569 dead transitions. [2025-03-08 22:04:54,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 569 transitions, 1674 flow [2025-03-08 22:04:54,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 22:04:54,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-08 22:04:54,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 8854 transitions. [2025-03-08 22:04:54,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9073580651772905 [2025-03-08 22:04:54,039 INFO L175 Difference]: Start difference. First operand has 539 places, 539 transitions, 1344 flow. Second operand 17 states and 8854 transitions. [2025-03-08 22:04:54,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 569 transitions, 1674 flow [2025-03-08 22:04:54,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 569 transitions, 1670 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:54,045 INFO L231 Difference]: Finished difference. Result has 556 places, 560 transitions, 1616 flow [2025-03-08 22:04:54,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=537, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1616, PETRI_PLACES=556, PETRI_TRANSITIONS=560} [2025-03-08 22:04:54,046 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 21 predicate places. [2025-03-08 22:04:54,046 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 560 transitions, 1616 flow [2025-03-08 22:04:54,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 518.1363636363636) internal successors, (11399), 22 states have internal predecessors, (11399), 0 states have call successors, (0), 0 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-08 22:04:54,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:54,048 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:04:54,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 22:04:54,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-08 22:04:54,249 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:54,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:54,250 INFO L85 PathProgramCache]: Analyzing trace with hash 555078672, now seen corresponding path program 2 times [2025-03-08 22:04:54,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:54,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759765321] [2025-03-08 22:04:54,251 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:04:54,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:54,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 402 statements into 2 equivalence classes. [2025-03-08 22:04:54,284 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 177 of 402 statements. [2025-03-08 22:04:54,284 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:04:54,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-08 22:04:54,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:54,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759765321] [2025-03-08 22:04:54,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759765321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:54,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:54,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:04:54,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453180456] [2025-03-08 22:04:54,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:54,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:04:54,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:54,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:04:54,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:04:54,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 574 [2025-03-08 22:04:54,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 560 transitions, 1616 flow. Second operand has 6 states, 6 states have (on average 532.6666666666666) internal successors, (3196), 6 states have internal predecessors, (3196), 0 states have call successors, (0), 0 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-08 22:04:54,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:54,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 574 [2025-03-08 22:04:54,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:55,415 INFO L124 PetriNetUnfolderBase]: 153/3886 cut-off events. [2025-03-08 22:04:55,415 INFO L125 PetriNetUnfolderBase]: For 189/453 co-relation queries the response was YES. [2025-03-08 22:04:55,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4667 conditions, 3886 events. 153/3886 cut-off events. For 189/453 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 27355 event pairs, 17 based on Foata normal form. 16/3506 useless extension candidates. Maximal degree in co-relation 4426. Up to 139 conditions per place. [2025-03-08 22:04:55,472 INFO L140 encePairwiseOnDemand]: 568/574 looper letters, 30 selfloop transitions, 6 changer transitions 0/567 dead transitions. [2025-03-08 22:04:55,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 560 places, 567 transitions, 1710 flow [2025-03-08 22:04:55,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:04:55,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:04:55,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3210 transitions. [2025-03-08 22:04:55,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9320557491289199 [2025-03-08 22:04:55,474 INFO L175 Difference]: Start difference. First operand has 556 places, 560 transitions, 1616 flow. Second operand 6 states and 3210 transitions. [2025-03-08 22:04:55,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 560 places, 567 transitions, 1710 flow [2025-03-08 22:04:55,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 567 transitions, 1632 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-03-08 22:04:55,481 INFO L231 Difference]: Finished difference. Result has 552 places, 559 transitions, 1548 flow [2025-03-08 22:04:55,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1548, PETRI_PLACES=552, PETRI_TRANSITIONS=559} [2025-03-08 22:04:55,482 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 17 predicate places. [2025-03-08 22:04:55,482 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 559 transitions, 1548 flow [2025-03-08 22:04:55,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.6666666666666) internal successors, (3196), 6 states have internal predecessors, (3196), 0 states have call successors, (0), 0 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-08 22:04:55,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:55,483 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:04:55,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 22:04:55,483 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:55,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:55,484 INFO L85 PathProgramCache]: Analyzing trace with hash 672370875, now seen corresponding path program 1 times [2025-03-08 22:04:55,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:55,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028522016] [2025-03-08 22:04:55,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:55,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:55,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-08 22:04:55,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-08 22:04:55,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:55,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:55,562 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-08 22:04:55,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:55,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028522016] [2025-03-08 22:04:55,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028522016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:55,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:55,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:55,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408255784] [2025-03-08 22:04:55,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:55,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:55,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:55,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:55,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:55,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 574 [2025-03-08 22:04:55,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 559 transitions, 1548 flow. Second operand has 3 states, 3 states have (on average 541.0) internal successors, (1623), 3 states have internal predecessors, (1623), 0 states have call successors, (0), 0 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-08 22:04:55,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:55,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 574 [2025-03-08 22:04:55,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:56,579 INFO L124 PetriNetUnfolderBase]: 344/6028 cut-off events. [2025-03-08 22:04:56,579 INFO L125 PetriNetUnfolderBase]: For 319/360 co-relation queries the response was YES. [2025-03-08 22:04:56,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7073 conditions, 6028 events. 344/6028 cut-off events. For 319/360 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 54383 event pairs, 84 based on Foata normal form. 24/5339 useless extension candidates. Maximal degree in co-relation 6560. Up to 316 conditions per place. [2025-03-08 22:04:56,634 INFO L140 encePairwiseOnDemand]: 566/574 looper letters, 13 selfloop transitions, 4 changer transitions 12/561 dead transitions. [2025-03-08 22:04:56,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 561 transitions, 1592 flow [2025-03-08 22:04:56,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:56,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:56,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1639 transitions. [2025-03-08 22:04:56,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9518002322880371 [2025-03-08 22:04:56,636 INFO L175 Difference]: Start difference. First operand has 552 places, 559 transitions, 1548 flow. Second operand 3 states and 1639 transitions. [2025-03-08 22:04:56,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 561 transitions, 1592 flow [2025-03-08 22:04:56,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 561 transitions, 1580 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:04:56,642 INFO L231 Difference]: Finished difference. Result has 548 places, 547 transitions, 1529 flow [2025-03-08 22:04:56,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1530, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1529, PETRI_PLACES=548, PETRI_TRANSITIONS=547} [2025-03-08 22:04:56,642 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 13 predicate places. [2025-03-08 22:04:56,642 INFO L471 AbstractCegarLoop]: Abstraction has has 548 places, 547 transitions, 1529 flow [2025-03-08 22:04:56,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 541.0) internal successors, (1623), 3 states have internal predecessors, (1623), 0 states have call successors, (0), 0 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-08 22:04:56,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:56,643 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:04:56,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 22:04:56,643 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:56,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:56,644 INFO L85 PathProgramCache]: Analyzing trace with hash 659115794, now seen corresponding path program 1 times [2025-03-08 22:04:56,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:56,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132065861] [2025-03-08 22:04:56,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:56,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:56,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-08 22:04:56,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-08 22:04:56,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:56,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:57,421 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2025-03-08 22:04:57,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:57,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132065861] [2025-03-08 22:04:57,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132065861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:57,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:57,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:04:57,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507400382] [2025-03-08 22:04:57,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:57,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:04:57,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:57,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:04:57,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:04:57,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 574 [2025-03-08 22:04:57,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 547 transitions, 1529 flow. Second operand has 6 states, 6 states have (on average 532.5) internal successors, (3195), 6 states have internal predecessors, (3195), 0 states have call successors, (0), 0 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-08 22:04:57,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:57,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 574 [2025-03-08 22:04:57,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:58,497 INFO L124 PetriNetUnfolderBase]: 160/4421 cut-off events. [2025-03-08 22:04:58,497 INFO L125 PetriNetUnfolderBase]: For 223/260 co-relation queries the response was YES. [2025-03-08 22:04:58,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5458 conditions, 4421 events. 160/4421 cut-off events. For 223/260 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 32713 event pairs, 22 based on Foata normal form. 8/4058 useless extension candidates. Maximal degree in co-relation 5392. Up to 126 conditions per place. [2025-03-08 22:04:58,567 INFO L140 encePairwiseOnDemand]: 568/574 looper letters, 29 selfloop transitions, 6 changer transitions 0/554 dead transitions. [2025-03-08 22:04:58,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 554 transitions, 1621 flow [2025-03-08 22:04:58,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:04:58,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:04:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3209 transitions. [2025-03-08 22:04:58,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317653890824622 [2025-03-08 22:04:58,569 INFO L175 Difference]: Start difference. First operand has 548 places, 547 transitions, 1529 flow. Second operand 6 states and 3209 transitions. [2025-03-08 22:04:58,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 554 transitions, 1621 flow [2025-03-08 22:04:58,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 554 transitions, 1613 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:58,578 INFO L231 Difference]: Finished difference. Result has 539 places, 546 transitions, 1531 flow [2025-03-08 22:04:58,578 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1519, PETRI_DIFFERENCE_MINUEND_PLACES=534, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1531, PETRI_PLACES=539, PETRI_TRANSITIONS=546} [2025-03-08 22:04:58,578 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 4 predicate places. [2025-03-08 22:04:58,579 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 546 transitions, 1531 flow [2025-03-08 22:04:58,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.5) internal successors, (3195), 6 states have internal predecessors, (3195), 0 states have call successors, (0), 0 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-08 22:04:58,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:58,579 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:04:58,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 22:04:58,583 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:04:58,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:58,584 INFO L85 PathProgramCache]: Analyzing trace with hash 854699762, now seen corresponding path program 1 times [2025-03-08 22:04:58,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:58,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144895756] [2025-03-08 22:04:58,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:58,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:58,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-08 22:04:58,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-08 22:04:58,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:58,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:58,684 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-08 22:04:58,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:58,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144895756] [2025-03-08 22:04:58,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144895756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:58,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:58,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:58,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513579475] [2025-03-08 22:04:58,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:58,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:58,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:58,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:58,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:58,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 574 [2025-03-08 22:04:58,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 546 transitions, 1531 flow. Second operand has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 0 states have call successors, (0), 0 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-08 22:04:58,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:58,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 574 [2025-03-08 22:04:58,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:00,811 INFO L124 PetriNetUnfolderBase]: 480/10385 cut-off events. [2025-03-08 22:05:00,811 INFO L125 PetriNetUnfolderBase]: For 298/315 co-relation queries the response was YES. [2025-03-08 22:05:00,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12050 conditions, 10385 events. 480/10385 cut-off events. For 298/315 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 106869 event pairs, 141 based on Foata normal form. 1/9408 useless extension candidates. Maximal degree in co-relation 11536. Up to 573 conditions per place. [2025-03-08 22:05:00,898 INFO L140 encePairwiseOnDemand]: 570/574 looper letters, 13 selfloop transitions, 2 changer transitions 0/549 dead transitions. [2025-03-08 22:05:00,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 549 transitions, 1570 flow [2025-03-08 22:05:00,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:00,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:00,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1649 transitions. [2025-03-08 22:05:00,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9576074332171893 [2025-03-08 22:05:00,900 INFO L175 Difference]: Start difference. First operand has 539 places, 546 transitions, 1531 flow. Second operand 3 states and 1649 transitions. [2025-03-08 22:05:00,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 549 transitions, 1570 flow [2025-03-08 22:05:00,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 549 transitions, 1558 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:05:00,908 INFO L231 Difference]: Finished difference. Result has 535 places, 546 transitions, 1529 flow [2025-03-08 22:05:00,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1515, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1529, PETRI_PLACES=535, PETRI_TRANSITIONS=546} [2025-03-08 22:05:00,909 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 0 predicate places. [2025-03-08 22:05:00,909 INFO L471 AbstractCegarLoop]: Abstraction has has 535 places, 546 transitions, 1529 flow [2025-03-08 22:05:00,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 0 states have call successors, (0), 0 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-08 22:05:00,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:00,910 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:00,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 22:05:00,910 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:05:00,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:00,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1095765640, now seen corresponding path program 1 times [2025-03-08 22:05:00,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:00,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244011563] [2025-03-08 22:05:00,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:00,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:00,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-03-08 22:05:00,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-03-08 22:05:00,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:00,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-08 22:05:01,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:01,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244011563] [2025-03-08 22:05:01,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244011563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:01,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:01,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:05:01,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348047356] [2025-03-08 22:05:01,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:01,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:05:01,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:01,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:05:01,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:05:01,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 543 out of 574 [2025-03-08 22:05:01,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 546 transitions, 1529 flow. Second operand has 4 states, 4 states have (on average 544.75) internal successors, (2179), 4 states have internal predecessors, (2179), 0 states have call successors, (0), 0 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-08 22:05:01,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:01,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 543 of 574 [2025-03-08 22:05:01,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:02,896 INFO L124 PetriNetUnfolderBase]: 464/8938 cut-off events. [2025-03-08 22:05:02,896 INFO L125 PetriNetUnfolderBase]: For 450/487 co-relation queries the response was YES. [2025-03-08 22:05:02,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10867 conditions, 8938 events. 464/8938 cut-off events. For 450/487 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 94779 event pairs, 188 based on Foata normal form. 0/7998 useless extension candidates. Maximal degree in co-relation 10353. Up to 519 conditions per place. [2025-03-08 22:05:02,999 INFO L140 encePairwiseOnDemand]: 569/574 looper letters, 20 selfloop transitions, 4 changer transitions 0/556 dead transitions. [2025-03-08 22:05:02,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 556 transitions, 1601 flow [2025-03-08 22:05:02,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:05:02,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 22:05:03,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2740 transitions. [2025-03-08 22:05:03,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9547038327526133 [2025-03-08 22:05:03,001 INFO L175 Difference]: Start difference. First operand has 535 places, 546 transitions, 1529 flow. Second operand 5 states and 2740 transitions. [2025-03-08 22:05:03,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 556 transitions, 1601 flow [2025-03-08 22:05:03,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 556 transitions, 1601 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:05:03,009 INFO L231 Difference]: Finished difference. Result has 542 places, 548 transitions, 1554 flow [2025-03-08 22:05:03,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1525, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1554, PETRI_PLACES=542, PETRI_TRANSITIONS=548} [2025-03-08 22:05:03,010 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 7 predicate places. [2025-03-08 22:05:03,010 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 548 transitions, 1554 flow [2025-03-08 22:05:03,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 544.75) internal successors, (2179), 4 states have internal predecessors, (2179), 0 states have call successors, (0), 0 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-08 22:05:03,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:03,011 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:03,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 22:05:03,011 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:05:03,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:03,012 INFO L85 PathProgramCache]: Analyzing trace with hash 842569820, now seen corresponding path program 1 times [2025-03-08 22:05:03,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:03,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803901529] [2025-03-08 22:05:03,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:03,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:03,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-08 22:05:03,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-08 22:05:03,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:03,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-08 22:05:03,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:03,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803901529] [2025-03-08 22:05:03,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803901529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:03,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:03,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:03,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506679557] [2025-03-08 22:05:03,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:03,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:03,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:03,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:03,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:03,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-03-08 22:05:03,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 548 transitions, 1554 flow. Second operand has 3 states, 3 states have (on average 543.6666666666666) internal successors, (1631), 3 states have internal predecessors, (1631), 0 states have call successors, (0), 0 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-08 22:05:03,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:03,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-03-08 22:05:03,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:04,876 INFO L124 PetriNetUnfolderBase]: 676/8832 cut-off events. [2025-03-08 22:05:04,876 INFO L125 PetriNetUnfolderBase]: For 998/1039 co-relation queries the response was YES. [2025-03-08 22:05:04,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11676 conditions, 8832 events. 676/8832 cut-off events. For 998/1039 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 95263 event pairs, 366 based on Foata normal form. 0/8004 useless extension candidates. Maximal degree in co-relation 11159. Up to 936 conditions per place. [2025-03-08 22:05:04,935 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 14 selfloop transitions, 2 changer transitions 1/549 dead transitions. [2025-03-08 22:05:04,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 549 transitions, 1592 flow [2025-03-08 22:05:04,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:04,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:04,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1639 transitions. [2025-03-08 22:05:04,937 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9518002322880371 [2025-03-08 22:05:04,937 INFO L175 Difference]: Start difference. First operand has 542 places, 548 transitions, 1554 flow. Second operand 3 states and 1639 transitions. [2025-03-08 22:05:04,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 549 transitions, 1592 flow [2025-03-08 22:05:04,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 549 transitions, 1592 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:05:04,944 INFO L231 Difference]: Finished difference. Result has 543 places, 547 transitions, 1556 flow [2025-03-08 22:05:04,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1556, PETRI_PLACES=543, PETRI_TRANSITIONS=547} [2025-03-08 22:05:04,945 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 8 predicate places. [2025-03-08 22:05:04,946 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 547 transitions, 1556 flow [2025-03-08 22:05:04,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.6666666666666) internal successors, (1631), 3 states have internal predecessors, (1631), 0 states have call successors, (0), 0 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-08 22:05:04,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:04,946 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:04,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 22:05:04,947 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:05:04,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:04,949 INFO L85 PathProgramCache]: Analyzing trace with hash -897223911, now seen corresponding path program 1 times [2025-03-08 22:05:04,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:04,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757131064] [2025-03-08 22:05:04,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:04,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:04,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-08 22:05:04,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-08 22:05:04,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:04,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:05,629 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-08 22:05:05,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:05,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757131064] [2025-03-08 22:05:05,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757131064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:05,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:05,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:05:05,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115229614] [2025-03-08 22:05:05,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:05,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:05:05,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:05,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:05:05,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:05:05,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 574 [2025-03-08 22:05:05,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 547 transitions, 1556 flow. Second operand has 6 states, 6 states have (on average 532.8333333333334) internal successors, (3197), 6 states have internal predecessors, (3197), 0 states have call successors, (0), 0 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-08 22:05:05,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:05,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 574 [2025-03-08 22:05:05,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:08,233 INFO L124 PetriNetUnfolderBase]: 462/8577 cut-off events. [2025-03-08 22:05:08,233 INFO L125 PetriNetUnfolderBase]: For 816/867 co-relation queries the response was YES. [2025-03-08 22:05:08,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11228 conditions, 8577 events. 462/8577 cut-off events. For 816/867 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 89168 event pairs, 78 based on Foata normal form. 0/7980 useless extension candidates. Maximal degree in co-relation 10648. Up to 282 conditions per place. [2025-03-08 22:05:08,343 INFO L140 encePairwiseOnDemand]: 568/574 looper letters, 29 selfloop transitions, 6 changer transitions 0/554 dead transitions. [2025-03-08 22:05:08,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 554 transitions, 1648 flow [2025-03-08 22:05:08,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:05:08,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:05:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3209 transitions. [2025-03-08 22:05:08,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317653890824622 [2025-03-08 22:05:08,345 INFO L175 Difference]: Start difference. First operand has 543 places, 547 transitions, 1556 flow. Second operand 6 states and 3209 transitions. [2025-03-08 22:05:08,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 554 transitions, 1648 flow [2025-03-08 22:05:08,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 554 transitions, 1644 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:08,355 INFO L231 Difference]: Finished difference. Result has 545 places, 546 transitions, 1562 flow [2025-03-08 22:05:08,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1550, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1562, PETRI_PLACES=545, PETRI_TRANSITIONS=546} [2025-03-08 22:05:08,356 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 10 predicate places. [2025-03-08 22:05:08,356 INFO L471 AbstractCegarLoop]: Abstraction has has 545 places, 546 transitions, 1562 flow [2025-03-08 22:05:08,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.8333333333334) internal successors, (3197), 6 states have internal predecessors, (3197), 0 states have call successors, (0), 0 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-08 22:05:08,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:08,356 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:08,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 22:05:08,356 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:05:08,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:08,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1037665291, now seen corresponding path program 1 times [2025-03-08 22:05:08,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:08,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366872911] [2025-03-08 22:05:08,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:08,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:08,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-03-08 22:05:08,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-03-08 22:05:08,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:08,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:08,958 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-08 22:05:08,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:08,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366872911] [2025-03-08 22:05:08,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366872911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:08,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:08,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:05:08,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150731717] [2025-03-08 22:05:08,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:08,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:05:08,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:08,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:05:08,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:05:09,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 574 [2025-03-08 22:05:09,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 546 transitions, 1562 flow. Second operand has 6 states, 6 states have (on average 532.6666666666666) internal successors, (3196), 6 states have internal predecessors, (3196), 0 states have call successors, (0), 0 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-08 22:05:09,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:09,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 574 [2025-03-08 22:05:09,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:10,741 INFO L124 PetriNetUnfolderBase]: 216/6466 cut-off events. [2025-03-08 22:05:10,741 INFO L125 PetriNetUnfolderBase]: For 361/443 co-relation queries the response was YES. [2025-03-08 22:05:10,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8195 conditions, 6466 events. 216/6466 cut-off events. For 361/443 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 55473 event pairs, 39 based on Foata normal form. 2/6077 useless extension candidates. Maximal degree in co-relation 8009. Up to 152 conditions per place. [2025-03-08 22:05:10,862 INFO L140 encePairwiseOnDemand]: 568/574 looper letters, 29 selfloop transitions, 6 changer transitions 0/553 dead transitions. [2025-03-08 22:05:10,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 553 transitions, 1654 flow [2025-03-08 22:05:10,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:05:10,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:05:10,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3209 transitions. [2025-03-08 22:05:10,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317653890824622 [2025-03-08 22:05:10,864 INFO L175 Difference]: Start difference. First operand has 545 places, 546 transitions, 1562 flow. Second operand 6 states and 3209 transitions. [2025-03-08 22:05:10,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 553 transitions, 1654 flow [2025-03-08 22:05:10,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 553 transitions, 1642 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:05:10,872 INFO L231 Difference]: Finished difference. Result has 544 places, 545 transitions, 1560 flow [2025-03-08 22:05:10,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1560, PETRI_PLACES=544, PETRI_TRANSITIONS=545} [2025-03-08 22:05:10,873 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 9 predicate places. [2025-03-08 22:05:10,873 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 545 transitions, 1560 flow [2025-03-08 22:05:10,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.6666666666666) internal successors, (3196), 6 states have internal predecessors, (3196), 0 states have call successors, (0), 0 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-08 22:05:10,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:10,874 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:10,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 22:05:10,874 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:05:10,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:10,875 INFO L85 PathProgramCache]: Analyzing trace with hash 231269758, now seen corresponding path program 1 times [2025-03-08 22:05:10,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:10,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297263818] [2025-03-08 22:05:10,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:10,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:10,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-03-08 22:05:10,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-03-08 22:05:10,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:10,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:11,444 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-08 22:05:11,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:11,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297263818] [2025-03-08 22:05:11,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297263818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:11,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:11,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:05:11,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283097569] [2025-03-08 22:05:11,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:11,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:05:11,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:11,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:05:11,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:05:11,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 574 [2025-03-08 22:05:11,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 545 transitions, 1560 flow. Second operand has 6 states, 6 states have (on average 532.8333333333334) internal successors, (3197), 6 states have internal predecessors, (3197), 0 states have call successors, (0), 0 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-08 22:05:11,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:11,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 574 [2025-03-08 22:05:11,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:13,513 INFO L124 PetriNetUnfolderBase]: 512/8653 cut-off events. [2025-03-08 22:05:13,513 INFO L125 PetriNetUnfolderBase]: For 775/816 co-relation queries the response was YES. [2025-03-08 22:05:13,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11257 conditions, 8653 events. 512/8653 cut-off events. For 775/816 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 90452 event pairs, 76 based on Foata normal form. 8/8123 useless extension candidates. Maximal degree in co-relation 10678. Up to 320 conditions per place. [2025-03-08 22:05:13,635 INFO L140 encePairwiseOnDemand]: 568/574 looper letters, 29 selfloop transitions, 6 changer transitions 0/552 dead transitions. [2025-03-08 22:05:13,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 552 transitions, 1652 flow [2025-03-08 22:05:13,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:05:13,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:05:13,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3209 transitions. [2025-03-08 22:05:13,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317653890824622 [2025-03-08 22:05:13,637 INFO L175 Difference]: Start difference. First operand has 544 places, 545 transitions, 1560 flow. Second operand 6 states and 3209 transitions. [2025-03-08 22:05:13,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 552 transitions, 1652 flow [2025-03-08 22:05:13,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 552 transitions, 1640 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:05:13,646 INFO L231 Difference]: Finished difference. Result has 543 places, 544 transitions, 1558 flow [2025-03-08 22:05:13,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1546, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1558, PETRI_PLACES=543, PETRI_TRANSITIONS=544} [2025-03-08 22:05:13,647 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 8 predicate places. [2025-03-08 22:05:13,647 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 544 transitions, 1558 flow [2025-03-08 22:05:13,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.8333333333334) internal successors, (3197), 6 states have internal predecessors, (3197), 0 states have call successors, (0), 0 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-08 22:05:13,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:13,648 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:13,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 22:05:13,648 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:05:13,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:13,650 INFO L85 PathProgramCache]: Analyzing trace with hash -216629663, now seen corresponding path program 1 times [2025-03-08 22:05:13,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:13,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841597229] [2025-03-08 22:05:13,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:13,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:13,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-08 22:05:13,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-08 22:05:13,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:13,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:13,748 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2025-03-08 22:05:13,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:13,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841597229] [2025-03-08 22:05:13,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841597229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:13,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:13,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:13,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271747302] [2025-03-08 22:05:13,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:13,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:13,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:13,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:13,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:13,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-03-08 22:05:13,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 544 transitions, 1558 flow. Second operand has 3 states, 3 states have (on average 542.6666666666666) internal successors, (1628), 3 states have internal predecessors, (1628), 0 states have call successors, (0), 0 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-08 22:05:13,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:13,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-03-08 22:05:13,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:15,303 INFO L124 PetriNetUnfolderBase]: 226/7968 cut-off events. [2025-03-08 22:05:15,303 INFO L125 PetriNetUnfolderBase]: For 376/602 co-relation queries the response was YES. [2025-03-08 22:05:15,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10222 conditions, 7968 events. 226/7968 cut-off events. For 376/602 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 73656 event pairs, 84 based on Foata normal form. 10/7639 useless extension candidates. Maximal degree in co-relation 10060. Up to 301 conditions per place. [2025-03-08 22:05:15,428 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 14 selfloop transitions, 3 changer transitions 0/545 dead transitions. [2025-03-08 22:05:15,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 545 transitions, 1596 flow [2025-03-08 22:05:15,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:15,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:15,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1639 transitions. [2025-03-08 22:05:15,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9518002322880371 [2025-03-08 22:05:15,429 INFO L175 Difference]: Start difference. First operand has 543 places, 544 transitions, 1558 flow. Second operand 3 states and 1639 transitions. [2025-03-08 22:05:15,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 545 transitions, 1596 flow [2025-03-08 22:05:15,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 545 transitions, 1584 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:05:15,438 INFO L231 Difference]: Finished difference. Result has 539 places, 543 transitions, 1550 flow [2025-03-08 22:05:15,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1544, PETRI_DIFFERENCE_MINUEND_PLACES=537, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1550, PETRI_PLACES=539, PETRI_TRANSITIONS=543} [2025-03-08 22:05:15,438 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 4 predicate places. [2025-03-08 22:05:15,439 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 543 transitions, 1550 flow [2025-03-08 22:05:15,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 542.6666666666666) internal successors, (1628), 3 states have internal predecessors, (1628), 0 states have call successors, (0), 0 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-08 22:05:15,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:15,439 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:15,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 22:05:15,439 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:05:15,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:15,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1689183004, now seen corresponding path program 1 times [2025-03-08 22:05:15,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:15,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235922317] [2025-03-08 22:05:15,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:15,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:15,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-08 22:05:15,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-08 22:05:15,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:15,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:15,528 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2025-03-08 22:05:15,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:15,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235922317] [2025-03-08 22:05:15,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235922317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:15,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:15,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:15,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485451756] [2025-03-08 22:05:15,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:15,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:15,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:15,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:15,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:15,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-03-08 22:05:15,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 543 transitions, 1550 flow. Second operand has 3 states, 3 states have (on average 543.0) internal successors, (1629), 3 states have internal predecessors, (1629), 0 states have call successors, (0), 0 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-08 22:05:15,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:15,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-03-08 22:05:15,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:17,395 INFO L124 PetriNetUnfolderBase]: 325/8405 cut-off events. [2025-03-08 22:05:17,395 INFO L125 PetriNetUnfolderBase]: For 458/595 co-relation queries the response was YES. [2025-03-08 22:05:17,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10474 conditions, 8405 events. 325/8405 cut-off events. For 458/595 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 80319 event pairs, 166 based on Foata normal form. 0/7984 useless extension candidates. Maximal degree in co-relation 9956. Up to 367 conditions per place. [2025-03-08 22:05:17,508 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 14 selfloop transitions, 3 changer transitions 0/544 dead transitions. [2025-03-08 22:05:17,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 544 transitions, 1588 flow [2025-03-08 22:05:17,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:17,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:17,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1639 transitions. [2025-03-08 22:05:17,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9518002322880371 [2025-03-08 22:05:17,509 INFO L175 Difference]: Start difference. First operand has 539 places, 543 transitions, 1550 flow. Second operand 3 states and 1639 transitions. [2025-03-08 22:05:17,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 544 transitions, 1588 flow [2025-03-08 22:05:17,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 544 transitions, 1582 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:17,518 INFO L231 Difference]: Finished difference. Result has 538 places, 542 transitions, 1548 flow [2025-03-08 22:05:17,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1548, PETRI_PLACES=538, PETRI_TRANSITIONS=542} [2025-03-08 22:05:17,519 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 3 predicate places. [2025-03-08 22:05:17,519 INFO L471 AbstractCegarLoop]: Abstraction has has 538 places, 542 transitions, 1548 flow [2025-03-08 22:05:17,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.0) internal successors, (1629), 3 states have internal predecessors, (1629), 0 states have call successors, (0), 0 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-08 22:05:17,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:17,519 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:17,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 22:05:17,520 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-03-08 22:05:17,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:17,521 INFO L85 PathProgramCache]: Analyzing trace with hash 42914957, now seen corresponding path program 1 times [2025-03-08 22:05:17,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:17,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244126733] [2025-03-08 22:05:17,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:17,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:17,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-03-08 22:05:17,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-03-08 22:05:17,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:17,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:17,613 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-08 22:05:17,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:17,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244126733] [2025-03-08 22:05:17,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244126733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:17,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:17,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:17,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985122237] [2025-03-08 22:05:17,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:17,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:17,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:17,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:17,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:17,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-03-08 22:05:17,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 542 transitions, 1548 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 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-08 22:05:17,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:17,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-03-08 22:05:17,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:19,548 INFO L124 PetriNetUnfolderBase]: 620/8668 cut-off events. [2025-03-08 22:05:19,548 INFO L125 PetriNetUnfolderBase]: For 886/915 co-relation queries the response was YES. [2025-03-08 22:05:19,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11419 conditions, 8668 events. 620/8668 cut-off events. For 886/915 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 93431 event pairs, 344 based on Foata normal form. 0/8155 useless extension candidates. Maximal degree in co-relation 10901. Up to 890 conditions per place. [2025-03-08 22:05:19,608 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 0 selfloop transitions, 0 changer transitions 543/543 dead transitions. [2025-03-08 22:05:19,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 543 transitions, 1586 flow [2025-03-08 22:05:19,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:19,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1639 transitions. [2025-03-08 22:05:19,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9518002322880371 [2025-03-08 22:05:19,610 INFO L175 Difference]: Start difference. First operand has 538 places, 542 transitions, 1548 flow. Second operand 3 states and 1639 transitions. [2025-03-08 22:05:19,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 543 transitions, 1586 flow [2025-03-08 22:05:19,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 543 transitions, 1580 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:19,617 INFO L231 Difference]: Finished difference. Result has 537 places, 0 transitions, 0 flow [2025-03-08 22:05:19,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1540, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=537, PETRI_TRANSITIONS=0} [2025-03-08 22:05:19,617 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 2 predicate places. [2025-03-08 22:05:19,617 INFO L471 AbstractCegarLoop]: Abstraction has has 537 places, 0 transitions, 0 flow [2025-03-08 22:05:19,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 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-08 22:05:19,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (80 of 81 remaining) [2025-03-08 22:05:19,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (79 of 81 remaining) [2025-03-08 22:05:19,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (78 of 81 remaining) [2025-03-08 22:05:19,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (77 of 81 remaining) [2025-03-08 22:05:19,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (76 of 81 remaining) [2025-03-08 22:05:19,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (75 of 81 remaining) [2025-03-08 22:05:19,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (74 of 81 remaining) [2025-03-08 22:05:19,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (73 of 81 remaining) [2025-03-08 22:05:19,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (72 of 81 remaining) [2025-03-08 22:05:19,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (71 of 81 remaining) [2025-03-08 22:05:19,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (70 of 81 remaining) [2025-03-08 22:05:19,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (69 of 81 remaining) [2025-03-08 22:05:19,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (68 of 81 remaining) [2025-03-08 22:05:19,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (67 of 81 remaining) [2025-03-08 22:05:19,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (66 of 81 remaining) [2025-03-08 22:05:19,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (65 of 81 remaining) [2025-03-08 22:05:19,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (64 of 81 remaining) [2025-03-08 22:05:19,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (63 of 81 remaining) [2025-03-08 22:05:19,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (62 of 81 remaining) [2025-03-08 22:05:19,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (61 of 81 remaining) [2025-03-08 22:05:19,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (60 of 81 remaining) [2025-03-08 22:05:19,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (59 of 81 remaining) [2025-03-08 22:05:19,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (58 of 81 remaining) [2025-03-08 22:05:19,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (57 of 81 remaining) [2025-03-08 22:05:19,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (56 of 81 remaining) [2025-03-08 22:05:19,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (55 of 81 remaining) [2025-03-08 22:05:19,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (54 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (53 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (52 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (51 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (50 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (49 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (48 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (47 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (46 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (45 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (44 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (43 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (42 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (41 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (40 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (39 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (38 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (37 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (36 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (32 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (31 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (30 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (29 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (28 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (27 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (26 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (25 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (24 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (22 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (21 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (20 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (19 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (18 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (17 of 81 remaining) [2025-03-08 22:05:19,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (16 of 81 remaining) [2025-03-08 22:05:19,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (15 of 81 remaining) [2025-03-08 22:05:19,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (14 of 81 remaining) [2025-03-08 22:05:19,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (13 of 81 remaining) [2025-03-08 22:05:19,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (12 of 81 remaining) [2025-03-08 22:05:19,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (11 of 81 remaining) [2025-03-08 22:05:19,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 81 remaining) [2025-03-08 22:05:19,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 81 remaining) [2025-03-08 22:05:19,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 81 remaining) [2025-03-08 22:05:19,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 81 remaining) [2025-03-08 22:05:19,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (6 of 81 remaining) [2025-03-08 22:05:19,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 81 remaining) [2025-03-08 22:05:19,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (4 of 81 remaining) [2025-03-08 22:05:19,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (3 of 81 remaining) [2025-03-08 22:05:19,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (2 of 81 remaining) [2025-03-08 22:05:19,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (1 of 81 remaining) [2025-03-08 22:05:19,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (0 of 81 remaining) [2025-03-08 22:05:19,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 22:05:19,622 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:19,626 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 22:05:19,626 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:05:19,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:05:19 BasicIcfg [2025-03-08 22:05:19,630 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:05:19,631 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:05:19,631 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:05:19,631 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:05:19,632 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:04:36" (3/4) ... [2025-03-08 22:05:19,633 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 22:05:19,635 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-08 22:05:19,635 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-08 22:05:19,635 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-08 22:05:19,639 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2025-03-08 22:05:19,639 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 22:05:19,640 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 22:05:19,640 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 22:05:19,717 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:05:19,717 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:05:19,717 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:05:19,718 INFO L158 Benchmark]: Toolchain (without parser) took 44539.43ms. Allocated memory was 142.6MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 112.0MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 765.0MB. Max. memory is 16.1GB. [2025-03-08 22:05:19,719 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:05:19,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.61ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 98.5MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:05:19,720 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.38ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 95.4MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:05:19,720 INFO L158 Benchmark]: Boogie Preprocessor took 31.54ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 92.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:05:19,721 INFO L158 Benchmark]: IcfgBuilder took 719.62ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 52.1MB in the end (delta: 40.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 22:05:19,721 INFO L158 Benchmark]: TraceAbstraction took 43427.75ms. Allocated memory was 142.6MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 51.2MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2025-03-08 22:05:19,721 INFO L158 Benchmark]: Witness Printer took 86.38ms. Allocated memory is still 2.5GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:05:19,722 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.19ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.61ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 98.5MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.38ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 95.4MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.54ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 92.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 719.62ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 52.1MB in the end (delta: 40.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 43427.75ms. Allocated memory was 142.6MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 51.2MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Witness Printer took 86.38ms. Allocated memory is still 2.5GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 4.2MB). There was no memory consumed. 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: 50]: 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: 54]: 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: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: 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: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: 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: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 79]: 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: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: 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: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: 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: 93]: 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: 94]: 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: 95]: 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: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: 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, 848 locations, 889 edges, 81 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: 43.2s, OverallIterations: 37, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 35.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3975 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2609 mSDsluCounter, 1588 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1335 mSDsCounter, 725 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7061 IncrementalHoareTripleChecker+Invalid, 7786 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 725 mSolverCounterUnsat, 253 mSDtfsCounter, 7061 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1204 GetRequests, 1078 SyntacticMatches, 5 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1616occurred in iteration=25, InterpolantAutomatonStates: 162, 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 10233 NumberOfCodeBlocks, 9873 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 10720 ConstructedInterpolants, 0 QuantifiedInterpolants, 12782 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1184 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 41 InterpolantComputations, 35 PerfectInterpolantSequences, 6751/6898 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 45 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 22:05:19,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE