./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/queue_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/queue_ok.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:56:22,967 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:56:23,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 08:56:23,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:56:23,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:56:23,049 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:56:23,050 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:56:23,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:56:23,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:56:23,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:56:23,052 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:56:23,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:56:23,052 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:56:23,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:56:23,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:56:23,053 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 08:56:23,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:56:23,053 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 08:56:23,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:56:23,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:56:23,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:56:23,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:56:23,053 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 08:56:23,053 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 08:56:23,053 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 08:56:23,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:56:23,054 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:56:23,054 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:56:23,054 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:56:23,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:56:23,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:56:23,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:56:23,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:56:23,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:56:23,054 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:56:23,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:56:23,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:56:23,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:56:23,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:56:23,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:56:23,055 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:56:23,055 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:56:23,055 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2025-02-06 08:56:23,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:56:23,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:56:23,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:56:23,292 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:56:23,292 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:56:23,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_ok.i [2025-02-06 08:56:24,507 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b1ab11d4b/37959ed36a484065aac854dd12a8a2cf/FLAG4f7134e94 [2025-02-06 08:56:24,854 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:56:24,855 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok.i [2025-02-06 08:56:24,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b1ab11d4b/37959ed36a484065aac854dd12a8a2cf/FLAG4f7134e94 [2025-02-06 08:56:24,896 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b1ab11d4b/37959ed36a484065aac854dd12a8a2cf [2025-02-06 08:56:24,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:56:24,899 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:56:24,900 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:56:24,900 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:56:24,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:56:24,904 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:56:24" (1/1) ... [2025-02-06 08:56:24,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78ce8b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:24, skipping insertion in model container [2025-02-06 08:56:24,905 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:56:24" (1/1) ... [2025-02-06 08:56:24,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:56:25,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:56:25,249 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:56:25,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:56:25,337 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:56:25,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:25 WrapperNode [2025-02-06 08:56:25,338 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:56:25,339 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:56:25,339 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:56:25,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:56:25,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:25" (1/1) ... [2025-02-06 08:56:25,356 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:25" (1/1) ... [2025-02-06 08:56:25,382 INFO L138 Inliner]: procedures = 274, calls = 94, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 409 [2025-02-06 08:56:25,382 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:56:25,383 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:56:25,383 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:56:25,383 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:56:25,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:25" (1/1) ... [2025-02-06 08:56:25,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:25" (1/1) ... [2025-02-06 08:56:25,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:25" (1/1) ... [2025-02-06 08:56:25,409 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:25" (1/1) ... [2025-02-06 08:56:25,433 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:25" (1/1) ... [2025-02-06 08:56:25,440 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:25" (1/1) ... [2025-02-06 08:56:25,442 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:25" (1/1) ... [2025-02-06 08:56:25,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:25" (1/1) ... [2025-02-06 08:56:25,454 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:56:25,455 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:56:25,455 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:56:25,455 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:56:25,456 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:25" (1/1) ... [2025-02-06 08:56:25,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:56:25,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:56:25,483 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 08:56:25,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 08:56:25,505 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-02-06 08:56:25,506 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-02-06 08:56:25,506 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-02-06 08:56:25,506 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-02-06 08:56:25,506 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 08:56:25,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 08:56:25,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 08:56:25,506 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 08:56:25,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:56:25,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 08:56:25,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:56:25,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:56:25,507 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 08:56:25,601 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:56:25,602 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:56:26,128 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 08:56:26,128 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:56:26,166 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:56:26,166 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 08:56:26,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:56:26 BoogieIcfgContainer [2025-02-06 08:56:26,166 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:56:26,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:56:26,168 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:56:26,175 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:56:26,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:56:24" (1/3) ... [2025-02-06 08:56:26,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e37f404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:56:26, skipping insertion in model container [2025-02-06 08:56:26,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:25" (2/3) ... [2025-02-06 08:56:26,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e37f404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:56:26, skipping insertion in model container [2025-02-06 08:56:26,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:56:26" (3/3) ... [2025-02-06 08:56:26,182 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2025-02-06 08:56:26,197 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:56:26,198 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok.i that has 3 procedures, 460 locations, 1 initial locations, 2 loop locations, and 33 error locations. [2025-02-06 08:56:26,198 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 08:56:26,342 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 08:56:26,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 466 places, 472 transitions, 958 flow [2025-02-06 08:56:26,610 INFO L124 PetriNetUnfolderBase]: 13/470 cut-off events. [2025-02-06 08:56:26,612 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 08:56:26,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 470 events. 13/470 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 740 event pairs, 0 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 309. Up to 3 conditions per place. [2025-02-06 08:56:26,622 INFO L82 GeneralOperation]: Start removeDead. Operand has 466 places, 472 transitions, 958 flow [2025-02-06 08:56:26,629 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 459 places, 465 transitions, 939 flow [2025-02-06 08:56:26,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:56:26,654 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;@483a35f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:56:26,655 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-02-06 08:56:26,666 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 08:56:26,667 INFO L124 PetriNetUnfolderBase]: 0/70 cut-off events. [2025-02-06 08:56:26,668 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 08:56:26,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:26,668 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] [2025-02-06 08:56:26,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:56:26,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:26,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1038377964, now seen corresponding path program 1 times [2025-02-06 08:56:26,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:26,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694972547] [2025-02-06 08:56:26,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:26,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:26,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 08:56:26,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 08:56:26,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:26,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:26,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:26,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:26,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694972547] [2025-02-06 08:56:26,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694972547] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:26,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:26,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:56:26,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774329999] [2025-02-06 08:56:26,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:26,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:56:26,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:26,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:56:26,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:56:27,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 472 [2025-02-06 08:56:27,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 465 transitions, 939 flow. Second operand has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:27,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:27,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 472 [2025-02-06 08:56:27,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:27,161 INFO L124 PetriNetUnfolderBase]: 40/986 cut-off events. [2025-02-06 08:56:27,161 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-06 08:56:27,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 986 events. 40/986 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4394 event pairs, 19 based on Foata normal form. 3/881 useless extension candidates. Maximal degree in co-relation 881. Up to 52 conditions per place. [2025-02-06 08:56:27,171 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 13 selfloop transitions, 2 changer transitions 0/452 dead transitions. [2025-02-06 08:56:27,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 452 transitions, 943 flow [2025-02-06 08:56:27,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:56:27,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:56:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2025-02-06 08:56:27,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.96045197740113 [2025-02-06 08:56:27,184 INFO L175 Difference]: Start difference. First operand has 459 places, 465 transitions, 939 flow. Second operand 3 states and 1360 transitions. [2025-02-06 08:56:27,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 452 transitions, 943 flow [2025-02-06 08:56:27,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 452 transitions, 938 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 08:56:27,194 INFO L231 Difference]: Finished difference. Result has 449 places, 452 transitions, 912 flow [2025-02-06 08:56:27,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=912, PETRI_PLACES=449, PETRI_TRANSITIONS=452} [2025-02-06 08:56:27,199 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -10 predicate places. [2025-02-06 08:56:27,199 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 452 transitions, 912 flow [2025-02-06 08:56:27,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:27,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:27,201 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] [2025-02-06 08:56:27,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:56:27,201 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:56:27,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:27,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1995106460, now seen corresponding path program 1 times [2025-02-06 08:56:27,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:27,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591365690] [2025-02-06 08:56:27,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:27,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:27,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-06 08:56:27,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-06 08:56:27,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:27,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:27,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:27,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:27,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591365690] [2025-02-06 08:56:27,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591365690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:27,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:27,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:56:27,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790144755] [2025-02-06 08:56:27,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:27,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:56:27,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:27,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:56:27,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:56:27,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 472 [2025-02-06 08:56:27,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 452 transitions, 912 flow. Second operand has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:27,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:27,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 472 [2025-02-06 08:56:27,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:27,421 INFO L124 PetriNetUnfolderBase]: 43/1114 cut-off events. [2025-02-06 08:56:27,421 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-06 08:56:27,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 1114 events. 43/1114 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 5448 event pairs, 19 based on Foata normal form. 0/996 useless extension candidates. Maximal degree in co-relation 1104. Up to 52 conditions per place. [2025-02-06 08:56:27,427 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 13 selfloop transitions, 2 changer transitions 0/451 dead transitions. [2025-02-06 08:56:27,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 451 transitions, 940 flow [2025-02-06 08:56:27,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:56:27,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:56:27,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1357 transitions. [2025-02-06 08:56:27,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9583333333333334 [2025-02-06 08:56:27,430 INFO L175 Difference]: Start difference. First operand has 449 places, 452 transitions, 912 flow. Second operand 3 states and 1357 transitions. [2025-02-06 08:56:27,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 451 transitions, 940 flow [2025-02-06 08:56:27,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 451 transitions, 936 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 08:56:27,455 INFO L231 Difference]: Finished difference. Result has 448 places, 451 transitions, 910 flow [2025-02-06 08:56:27,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=910, PETRI_PLACES=448, PETRI_TRANSITIONS=451} [2025-02-06 08:56:27,456 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -11 predicate places. [2025-02-06 08:56:27,457 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 451 transitions, 910 flow [2025-02-06 08:56:27,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:27,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:27,462 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:27,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:56:27,462 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:56:27,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:27,463 INFO L85 PathProgramCache]: Analyzing trace with hash 651287665, now seen corresponding path program 1 times [2025-02-06 08:56:27,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:27,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029700958] [2025-02-06 08:56:27,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:27,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:27,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 08:56:27,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 08:56:27,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:27,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:28,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:28,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:28,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029700958] [2025-02-06 08:56:28,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029700958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:28,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:28,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:56:28,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916843500] [2025-02-06 08:56:28,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:28,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:56:28,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:28,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:56:28,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:56:28,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 472 [2025-02-06 08:56:28,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 451 transitions, 910 flow. Second operand has 6 states, 6 states have (on average 359.3333333333333) internal successors, (2156), 6 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:28,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:28,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 472 [2025-02-06 08:56:28,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:30,014 INFO L124 PetriNetUnfolderBase]: 2177/9184 cut-off events. [2025-02-06 08:56:30,015 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-02-06 08:56:30,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13285 conditions, 9184 events. 2177/9184 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 80052 event pairs, 1832 based on Foata normal form. 0/8228 useless extension candidates. Maximal degree in co-relation 13204. Up to 4013 conditions per place. [2025-02-06 08:56:30,065 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 100 selfloop transitions, 5 changer transitions 0/450 dead transitions. [2025-02-06 08:56:30,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 450 transitions, 1118 flow [2025-02-06 08:56:30,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:56:30,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:56:30,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2254 transitions. [2025-02-06 08:56:30,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7959039548022598 [2025-02-06 08:56:30,073 INFO L175 Difference]: Start difference. First operand has 448 places, 451 transitions, 910 flow. Second operand 6 states and 2254 transitions. [2025-02-06 08:56:30,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 450 transitions, 1118 flow [2025-02-06 08:56:30,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 450 transitions, 1114 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 08:56:30,079 INFO L231 Difference]: Finished difference. Result has 450 places, 450 transitions, 914 flow [2025-02-06 08:56:30,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=914, PETRI_PLACES=450, PETRI_TRANSITIONS=450} [2025-02-06 08:56:30,080 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -9 predicate places. [2025-02-06 08:56:30,081 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 450 transitions, 914 flow [2025-02-06 08:56:30,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 359.3333333333333) internal successors, (2156), 6 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:30,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:30,083 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:30,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:56:30,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:56:30,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:30,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1989225366, now seen corresponding path program 1 times [2025-02-06 08:56:30,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:30,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909313549] [2025-02-06 08:56:30,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:30,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:30,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 08:56:30,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 08:56:30,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:30,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:30,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:30,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909313549] [2025-02-06 08:56:30,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909313549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:30,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:30,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:56:30,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41024136] [2025-02-06 08:56:30,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:30,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:56:30,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:30,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:56:30,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:56:30,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 472 [2025-02-06 08:56:30,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 450 transitions, 914 flow. Second operand has 6 states, 6 states have (on average 359.3333333333333) internal successors, (2156), 6 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:30,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:30,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 472 [2025-02-06 08:56:30,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:32,287 INFO L124 PetriNetUnfolderBase]: 2177/9183 cut-off events. [2025-02-06 08:56:32,288 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-02-06 08:56:32,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13287 conditions, 9183 events. 2177/9183 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 80103 event pairs, 1832 based on Foata normal form. 0/8228 useless extension candidates. Maximal degree in co-relation 13190. Up to 4013 conditions per place. [2025-02-06 08:56:32,359 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 100 selfloop transitions, 5 changer transitions 0/449 dead transitions. [2025-02-06 08:56:32,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 449 transitions, 1122 flow [2025-02-06 08:56:32,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:56:32,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:56:32,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2254 transitions. [2025-02-06 08:56:32,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7959039548022598 [2025-02-06 08:56:32,364 INFO L175 Difference]: Start difference. First operand has 450 places, 450 transitions, 914 flow. Second operand 6 states and 2254 transitions. [2025-02-06 08:56:32,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 449 transitions, 1122 flow [2025-02-06 08:56:32,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 449 transitions, 1112 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 08:56:32,371 INFO L231 Difference]: Finished difference. Result has 449 places, 449 transitions, 912 flow [2025-02-06 08:56:32,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=912, PETRI_PLACES=449, PETRI_TRANSITIONS=449} [2025-02-06 08:56:32,372 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -10 predicate places. [2025-02-06 08:56:32,372 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 449 transitions, 912 flow [2025-02-06 08:56:32,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 359.3333333333333) internal successors, (2156), 6 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:32,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:32,374 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:32,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:56:32,374 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:56:32,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:32,375 INFO L85 PathProgramCache]: Analyzing trace with hash -674521394, now seen corresponding path program 1 times [2025-02-06 08:56:32,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:32,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752907343] [2025-02-06 08:56:32,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:32,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:32,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 08:56:32,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 08:56:32,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:32,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:33,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:33,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:33,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752907343] [2025-02-06 08:56:33,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752907343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:33,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:33,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:56:33,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472450805] [2025-02-06 08:56:33,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:33,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:56:33,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:33,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:56:33,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:56:33,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 472 [2025-02-06 08:56:33,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 449 transitions, 912 flow. Second operand has 6 states, 6 states have (on average 359.3333333333333) internal successors, (2156), 6 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:33,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:33,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 472 [2025-02-06 08:56:33,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:34,658 INFO L124 PetriNetUnfolderBase]: 2177/9182 cut-off events. [2025-02-06 08:56:34,658 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-02-06 08:56:34,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13286 conditions, 9182 events. 2177/9182 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 79914 event pairs, 1832 based on Foata normal form. 0/8228 useless extension candidates. Maximal degree in co-relation 13181. Up to 4013 conditions per place. [2025-02-06 08:56:34,692 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 100 selfloop transitions, 5 changer transitions 0/448 dead transitions. [2025-02-06 08:56:34,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 448 transitions, 1120 flow [2025-02-06 08:56:34,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:56:34,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:56:34,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2254 transitions. [2025-02-06 08:56:34,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7959039548022598 [2025-02-06 08:56:34,696 INFO L175 Difference]: Start difference. First operand has 449 places, 449 transitions, 912 flow. Second operand 6 states and 2254 transitions. [2025-02-06 08:56:34,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 448 transitions, 1120 flow [2025-02-06 08:56:34,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 448 transitions, 1110 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 08:56:34,702 INFO L231 Difference]: Finished difference. Result has 448 places, 448 transitions, 910 flow [2025-02-06 08:56:34,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=910, PETRI_PLACES=448, PETRI_TRANSITIONS=448} [2025-02-06 08:56:34,703 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -11 predicate places. [2025-02-06 08:56:34,703 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 448 transitions, 910 flow [2025-02-06 08:56:34,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 359.3333333333333) internal successors, (2156), 6 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:34,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:34,704 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] [2025-02-06 08:56:34,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 08:56:34,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:56:34,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:34,705 INFO L85 PathProgramCache]: Analyzing trace with hash 84007781, now seen corresponding path program 1 times [2025-02-06 08:56:34,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:34,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121040228] [2025-02-06 08:56:34,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:34,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:34,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 08:56:34,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 08:56:34,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:34,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:35,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:35,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:35,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121040228] [2025-02-06 08:56:35,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121040228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:35,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:35,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:56:35,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810496627] [2025-02-06 08:56:35,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:35,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:56:35,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:35,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:56:35,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:56:35,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 472 [2025-02-06 08:56:35,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 448 transitions, 910 flow. Second operand has 6 states, 6 states have (on average 407.1666666666667) internal successors, (2443), 6 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:35,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:35,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 472 [2025-02-06 08:56:35,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:36,663 INFO L124 PetriNetUnfolderBase]: 502/4907 cut-off events. [2025-02-06 08:56:36,664 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 08:56:36,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5777 conditions, 4907 events. 502/4907 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 39017 event pairs, 344 based on Foata normal form. 0/4325 useless extension candidates. Maximal degree in co-relation 5654. Up to 811 conditions per place. [2025-02-06 08:56:36,713 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 54 selfloop transitions, 5 changer transitions 0/447 dead transitions. [2025-02-06 08:56:36,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 447 transitions, 1026 flow [2025-02-06 08:56:36,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:56:36,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:56:36,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2484 transitions. [2025-02-06 08:56:36,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8771186440677966 [2025-02-06 08:56:36,730 INFO L175 Difference]: Start difference. First operand has 448 places, 448 transitions, 910 flow. Second operand 6 states and 2484 transitions. [2025-02-06 08:56:36,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 447 transitions, 1026 flow [2025-02-06 08:56:36,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 447 transitions, 1016 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 08:56:36,742 INFO L231 Difference]: Finished difference. Result has 447 places, 447 transitions, 908 flow [2025-02-06 08:56:36,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=908, PETRI_PLACES=447, PETRI_TRANSITIONS=447} [2025-02-06 08:56:36,748 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -12 predicate places. [2025-02-06 08:56:36,748 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 447 transitions, 908 flow [2025-02-06 08:56:36,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 407.1666666666667) internal successors, (2443), 6 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:36,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:36,749 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] [2025-02-06 08:56:36,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 08:56:36,749 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:56:36,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:36,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1788507416, now seen corresponding path program 1 times [2025-02-06 08:56:36,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:36,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53321598] [2025-02-06 08:56:36,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:36,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:36,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 08:56:36,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 08:56:36,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:36,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:37,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:37,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:37,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53321598] [2025-02-06 08:56:37,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53321598] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:37,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:37,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:56:37,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923517359] [2025-02-06 08:56:37,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:37,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:56:37,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:37,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:56:37,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:56:38,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 472 [2025-02-06 08:56:38,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 447 transitions, 908 flow. Second operand has 6 states, 6 states have (on average 407.1666666666667) internal successors, (2443), 6 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:38,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:38,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 472 [2025-02-06 08:56:38,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:38,779 INFO L124 PetriNetUnfolderBase]: 502/4906 cut-off events. [2025-02-06 08:56:38,779 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 08:56:38,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5776 conditions, 4906 events. 502/4906 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 39174 event pairs, 344 based on Foata normal form. 0/4325 useless extension candidates. Maximal degree in co-relation 5615. Up to 811 conditions per place. [2025-02-06 08:56:38,808 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 54 selfloop transitions, 5 changer transitions 0/446 dead transitions. [2025-02-06 08:56:38,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 446 transitions, 1024 flow [2025-02-06 08:56:38,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:56:38,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:56:38,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2484 transitions. [2025-02-06 08:56:38,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8771186440677966 [2025-02-06 08:56:38,813 INFO L175 Difference]: Start difference. First operand has 447 places, 447 transitions, 908 flow. Second operand 6 states and 2484 transitions. [2025-02-06 08:56:38,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 446 transitions, 1024 flow [2025-02-06 08:56:38,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 446 transitions, 1014 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 08:56:38,820 INFO L231 Difference]: Finished difference. Result has 446 places, 446 transitions, 906 flow [2025-02-06 08:56:38,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=906, PETRI_PLACES=446, PETRI_TRANSITIONS=446} [2025-02-06 08:56:38,823 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -13 predicate places. [2025-02-06 08:56:38,824 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 446 transitions, 906 flow [2025-02-06 08:56:38,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 407.1666666666667) internal successors, (2443), 6 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:38,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:38,826 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:38,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 08:56:38,826 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:56:38,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:38,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1108378393, now seen corresponding path program 1 times [2025-02-06 08:56:38,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:38,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702271660] [2025-02-06 08:56:38,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:38,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:38,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 08:56:38,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 08:56:38,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:38,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:38,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:38,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:38,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702271660] [2025-02-06 08:56:38,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702271660] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:38,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:38,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:56:38,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024286769] [2025-02-06 08:56:38,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:38,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:56:38,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:38,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:56:38,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:56:38,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 472 [2025-02-06 08:56:38,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 446 transitions, 906 flow. Second operand has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:38,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:38,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 472 [2025-02-06 08:56:38,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:39,026 INFO L124 PetriNetUnfolderBase]: 53/1041 cut-off events. [2025-02-06 08:56:39,027 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-06 08:56:39,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1151 conditions, 1041 events. 53/1041 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4919 event pairs, 12 based on Foata normal form. 0/937 useless extension candidates. Maximal degree in co-relation 1009. Up to 56 conditions per place. [2025-02-06 08:56:39,032 INFO L140 encePairwiseOnDemand]: 467/472 looper letters, 17 selfloop transitions, 4 changer transitions 0/454 dead transitions. [2025-02-06 08:56:39,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 454 transitions, 967 flow [2025-02-06 08:56:39,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:56:39,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:56:39,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1375 transitions. [2025-02-06 08:56:39,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.971045197740113 [2025-02-06 08:56:39,038 INFO L175 Difference]: Start difference. First operand has 446 places, 446 transitions, 906 flow. Second operand 3 states and 1375 transitions. [2025-02-06 08:56:39,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 454 transitions, 967 flow [2025-02-06 08:56:39,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 454 transitions, 957 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 08:56:39,046 INFO L231 Difference]: Finished difference. Result has 445 places, 449 transitions, 926 flow [2025-02-06 08:56:39,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=926, PETRI_PLACES=445, PETRI_TRANSITIONS=449} [2025-02-06 08:56:39,049 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -14 predicate places. [2025-02-06 08:56:39,050 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 449 transitions, 926 flow [2025-02-06 08:56:39,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:39,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:39,051 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] [2025-02-06 08:56:39,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 08:56:39,051 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:56:39,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:39,052 INFO L85 PathProgramCache]: Analyzing trace with hash 874979927, now seen corresponding path program 1 times [2025-02-06 08:56:39,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:39,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049404403] [2025-02-06 08:56:39,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:39,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:39,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 08:56:39,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 08:56:39,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:39,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:39,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:39,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:39,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049404403] [2025-02-06 08:56:39,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049404403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:39,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:39,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:56:39,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541797118] [2025-02-06 08:56:39,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:39,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:56:39,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:39,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:56:39,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:56:39,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 472 [2025-02-06 08:56:39,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 449 transitions, 926 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:39,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:39,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 472 [2025-02-06 08:56:39,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:39,289 INFO L124 PetriNetUnfolderBase]: 96/2101 cut-off events. [2025-02-06 08:56:39,290 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-02-06 08:56:39,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2279 conditions, 2101 events. 96/2101 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 13704 event pairs, 24 based on Foata normal form. 0/1880 useless extension candidates. Maximal degree in co-relation 1965. Up to 85 conditions per place. [2025-02-06 08:56:39,301 INFO L140 encePairwiseOnDemand]: 467/472 looper letters, 16 selfloop transitions, 4 changer transitions 0/456 dead transitions. [2025-02-06 08:56:39,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 456 transitions, 981 flow [2025-02-06 08:56:39,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:56:39,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:56:39,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1374 transitions. [2025-02-06 08:56:39,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703389830508474 [2025-02-06 08:56:39,304 INFO L175 Difference]: Start difference. First operand has 445 places, 449 transitions, 926 flow. Second operand 3 states and 1374 transitions. [2025-02-06 08:56:39,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 456 transitions, 981 flow [2025-02-06 08:56:39,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 456 transitions, 973 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 08:56:39,311 INFO L231 Difference]: Finished difference. Result has 447 places, 452 transitions, 948 flow [2025-02-06 08:56:39,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=948, PETRI_PLACES=447, PETRI_TRANSITIONS=452} [2025-02-06 08:56:39,312 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -12 predicate places. [2025-02-06 08:56:39,312 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 452 transitions, 948 flow [2025-02-06 08:56:39,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:39,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:39,313 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] [2025-02-06 08:56:39,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 08:56:39,313 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:56:39,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:39,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1675236772, now seen corresponding path program 1 times [2025-02-06 08:56:39,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:39,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971573645] [2025-02-06 08:56:39,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:39,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:39,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 08:56:39,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 08:56:39,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:39,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:39,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:56:39,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:39,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971573645] [2025-02-06 08:56:39,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971573645] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:39,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:39,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:56:39,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100692243] [2025-02-06 08:56:39,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:39,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:56:39,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:39,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:56:39,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:56:39,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 472 [2025-02-06 08:56:39,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 452 transitions, 948 flow. Second operand has 3 states, 3 states have (on average 454.6666666666667) internal successors, (1364), 3 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:39,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:39,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 472 [2025-02-06 08:56:39,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:39,640 INFO L124 PetriNetUnfolderBase]: 82/2173 cut-off events. [2025-02-06 08:56:39,641 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-06 08:56:39,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2361 conditions, 2173 events. 82/2173 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 12317 event pairs, 35 based on Foata normal form. 7/1964 useless extension candidates. Maximal degree in co-relation 1929. Up to 102 conditions per place. [2025-02-06 08:56:39,658 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 13 selfloop transitions, 2 changer transitions 0/456 dead transitions. [2025-02-06 08:56:39,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 456 transitions, 988 flow [2025-02-06 08:56:39,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:56:39,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:56:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1375 transitions. [2025-02-06 08:56:39,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.971045197740113 [2025-02-06 08:56:39,661 INFO L175 Difference]: Start difference. First operand has 447 places, 452 transitions, 948 flow. Second operand 3 states and 1375 transitions. [2025-02-06 08:56:39,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 456 transitions, 988 flow [2025-02-06 08:56:39,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 456 transitions, 980 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 08:56:39,668 INFO L231 Difference]: Finished difference. Result has 448 places, 453 transitions, 952 flow [2025-02-06 08:56:39,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=952, PETRI_PLACES=448, PETRI_TRANSITIONS=453} [2025-02-06 08:56:39,669 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -11 predicate places. [2025-02-06 08:56:39,669 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 453 transitions, 952 flow [2025-02-06 08:56:39,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 454.6666666666667) internal successors, (1364), 3 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:39,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:39,670 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] [2025-02-06 08:56:39,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 08:56:39,671 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:56:39,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:39,672 INFO L85 PathProgramCache]: Analyzing trace with hash 182214944, now seen corresponding path program 1 times [2025-02-06 08:56:39,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:39,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695391970] [2025-02-06 08:56:39,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:39,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:39,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 08:56:39,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 08:56:39,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:39,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:39,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:56:39,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:39,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695391970] [2025-02-06 08:56:39,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695391970] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:39,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:39,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:56:39,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069829380] [2025-02-06 08:56:39,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:39,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:56:39,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:39,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:56:39,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:56:39,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 472 [2025-02-06 08:56:39,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 453 transitions, 952 flow. Second operand has 3 states, 3 states have (on average 455.0) internal successors, (1365), 3 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:39,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:39,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 472 [2025-02-06 08:56:39,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:40,357 INFO L124 PetriNetUnfolderBase]: 136/3825 cut-off events. [2025-02-06 08:56:40,357 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-06 08:56:40,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4046 conditions, 3825 events. 136/3825 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 26285 event pairs, 40 based on Foata normal form. 9/3434 useless extension candidates. Maximal degree in co-relation 3630. Up to 113 conditions per place. [2025-02-06 08:56:40,387 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 13 selfloop transitions, 2 changer transitions 0/457 dead transitions. [2025-02-06 08:56:40,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 457 transitions, 991 flow [2025-02-06 08:56:40,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:56:40,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:56:40,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1375 transitions. [2025-02-06 08:56:40,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.971045197740113 [2025-02-06 08:56:40,390 INFO L175 Difference]: Start difference. First operand has 448 places, 453 transitions, 952 flow. Second operand 3 states and 1375 transitions. [2025-02-06 08:56:40,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 457 transitions, 991 flow [2025-02-06 08:56:40,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 457 transitions, 989 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 08:56:40,397 INFO L231 Difference]: Finished difference. Result has 450 places, 454 transitions, 962 flow [2025-02-06 08:56:40,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=962, PETRI_PLACES=450, PETRI_TRANSITIONS=454} [2025-02-06 08:56:40,399 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -9 predicate places. [2025-02-06 08:56:40,399 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 454 transitions, 962 flow [2025-02-06 08:56:40,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 455.0) internal successors, (1365), 3 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:40,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:40,400 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-02-06 08:56:40,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 08:56:40,400 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:56:40,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:40,401 INFO L85 PathProgramCache]: Analyzing trace with hash 2048093260, now seen corresponding path program 1 times [2025-02-06 08:56:40,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:40,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224568542] [2025-02-06 08:56:40,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:40,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:40,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-06 08:56:40,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-06 08:56:40,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:40,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:40,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:56:40,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:40,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224568542] [2025-02-06 08:56:40,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224568542] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:40,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:40,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:56:40,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412507323] [2025-02-06 08:56:40,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:40,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:56:40,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:40,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:56:40,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:56:41,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 472 [2025-02-06 08:56:41,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 454 transitions, 962 flow. Second operand has 6 states, 6 states have (on average 397.5) internal successors, (2385), 6 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:41,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:41,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 472 [2025-02-06 08:56:41,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:42,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1104] L1039-3-->L1039: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret74#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret74#1=|v_t2Thread1of1ForFork0_#t~ret74#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret74#1][178], [523#true, Black: 512#(= |#race~dequeue_flag~0| 0), 519#true, Black: 517#(= |t1Thread1of1ForFork1_~i~0#1| 0), Black: 521#(= 0 |t2Thread1of1ForFork0_~i~1#1|), 103#L1039true, 465#true, Black: 507#(= |#race~enqueue_flag~0| 0), 333#L1020true, 375#L1053-1true]) [2025-02-06 08:56:42,207 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2025-02-06 08:56:42,207 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-02-06 08:56:42,207 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-02-06 08:56:42,207 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-02-06 08:56:42,207 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1104] L1039-3-->L1039: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret74#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret74#1=|v_t2Thread1of1ForFork0_#t~ret74#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret74#1][178], [523#true, Black: 512#(= |#race~dequeue_flag~0| 0), 519#true, Black: 517#(= |t1Thread1of1ForFork1_~i~0#1| 0), Black: 521#(= 0 |t2Thread1of1ForFork0_~i~1#1|), 103#L1039true, 465#true, Black: 507#(= |#race~enqueue_flag~0| 0), 204#L1055true]) [2025-02-06 08:56:42,207 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is cut-off event [2025-02-06 08:56:42,207 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2025-02-06 08:56:42,207 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-02-06 08:56:42,207 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2025-02-06 08:56:44,734 INFO L124 PetriNetUnfolderBase]: 3991/24250 cut-off events. [2025-02-06 08:56:44,734 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-02-06 08:56:44,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32098 conditions, 24250 events. 3991/24250 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 282487 event pairs, 1492 based on Foata normal form. 0/21673 useless extension candidates. Maximal degree in co-relation 31316. Up to 5596 conditions per place. [2025-02-06 08:56:44,866 INFO L140 encePairwiseOnDemand]: 439/472 looper letters, 83 selfloop transitions, 66 changer transitions 0/533 dead transitions. [2025-02-06 08:56:44,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 533 transitions, 1426 flow [2025-02-06 08:56:44,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:56:44,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:56:44,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2516 transitions. [2025-02-06 08:56:44,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8884180790960452 [2025-02-06 08:56:44,870 INFO L175 Difference]: Start difference. First operand has 450 places, 454 transitions, 962 flow. Second operand 6 states and 2516 transitions. [2025-02-06 08:56:44,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 533 transitions, 1426 flow [2025-02-06 08:56:44,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 533 transitions, 1424 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 08:56:44,889 INFO L231 Difference]: Finished difference. Result has 459 places, 518 transitions, 1414 flow [2025-02-06 08:56:44,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=960, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1414, PETRI_PLACES=459, PETRI_TRANSITIONS=518} [2025-02-06 08:56:44,891 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 0 predicate places. [2025-02-06 08:56:44,894 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 518 transitions, 1414 flow [2025-02-06 08:56:44,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 397.5) internal successors, (2385), 6 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:44,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:44,896 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-02-06 08:56:44,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 08:56:44,896 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:56:44,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:44,896 INFO L85 PathProgramCache]: Analyzing trace with hash 356132486, now seen corresponding path program 1 times [2025-02-06 08:56:44,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:44,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764170148] [2025-02-06 08:56:44,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:44,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:44,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-06 08:56:44,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-06 08:56:44,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:44,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:45,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:56:45,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:45,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764170148] [2025-02-06 08:56:45,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764170148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:45,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:45,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:56:45,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763311880] [2025-02-06 08:56:45,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:45,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:56:45,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:45,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:56:45,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:56:45,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 472 [2025-02-06 08:56:45,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 518 transitions, 1414 flow. Second operand has 3 states, 3 states have (on average 454.0) internal successors, (1362), 3 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:45,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:45,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 472 [2025-02-06 08:56:45,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:45,670 INFO L124 PetriNetUnfolderBase]: 86/2843 cut-off events. [2025-02-06 08:56:45,670 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-02-06 08:56:45,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3390 conditions, 2843 events. 86/2843 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 17270 event pairs, 17 based on Foata normal form. 4/2583 useless extension candidates. Maximal degree in co-relation 2911. Up to 169 conditions per place. [2025-02-06 08:56:45,680 INFO L140 encePairwiseOnDemand]: 468/472 looper letters, 14 selfloop transitions, 3 changer transitions 0/452 dead transitions. [2025-02-06 08:56:45,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 452 transitions, 1067 flow [2025-02-06 08:56:45,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:56:45,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:56:45,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1374 transitions. [2025-02-06 08:56:45,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703389830508474 [2025-02-06 08:56:45,682 INFO L175 Difference]: Start difference. First operand has 459 places, 518 transitions, 1414 flow. Second operand 3 states and 1374 transitions. [2025-02-06 08:56:45,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 452 transitions, 1067 flow [2025-02-06 08:56:45,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 452 transitions, 977 flow, removed 21 selfloop flow, removed 12 redundant places. [2025-02-06 08:56:45,689 INFO L231 Difference]: Finished difference. Result has 446 places, 447 transitions, 941 flow [2025-02-06 08:56:45,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=941, PETRI_PLACES=446, PETRI_TRANSITIONS=447} [2025-02-06 08:56:45,690 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -13 predicate places. [2025-02-06 08:56:45,690 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 447 transitions, 941 flow [2025-02-06 08:56:45,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 454.0) internal successors, (1362), 3 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:45,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:45,691 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] [2025-02-06 08:56:45,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 08:56:45,691 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:56:45,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:45,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1178204073, now seen corresponding path program 1 times [2025-02-06 08:56:45,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:45,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663322668] [2025-02-06 08:56:45,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:45,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:45,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 08:56:45,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 08:56:45,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:45,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:46,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:56:46,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:46,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663322668] [2025-02-06 08:56:46,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663322668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:46,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:46,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:56:46,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598058576] [2025-02-06 08:56:46,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:46,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:56:46,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:46,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:56:46,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:56:46,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 472 [2025-02-06 08:56:46,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 447 transitions, 941 flow. Second operand has 6 states, 6 states have (on average 353.8333333333333) internal successors, (2123), 6 states have internal predecessors, (2123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:46,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:46,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 472 [2025-02-06 08:56:46,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:47,167 INFO L124 PetriNetUnfolderBase]: 693/3437 cut-off events. [2025-02-06 08:56:47,168 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2025-02-06 08:56:47,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5268 conditions, 3437 events. 693/3437 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 23994 event pairs, 604 based on Foata normal form. 0/3174 useless extension candidates. Maximal degree in co-relation 4400. Up to 1497 conditions per place. [2025-02-06 08:56:47,181 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 122 selfloop transitions, 5 changer transitions 0/458 dead transitions. [2025-02-06 08:56:47,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 458 transitions, 1225 flow [2025-02-06 08:56:47,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:56:47,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:56:47,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2216 transitions. [2025-02-06 08:56:47,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7824858757062146 [2025-02-06 08:56:47,184 INFO L175 Difference]: Start difference. First operand has 446 places, 447 transitions, 941 flow. Second operand 6 states and 2216 transitions. [2025-02-06 08:56:47,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 458 transitions, 1225 flow [2025-02-06 08:56:47,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 458 transitions, 1219 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 08:56:47,189 INFO L231 Difference]: Finished difference. Result has 448 places, 446 transitions, 943 flow [2025-02-06 08:56:47,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=943, PETRI_PLACES=448, PETRI_TRANSITIONS=446} [2025-02-06 08:56:47,190 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -11 predicate places. [2025-02-06 08:56:47,190 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 446 transitions, 943 flow [2025-02-06 08:56:47,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 353.8333333333333) internal successors, (2123), 6 states have internal predecessors, (2123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:47,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:47,191 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] [2025-02-06 08:56:47,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 08:56:47,191 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:56:47,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:47,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1063033939, now seen corresponding path program 1 times [2025-02-06 08:56:47,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:47,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214653162] [2025-02-06 08:56:47,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:47,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:47,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-06 08:56:47,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-06 08:56:47,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:47,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:56:47,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:47,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214653162] [2025-02-06 08:56:47,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214653162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:47,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:47,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:56:47,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030890934] [2025-02-06 08:56:47,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:47,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:56:47,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:47,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:56:47,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:56:48,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 472 [2025-02-06 08:56:48,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 446 transitions, 943 flow. Second operand has 6 states, 6 states have (on average 415.1666666666667) internal successors, (2491), 6 states have internal predecessors, (2491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:48,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:48,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 472 [2025-02-06 08:56:48,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:48,531 INFO L124 PetriNetUnfolderBase]: 297/2792 cut-off events. [2025-02-06 08:56:48,532 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-02-06 08:56:48,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3596 conditions, 2792 events. 297/2792 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 16355 event pairs, 214 based on Foata normal form. 0/2562 useless extension candidates. Maximal degree in co-relation 2960. Up to 533 conditions per place. [2025-02-06 08:56:48,539 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 59 selfloop transitions, 5 changer transitions 0/457 dead transitions. [2025-02-06 08:56:48,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 457 transitions, 1101 flow [2025-02-06 08:56:48,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:56:48,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:56:48,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2531 transitions. [2025-02-06 08:56:48,543 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8937146892655368 [2025-02-06 08:56:48,543 INFO L175 Difference]: Start difference. First operand has 448 places, 446 transitions, 943 flow. Second operand 6 states and 2531 transitions. [2025-02-06 08:56:48,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 457 transitions, 1101 flow [2025-02-06 08:56:48,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 457 transitions, 1091 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 08:56:48,548 INFO L231 Difference]: Finished difference. Result has 447 places, 445 transitions, 941 flow [2025-02-06 08:56:48,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=941, PETRI_PLACES=447, PETRI_TRANSITIONS=445} [2025-02-06 08:56:48,549 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -12 predicate places. [2025-02-06 08:56:48,549 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 445 transitions, 941 flow [2025-02-06 08:56:48,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 415.1666666666667) internal successors, (2491), 6 states have internal predecessors, (2491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:48,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:48,550 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:48,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 08:56:48,550 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:56:48,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:48,551 INFO L85 PathProgramCache]: Analyzing trace with hash -2066489295, now seen corresponding path program 1 times [2025-02-06 08:56:48,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:48,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365568496] [2025-02-06 08:56:48,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:48,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:48,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 08:56:48,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 08:56:48,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:48,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:48,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:56:48,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:48,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365568496] [2025-02-06 08:56:48,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365568496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:48,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:48,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:56:48,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620200571] [2025-02-06 08:56:48,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:48,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:56:48,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:48,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:56:48,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:56:49,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 472 [2025-02-06 08:56:49,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 445 transitions, 941 flow. Second operand has 6 states, 6 states have (on average 375.5) internal successors, (2253), 6 states have internal predecessors, (2253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:49,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:49,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 472 [2025-02-06 08:56:49,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:49,776 INFO L124 PetriNetUnfolderBase]: 567/3295 cut-off events. [2025-02-06 08:56:49,777 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2025-02-06 08:56:49,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4777 conditions, 3295 events. 567/3295 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22641 event pairs, 478 based on Foata normal form. 0/3048 useless extension candidates. Maximal degree in co-relation 4115. Up to 1203 conditions per place. [2025-02-06 08:56:49,788 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 101 selfloop transitions, 5 changer transitions 0/456 dead transitions. [2025-02-06 08:56:49,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 456 transitions, 1183 flow [2025-02-06 08:56:49,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:56:49,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:56:49,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2321 transitions. [2025-02-06 08:56:49,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8195621468926554 [2025-02-06 08:56:49,791 INFO L175 Difference]: Start difference. First operand has 447 places, 445 transitions, 941 flow. Second operand 6 states and 2321 transitions. [2025-02-06 08:56:49,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 456 transitions, 1183 flow [2025-02-06 08:56:49,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 456 transitions, 1173 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 08:56:49,796 INFO L231 Difference]: Finished difference. Result has 446 places, 444 transitions, 939 flow [2025-02-06 08:56:49,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=939, PETRI_PLACES=446, PETRI_TRANSITIONS=444} [2025-02-06 08:56:49,797 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -13 predicate places. [2025-02-06 08:56:49,797 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 444 transitions, 939 flow [2025-02-06 08:56:49,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 375.5) internal successors, (2253), 6 states have internal predecessors, (2253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:49,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:49,798 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:49,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 08:56:49,798 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:56:49,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:49,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1821259648, now seen corresponding path program 1 times [2025-02-06 08:56:49,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:49,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056149297] [2025-02-06 08:56:49,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:49,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:49,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-06 08:56:49,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-06 08:56:49,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:49,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:56:50,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:50,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056149297] [2025-02-06 08:56:50,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056149297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:50,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:50,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:56:50,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907905125] [2025-02-06 08:56:50,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:50,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:56:50,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:50,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:56:50,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:56:50,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 472 [2025-02-06 08:56:50,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 444 transitions, 939 flow. Second operand has 6 states, 6 states have (on average 361.3333333333333) internal successors, (2168), 6 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:50,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:50,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 472 [2025-02-06 08:56:50,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:51,057 INFO L124 PetriNetUnfolderBase]: 657/3377 cut-off events. [2025-02-06 08:56:51,057 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2025-02-06 08:56:51,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5129 conditions, 3377 events. 657/3377 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 23392 event pairs, 568 based on Foata normal form. 0/3146 useless extension candidates. Maximal degree in co-relation 4319. Up to 1413 conditions per place. [2025-02-06 08:56:51,068 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 116 selfloop transitions, 5 changer transitions 0/455 dead transitions. [2025-02-06 08:56:51,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 455 transitions, 1211 flow [2025-02-06 08:56:51,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:56:51,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:56:51,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2246 transitions. [2025-02-06 08:56:51,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7930790960451978 [2025-02-06 08:56:51,071 INFO L175 Difference]: Start difference. First operand has 446 places, 444 transitions, 939 flow. Second operand 6 states and 2246 transitions. [2025-02-06 08:56:51,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 455 transitions, 1211 flow [2025-02-06 08:56:51,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 455 transitions, 1201 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 08:56:51,076 INFO L231 Difference]: Finished difference. Result has 445 places, 443 transitions, 937 flow [2025-02-06 08:56:51,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=937, PETRI_PLACES=445, PETRI_TRANSITIONS=443} [2025-02-06 08:56:51,077 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -14 predicate places. [2025-02-06 08:56:51,077 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 443 transitions, 937 flow [2025-02-06 08:56:51,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 361.3333333333333) internal successors, (2168), 6 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:51,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:51,078 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] [2025-02-06 08:56:51,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 08:56:51,079 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:56:51,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:51,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1293842287, now seen corresponding path program 1 times [2025-02-06 08:56:51,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:51,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077206717] [2025-02-06 08:56:51,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:51,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:51,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-06 08:56:51,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-06 08:56:51,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:51,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 08:56:51,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:51,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077206717] [2025-02-06 08:56:51,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077206717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:51,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:51,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:56:51,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626460238] [2025-02-06 08:56:51,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:51,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:56:51,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:51,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:56:51,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:56:52,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 472 [2025-02-06 08:56:52,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 443 transitions, 937 flow. Second operand has 6 states, 6 states have (on average 362.1666666666667) internal successors, (2173), 6 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:52,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:52,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 472 [2025-02-06 08:56:52,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:52,661 INFO L124 PetriNetUnfolderBase]: 651/3363 cut-off events. [2025-02-06 08:56:52,661 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2025-02-06 08:56:52,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5105 conditions, 3363 events. 651/3363 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 23230 event pairs, 562 based on Foata normal form. 0/3132 useless extension candidates. Maximal degree in co-relation 4305. Up to 1407 conditions per place. [2025-02-06 08:56:52,677 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 116 selfloop transitions, 5 changer transitions 0/454 dead transitions. [2025-02-06 08:56:52,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 454 transitions, 1209 flow [2025-02-06 08:56:52,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:56:52,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:56:52,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2246 transitions. [2025-02-06 08:56:52,681 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7930790960451978 [2025-02-06 08:56:52,681 INFO L175 Difference]: Start difference. First operand has 445 places, 443 transitions, 937 flow. Second operand 6 states and 2246 transitions. [2025-02-06 08:56:52,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 454 transitions, 1209 flow [2025-02-06 08:56:52,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 454 transitions, 1199 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 08:56:52,687 INFO L231 Difference]: Finished difference. Result has 444 places, 442 transitions, 935 flow [2025-02-06 08:56:52,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=935, PETRI_PLACES=444, PETRI_TRANSITIONS=442} [2025-02-06 08:56:52,688 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -15 predicate places. [2025-02-06 08:56:52,688 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 442 transitions, 935 flow [2025-02-06 08:56:52,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 362.1666666666667) internal successors, (2173), 6 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:52,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:52,689 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-02-06 08:56:52,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 08:56:52,689 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:56:52,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:52,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1910331373, now seen corresponding path program 1 times [2025-02-06 08:56:52,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:52,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855289980] [2025-02-06 08:56:52,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:52,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:52,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-06 08:56:52,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-06 08:56:52,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:52,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:53,187 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 08:56:53,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:53,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855289980] [2025-02-06 08:56:53,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855289980] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:53,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:53,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:56:53,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135447911] [2025-02-06 08:56:53,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:53,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:56:53,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:53,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:56:53,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:56:53,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 472 [2025-02-06 08:56:53,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 442 transitions, 935 flow. Second operand has 6 states, 6 states have (on average 358.1666666666667) internal successors, (2149), 6 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:53,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:53,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 472 [2025-02-06 08:56:53,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:53,866 INFO L124 PetriNetUnfolderBase]: 672/3379 cut-off events. [2025-02-06 08:56:53,866 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2025-02-06 08:56:53,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5181 conditions, 3379 events. 672/3379 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 23483 event pairs, 583 based on Foata normal form. 0/3154 useless extension candidates. Maximal degree in co-relation 4974. Up to 1453 conditions per place. [2025-02-06 08:56:53,877 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 122 selfloop transitions, 5 changer transitions 0/453 dead transitions. [2025-02-06 08:56:53,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 453 transitions, 1219 flow [2025-02-06 08:56:53,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:56:53,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:56:53,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2221 transitions. [2025-02-06 08:56:53,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7842514124293786 [2025-02-06 08:56:53,880 INFO L175 Difference]: Start difference. First operand has 444 places, 442 transitions, 935 flow. Second operand 6 states and 2221 transitions. [2025-02-06 08:56:53,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 453 transitions, 1219 flow [2025-02-06 08:56:53,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 453 transitions, 1209 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 08:56:53,885 INFO L231 Difference]: Finished difference. Result has 443 places, 441 transitions, 933 flow [2025-02-06 08:56:53,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=933, PETRI_PLACES=443, PETRI_TRANSITIONS=441} [2025-02-06 08:56:53,885 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -16 predicate places. [2025-02-06 08:56:53,886 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 441 transitions, 933 flow [2025-02-06 08:56:53,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 358.1666666666667) internal successors, (2149), 6 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:53,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:53,886 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:53,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 08:56:53,886 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:56:53,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:53,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1499016472, now seen corresponding path program 1 times [2025-02-06 08:56:53,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:53,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482802387] [2025-02-06 08:56:53,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:53,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:53,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-02-06 08:56:53,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-02-06 08:56:53,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:53,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:53,979 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 08:56:53,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:53,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482802387] [2025-02-06 08:56:53,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482802387] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:56:53,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779474247] [2025-02-06 08:56:53,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:53,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:56:53,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:56:53,983 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:56:53,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 08:56:54,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-02-06 08:56:54,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-02-06 08:56:54,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:54,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:54,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 08:56:54,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:56:54,189 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-06 08:56:54,189 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:56:54,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779474247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:54,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:56:54,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-06 08:56:54,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802480479] [2025-02-06 08:56:54,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:54,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:56:54,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:54,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:56:54,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:56:54,203 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 472 [2025-02-06 08:56:54,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 441 transitions, 933 flow. Second operand has 3 states, 3 states have (on average 451.3333333333333) internal successors, (1354), 3 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:54,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:54,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 472 [2025-02-06 08:56:54,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:54,363 INFO L124 PetriNetUnfolderBase]: 64/1688 cut-off events. [2025-02-06 08:56:54,364 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-06 08:56:54,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1892 conditions, 1688 events. 64/1688 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 7490 event pairs, 29 based on Foata normal form. 0/1598 useless extension candidates. Maximal degree in co-relation 1461. Up to 79 conditions per place. [2025-02-06 08:56:54,369 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 15 selfloop transitions, 2 changer transitions 0/443 dead transitions. [2025-02-06 08:56:54,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 443 transitions, 973 flow [2025-02-06 08:56:54,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:56:54,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:56:54,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1365 transitions. [2025-02-06 08:56:54,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9639830508474576 [2025-02-06 08:56:54,371 INFO L175 Difference]: Start difference. First operand has 443 places, 441 transitions, 933 flow. Second operand 3 states and 1365 transitions. [2025-02-06 08:56:54,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 443 transitions, 973 flow [2025-02-06 08:56:54,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 443 transitions, 963 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 08:56:54,376 INFO L231 Difference]: Finished difference. Result has 439 places, 440 transitions, 925 flow [2025-02-06 08:56:54,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=925, PETRI_PLACES=439, PETRI_TRANSITIONS=440} [2025-02-06 08:56:54,377 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -20 predicate places. [2025-02-06 08:56:54,377 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 440 transitions, 925 flow [2025-02-06 08:56:54,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 451.3333333333333) internal successors, (1354), 3 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:54,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:54,377 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:54,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 08:56:54,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:56:54,578 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:56:54,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:54,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1387476388, now seen corresponding path program 1 times [2025-02-06 08:56:54,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:54,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808333513] [2025-02-06 08:56:54,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:54,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:54,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-06 08:56:54,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-06 08:56:54,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:54,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:54,678 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 08:56:54,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:54,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808333513] [2025-02-06 08:56:54,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808333513] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:56:54,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296561648] [2025-02-06 08:56:54,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:54,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:56:54,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:56:54,681 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:56:54,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 08:56:54,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-06 08:56:54,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-06 08:56:54,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:54,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:54,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 08:56:54,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:56:54,878 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-06 08:56:54,879 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:56:54,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296561648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:54,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:56:54,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-06 08:56:54,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263780881] [2025-02-06 08:56:54,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:54,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:56:54,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:54,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:56:54,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:56:54,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 472 [2025-02-06 08:56:54,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 440 transitions, 925 flow. Second operand has 3 states, 3 states have (on average 451.0) internal successors, (1353), 3 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:54,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:54,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 472 [2025-02-06 08:56:54,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:55,177 INFO L124 PetriNetUnfolderBase]: 136/3370 cut-off events. [2025-02-06 08:56:55,178 INFO L125 PetriNetUnfolderBase]: For 41/48 co-relation queries the response was YES. [2025-02-06 08:56:55,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3669 conditions, 3370 events. 136/3370 cut-off events. For 41/48 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 22195 event pairs, 38 based on Foata normal form. 1/3116 useless extension candidates. Maximal degree in co-relation 3252. Up to 129 conditions per place. [2025-02-06 08:56:55,188 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 17 selfloop transitions, 7 changer transitions 1/448 dead transitions. [2025-02-06 08:56:55,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 448 transitions, 999 flow [2025-02-06 08:56:55,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:56:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:56:55,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1370 transitions. [2025-02-06 08:56:55,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9675141242937854 [2025-02-06 08:56:55,190 INFO L175 Difference]: Start difference. First operand has 439 places, 440 transitions, 925 flow. Second operand 3 states and 1370 transitions. [2025-02-06 08:56:55,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 448 transitions, 999 flow [2025-02-06 08:56:55,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 448 transitions, 995 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 08:56:55,198 INFO L231 Difference]: Finished difference. Result has 441 places, 445 transitions, 977 flow [2025-02-06 08:56:55,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=977, PETRI_PLACES=441, PETRI_TRANSITIONS=445} [2025-02-06 08:56:55,199 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -18 predicate places. [2025-02-06 08:56:55,199 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 445 transitions, 977 flow [2025-02-06 08:56:55,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 451.0) internal successors, (1353), 3 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:55,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:55,200 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:55,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 08:56:55,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:56:55,401 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:56:55,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:55,402 INFO L85 PathProgramCache]: Analyzing trace with hash 834769128, now seen corresponding path program 1 times [2025-02-06 08:56:55,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:55,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534150744] [2025-02-06 08:56:55,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:55,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:55,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-02-06 08:56:55,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-02-06 08:56:55,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:55,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:55,577 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 08:56:55,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:55,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534150744] [2025-02-06 08:56:55,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534150744] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:56:55,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755386338] [2025-02-06 08:56:55,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:55,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:56:55,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:56:55,581 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:56:55,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 08:56:55,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-02-06 08:56:55,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-02-06 08:56:55,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:55,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:55,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 08:56:55,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:56:55,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 08:56:55,853 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-06 08:56:55,855 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:56:55,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755386338] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:55,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:56:55,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-06 08:56:55,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617681346] [2025-02-06 08:56:55,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:55,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:56:55,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:55,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:56:55,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:56:55,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 472 [2025-02-06 08:56:55,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 445 transitions, 977 flow. Second operand has 3 states, 3 states have (on average 457.0) internal successors, (1371), 3 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:55,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:55,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 472 [2025-02-06 08:56:55,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:55,974 INFO L124 PetriNetUnfolderBase]: 33/1428 cut-off events. [2025-02-06 08:56:55,974 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-02-06 08:56:55,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1543 conditions, 1428 events. 33/1428 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 5282 event pairs, 6 based on Foata normal form. 2/1356 useless extension candidates. Maximal degree in co-relation 1141. Up to 26 conditions per place. [2025-02-06 08:56:55,977 INFO L140 encePairwiseOnDemand]: 468/472 looper letters, 7 selfloop transitions, 3 changer transitions 5/438 dead transitions. [2025-02-06 08:56:55,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 438 transitions, 954 flow [2025-02-06 08:56:55,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:56:55,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:56:55,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1378 transitions. [2025-02-06 08:56:55,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9731638418079096 [2025-02-06 08:56:55,981 INFO L175 Difference]: Start difference. First operand has 441 places, 445 transitions, 977 flow. Second operand 3 states and 1378 transitions. [2025-02-06 08:56:55,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 438 transitions, 954 flow [2025-02-06 08:56:55,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 438 transitions, 934 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-06 08:56:55,985 INFO L231 Difference]: Finished difference. Result has 437 places, 431 transitions, 899 flow [2025-02-06 08:56:55,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=899, PETRI_PLACES=437, PETRI_TRANSITIONS=431} [2025-02-06 08:56:55,986 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -22 predicate places. [2025-02-06 08:56:55,986 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 431 transitions, 899 flow [2025-02-06 08:56:55,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 457.0) internal successors, (1371), 3 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:55,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:55,986 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:55,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 08:56:56,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:56:56,187 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:56:56,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:56,188 INFO L85 PathProgramCache]: Analyzing trace with hash -229473674, now seen corresponding path program 1 times [2025-02-06 08:56:56,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:56,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479107227] [2025-02-06 08:56:56,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:56,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:56,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-02-06 08:56:56,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-02-06 08:56:56,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:56,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:56,293 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 08:56:56,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:56,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479107227] [2025-02-06 08:56:56,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479107227] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:56:56,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019407836] [2025-02-06 08:56:56,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:56,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:56:56,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:56:56,299 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:56:56,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 08:56:56,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-02-06 08:56:56,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-02-06 08:56:56,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:56,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:56,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 08:56:56,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:56:56,584 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 08:56:56,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:56:56,669 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 08:56:56,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019407836] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:56:56,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:56:56,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 08:56:56,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663075528] [2025-02-06 08:56:56,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:56:56,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:56:56,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:56,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:56:56,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:56:56,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 472 [2025-02-06 08:56:56,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 431 transitions, 899 flow. Second operand has 10 states, 10 states have (on average 452.2) internal successors, (4522), 10 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:56,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:56,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 472 [2025-02-06 08:56:56,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:56,885 INFO L124 PetriNetUnfolderBase]: 44/1399 cut-off events. [2025-02-06 08:56:56,885 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-06 08:56:56,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1557 conditions, 1399 events. 44/1399 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3399 event pairs, 10 based on Foata normal form. 4/1326 useless extension candidates. Maximal degree in co-relation 986. Up to 35 conditions per place. [2025-02-06 08:56:56,888 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 20 selfloop transitions, 9 changer transitions 0/446 dead transitions. [2025-02-06 08:56:56,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 446 transitions, 1003 flow [2025-02-06 08:56:56,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:56:56,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 08:56:56,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 4081 transitions. [2025-02-06 08:56:56,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9606873822975518 [2025-02-06 08:56:56,891 INFO L175 Difference]: Start difference. First operand has 437 places, 431 transitions, 899 flow. Second operand 9 states and 4081 transitions. [2025-02-06 08:56:56,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 446 transitions, 1003 flow [2025-02-06 08:56:56,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 446 transitions, 994 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-06 08:56:56,895 INFO L231 Difference]: Finished difference. Result has 441 places, 437 transitions, 940 flow [2025-02-06 08:56:56,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=940, PETRI_PLACES=441, PETRI_TRANSITIONS=437} [2025-02-06 08:56:56,896 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -18 predicate places. [2025-02-06 08:56:56,896 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 437 transitions, 940 flow [2025-02-06 08:56:56,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 452.2) internal successors, (4522), 10 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:56,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:56,897 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, 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, 1, 1, 1, 1, 1] [2025-02-06 08:56:56,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 08:56:57,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-06 08:56:57,098 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:56:57,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:57,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1469125228, now seen corresponding path program 2 times [2025-02-06 08:56:57,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:57,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073383232] [2025-02-06 08:56:57,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:56:57,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:57,135 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 407 statements into 2 equivalence classes. [2025-02-06 08:56:57,141 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 176 of 407 statements. [2025-02-06 08:56:57,141 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 08:56:57,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:57,348 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2025-02-06 08:56:57,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:57,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073383232] [2025-02-06 08:56:57,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073383232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:57,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:57,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:56:57,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572719595] [2025-02-06 08:56:57,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:57,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:56:57,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:57,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:56:57,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:56:57,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 472 [2025-02-06 08:56:57,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 437 transitions, 940 flow. Second operand has 6 states, 6 states have (on average 410.6666666666667) internal successors, (2464), 6 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:57,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:57,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 472 [2025-02-06 08:56:57,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:58,121 INFO L124 PetriNetUnfolderBase]: 130/1477 cut-off events. [2025-02-06 08:56:58,122 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-02-06 08:56:58,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2013 conditions, 1477 events. 130/1477 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 4521 event pairs, 95 based on Foata normal form. 0/1405 useless extension candidates. Maximal degree in co-relation 1266. Up to 303 conditions per place. [2025-02-06 08:56:58,126 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 57 selfloop transitions, 5 changer transitions 0/440 dead transitions. [2025-02-06 08:56:58,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 440 transitions, 1074 flow [2025-02-06 08:56:58,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:56:58,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:56:58,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2487 transitions. [2025-02-06 08:56:58,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.878177966101695 [2025-02-06 08:56:58,128 INFO L175 Difference]: Start difference. First operand has 441 places, 437 transitions, 940 flow. Second operand 6 states and 2487 transitions. [2025-02-06 08:56:58,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 440 transitions, 1074 flow [2025-02-06 08:56:58,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 440 transitions, 1068 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 08:56:58,133 INFO L231 Difference]: Finished difference. Result has 444 places, 436 transitions, 942 flow [2025-02-06 08:56:58,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=942, PETRI_PLACES=444, PETRI_TRANSITIONS=436} [2025-02-06 08:56:58,134 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -15 predicate places. [2025-02-06 08:56:58,134 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 436 transitions, 942 flow [2025-02-06 08:56:58,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 410.6666666666667) internal successors, (2464), 6 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:58,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:58,135 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:58,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 08:56:58,135 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:56:58,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:58,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1950634249, now seen corresponding path program 1 times [2025-02-06 08:56:58,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:58,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014342039] [2025-02-06 08:56:58,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:58,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:58,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-02-06 08:56:58,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-02-06 08:56:58,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:58,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-06 08:56:58,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:58,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014342039] [2025-02-06 08:56:58,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014342039] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:56:58,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316578111] [2025-02-06 08:56:58,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:58,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:56:58,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:56:58,399 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:56:58,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 08:56:58,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-02-06 08:56:58,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-02-06 08:56:58,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:58,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:58,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 1218 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 08:56:58,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:56:58,901 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-06 08:56:58,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:56:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-06 08:56:59,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316578111] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:56:59,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:56:59,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-02-06 08:56:59,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610362254] [2025-02-06 08:56:59,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:56:59,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 08:56:59,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:59,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 08:56:59,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-06 08:56:59,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 472 [2025-02-06 08:56:59,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 436 transitions, 942 flow. Second operand has 18 states, 18 states have (on average 452.1111111111111) internal successors, (8138), 18 states have internal predecessors, (8138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:59,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:59,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 472 [2025-02-06 08:56:59,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:59,672 INFO L124 PetriNetUnfolderBase]: 70/2163 cut-off events. [2025-02-06 08:56:59,673 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-02-06 08:56:59,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2489 conditions, 2163 events. 70/2163 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4837 event pairs, 10 based on Foata normal form. 8/2090 useless extension candidates. Maximal degree in co-relation 1897. Up to 35 conditions per place. [2025-02-06 08:56:59,678 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 36 selfloop transitions, 21 changer transitions 0/473 dead transitions. [2025-02-06 08:56:59,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 473 transitions, 1220 flow [2025-02-06 08:56:59,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 08:56:59,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-06 08:56:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 9511 transitions. [2025-02-06 08:56:59,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95954398708636 [2025-02-06 08:56:59,682 INFO L175 Difference]: Start difference. First operand has 444 places, 436 transitions, 942 flow. Second operand 21 states and 9511 transitions. [2025-02-06 08:56:59,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 473 transitions, 1220 flow [2025-02-06 08:56:59,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 473 transitions, 1210 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 08:56:59,687 INFO L231 Difference]: Finished difference. Result has 464 places, 449 transitions, 1062 flow [2025-02-06 08:56:59,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1062, PETRI_PLACES=464, PETRI_TRANSITIONS=449} [2025-02-06 08:56:59,688 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 5 predicate places. [2025-02-06 08:56:59,688 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 449 transitions, 1062 flow [2025-02-06 08:56:59,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 452.1111111111111) internal successors, (8138), 18 states have internal predecessors, (8138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:59,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:59,690 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:59,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 08:56:59,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-06 08:56:59,891 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:56:59,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:59,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1071825591, now seen corresponding path program 2 times [2025-02-06 08:56:59,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:59,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406005652] [2025-02-06 08:56:59,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:56:59,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:59,949 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 713 statements into 2 equivalence classes. [2025-02-06 08:56:59,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 182 of 713 statements. [2025-02-06 08:56:59,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 08:56:59,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:00,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2612 trivial. 0 not checked. [2025-02-06 08:57:00,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:57:00,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406005652] [2025-02-06 08:57:00,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406005652] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:57:00,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:57:00,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:57:00,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148197741] [2025-02-06 08:57:00,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:57:00,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:57:00,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:57:00,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:57:00,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:57:00,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 472 [2025-02-06 08:57:00,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 449 transitions, 1062 flow. Second operand has 6 states, 6 states have (on average 410.6666666666667) internal successors, (2464), 6 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:00,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:57:00,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 472 [2025-02-06 08:57:00,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:57:01,159 INFO L124 PetriNetUnfolderBase]: 218/2305 cut-off events. [2025-02-06 08:57:01,159 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2025-02-06 08:57:01,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3362 conditions, 2305 events. 218/2305 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 6855 event pairs, 175 based on Foata normal form. 0/2229 useless extension candidates. Maximal degree in co-relation 2614. Up to 543 conditions per place. [2025-02-06 08:57:01,166 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 57 selfloop transitions, 5 changer transitions 0/452 dead transitions. [2025-02-06 08:57:01,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 452 transitions, 1196 flow [2025-02-06 08:57:01,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:57:01,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:57:01,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2487 transitions. [2025-02-06 08:57:01,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.878177966101695 [2025-02-06 08:57:01,168 INFO L175 Difference]: Start difference. First operand has 464 places, 449 transitions, 1062 flow. Second operand 6 states and 2487 transitions. [2025-02-06 08:57:01,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 452 transitions, 1196 flow [2025-02-06 08:57:01,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 452 transitions, 1172 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-06 08:57:01,172 INFO L231 Difference]: Finished difference. Result has 462 places, 448 transitions, 1046 flow [2025-02-06 08:57:01,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1046, PETRI_PLACES=462, PETRI_TRANSITIONS=448} [2025-02-06 08:57:01,173 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 3 predicate places. [2025-02-06 08:57:01,173 INFO L471 AbstractCegarLoop]: Abstraction has has 462 places, 448 transitions, 1046 flow [2025-02-06 08:57:01,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 410.6666666666667) internal successors, (2464), 6 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:01,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:57:01,174 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:57:01,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 08:57:01,174 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:57:01,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:57:01,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1315803186, now seen corresponding path program 1 times [2025-02-06 08:57:01,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:57:01,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561924979] [2025-02-06 08:57:01,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:57:01,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:57:01,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 731 statements into 1 equivalence classes. [2025-02-06 08:57:01,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 731 of 731 statements. [2025-02-06 08:57:01,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:57:01,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:01,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2613 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2612 trivial. 0 not checked. [2025-02-06 08:57:01,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:57:01,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561924979] [2025-02-06 08:57:01,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561924979] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:57:01,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:57:01,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:57:01,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953153997] [2025-02-06 08:57:01,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:57:01,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:57:01,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:57:01,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:57:01,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:57:01,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 472 [2025-02-06 08:57:01,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 448 transitions, 1046 flow. Second operand has 4 states, 4 states have (on average 452.5) internal successors, (1810), 4 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:01,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:57:01,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 472 [2025-02-06 08:57:01,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:57:01,849 INFO L124 PetriNetUnfolderBase]: 60/2597 cut-off events. [2025-02-06 08:57:01,850 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2025-02-06 08:57:01,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2885 conditions, 2597 events. 60/2597 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 8023 event pairs, 17 based on Foata normal form. 4/2481 useless extension candidates. Maximal degree in co-relation 1943. Up to 59 conditions per place. [2025-02-06 08:57:01,858 INFO L140 encePairwiseOnDemand]: 467/472 looper letters, 14 selfloop transitions, 4 changer transitions 0/453 dead transitions. [2025-02-06 08:57:01,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 453 transitions, 1094 flow [2025-02-06 08:57:01,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:57:01,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 08:57:01,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1819 transitions. [2025-02-06 08:57:01,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9634533898305084 [2025-02-06 08:57:01,859 INFO L175 Difference]: Start difference. First operand has 462 places, 448 transitions, 1046 flow. Second operand 4 states and 1819 transitions. [2025-02-06 08:57:01,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 453 transitions, 1094 flow [2025-02-06 08:57:01,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 453 transitions, 1084 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 08:57:01,865 INFO L231 Difference]: Finished difference. Result has 462 places, 451 transitions, 1064 flow [2025-02-06 08:57:01,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1064, PETRI_PLACES=462, PETRI_TRANSITIONS=451} [2025-02-06 08:57:01,866 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 3 predicate places. [2025-02-06 08:57:01,866 INFO L471 AbstractCegarLoop]: Abstraction has has 462 places, 451 transitions, 1064 flow [2025-02-06 08:57:01,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 452.5) internal successors, (1810), 4 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:01,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:57:01,867 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:57:01,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 08:57:01,867 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:57:01,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:57:01,869 INFO L85 PathProgramCache]: Analyzing trace with hash 2001715536, now seen corresponding path program 1 times [2025-02-06 08:57:01,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:57:01,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787537594] [2025-02-06 08:57:01,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:57:01,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:57:01,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-02-06 08:57:01,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-02-06 08:57:01,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:57:01,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:02,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2613 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2612 trivial. 0 not checked. [2025-02-06 08:57:02,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:57:02,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787537594] [2025-02-06 08:57:02,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787537594] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:57:02,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998105467] [2025-02-06 08:57:02,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:57:02,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:57:02,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:57:02,226 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:57:02,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 08:57:02,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-02-06 08:57:02,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-02-06 08:57:02,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:57:02,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:02,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 2218 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 08:57:02,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:57:02,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2613 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2613 trivial. 0 not checked. [2025-02-06 08:57:02,733 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:57:02,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998105467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:57:02,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:57:02,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-06 08:57:02,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396244550] [2025-02-06 08:57:02,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:57:02,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:57:02,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:57:02,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:57:02,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:57:02,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 472 [2025-02-06 08:57:02,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 451 transitions, 1064 flow. Second operand has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:02,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:57:02,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 472 [2025-02-06 08:57:02,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:57:03,092 INFO L124 PetriNetUnfolderBase]: 53/2586 cut-off events. [2025-02-06 08:57:03,092 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2025-02-06 08:57:03,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2873 conditions, 2586 events. 53/2586 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 7889 event pairs, 12 based on Foata normal form. 0/2470 useless extension candidates. Maximal degree in co-relation 2354. Up to 44 conditions per place. [2025-02-06 08:57:03,100 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 12 selfloop transitions, 2 changer transitions 0/451 dead transitions. [2025-02-06 08:57:03,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 451 transitions, 1093 flow [2025-02-06 08:57:03,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:57:03,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:57:03,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2025-02-06 08:57:03,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.961864406779661 [2025-02-06 08:57:03,102 INFO L175 Difference]: Start difference. First operand has 462 places, 451 transitions, 1064 flow. Second operand 3 states and 1362 transitions. [2025-02-06 08:57:03,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 451 transitions, 1093 flow [2025-02-06 08:57:03,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 451 transitions, 1091 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 08:57:03,107 INFO L231 Difference]: Finished difference. Result has 462 places, 450 transitions, 1064 flow [2025-02-06 08:57:03,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1064, PETRI_PLACES=462, PETRI_TRANSITIONS=450} [2025-02-06 08:57:03,108 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 3 predicate places. [2025-02-06 08:57:03,108 INFO L471 AbstractCegarLoop]: Abstraction has has 462 places, 450 transitions, 1064 flow [2025-02-06 08:57:03,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:03,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:57:03,109 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:57:03,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 08:57:03,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-06 08:57:03,310 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting t2Err10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:57:03,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:57:03,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1413094414, now seen corresponding path program 1 times [2025-02-06 08:57:03,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:57:03,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807019775] [2025-02-06 08:57:03,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:57:03,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:57:03,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-02-06 08:57:03,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-02-06 08:57:03,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:57:03,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:04,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2613 backedges. 0 proven. 2464 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-06 08:57:04,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:57:04,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807019775] [2025-02-06 08:57:04,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807019775] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:57:04,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049490425] [2025-02-06 08:57:04,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:57:04,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:57:04,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:57:04,221 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:57:04,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 08:57:04,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-02-06 08:57:04,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-02-06 08:57:04,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:57:04,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:04,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 2232 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 08:57:04,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:57:05,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2613 backedges. 0 proven. 2464 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-06 08:57:05,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:57:05,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2613 backedges. 0 proven. 2464 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-06 08:57:05,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049490425] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:57:05,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:57:05,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-02-06 08:57:05,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232137313] [2025-02-06 08:57:05,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:57:05,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-06 08:57:05,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:57:05,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 08:57:05,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 08:57:05,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 472 [2025-02-06 08:57:05,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 450 transitions, 1064 flow. Second operand has 34 states, 34 states have (on average 452.05882352941177) internal successors, (15370), 34 states have internal predecessors, (15370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:05,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:57:05,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 472 [2025-02-06 08:57:05,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:57:07,381 INFO L124 PetriNetUnfolderBase]: 122/4145 cut-off events. [2025-02-06 08:57:07,382 INFO L125 PetriNetUnfolderBase]: For 578/578 co-relation queries the response was YES. [2025-02-06 08:57:07,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4896 conditions, 4145 events. 122/4145 cut-off events. For 578/578 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 11092 event pairs, 10 based on Foata normal form. 16/4028 useless extension candidates. Maximal degree in co-relation 4835. Up to 67 conditions per place. [2025-02-06 08:57:07,406 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 68 selfloop transitions, 45 changer transitions 0/530 dead transitions. [2025-02-06 08:57:07,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 530 transitions, 1734 flow [2025-02-06 08:57:07,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-02-06 08:57:07,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-02-06 08:57:07,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 20371 transitions. [2025-02-06 08:57:07,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9590866290018832 [2025-02-06 08:57:07,426 INFO L175 Difference]: Start difference. First operand has 462 places, 450 transitions, 1064 flow. Second operand 45 states and 20371 transitions. [2025-02-06 08:57:07,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 506 places, 530 transitions, 1734 flow [2025-02-06 08:57:07,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 504 places, 530 transitions, 1730 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 08:57:07,443 INFO L231 Difference]: Finished difference. Result has 513 places, 475 transitions, 1362 flow [2025-02-06 08:57:07,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=1362, PETRI_PLACES=513, PETRI_TRANSITIONS=475} [2025-02-06 08:57:07,445 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 54 predicate places. [2025-02-06 08:57:07,445 INFO L471 AbstractCegarLoop]: Abstraction has has 513 places, 475 transitions, 1362 flow [2025-02-06 08:57:07,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 452.05882352941177) internal successors, (15370), 34 states have internal predecessors, (15370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:07,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:57:07,447 INFO L206 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:57:07,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 08:57:07,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:57:07,653 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:57:07,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:57:07,657 INFO L85 PathProgramCache]: Analyzing trace with hash -397418418, now seen corresponding path program 2 times [2025-02-06 08:57:07,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:57:07,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688574202] [2025-02-06 08:57:07,657 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:57:07,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:57:07,802 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1334 statements into 2 equivalence classes. [2025-02-06 08:57:07,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 197 of 1334 statements. [2025-02-06 08:57:07,819 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 08:57:07,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:08,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12617 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12617 trivial. 0 not checked. [2025-02-06 08:57:08,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:57:08,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688574202] [2025-02-06 08:57:08,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688574202] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:57:08,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:57:08,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:57:08,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200553176] [2025-02-06 08:57:08,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:57:08,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:57:08,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:57:08,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:57:08,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:57:08,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 472 [2025-02-06 08:57:08,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 475 transitions, 1362 flow. Second operand has 6 states, 6 states have (on average 400.6666666666667) internal successors, (2404), 6 states have internal predecessors, (2404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:08,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:57:08,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 472 [2025-02-06 08:57:08,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:57:09,825 INFO L124 PetriNetUnfolderBase]: 466/4463 cut-off events. [2025-02-06 08:57:09,826 INFO L125 PetriNetUnfolderBase]: For 577/577 co-relation queries the response was YES. [2025-02-06 08:57:09,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6885 conditions, 4463 events. 466/4463 cut-off events. For 577/577 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 15509 event pairs, 353 based on Foata normal form. 0/4371 useless extension candidates. Maximal degree in co-relation 5450. Up to 1085 conditions per place. [2025-02-06 08:57:09,842 INFO L140 encePairwiseOnDemand]: 463/472 looper letters, 64 selfloop transitions, 6 changer transitions 0/476 dead transitions. [2025-02-06 08:57:09,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 476 transitions, 1508 flow [2025-02-06 08:57:09,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:57:09,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:57:09,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2437 transitions. [2025-02-06 08:57:09,844 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8605225988700564 [2025-02-06 08:57:09,844 INFO L175 Difference]: Start difference. First operand has 513 places, 475 transitions, 1362 flow. Second operand 6 states and 2437 transitions. [2025-02-06 08:57:09,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 476 transitions, 1508 flow [2025-02-06 08:57:09,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 497 places, 476 transitions, 1452 flow, removed 10 selfloop flow, removed 18 redundant places. [2025-02-06 08:57:09,852 INFO L231 Difference]: Finished difference. Result has 497 places, 472 transitions, 1312 flow [2025-02-06 08:57:09,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=492, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1312, PETRI_PLACES=497, PETRI_TRANSITIONS=472} [2025-02-06 08:57:09,852 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 38 predicate places. [2025-02-06 08:57:09,852 INFO L471 AbstractCegarLoop]: Abstraction has has 497 places, 472 transitions, 1312 flow [2025-02-06 08:57:09,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 400.6666666666667) internal successors, (2404), 6 states have internal predecessors, (2404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:09,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:57:09,853 INFO L206 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:57:09,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 08:57:09,853 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:57:09,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:57:09,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1749416276, now seen corresponding path program 1 times [2025-02-06 08:57:09,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:57:09,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070352939] [2025-02-06 08:57:09,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:57:09,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:57:09,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1338 statements into 1 equivalence classes. [2025-02-06 08:57:10,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1338 of 1338 statements. [2025-02-06 08:57:10,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:57:10,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:10,666 INFO L134 CoverageAnalysis]: Checked inductivity of 12618 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12617 trivial. 0 not checked. [2025-02-06 08:57:10,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:57:10,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070352939] [2025-02-06 08:57:10,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070352939] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:57:10,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093977626] [2025-02-06 08:57:10,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:57:10,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:57:10,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:57:10,669 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:57:10,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 08:57:11,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1338 statements into 1 equivalence classes. [2025-02-06 08:57:11,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1338 of 1338 statements. [2025-02-06 08:57:11,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:57:11,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:11,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 4154 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 08:57:11,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:57:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 12618 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12618 trivial. 0 not checked. [2025-02-06 08:57:11,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:57:11,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093977626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:57:11,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:57:11,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-06 08:57:11,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818163787] [2025-02-06 08:57:11,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:57:11,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:57:11,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:57:11,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:57:11,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:57:11,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 472 [2025-02-06 08:57:11,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 472 transitions, 1312 flow. Second operand has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:11,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:57:11,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 472 [2025-02-06 08:57:11,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:57:12,497 INFO L124 PetriNetUnfolderBase]: 67/4060 cut-off events. [2025-02-06 08:57:12,498 INFO L125 PetriNetUnfolderBase]: For 530/530 co-relation queries the response was YES. [2025-02-06 08:57:12,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4665 conditions, 4060 events. 67/4060 cut-off events. For 530/530 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 10157 event pairs, 10 based on Foata normal form. 0/3956 useless extension candidates. Maximal degree in co-relation 3825. Up to 60 conditions per place. [2025-02-06 08:57:12,516 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 9 selfloop transitions, 0 changer transitions 5/472 dead transitions. [2025-02-06 08:57:12,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 472 transitions, 1341 flow [2025-02-06 08:57:12,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:57:12,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:57:12,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2025-02-06 08:57:12,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.961864406779661 [2025-02-06 08:57:12,517 INFO L175 Difference]: Start difference. First operand has 497 places, 472 transitions, 1312 flow. Second operand 3 states and 1362 transitions. [2025-02-06 08:57:12,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 472 transitions, 1341 flow [2025-02-06 08:57:12,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 472 transitions, 1329 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 08:57:12,525 INFO L231 Difference]: Finished difference. Result has 493 places, 467 transitions, 1290 flow [2025-02-06 08:57:12,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1290, PETRI_PLACES=493, PETRI_TRANSITIONS=467} [2025-02-06 08:57:12,526 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 34 predicate places. [2025-02-06 08:57:12,526 INFO L471 AbstractCegarLoop]: Abstraction has has 493 places, 467 transitions, 1290 flow [2025-02-06 08:57:12,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:12,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:57:12,527 INFO L206 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:57:12,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 08:57:12,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:57:12,731 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting t2Err9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:57:12,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:57:12,737 INFO L85 PathProgramCache]: Analyzing trace with hash -33364687, now seen corresponding path program 1 times [2025-02-06 08:57:12,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:57:12,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020714884] [2025-02-06 08:57:12,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:57:12,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:57:12,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1340 statements into 1 equivalence classes. [2025-02-06 08:57:12,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1340 of 1340 statements. [2025-02-06 08:57:12,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:57:12,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:15,898 INFO L134 CoverageAnalysis]: Checked inductivity of 12617 backedges. 0 proven. 12300 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2025-02-06 08:57:15,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:57:15,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020714884] [2025-02-06 08:57:15,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020714884] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:57:15,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544766880] [2025-02-06 08:57:15,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:57:15,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:57:15,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:57:15,901 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:57:15,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 08:57:16,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1340 statements into 1 equivalence classes. [2025-02-06 08:57:16,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1340 of 1340 statements. [2025-02-06 08:57:16,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:57:16,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:16,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 4186 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 08:57:16,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:57:17,797 INFO L134 CoverageAnalysis]: Checked inductivity of 12617 backedges. 0 proven. 12300 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2025-02-06 08:57:17,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:57:19,080 INFO L134 CoverageAnalysis]: Checked inductivity of 12617 backedges. 0 proven. 12300 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2025-02-06 08:57:19,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544766880] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:57:19,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:57:19,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 43 [2025-02-06 08:57:19,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143540517] [2025-02-06 08:57:19,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:57:19,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-02-06 08:57:19,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:57:19,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-06 08:57:19,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2025-02-06 08:57:19,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 472 [2025-02-06 08:57:19,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 467 transitions, 1290 flow. Second operand has 43 states, 43 states have (on average 452.09302325581393) internal successors, (19440), 43 states have internal predecessors, (19440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:19,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:57:19,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 472 [2025-02-06 08:57:19,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:57:21,373 INFO L124 PetriNetUnfolderBase]: 150/5061 cut-off events. [2025-02-06 08:57:21,374 INFO L125 PetriNetUnfolderBase]: For 1840/1840 co-relation queries the response was YES. [2025-02-06 08:57:21,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6163 conditions, 5061 events. 150/5061 cut-off events. For 1840/1840 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 12589 event pairs, 10 based on Foata normal form. 10/4956 useless extension candidates. Maximal degree in co-relation 6137. Up to 87 conditions per place. [2025-02-06 08:57:21,395 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 88 selfloop transitions, 60 changer transitions 0/557 dead transitions. [2025-02-06 08:57:21,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 557 transitions, 2134 flow [2025-02-06 08:57:21,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-02-06 08:57:21,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2025-02-06 08:57:21,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 27153 transitions. [2025-02-06 08:57:21,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9587923728813559 [2025-02-06 08:57:21,407 INFO L175 Difference]: Start difference. First operand has 493 places, 467 transitions, 1290 flow. Second operand 60 states and 27153 transitions. [2025-02-06 08:57:21,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 557 transitions, 2134 flow [2025-02-06 08:57:21,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 557 transitions, 2134 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 08:57:21,415 INFO L231 Difference]: Finished difference. Result has 554 places, 483 transitions, 1584 flow [2025-02-06 08:57:21,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1290, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=1584, PETRI_PLACES=554, PETRI_TRANSITIONS=483} [2025-02-06 08:57:21,416 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 95 predicate places. [2025-02-06 08:57:21,416 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 483 transitions, 1584 flow [2025-02-06 08:57:21,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 452.09302325581393) internal successors, (19440), 43 states have internal predecessors, (19440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:21,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:57:21,418 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:57:21,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 08:57:21,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:57:21,623 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting t2Err9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:57:21,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:57:21,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1939764179, now seen corresponding path program 2 times [2025-02-06 08:57:21,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:57:21,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712736055] [2025-02-06 08:57:21,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:57:21,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:57:21,788 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1715 statements into 2 equivalence classes. [2025-02-06 08:57:21,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 180 of 1715 statements. [2025-02-06 08:57:21,794 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 08:57:21,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:22,027 INFO L134 CoverageAnalysis]: Checked inductivity of 22681 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22681 trivial. 0 not checked. [2025-02-06 08:57:22,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:57:22,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712736055] [2025-02-06 08:57:22,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712736055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:57:22,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:57:22,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:57:22,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014398262] [2025-02-06 08:57:22,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:57:22,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:57:22,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:57:22,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:57:22,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:57:22,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 472 [2025-02-06 08:57:22,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 483 transitions, 1584 flow. Second operand has 6 states, 6 states have (on average 408.8333333333333) internal successors, (2453), 6 states have internal predecessors, (2453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:22,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:57:22,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 472 [2025-02-06 08:57:22,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:57:24,441 INFO L124 PetriNetUnfolderBase]: 554/5455 cut-off events. [2025-02-06 08:57:24,441 INFO L125 PetriNetUnfolderBase]: For 1115/1115 co-relation queries the response was YES. [2025-02-06 08:57:24,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8578 conditions, 5455 events. 554/5455 cut-off events. For 1115/1115 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 18013 event pairs, 473 based on Foata normal form. 0/5349 useless extension candidates. Maximal degree in co-relation 8546. Up to 1437 conditions per place. [2025-02-06 08:57:24,453 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 59 selfloop transitions, 5 changer transitions 0/486 dead transitions. [2025-02-06 08:57:24,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 486 transitions, 1722 flow [2025-02-06 08:57:24,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:57:24,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:57:24,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2477 transitions. [2025-02-06 08:57:24,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8746468926553672 [2025-02-06 08:57:24,455 INFO L175 Difference]: Start difference. First operand has 554 places, 483 transitions, 1584 flow. Second operand 6 states and 2477 transitions. [2025-02-06 08:57:24,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 486 transitions, 1722 flow [2025-02-06 08:57:24,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 486 transitions, 1624 flow, removed 7 selfloop flow, removed 42 redundant places. [2025-02-06 08:57:24,464 INFO L231 Difference]: Finished difference. Result has 516 places, 482 transitions, 1494 flow [2025-02-06 08:57:24,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1484, PETRI_DIFFERENCE_MINUEND_PLACES=511, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=482, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1494, PETRI_PLACES=516, PETRI_TRANSITIONS=482} [2025-02-06 08:57:24,465 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 57 predicate places. [2025-02-06 08:57:24,465 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 482 transitions, 1494 flow [2025-02-06 08:57:24,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 408.8333333333333) internal successors, (2453), 6 states have internal predecessors, (2453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:24,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:57:24,466 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:57:24,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-06 08:57:24,466 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting t2Err8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:57:24,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:57:24,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1933437851, now seen corresponding path program 1 times [2025-02-06 08:57:24,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:57:24,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687254404] [2025-02-06 08:57:24,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:57:24,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:57:24,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1724 statements into 1 equivalence classes. [2025-02-06 08:57:24,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1724 of 1724 statements. [2025-02-06 08:57:24,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:57:24,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:29,527 INFO L134 CoverageAnalysis]: Checked inductivity of 22681 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22681 trivial. 0 not checked. [2025-02-06 08:57:29,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:57:29,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687254404] [2025-02-06 08:57:29,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687254404] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:57:29,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:57:29,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:57:29,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708379853] [2025-02-06 08:57:29,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:57:29,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:57:29,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:57:29,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:57:29,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:57:30,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 472 [2025-02-06 08:57:30,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 482 transitions, 1494 flow. Second operand has 6 states, 6 states have (on average 417.6666666666667) internal successors, (2506), 6 states have internal predecessors, (2506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:30,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:57:30,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 472 [2025-02-06 08:57:30,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:57:31,721 INFO L124 PetriNetUnfolderBase]: 518/5411 cut-off events. [2025-02-06 08:57:31,721 INFO L125 PetriNetUnfolderBase]: For 1087/1087 co-relation queries the response was YES. [2025-02-06 08:57:31,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8369 conditions, 5411 events. 518/5411 cut-off events. For 1087/1087 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 17501 event pairs, 437 based on Foata normal form. 0/5321 useless extension candidates. Maximal degree in co-relation 8336. Up to 1329 conditions per place. [2025-02-06 08:57:31,736 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 50 selfloop transitions, 5 changer transitions 0/485 dead transitions. [2025-02-06 08:57:31,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 485 transitions, 1614 flow [2025-02-06 08:57:31,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:57:31,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:57:31,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2522 transitions. [2025-02-06 08:57:31,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8905367231638418 [2025-02-06 08:57:31,738 INFO L175 Difference]: Start difference. First operand has 516 places, 482 transitions, 1494 flow. Second operand 6 states and 2522 transitions. [2025-02-06 08:57:31,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 485 transitions, 1614 flow [2025-02-06 08:57:31,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 485 transitions, 1604 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 08:57:31,746 INFO L231 Difference]: Finished difference. Result has 515 places, 481 transitions, 1492 flow [2025-02-06 08:57:31,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1492, PETRI_PLACES=515, PETRI_TRANSITIONS=481} [2025-02-06 08:57:31,747 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 56 predicate places. [2025-02-06 08:57:31,747 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 481 transitions, 1492 flow [2025-02-06 08:57:31,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 417.6666666666667) internal successors, (2506), 6 states have internal predecessors, (2506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:31,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:57:31,748 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:57:31,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 08:57:31,748 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting t2Err7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:57:31,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:57:31,758 INFO L85 PathProgramCache]: Analyzing trace with hash -557683693, now seen corresponding path program 1 times [2025-02-06 08:57:31,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:57:31,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247158962] [2025-02-06 08:57:31,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:57:31,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:57:31,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1732 statements into 1 equivalence classes. [2025-02-06 08:57:31,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1732 of 1732 statements. [2025-02-06 08:57:31,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:57:31,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:36,505 INFO L134 CoverageAnalysis]: Checked inductivity of 22681 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22681 trivial. 0 not checked. [2025-02-06 08:57:36,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:57:36,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247158962] [2025-02-06 08:57:36,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247158962] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:57:36,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:57:36,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:57:36,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116664020] [2025-02-06 08:57:36,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:57:36,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:57:36,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:57:36,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:57:36,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:57:36,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 472 [2025-02-06 08:57:36,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 481 transitions, 1492 flow. Second operand has 6 states, 6 states have (on average 382.0) internal successors, (2292), 6 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:36,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:57:36,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 472 [2025-02-06 08:57:36,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:57:38,622 INFO L124 PetriNetUnfolderBase]: 894/5779 cut-off events. [2025-02-06 08:57:38,622 INFO L125 PetriNetUnfolderBase]: For 1151/1151 co-relation queries the response was YES. [2025-02-06 08:57:38,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10513 conditions, 5779 events. 894/5779 cut-off events. For 1151/1151 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 22234 event pairs, 813 based on Foata normal form. 0/5689 useless extension candidates. Maximal degree in co-relation 10480. Up to 2465 conditions per place. [2025-02-06 08:57:38,644 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 92 selfloop transitions, 5 changer transitions 0/484 dead transitions. [2025-02-06 08:57:38,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 484 transitions, 1696 flow [2025-02-06 08:57:38,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:57:38,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:57:38,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2312 transitions. [2025-02-06 08:57:38,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8163841807909604 [2025-02-06 08:57:38,646 INFO L175 Difference]: Start difference. First operand has 515 places, 481 transitions, 1492 flow. Second operand 6 states and 2312 transitions. [2025-02-06 08:57:38,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 484 transitions, 1696 flow [2025-02-06 08:57:38,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 484 transitions, 1686 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 08:57:38,654 INFO L231 Difference]: Finished difference. Result has 514 places, 480 transitions, 1490 flow [2025-02-06 08:57:38,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1480, PETRI_DIFFERENCE_MINUEND_PLACES=509, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1490, PETRI_PLACES=514, PETRI_TRANSITIONS=480} [2025-02-06 08:57:38,655 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 55 predicate places. [2025-02-06 08:57:38,655 INFO L471 AbstractCegarLoop]: Abstraction has has 514 places, 480 transitions, 1490 flow [2025-02-06 08:57:38,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 382.0) internal successors, (2292), 6 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:38,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:57:38,656 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:57:38,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-06 08:57:38,656 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting t2Err3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:57:38,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:57:38,661 INFO L85 PathProgramCache]: Analyzing trace with hash 214897700, now seen corresponding path program 1 times [2025-02-06 08:57:38,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:57:38,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154299402] [2025-02-06 08:57:38,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:57:38,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:57:38,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1750 statements into 1 equivalence classes. [2025-02-06 08:57:38,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1750 of 1750 statements. [2025-02-06 08:57:38,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:57:38,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:43,431 INFO L134 CoverageAnalysis]: Checked inductivity of 22686 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22686 trivial. 0 not checked. [2025-02-06 08:57:43,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:57:43,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154299402] [2025-02-06 08:57:43,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154299402] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:57:43,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:57:43,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:57:43,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104153020] [2025-02-06 08:57:43,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:57:43,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:57:43,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:57:43,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:57:43,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:57:43,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 472 [2025-02-06 08:57:43,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 480 transitions, 1490 flow. Second operand has 6 states, 6 states have (on average 367.8333333333333) internal successors, (2207), 6 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:43,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:57:43,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 472 [2025-02-06 08:57:43,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:57:46,620 INFO L124 PetriNetUnfolderBase]: 950/5827 cut-off events. [2025-02-06 08:57:46,621 INFO L125 PetriNetUnfolderBase]: For 1199/1199 co-relation queries the response was YES. [2025-02-06 08:57:46,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10737 conditions, 5827 events. 950/5827 cut-off events. For 1199/1199 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 22735 event pairs, 869 based on Foata normal form. 0/5753 useless extension candidates. Maximal degree in co-relation 10704. Up to 2641 conditions per place. [2025-02-06 08:57:46,638 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 107 selfloop transitions, 5 changer transitions 0/483 dead transitions. [2025-02-06 08:57:46,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 483 transitions, 1724 flow [2025-02-06 08:57:46,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:57:46,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:57:46,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2237 transitions. [2025-02-06 08:57:46,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7899011299435028 [2025-02-06 08:57:46,639 INFO L175 Difference]: Start difference. First operand has 514 places, 480 transitions, 1490 flow. Second operand 6 states and 2237 transitions. [2025-02-06 08:57:46,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 483 transitions, 1724 flow [2025-02-06 08:57:46,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 513 places, 483 transitions, 1714 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 08:57:46,649 INFO L231 Difference]: Finished difference. Result has 513 places, 479 transitions, 1488 flow [2025-02-06 08:57:46,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1478, PETRI_DIFFERENCE_MINUEND_PLACES=508, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1488, PETRI_PLACES=513, PETRI_TRANSITIONS=479} [2025-02-06 08:57:46,650 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 54 predicate places. [2025-02-06 08:57:46,650 INFO L471 AbstractCegarLoop]: Abstraction has has 513 places, 479 transitions, 1488 flow [2025-02-06 08:57:46,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 367.8333333333333) internal successors, (2207), 6 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:46,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:57:46,651 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:57:46,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-06 08:57:46,651 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting t2Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-06 08:57:46,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:57:46,656 INFO L85 PathProgramCache]: Analyzing trace with hash 788877584, now seen corresponding path program 1 times [2025-02-06 08:57:46,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:57:46,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794747658] [2025-02-06 08:57:46,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:57:46,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:57:46,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1757 statements into 1 equivalence classes. [2025-02-06 08:57:46,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1757 of 1757 statements. [2025-02-06 08:57:46,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:57:46,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:52,281 INFO L134 CoverageAnalysis]: Checked inductivity of 22699 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22699 trivial. 0 not checked. [2025-02-06 08:57:52,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:57:52,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794747658] [2025-02-06 08:57:52,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794747658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:57:52,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:57:52,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:57:52,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210495616] [2025-02-06 08:57:52,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:57:52,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:57:52,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:57:52,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:57:52,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:57:52,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 472 [2025-02-06 08:57:52,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 479 transitions, 1488 flow. Second operand has 6 states, 6 states have (on average 369.6666666666667) internal successors, (2218), 6 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:52,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:57:52,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 472 [2025-02-06 08:57:52,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand