./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d 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-race-challenges/per-thread-index-bitmask-race.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 9dc253a71095a3ed3b49fc56a3d17da307efb7fa91be8525b1f50977899b5b3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:43:25,336 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:43:25,390 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:43:25,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:43:25,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:43:25,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:43:25,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:43:25,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:43:25,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:43:25,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:43:25,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:43:25,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:43:25,409 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:43:25,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:43:25,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:43:25,409 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:43:25,409 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:43:25,409 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:43:25,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:43:25,410 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:43:25,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:43:25,410 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:43:25,410 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:43:25,410 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:43:25,410 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:43:25,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:43:25,410 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:43:25,410 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:43:25,410 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:43:25,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:43:25,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:43:25,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:43:25,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:43:25,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:43:25,411 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:43:25,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:43:25,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:43:25,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:43:25,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:43:25,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:43:25,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:43:25,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:43:25,411 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 -> 9dc253a71095a3ed3b49fc56a3d17da307efb7fa91be8525b1f50977899b5b3d [2025-02-08 05:43:25,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:43:25,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:43:25,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:43:25,656 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:43:25,657 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:43:25,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i [2025-02-08 05:43:26,879 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3011f22d8/87ed81956fc042a09844d651f08b63d5/FLAGb820796c9 [2025-02-08 05:43:27,201 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:43:27,202 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i [2025-02-08 05:43:27,220 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3011f22d8/87ed81956fc042a09844d651f08b63d5/FLAGb820796c9 [2025-02-08 05:43:27,461 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3011f22d8/87ed81956fc042a09844d651f08b63d5 [2025-02-08 05:43:27,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:43:27,464 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:43:27,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:43:27,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:43:27,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:43:27,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:43:27" (1/1) ... [2025-02-08 05:43:27,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77e66591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:27, skipping insertion in model container [2025-02-08 05:43:27,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:43:27" (1/1) ... [2025-02-08 05:43:27,504 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:43:27,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:43:27,774 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:43:27,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:43:27,862 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:43:27,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:27 WrapperNode [2025-02-08 05:43:27,865 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:43:27,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:43:27,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:43:27,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:43:27,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:27" (1/1) ... [2025-02-08 05:43:27,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:27" (1/1) ... [2025-02-08 05:43:27,901 INFO L138 Inliner]: procedures = 273, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 126 [2025-02-08 05:43:27,901 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:43:27,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:43:27,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:43:27,902 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:43:27,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:27" (1/1) ... [2025-02-08 05:43:27,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:27" (1/1) ... [2025-02-08 05:43:27,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:27" (1/1) ... [2025-02-08 05:43:27,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:27" (1/1) ... [2025-02-08 05:43:27,913 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:27" (1/1) ... [2025-02-08 05:43:27,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:27" (1/1) ... [2025-02-08 05:43:27,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:27" (1/1) ... [2025-02-08 05:43:27,916 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:27" (1/1) ... [2025-02-08 05:43:27,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:43:27,918 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:43:27,918 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:43:27,918 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:43:27,919 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:27" (1/1) ... [2025-02-08 05:43:27,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:43:27,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:43:27,960 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-08 05:43:27,964 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-08 05:43:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:43:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:43:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:43:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:43:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-02-08 05:43:27,980 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-02-08 05:43:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:43:27,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:43:27,982 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:43:28,056 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:43:28,058 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:43:28,283 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:43:28,283 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:43:28,313 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:43:28,313 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 05:43:28,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:43:28 BoogieIcfgContainer [2025-02-08 05:43:28,313 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:43:28,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:43:28,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:43:28,322 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:43:28,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:43:27" (1/3) ... [2025-02-08 05:43:28,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ee8a2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:43:28, skipping insertion in model container [2025-02-08 05:43:28,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:27" (2/3) ... [2025-02-08 05:43:28,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ee8a2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:43:28, skipping insertion in model container [2025-02-08 05:43:28,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:43:28" (3/3) ... [2025-02-08 05:43:28,324 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i [2025-02-08 05:43:28,335 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:43:28,337 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-index-bitmask-race.i that has 2 procedures, 169 locations, 1 initial locations, 2 loop locations, and 11 error locations. [2025-02-08 05:43:28,337 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:43:28,402 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 05:43:28,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 185 transitions, 377 flow [2025-02-08 05:43:28,538 INFO L124 PetriNetUnfolderBase]: 26/277 cut-off events. [2025-02-08 05:43:28,540 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:43:28,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 277 events. 26/277 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 622 event pairs, 0 based on Foata normal form. 0/231 useless extension candidates. Maximal degree in co-relation 140. Up to 6 conditions per place. [2025-02-08 05:43:28,545 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 185 transitions, 377 flow [2025-02-08 05:43:28,556 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 185 transitions, 377 flow [2025-02-08 05:43:28,570 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:43:28,587 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;@31ac7080, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:43:28,587 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-08 05:43:28,601 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:43:28,601 INFO L124 PetriNetUnfolderBase]: 2/34 cut-off events. [2025-02-08 05:43:28,601 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:43:28,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:28,602 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] [2025-02-08 05:43:28,602 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:28,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:28,610 INFO L85 PathProgramCache]: Analyzing trace with hash -27430900, now seen corresponding path program 1 times [2025-02-08 05:43:28,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:28,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442707756] [2025-02-08 05:43:28,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:28,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:28,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:43:28,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:43:28,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:28,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:28,850 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-08 05:43:28,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:28,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442707756] [2025-02-08 05:43:28,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442707756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:28,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:28,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:28,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399736281] [2025-02-08 05:43:28,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:28,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:28,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:28,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:28,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:28,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 185 [2025-02-08 05:43:28,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 185 transitions, 377 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 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-08 05:43:28,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:28,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 185 [2025-02-08 05:43:28,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:29,034 INFO L124 PetriNetUnfolderBase]: 62/554 cut-off events. [2025-02-08 05:43:29,034 INFO L125 PetriNetUnfolderBase]: For 7/10 co-relation queries the response was YES. [2025-02-08 05:43:29,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 554 events. 62/554 cut-off events. For 7/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2344 event pairs, 2 based on Foata normal form. 2/458 useless extension candidates. Maximal degree in co-relation 469. Up to 65 conditions per place. [2025-02-08 05:43:29,042 INFO L140 encePairwiseOnDemand]: 180/185 looper letters, 16 selfloop transitions, 2 changer transitions 2/182 dead transitions. [2025-02-08 05:43:29,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 182 transitions, 407 flow [2025-02-08 05:43:29,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:29,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:29,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2025-02-08 05:43:29,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9243243243243243 [2025-02-08 05:43:29,058 INFO L175 Difference]: Start difference. First operand has 172 places, 185 transitions, 377 flow. Second operand 3 states and 513 transitions. [2025-02-08 05:43:29,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 182 transitions, 407 flow [2025-02-08 05:43:29,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 182 transitions, 407 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:43:29,066 INFO L231 Difference]: Finished difference. Result has 173 places, 180 transitions, 371 flow [2025-02-08 05:43:29,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=371, PETRI_PLACES=173, PETRI_TRANSITIONS=180} [2025-02-08 05:43:29,071 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 1 predicate places. [2025-02-08 05:43:29,072 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 180 transitions, 371 flow [2025-02-08 05:43:29,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 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-08 05:43:29,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:29,074 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] [2025-02-08 05:43:29,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:43:29,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:29,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:29,075 INFO L85 PathProgramCache]: Analyzing trace with hash 391319096, now seen corresponding path program 1 times [2025-02-08 05:43:29,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:29,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732010265] [2025-02-08 05:43:29,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:29,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:29,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:43:29,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:43:29,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:29,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:29,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:29,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:29,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732010265] [2025-02-08 05:43:29,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732010265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:29,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:29,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:29,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23673829] [2025-02-08 05:43:29,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:29,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:29,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:29,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:29,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:29,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 185 [2025-02-08 05:43:29,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 180 transitions, 371 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 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-08 05:43:29,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:29,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 185 [2025-02-08 05:43:29,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:29,300 INFO L124 PetriNetUnfolderBase]: 132/715 cut-off events. [2025-02-08 05:43:29,301 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:43:29,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 881 conditions, 715 events. 132/715 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3513 event pairs, 6 based on Foata normal form. 0/591 useless extension candidates. Maximal degree in co-relation 843. Up to 106 conditions per place. [2025-02-08 05:43:29,307 INFO L140 encePairwiseOnDemand]: 174/185 looper letters, 29 selfloop transitions, 8 changer transitions 0/196 dead transitions. [2025-02-08 05:43:29,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 196 transitions, 477 flow [2025-02-08 05:43:29,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:29,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:29,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2025-02-08 05:43:29,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9477477477477477 [2025-02-08 05:43:29,311 INFO L175 Difference]: Start difference. First operand has 173 places, 180 transitions, 371 flow. Second operand 3 states and 526 transitions. [2025-02-08 05:43:29,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 196 transitions, 477 flow [2025-02-08 05:43:29,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 196 transitions, 473 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:43:29,314 INFO L231 Difference]: Finished difference. Result has 173 places, 188 transitions, 437 flow [2025-02-08 05:43:29,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=437, PETRI_PLACES=173, PETRI_TRANSITIONS=188} [2025-02-08 05:43:29,317 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 1 predicate places. [2025-02-08 05:43:29,317 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 188 transitions, 437 flow [2025-02-08 05:43:29,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 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-08 05:43:29,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:29,317 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] [2025-02-08 05:43:29,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:43:29,318 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:29,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:29,319 INFO L85 PathProgramCache]: Analyzing trace with hash 138256369, now seen corresponding path program 1 times [2025-02-08 05:43:29,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:29,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151915430] [2025-02-08 05:43:29,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:29,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:29,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 05:43:29,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 05:43:29,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:29,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:29,398 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-08 05:43:29,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:29,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151915430] [2025-02-08 05:43:29,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151915430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:29,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:29,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:29,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642796500] [2025-02-08 05:43:29,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:29,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:29,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:29,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:29,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:29,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 185 [2025-02-08 05:43:29,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 188 transitions, 437 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 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-08 05:43:29,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:29,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 185 [2025-02-08 05:43:29,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:29,535 INFO L124 PetriNetUnfolderBase]: 118/819 cut-off events. [2025-02-08 05:43:29,536 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-02-08 05:43:29,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 819 events. 118/819 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4411 event pairs, 12 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 849. Up to 73 conditions per place. [2025-02-08 05:43:29,540 INFO L140 encePairwiseOnDemand]: 181/185 looper letters, 21 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2025-02-08 05:43:29,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 194 transitions, 495 flow [2025-02-08 05:43:29,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:29,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:29,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2025-02-08 05:43:29,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423423423423424 [2025-02-08 05:43:29,542 INFO L175 Difference]: Start difference. First operand has 173 places, 188 transitions, 437 flow. Second operand 3 states and 523 transitions. [2025-02-08 05:43:29,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 194 transitions, 495 flow [2025-02-08 05:43:29,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 194 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:43:29,547 INFO L231 Difference]: Finished difference. Result has 172 places, 188 transitions, 431 flow [2025-02-08 05:43:29,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=431, PETRI_PLACES=172, PETRI_TRANSITIONS=188} [2025-02-08 05:43:29,550 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 0 predicate places. [2025-02-08 05:43:29,550 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 188 transitions, 431 flow [2025-02-08 05:43:29,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 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-08 05:43:29,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:29,551 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:29,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:43:29,551 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:29,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:29,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1532069947, now seen corresponding path program 1 times [2025-02-08 05:43:29,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:29,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227793169] [2025-02-08 05:43:29,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:29,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:29,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 05:43:29,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 05:43:29,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:29,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:29,703 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-08 05:43:29,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:29,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227793169] [2025-02-08 05:43:29,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227793169] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:29,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:29,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:43:29,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449949266] [2025-02-08 05:43:29,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:29,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:43:29,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:29,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:43:29,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:43:29,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 185 [2025-02-08 05:43:29,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 188 transitions, 431 flow. Second operand has 5 states, 5 states have (on average 163.4) internal successors, (817), 5 states have internal predecessors, (817), 0 states have call successors, (0), 0 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-08 05:43:29,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:29,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 185 [2025-02-08 05:43:29,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:29,855 INFO L124 PetriNetUnfolderBase]: 109/721 cut-off events. [2025-02-08 05:43:29,856 INFO L125 PetriNetUnfolderBase]: For 25/40 co-relation queries the response was YES. [2025-02-08 05:43:29,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 721 events. 109/721 cut-off events. For 25/40 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3668 event pairs, 16 based on Foata normal form. 2/609 useless extension candidates. Maximal degree in co-relation 719. Up to 83 conditions per place. [2025-02-08 05:43:29,859 INFO L140 encePairwiseOnDemand]: 177/185 looper letters, 27 selfloop transitions, 2 changer transitions 5/201 dead transitions. [2025-02-08 05:43:29,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 201 transitions, 525 flow [2025-02-08 05:43:29,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:43:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:43:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1007 transitions. [2025-02-08 05:43:29,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9072072072072072 [2025-02-08 05:43:29,862 INFO L175 Difference]: Start difference. First operand has 172 places, 188 transitions, 431 flow. Second operand 6 states and 1007 transitions. [2025-02-08 05:43:29,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 201 transitions, 525 flow [2025-02-08 05:43:29,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 201 transitions, 525 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:43:29,866 INFO L231 Difference]: Finished difference. Result has 181 places, 188 transitions, 449 flow [2025-02-08 05:43:29,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=449, PETRI_PLACES=181, PETRI_TRANSITIONS=188} [2025-02-08 05:43:29,869 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 9 predicate places. [2025-02-08 05:43:29,869 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 188 transitions, 449 flow [2025-02-08 05:43:29,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 163.4) internal successors, (817), 5 states have internal predecessors, (817), 0 states have call successors, (0), 0 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-08 05:43:29,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:29,870 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] [2025-02-08 05:43:29,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:43:29,870 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:29,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:29,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1734740504, now seen corresponding path program 1 times [2025-02-08 05:43:29,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:29,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033385322] [2025-02-08 05:43:29,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:29,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:29,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 05:43:29,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 05:43:29,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:29,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:29,964 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-08 05:43:29,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:29,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033385322] [2025-02-08 05:43:29,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033385322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:29,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:29,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:43:29,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682860290] [2025-02-08 05:43:29,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:29,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:29,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:29,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:29,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:30,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 185 [2025-02-08 05:43:30,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 188 transitions, 449 flow. Second operand has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 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-08 05:43:30,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:30,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 185 [2025-02-08 05:43:30,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:30,119 INFO L124 PetriNetUnfolderBase]: 110/666 cut-off events. [2025-02-08 05:43:30,119 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:43:30,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 666 events. 110/666 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3047 event pairs, 13 based on Foata normal form. 1/564 useless extension candidates. Maximal degree in co-relation 776. Up to 87 conditions per place. [2025-02-08 05:43:30,122 INFO L140 encePairwiseOnDemand]: 182/185 looper letters, 19 selfloop transitions, 2 changer transitions 0/195 dead transitions. [2025-02-08 05:43:30,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 195 transitions, 505 flow [2025-02-08 05:43:30,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:30,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:30,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2025-02-08 05:43:30,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9531531531531532 [2025-02-08 05:43:30,127 INFO L175 Difference]: Start difference. First operand has 181 places, 188 transitions, 449 flow. Second operand 3 states and 529 transitions. [2025-02-08 05:43:30,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 195 transitions, 505 flow [2025-02-08 05:43:30,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 195 transitions, 491 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-02-08 05:43:30,131 INFO L231 Difference]: Finished difference. Result has 176 places, 189 transitions, 447 flow [2025-02-08 05:43:30,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=447, PETRI_PLACES=176, PETRI_TRANSITIONS=189} [2025-02-08 05:43:30,132 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 4 predicate places. [2025-02-08 05:43:30,132 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 189 transitions, 447 flow [2025-02-08 05:43:30,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 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-08 05:43:30,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:30,132 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] [2025-02-08 05:43:30,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:43:30,133 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:30,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:30,133 INFO L85 PathProgramCache]: Analyzing trace with hash 971002327, now seen corresponding path program 1 times [2025-02-08 05:43:30,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:30,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838848123] [2025-02-08 05:43:30,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:30,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:30,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:43:30,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:43:30,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:30,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:30,195 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-08 05:43:30,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:30,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838848123] [2025-02-08 05:43:30,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838848123] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:30,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:30,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:43:30,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954243100] [2025-02-08 05:43:30,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:30,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:43:30,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:30,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:43:30,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:43:30,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 185 [2025-02-08 05:43:30,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 189 transitions, 447 flow. Second operand has 4 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 0 states have call successors, (0), 0 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-08 05:43:30,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:30,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 185 [2025-02-08 05:43:30,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:30,369 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][192], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), Black: 178#true, 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 198#true, Black: 183#true, 43#L1058-24true, 173#true, 202#true]) [2025-02-08 05:43:30,369 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is not cut-off event [2025-02-08 05:43:30,369 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is not cut-off event [2025-02-08 05:43:30,369 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2025-02-08 05:43:30,369 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2025-02-08 05:43:30,375 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][192], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), 2#L1058-22true, Black: 178#true, 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 198#true, Black: 183#true, 173#true, 202#true]) [2025-02-08 05:43:30,375 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is not cut-off event [2025-02-08 05:43:30,375 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2025-02-08 05:43:30,375 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2025-02-08 05:43:30,375 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2025-02-08 05:43:30,390 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][192], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), Black: 178#true, 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 198#true, Black: 183#true, 105#L1058-12true, 173#true, 202#true]) [2025-02-08 05:43:30,390 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-02-08 05:43:30,390 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-02-08 05:43:30,390 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-02-08 05:43:30,390 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-02-08 05:43:30,394 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][192], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), Black: 178#true, 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 11#L1058-10true, 198#true, Black: 183#true, 173#true, 202#true]) [2025-02-08 05:43:30,394 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2025-02-08 05:43:30,394 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-02-08 05:43:30,394 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-02-08 05:43:30,394 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-02-08 05:43:30,404 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][176], [69#L1059-10true, Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), Black: 178#true, 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 198#true, Black: 183#true, 173#true, 202#true]) [2025-02-08 05:43:30,405 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is not cut-off event [2025-02-08 05:43:30,405 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2025-02-08 05:43:30,405 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is not cut-off event [2025-02-08 05:43:30,405 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2025-02-08 05:43:30,421 INFO L124 PetriNetUnfolderBase]: 287/1201 cut-off events. [2025-02-08 05:43:30,421 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-08 05:43:30,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1688 conditions, 1201 events. 287/1201 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 7112 event pairs, 30 based on Foata normal form. 1/1053 useless extension candidates. Maximal degree in co-relation 1548. Up to 172 conditions per place. [2025-02-08 05:43:30,426 INFO L140 encePairwiseOnDemand]: 173/185 looper letters, 42 selfloop transitions, 12 changer transitions 0/218 dead transitions. [2025-02-08 05:43:30,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 218 transitions, 615 flow [2025-02-08 05:43:30,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:43:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:43:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 691 transitions. [2025-02-08 05:43:30,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9337837837837838 [2025-02-08 05:43:30,428 INFO L175 Difference]: Start difference. First operand has 176 places, 189 transitions, 447 flow. Second operand 4 states and 691 transitions. [2025-02-08 05:43:30,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 218 transitions, 615 flow [2025-02-08 05:43:30,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 218 transitions, 613 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:43:30,431 INFO L231 Difference]: Finished difference. Result has 181 places, 199 transitions, 537 flow [2025-02-08 05:43:30,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=537, PETRI_PLACES=181, PETRI_TRANSITIONS=199} [2025-02-08 05:43:30,431 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 9 predicate places. [2025-02-08 05:43:30,432 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 199 transitions, 537 flow [2025-02-08 05:43:30,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 0 states have call successors, (0), 0 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-08 05:43:30,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:30,432 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:30,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:43:30,432 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:30,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:30,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1777930259, now seen corresponding path program 1 times [2025-02-08 05:43:30,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:30,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181243953] [2025-02-08 05:43:30,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:30,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:30,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:43:30,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:43:30,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:30,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:30,479 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-08 05:43:30,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:30,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181243953] [2025-02-08 05:43:30,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181243953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:30,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:30,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:43:30,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38001284] [2025-02-08 05:43:30,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:30,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:43:30,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:30,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:43:30,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:43:30,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 185 [2025-02-08 05:43:30,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 199 transitions, 537 flow. Second operand has 4 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 0 states have call successors, (0), 0 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-08 05:43:30,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:30,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 185 [2025-02-08 05:43:30,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:30,597 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][191], [Black: 204#(not (= ~threads_mask~0 0)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), Black: 178#true, 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 183#true, 43#L1058-24true, 173#true, 202#true, 209#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0)))]) [2025-02-08 05:43:30,597 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2025-02-08 05:43:30,597 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-02-08 05:43:30,597 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-02-08 05:43:30,597 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-02-08 05:43:30,600 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][191], [Black: 204#(not (= ~threads_mask~0 0)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), 2#L1058-22true, Black: 178#true, 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 183#true, 173#true, 202#true, 209#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0)))]) [2025-02-08 05:43:30,600 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2025-02-08 05:43:30,601 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-02-08 05:43:30,601 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-02-08 05:43:30,601 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2025-02-08 05:43:30,608 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][191], [Black: 204#(not (= ~threads_mask~0 0)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), Black: 178#true, 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 183#true, 173#true, 52#L1058-18true, 202#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 209#true]) [2025-02-08 05:43:30,608 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2025-02-08 05:43:30,608 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2025-02-08 05:43:30,608 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2025-02-08 05:43:30,608 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2025-02-08 05:43:30,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][191], [Black: 204#(not (= ~threads_mask~0 0)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), Black: 178#true, 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 183#true, 173#true, 105#L1058-12true, 202#true, 209#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0)))]) [2025-02-08 05:43:30,621 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2025-02-08 05:43:30,621 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-02-08 05:43:30,621 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-02-08 05:43:30,621 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-02-08 05:43:30,624 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][191], [Black: 204#(not (= ~threads_mask~0 0)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), Black: 178#true, 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 11#L1058-10true, Black: 183#true, 173#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 202#true, 209#true]) [2025-02-08 05:43:30,624 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2025-02-08 05:43:30,625 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-02-08 05:43:30,625 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-02-08 05:43:30,625 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-02-08 05:43:30,639 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][174], [69#L1059-10true, Black: 204#(not (= ~threads_mask~0 0)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), Black: 178#true, 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 183#true, 173#true, 202#true, 209#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0)))]) [2025-02-08 05:43:30,640 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is not cut-off event [2025-02-08 05:43:30,640 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2025-02-08 05:43:30,640 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2025-02-08 05:43:30,640 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2025-02-08 05:43:30,664 INFO L124 PetriNetUnfolderBase]: 284/1202 cut-off events. [2025-02-08 05:43:30,664 INFO L125 PetriNetUnfolderBase]: For 388/452 co-relation queries the response was YES. [2025-02-08 05:43:30,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2024 conditions, 1202 events. 284/1202 cut-off events. For 388/452 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 7223 event pairs, 30 based on Foata normal form. 21/1084 useless extension candidates. Maximal degree in co-relation 1832. Up to 169 conditions per place. [2025-02-08 05:43:30,671 INFO L140 encePairwiseOnDemand]: 174/185 looper letters, 42 selfloop transitions, 13 changer transitions 0/219 dead transitions. [2025-02-08 05:43:30,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 219 transitions, 701 flow [2025-02-08 05:43:30,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:43:30,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:43:30,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 689 transitions. [2025-02-08 05:43:30,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9310810810810811 [2025-02-08 05:43:30,673 INFO L175 Difference]: Start difference. First operand has 181 places, 199 transitions, 537 flow. Second operand 4 states and 689 transitions. [2025-02-08 05:43:30,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 219 transitions, 701 flow [2025-02-08 05:43:30,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 219 transitions, 701 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:43:30,677 INFO L231 Difference]: Finished difference. Result has 186 places, 202 transitions, 596 flow [2025-02-08 05:43:30,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=596, PETRI_PLACES=186, PETRI_TRANSITIONS=202} [2025-02-08 05:43:30,678 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 14 predicate places. [2025-02-08 05:43:30,678 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 202 transitions, 596 flow [2025-02-08 05:43:30,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 0 states have call successors, (0), 0 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-08 05:43:30,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:30,678 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] [2025-02-08 05:43:30,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:43:30,679 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:30,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:30,679 INFO L85 PathProgramCache]: Analyzing trace with hash -575957464, now seen corresponding path program 1 times [2025-02-08 05:43:30,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:30,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165117602] [2025-02-08 05:43:30,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:30,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:30,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 05:43:30,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 05:43:30,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:30,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:30,758 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-08 05:43:30,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:30,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165117602] [2025-02-08 05:43:30,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165117602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:30,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:30,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:43:30,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551871990] [2025-02-08 05:43:30,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:30,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:43:30,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:30,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:43:30,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:43:30,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 185 [2025-02-08 05:43:30,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 202 transitions, 596 flow. Second operand has 4 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 0 states have call successors, (0), 0 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-08 05:43:30,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:30,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 185 [2025-02-08 05:43:30,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:30,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][173], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 173#true, 215#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 209#true, Black: 204#(not (= ~threads_mask~0 0)), 69#L1059-10true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 178#true, Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 183#true, 202#true]) [2025-02-08 05:43:30,929 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is not cut-off event [2025-02-08 05:43:30,929 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2025-02-08 05:43:30,929 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2025-02-08 05:43:30,929 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2025-02-08 05:43:30,930 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][173], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 173#true, 215#true, 209#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 178#true, 160#L1058-2true, Black: 183#true, 202#true]) [2025-02-08 05:43:30,930 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-02-08 05:43:30,930 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-02-08 05:43:30,930 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-08 05:43:30,930 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-08 05:43:30,934 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][170], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 173#true, 215#true, 209#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 178#true, 49#L1059-5true, Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 183#true, 202#true]) [2025-02-08 05:43:30,934 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2025-02-08 05:43:30,934 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-02-08 05:43:30,934 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-02-08 05:43:30,934 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-08 05:43:30,945 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][170], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 173#true, 215#true, 87#L1059-1true, 209#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 180#(= |#race~threads_mask~0| 0), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 183#true, 202#true]) [2025-02-08 05:43:30,946 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2025-02-08 05:43:30,946 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-02-08 05:43:30,946 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-02-08 05:43:30,946 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-02-08 05:43:30,958 INFO L124 PetriNetUnfolderBase]: 315/1327 cut-off events. [2025-02-08 05:43:30,959 INFO L125 PetriNetUnfolderBase]: For 944/1026 co-relation queries the response was YES. [2025-02-08 05:43:30,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2491 conditions, 1327 events. 315/1327 cut-off events. For 944/1026 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 8118 event pairs, 34 based on Foata normal form. 20/1188 useless extension candidates. Maximal degree in co-relation 2274. Up to 216 conditions per place. [2025-02-08 05:43:30,964 INFO L140 encePairwiseOnDemand]: 175/185 looper letters, 39 selfloop transitions, 15 changer transitions 0/221 dead transitions. [2025-02-08 05:43:30,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 221 transitions, 771 flow [2025-02-08 05:43:30,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:43:30,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:43:30,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 687 transitions. [2025-02-08 05:43:30,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9283783783783783 [2025-02-08 05:43:30,966 INFO L175 Difference]: Start difference. First operand has 186 places, 202 transitions, 596 flow. Second operand 4 states and 687 transitions. [2025-02-08 05:43:30,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 221 transitions, 771 flow [2025-02-08 05:43:30,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 221 transitions, 755 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 05:43:30,970 INFO L231 Difference]: Finished difference. Result has 190 places, 206 transitions, 663 flow [2025-02-08 05:43:30,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=663, PETRI_PLACES=190, PETRI_TRANSITIONS=206} [2025-02-08 05:43:30,971 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 18 predicate places. [2025-02-08 05:43:30,971 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 206 transitions, 663 flow [2025-02-08 05:43:30,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 0 states have call successors, (0), 0 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-08 05:43:30,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:30,972 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] [2025-02-08 05:43:30,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:43:30,972 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:30,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:30,973 INFO L85 PathProgramCache]: Analyzing trace with hash -19516029, now seen corresponding path program 1 times [2025-02-08 05:43:30,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:30,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100178857] [2025-02-08 05:43:30,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:30,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:30,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 05:43:30,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 05:43:30,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:30,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:31,026 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-08 05:43:31,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:31,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100178857] [2025-02-08 05:43:31,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100178857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:31,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:31,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:43:31,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802905992] [2025-02-08 05:43:31,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:31,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:43:31,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:31,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:43:31,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:43:31,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 185 [2025-02-08 05:43:31,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 206 transitions, 663 flow. Second operand has 4 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 0 states have call successors, (0), 0 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-08 05:43:31,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:31,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 185 [2025-02-08 05:43:31,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:31,324 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][171], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 173#true, 215#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 69#L1059-10true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 178#true, Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), 221#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2025-02-08 05:43:31,324 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2025-02-08 05:43:31,324 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2025-02-08 05:43:31,324 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2025-02-08 05:43:31,324 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2025-02-08 05:43:31,325 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][171], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 215#true, 173#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 178#true, 221#true, 160#L1058-2true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2025-02-08 05:43:31,325 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2025-02-08 05:43:31,325 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-02-08 05:43:31,325 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-02-08 05:43:31,325 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-02-08 05:43:31,339 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][168], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 173#true, 215#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), 49#L1059-5true, Black: 178#true, Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), 221#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2025-02-08 05:43:31,339 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-02-08 05:43:31,339 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-08 05:43:31,339 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-02-08 05:43:31,339 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-08 05:43:31,391 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][168], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 173#true, 215#true, 87#L1059-1true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 180#(= |#race~threads_mask~0| 0), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), 221#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2025-02-08 05:43:31,391 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2025-02-08 05:43:31,391 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-02-08 05:43:31,391 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-02-08 05:43:31,391 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-02-08 05:43:31,415 INFO L124 PetriNetUnfolderBase]: 325/1342 cut-off events. [2025-02-08 05:43:31,419 INFO L125 PetriNetUnfolderBase]: For 1592/1684 co-relation queries the response was YES. [2025-02-08 05:43:31,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2739 conditions, 1342 events. 325/1342 cut-off events. For 1592/1684 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 8203 event pairs, 36 based on Foata normal form. 21/1201 useless extension candidates. Maximal degree in co-relation 2519. Up to 222 conditions per place. [2025-02-08 05:43:31,430 INFO L140 encePairwiseOnDemand]: 175/185 looper letters, 39 selfloop transitions, 17 changer transitions 0/223 dead transitions. [2025-02-08 05:43:31,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 223 transitions, 835 flow [2025-02-08 05:43:31,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:43:31,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:43:31,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 687 transitions. [2025-02-08 05:43:31,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9283783783783783 [2025-02-08 05:43:31,436 INFO L175 Difference]: Start difference. First operand has 190 places, 206 transitions, 663 flow. Second operand 4 states and 687 transitions. [2025-02-08 05:43:31,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 223 transitions, 835 flow [2025-02-08 05:43:31,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 223 transitions, 819 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:43:31,445 INFO L231 Difference]: Finished difference. Result has 194 places, 209 transitions, 729 flow [2025-02-08 05:43:31,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=729, PETRI_PLACES=194, PETRI_TRANSITIONS=209} [2025-02-08 05:43:31,446 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 22 predicate places. [2025-02-08 05:43:31,449 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 209 transitions, 729 flow [2025-02-08 05:43:31,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 0 states have call successors, (0), 0 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-08 05:43:31,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:31,450 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:31,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:43:31,450 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:31,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:31,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1177086539, now seen corresponding path program 1 times [2025-02-08 05:43:31,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:31,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883832230] [2025-02-08 05:43:31,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:31,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:31,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 05:43:31,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 05:43:31,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:31,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:31,525 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-08 05:43:31,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:31,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883832230] [2025-02-08 05:43:31,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883832230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:31,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:31,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:43:31,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118707500] [2025-02-08 05:43:31,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:31,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:43:31,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:31,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:43:31,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:43:31,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 185 [2025-02-08 05:43:31,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 209 transitions, 729 flow. Second operand has 4 states, 4 states have (on average 164.75) internal successors, (659), 4 states have internal predecessors, (659), 0 states have call successors, (0), 0 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-08 05:43:31,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:31,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 185 [2025-02-08 05:43:31,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:31,781 INFO L124 PetriNetUnfolderBase]: 360/1508 cut-off events. [2025-02-08 05:43:31,782 INFO L125 PetriNetUnfolderBase]: For 2438/2560 co-relation queries the response was YES. [2025-02-08 05:43:31,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3223 conditions, 1508 events. 360/1508 cut-off events. For 2438/2560 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 9901 event pairs, 41 based on Foata normal form. 16/1351 useless extension candidates. Maximal degree in co-relation 3004. Up to 311 conditions per place. [2025-02-08 05:43:31,790 INFO L140 encePairwiseOnDemand]: 179/185 looper letters, 44 selfloop transitions, 18 changer transitions 0/238 dead transitions. [2025-02-08 05:43:31,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 238 transitions, 1043 flow [2025-02-08 05:43:31,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:43:31,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:43:31,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 692 transitions. [2025-02-08 05:43:31,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9351351351351351 [2025-02-08 05:43:31,792 INFO L175 Difference]: Start difference. First operand has 194 places, 209 transitions, 729 flow. Second operand 4 states and 692 transitions. [2025-02-08 05:43:31,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 238 transitions, 1043 flow [2025-02-08 05:43:31,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 238 transitions, 1019 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:43:31,798 INFO L231 Difference]: Finished difference. Result has 198 places, 223 transitions, 925 flow [2025-02-08 05:43:31,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=925, PETRI_PLACES=198, PETRI_TRANSITIONS=223} [2025-02-08 05:43:31,798 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 26 predicate places. [2025-02-08 05:43:31,798 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 223 transitions, 925 flow [2025-02-08 05:43:31,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 164.75) internal successors, (659), 4 states have internal predecessors, (659), 0 states have call successors, (0), 0 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-08 05:43:31,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:31,799 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:31,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:43:31,799 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:31,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:31,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1183551186, now seen corresponding path program 1 times [2025-02-08 05:43:31,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:31,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216691595] [2025-02-08 05:43:31,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:31,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:31,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 05:43:31,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 05:43:31,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:31,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:31,825 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-08 05:43:31,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:31,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216691595] [2025-02-08 05:43:31,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216691595] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:31,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:31,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:31,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186461874] [2025-02-08 05:43:31,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:31,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:31,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:31,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:31,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:31,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 185 [2025-02-08 05:43:31,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 223 transitions, 925 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 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-08 05:43:31,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:31,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 185 [2025-02-08 05:43:31,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:31,965 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([274] L1059-6-->L1059-5: Formula: (= v_~threads_mask~0_1 |v_ULTIMATE.start_main_#t~bitwise18#1_3|) InVars {ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_3|} OutVars{~threads_mask~0=v_~threads_mask~0_1, ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_3|} AuxVars[] AssignedVars[~threads_mask~0][206], [Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 223#(not (= ~threads_mask~0 0)), 235#true, 157#L1048-5true, Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 227#true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 178#true, 49#L1059-5true, Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2025-02-08 05:43:31,965 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-02-08 05:43:31,965 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-08 05:43:31,965 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-02-08 05:43:31,965 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-08 05:43:31,970 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][164], [Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 235#true, 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 227#true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 178#true, 49#L1059-5true, Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2025-02-08 05:43:31,970 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2025-02-08 05:43:31,970 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-08 05:43:31,970 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-08 05:43:31,970 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-02-08 05:43:32,007 INFO L124 PetriNetUnfolderBase]: 384/1710 cut-off events. [2025-02-08 05:43:32,007 INFO L125 PetriNetUnfolderBase]: For 2128/2190 co-relation queries the response was YES. [2025-02-08 05:43:32,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3411 conditions, 1710 events. 384/1710 cut-off events. For 2128/2190 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 12674 event pairs, 66 based on Foata normal form. 6/1513 useless extension candidates. Maximal degree in co-relation 3185. Up to 332 conditions per place. [2025-02-08 05:43:32,016 INFO L140 encePairwiseOnDemand]: 179/185 looper letters, 30 selfloop transitions, 7 changer transitions 0/230 dead transitions. [2025-02-08 05:43:32,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 230 transitions, 1019 flow [2025-02-08 05:43:32,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:32,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:32,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2025-02-08 05:43:32,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9261261261261261 [2025-02-08 05:43:32,018 INFO L175 Difference]: Start difference. First operand has 198 places, 223 transitions, 925 flow. Second operand 3 states and 514 transitions. [2025-02-08 05:43:32,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 230 transitions, 1019 flow [2025-02-08 05:43:32,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 230 transitions, 1019 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:43:32,025 INFO L231 Difference]: Finished difference. Result has 202 places, 228 transitions, 981 flow [2025-02-08 05:43:32,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=981, PETRI_PLACES=202, PETRI_TRANSITIONS=228} [2025-02-08 05:43:32,025 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 30 predicate places. [2025-02-08 05:43:32,026 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 228 transitions, 981 flow [2025-02-08 05:43:32,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 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-08 05:43:32,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:32,026 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:32,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:43:32,026 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:32,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:32,027 INFO L85 PathProgramCache]: Analyzing trace with hash 558458947, now seen corresponding path program 1 times [2025-02-08 05:43:32,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:32,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428192139] [2025-02-08 05:43:32,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:32,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:32,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 05:43:32,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 05:43:32,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:32,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:32,399 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-08 05:43:32,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:32,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428192139] [2025-02-08 05:43:32,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428192139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:32,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:32,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:43:32,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469724674] [2025-02-08 05:43:32,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:32,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:43:32,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:32,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:43:32,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:43:32,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 185 [2025-02-08 05:43:32,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 228 transitions, 981 flow. Second operand has 6 states, 6 states have (on average 153.16666666666666) internal successors, (919), 6 states have internal predecessors, (919), 0 states have call successors, (0), 0 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-08 05:43:32,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:32,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 185 [2025-02-08 05:43:32,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:32,645 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][164], [Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 223#(not (= ~threads_mask~0 0)), 235#true, 240#true, 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 204#(not (= ~threads_mask~0 0)), 227#true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 178#true, Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), 49#L1059-5true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2025-02-08 05:43:32,646 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2025-02-08 05:43:32,646 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-08 05:43:32,646 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-02-08 05:43:32,646 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-08 05:43:32,750 INFO L124 PetriNetUnfolderBase]: 532/2307 cut-off events. [2025-02-08 05:43:32,750 INFO L125 PetriNetUnfolderBase]: For 2358/2377 co-relation queries the response was YES. [2025-02-08 05:43:32,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4493 conditions, 2307 events. 532/2307 cut-off events. For 2358/2377 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 17640 event pairs, 117 based on Foata normal form. 5/2021 useless extension candidates. Maximal degree in co-relation 4259. Up to 454 conditions per place. [2025-02-08 05:43:32,758 INFO L140 encePairwiseOnDemand]: 174/185 looper letters, 43 selfloop transitions, 22 changer transitions 0/257 dead transitions. [2025-02-08 05:43:32,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 257 transitions, 1169 flow [2025-02-08 05:43:32,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:43:32,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:43:32,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 968 transitions. [2025-02-08 05:43:32,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.872072072072072 [2025-02-08 05:43:32,761 INFO L175 Difference]: Start difference. First operand has 202 places, 228 transitions, 981 flow. Second operand 6 states and 968 transitions. [2025-02-08 05:43:32,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 257 transitions, 1169 flow [2025-02-08 05:43:32,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 257 transitions, 1155 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:43:32,767 INFO L231 Difference]: Finished difference. Result has 210 places, 249 transitions, 1117 flow [2025-02-08 05:43:32,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=967, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1117, PETRI_PLACES=210, PETRI_TRANSITIONS=249} [2025-02-08 05:43:32,767 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 38 predicate places. [2025-02-08 05:43:32,768 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 249 transitions, 1117 flow [2025-02-08 05:43:32,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 153.16666666666666) internal successors, (919), 6 states have internal predecessors, (919), 0 states have call successors, (0), 0 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-08 05:43:32,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:32,768 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] [2025-02-08 05:43:32,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:43:32,768 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:32,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:32,769 INFO L85 PathProgramCache]: Analyzing trace with hash 498438496, now seen corresponding path program 1 times [2025-02-08 05:43:32,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:32,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271130061] [2025-02-08 05:43:32,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:32,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:32,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 05:43:32,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 05:43:32,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:32,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:33,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:33,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:33,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271130061] [2025-02-08 05:43:33,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271130061] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:33,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:33,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:43:33,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888110161] [2025-02-08 05:43:33,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:33,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:43:33,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:33,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:43:33,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:43:33,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 185 [2025-02-08 05:43:33,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 249 transitions, 1117 flow. Second operand has 6 states, 6 states have (on average 157.0) internal successors, (942), 6 states have internal predecessors, (942), 0 states have call successors, (0), 0 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-08 05:43:33,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:33,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 185 [2025-02-08 05:43:33,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:33,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([423] L1048-12-->L1048-10: Formula: (and (not (= v_~threads_mask~0_27 0)) (not (= |v_threadThread1of1ForFork0_#t~bitwise5_7| v_~threads_mask~0_27))) InVars {threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_7|, ~threads_mask~0=v_~threads_mask~0_27} OutVars{threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_7|, ~threads_mask~0=v_~threads_mask~0_27} AuxVars[] AssignedVars[][166], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 202#true, 211#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), 49#L1059-5true, Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), 223#(not (= ~threads_mask~0 0)), 204#(not (= ~threads_mask~0 0)), Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, 217#(not (= ~threads_mask~0 0)), Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 227#true, 85#L1048-10true, Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true, Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))))]) [2025-02-08 05:43:33,269 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2025-02-08 05:43:33,269 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2025-02-08 05:43:33,269 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2025-02-08 05:43:33,269 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2025-02-08 05:43:33,273 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][180], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 251#true, 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), 49#L1059-5true, Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 227#true, Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true, Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))))]) [2025-02-08 05:43:33,274 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-02-08 05:43:33,274 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-02-08 05:43:33,274 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-08 05:43:33,274 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-02-08 05:43:33,281 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([274] L1059-6-->L1059-5: Formula: (= v_~threads_mask~0_1 |v_ULTIMATE.start_main_#t~bitwise18#1_3|) InVars {ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_3|} OutVars{~threads_mask~0=v_~threads_mask~0_1, ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_3|} AuxVars[] AssignedVars[~threads_mask~0][254], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 251#true, 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), 49#L1059-5true, Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 227#true, Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true, Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))))]) [2025-02-08 05:43:33,282 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-02-08 05:43:33,282 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-02-08 05:43:33,282 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-08 05:43:33,282 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-08 05:43:33,289 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([427] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][180], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 251#true, 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), 49#L1059-5true, Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 227#true, Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true, Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))))]) [2025-02-08 05:43:33,289 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is not cut-off event [2025-02-08 05:43:33,289 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2025-02-08 05:43:33,289 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2025-02-08 05:43:33,289 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2025-02-08 05:43:33,289 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2025-02-08 05:43:33,399 INFO L124 PetriNetUnfolderBase]: 629/2461 cut-off events. [2025-02-08 05:43:33,399 INFO L125 PetriNetUnfolderBase]: For 2741/2806 co-relation queries the response was YES. [2025-02-08 05:43:33,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5292 conditions, 2461 events. 629/2461 cut-off events. For 2741/2806 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 19040 event pairs, 87 based on Foata normal form. 15/2221 useless extension candidates. Maximal degree in co-relation 5019. Up to 541 conditions per place. [2025-02-08 05:43:33,412 INFO L140 encePairwiseOnDemand]: 170/185 looper letters, 75 selfloop transitions, 48 changer transitions 0/320 dead transitions. [2025-02-08 05:43:33,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 320 transitions, 1639 flow [2025-02-08 05:43:33,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:43:33,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:43:33,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1015 transitions. [2025-02-08 05:43:33,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9144144144144144 [2025-02-08 05:43:33,414 INFO L175 Difference]: Start difference. First operand has 210 places, 249 transitions, 1117 flow. Second operand 6 states and 1015 transitions. [2025-02-08 05:43:33,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 320 transitions, 1639 flow [2025-02-08 05:43:33,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 320 transitions, 1639 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:43:33,424 INFO L231 Difference]: Finished difference. Result has 220 places, 292 transitions, 1505 flow [2025-02-08 05:43:33,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=1117, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1505, PETRI_PLACES=220, PETRI_TRANSITIONS=292} [2025-02-08 05:43:33,425 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 48 predicate places. [2025-02-08 05:43:33,425 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 292 transitions, 1505 flow [2025-02-08 05:43:33,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 157.0) internal successors, (942), 6 states have internal predecessors, (942), 0 states have call successors, (0), 0 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-08 05:43:33,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:33,426 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] [2025-02-08 05:43:33,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:43:33,426 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:33,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:33,427 INFO L85 PathProgramCache]: Analyzing trace with hash -694314164, now seen corresponding path program 1 times [2025-02-08 05:43:33,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:33,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316781553] [2025-02-08 05:43:33,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:33,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:33,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 05:43:33,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 05:43:33,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:33,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:33,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:33,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:33,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316781553] [2025-02-08 05:43:33,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316781553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:33,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:33,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:43:33,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836560501] [2025-02-08 05:43:33,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:33,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:43:33,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:33,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:43:33,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:43:34,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 185 [2025-02-08 05:43:34,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 292 transitions, 1505 flow. Second operand has 6 states, 6 states have (on average 155.83333333333334) internal successors, (935), 6 states have internal predecessors, (935), 0 states have call successors, (0), 0 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-08 05:43:34,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:34,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 185 [2025-02-08 05:43:34,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:34,492 INFO L124 PetriNetUnfolderBase]: 604/2510 cut-off events. [2025-02-08 05:43:34,493 INFO L125 PetriNetUnfolderBase]: For 3303/3396 co-relation queries the response was YES. [2025-02-08 05:43:34,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5941 conditions, 2510 events. 604/2510 cut-off events. For 3303/3396 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 19919 event pairs, 97 based on Foata normal form. 19/2283 useless extension candidates. Maximal degree in co-relation 5690. Up to 591 conditions per place. [2025-02-08 05:43:34,513 INFO L140 encePairwiseOnDemand]: 174/185 looper letters, 95 selfloop transitions, 31 changer transitions 7/328 dead transitions. [2025-02-08 05:43:34,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 328 transitions, 1948 flow [2025-02-08 05:43:34,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:43:34,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:43:34,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 979 transitions. [2025-02-08 05:43:34,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.881981981981982 [2025-02-08 05:43:34,516 INFO L175 Difference]: Start difference. First operand has 220 places, 292 transitions, 1505 flow. Second operand 6 states and 979 transitions. [2025-02-08 05:43:34,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 328 transitions, 1948 flow [2025-02-08 05:43:34,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 328 transitions, 1930 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-02-08 05:43:34,532 INFO L231 Difference]: Finished difference. Result has 230 places, 313 transitions, 1788 flow [2025-02-08 05:43:34,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1788, PETRI_PLACES=230, PETRI_TRANSITIONS=313} [2025-02-08 05:43:34,533 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 58 predicate places. [2025-02-08 05:43:34,533 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 313 transitions, 1788 flow [2025-02-08 05:43:34,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 155.83333333333334) internal successors, (935), 6 states have internal predecessors, (935), 0 states have call successors, (0), 0 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-08 05:43:34,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:34,534 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] [2025-02-08 05:43:34,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:43:34,534 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:34,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:34,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1691892010, now seen corresponding path program 1 times [2025-02-08 05:43:34,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:34,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910578840] [2025-02-08 05:43:34,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:34,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:34,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 05:43:34,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 05:43:34,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:34,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:34,573 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-08 05:43:34,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:34,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910578840] [2025-02-08 05:43:34,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910578840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:34,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:34,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:34,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761259308] [2025-02-08 05:43:34,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:34,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:34,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:34,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:34,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:34,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 185 [2025-02-08 05:43:34,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 313 transitions, 1788 flow. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 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-08 05:43:34,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:34,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 185 [2025-02-08 05:43:34,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:34,772 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][176], [Black: 253#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 255#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 254#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 240#true, Black: 256#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 262#true, 251#true, 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 265#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), 273#true, Black: 266#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 264#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 227#true, Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), 160#L1058-2true, Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true, Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))))]) [2025-02-08 05:43:34,772 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-02-08 05:43:34,772 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-02-08 05:43:34,772 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-02-08 05:43:34,772 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-02-08 05:43:34,786 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([274] L1059-6-->L1059-5: Formula: (= v_~threads_mask~0_1 |v_ULTIMATE.start_main_#t~bitwise18#1_3|) InVars {ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_3|} OutVars{~threads_mask~0=v_~threads_mask~0_1, ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_3|} AuxVars[] AssignedVars[~threads_mask~0][269], [Black: 253#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 255#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 254#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 240#true, Black: 256#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 262#true, 251#true, 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 265#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), 273#true, Black: 266#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 264#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), 49#L1059-5true, Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 227#true, Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true, Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))))]) [2025-02-08 05:43:34,786 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-02-08 05:43:34,786 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-08 05:43:34,786 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-02-08 05:43:34,786 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-08 05:43:34,884 INFO L124 PetriNetUnfolderBase]: 765/2882 cut-off events. [2025-02-08 05:43:34,885 INFO L125 PetriNetUnfolderBase]: For 3836/3959 co-relation queries the response was YES. [2025-02-08 05:43:34,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6783 conditions, 2882 events. 765/2882 cut-off events. For 3836/3959 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 23680 event pairs, 105 based on Foata normal form. 17/2624 useless extension candidates. Maximal degree in co-relation 6531. Up to 539 conditions per place. [2025-02-08 05:43:34,902 INFO L140 encePairwiseOnDemand]: 178/185 looper letters, 35 selfloop transitions, 11 changer transitions 3/329 dead transitions. [2025-02-08 05:43:34,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 329 transitions, 1948 flow [2025-02-08 05:43:34,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:34,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:34,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2025-02-08 05:43:34,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9405405405405406 [2025-02-08 05:43:34,904 INFO L175 Difference]: Start difference. First operand has 230 places, 313 transitions, 1788 flow. Second operand 3 states and 522 transitions. [2025-02-08 05:43:34,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 329 transitions, 1948 flow [2025-02-08 05:43:34,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 329 transitions, 1892 flow, removed 28 selfloop flow, removed 0 redundant places. [2025-02-08 05:43:34,918 INFO L231 Difference]: Finished difference. Result has 230 places, 317 transitions, 1790 flow [2025-02-08 05:43:34,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=1732, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1790, PETRI_PLACES=230, PETRI_TRANSITIONS=317} [2025-02-08 05:43:34,919 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 58 predicate places. [2025-02-08 05:43:34,919 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 317 transitions, 1790 flow [2025-02-08 05:43:34,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 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-08 05:43:34,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:34,920 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:34,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:43:34,920 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:34,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:34,921 INFO L85 PathProgramCache]: Analyzing trace with hash -231705390, now seen corresponding path program 1 times [2025-02-08 05:43:34,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:34,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954411608] [2025-02-08 05:43:34,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:34,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:34,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 05:43:34,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 05:43:34,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:34,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:35,350 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-08 05:43:35,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:35,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954411608] [2025-02-08 05:43:35,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954411608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:35,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:35,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 05:43:35,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177222058] [2025-02-08 05:43:35,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:35,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 05:43:35,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:35,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 05:43:35,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-08 05:43:35,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 185 [2025-02-08 05:43:35,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 317 transitions, 1790 flow. Second operand has 11 states, 11 states have (on average 147.27272727272728) internal successors, (1620), 11 states have internal predecessors, (1620), 0 states have call successors, (0), 0 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-08 05:43:35,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:35,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 185 [2025-02-08 05:43:35,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:36,143 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([423] L1048-12-->L1048-10: Formula: (and (not (= v_~threads_mask~0_27 0)) (not (= |v_threadThread1of1ForFork0_#t~bitwise5_7| v_~threads_mask~0_27))) InVars {threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_7|, ~threads_mask~0=v_~threads_mask~0_27} OutVars{threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_7|, ~threads_mask~0=v_~threads_mask~0_27} AuxVars[] AssignedVars[][171], [Black: 253#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 255#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 254#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 240#true, Black: 256#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 262#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 265#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), 273#true, Black: 266#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 202#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 264#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), 211#(not (= ~threads_mask~0 0)), Black: 275#(= |threadThread1of1ForFork0_#t~nondet7| |#race~threads_mask~0|), 185#(= |#race~datas~0| 0), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), 49#L1059-5true, 296#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0))), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), 223#(not (= ~threads_mask~0 0)), 204#(not (= ~threads_mask~0 0)), Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, 217#(not (= ~threads_mask~0 0)), Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 227#true, Black: 178#true, 85#L1048-10true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true, Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))))]) [2025-02-08 05:43:36,144 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2025-02-08 05:43:36,144 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2025-02-08 05:43:36,144 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2025-02-08 05:43:36,144 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2025-02-08 05:43:36,152 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][188], [Black: 253#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 255#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 254#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 240#true, Black: 256#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 262#true, 251#true, 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 265#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), 273#true, Black: 266#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 264#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 204#(not (= ~threads_mask~0 0)), Black: 275#(= |threadThread1of1ForFork0_#t~nondet7| |#race~threads_mask~0|), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), 49#L1059-5true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), 296#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0))), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 227#true, Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true, Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))))]) [2025-02-08 05:43:36,152 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-02-08 05:43:36,152 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-08 05:43:36,152 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-02-08 05:43:36,152 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-02-08 05:43:36,173 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([274] L1059-6-->L1059-5: Formula: (= v_~threads_mask~0_1 |v_ULTIMATE.start_main_#t~bitwise18#1_3|) InVars {ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_3|} OutVars{~threads_mask~0=v_~threads_mask~0_1, ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_3|} AuxVars[] AssignedVars[~threads_mask~0][336], [Black: 253#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 255#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 254#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 240#true, Black: 256#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 262#true, 251#true, 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 265#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), 273#true, Black: 266#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 264#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 204#(not (= ~threads_mask~0 0)), Black: 275#(= |threadThread1of1ForFork0_#t~nondet7| |#race~threads_mask~0|), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), 49#L1059-5true, Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), 296#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0))), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 227#true, Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true, Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))))]) [2025-02-08 05:43:36,174 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-02-08 05:43:36,174 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-02-08 05:43:36,174 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-08 05:43:36,174 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-08 05:43:36,189 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([427] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][188], [Black: 253#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 255#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 254#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 240#true, Black: 256#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 262#true, 251#true, 157#L1048-5true, Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 265#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), 273#true, Black: 266#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 264#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 204#(not (= ~threads_mask~0 0)), Black: 275#(= |threadThread1of1ForFork0_#t~nondet7| |#race~threads_mask~0|), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), 49#L1059-5true, 296#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0))), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 227#true, Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true, Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))))]) [2025-02-08 05:43:36,189 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is not cut-off event [2025-02-08 05:43:36,189 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2025-02-08 05:43:36,189 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2025-02-08 05:43:36,189 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2025-02-08 05:43:36,190 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2025-02-08 05:43:36,331 INFO L124 PetriNetUnfolderBase]: 786/3113 cut-off events. [2025-02-08 05:43:36,331 INFO L125 PetriNetUnfolderBase]: For 4715/4848 co-relation queries the response was YES. [2025-02-08 05:43:36,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7936 conditions, 3113 events. 786/3113 cut-off events. For 4715/4848 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 26077 event pairs, 87 based on Foata normal form. 58/2930 useless extension candidates. Maximal degree in co-relation 7669. Up to 462 conditions per place. [2025-02-08 05:43:36,351 INFO L140 encePairwiseOnDemand]: 170/185 looper letters, 160 selfloop transitions, 67 changer transitions 4/423 dead transitions. [2025-02-08 05:43:36,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 423 transitions, 2836 flow [2025-02-08 05:43:36,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 05:43:36,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-02-08 05:43:36,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2736 transitions. [2025-02-08 05:43:36,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8216216216216217 [2025-02-08 05:43:36,358 INFO L175 Difference]: Start difference. First operand has 230 places, 317 transitions, 1790 flow. Second operand 18 states and 2736 transitions. [2025-02-08 05:43:36,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 423 transitions, 2836 flow [2025-02-08 05:43:36,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 423 transitions, 2814 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:43:36,383 INFO L231 Difference]: Finished difference. Result has 245 places, 335 transitions, 2027 flow [2025-02-08 05:43:36,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=1764, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2027, PETRI_PLACES=245, PETRI_TRANSITIONS=335} [2025-02-08 05:43:36,384 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 73 predicate places. [2025-02-08 05:43:36,384 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 335 transitions, 2027 flow [2025-02-08 05:43:36,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 147.27272727272728) internal successors, (1620), 11 states have internal predecessors, (1620), 0 states have call successors, (0), 0 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-08 05:43:36,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:36,385 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:36,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:43:36,385 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:36,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:36,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1649828179, now seen corresponding path program 1 times [2025-02-08 05:43:36,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:36,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368553394] [2025-02-08 05:43:36,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:36,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:36,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 05:43:36,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 05:43:36,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:36,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:36,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:36,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:36,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368553394] [2025-02-08 05:43:36,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368553394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:36,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:36,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 05:43:36,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378680234] [2025-02-08 05:43:36,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:36,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 05:43:36,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:36,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 05:43:36,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-02-08 05:43:37,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 185 [2025-02-08 05:43:37,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 335 transitions, 2027 flow. Second operand has 12 states, 12 states have (on average 144.25) internal successors, (1731), 12 states have internal predecessors, (1731), 0 states have call successors, (0), 0 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-08 05:43:37,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:37,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 185 [2025-02-08 05:43:37,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:37,598 INFO L124 PetriNetUnfolderBase]: 725/2980 cut-off events. [2025-02-08 05:43:37,598 INFO L125 PetriNetUnfolderBase]: For 4868/4971 co-relation queries the response was YES. [2025-02-08 05:43:37,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7889 conditions, 2980 events. 725/2980 cut-off events. For 4868/4971 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 24700 event pairs, 112 based on Foata normal form. 28/2789 useless extension candidates. Maximal degree in co-relation 7610. Up to 619 conditions per place. [2025-02-08 05:43:37,614 INFO L140 encePairwiseOnDemand]: 172/185 looper letters, 75 selfloop transitions, 6 changer transitions 112/369 dead transitions. [2025-02-08 05:43:37,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 369 transitions, 2661 flow [2025-02-08 05:43:37,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 05:43:37,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 05:43:37,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1921 transitions. [2025-02-08 05:43:37,618 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7987525987525987 [2025-02-08 05:43:37,618 INFO L175 Difference]: Start difference. First operand has 245 places, 335 transitions, 2027 flow. Second operand 13 states and 1921 transitions. [2025-02-08 05:43:37,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 369 transitions, 2661 flow [2025-02-08 05:43:37,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 369 transitions, 2505 flow, removed 16 selfloop flow, removed 8 redundant places. [2025-02-08 05:43:37,640 INFO L231 Difference]: Finished difference. Result has 248 places, 257 transitions, 1432 flow [2025-02-08 05:43:37,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=1905, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1432, PETRI_PLACES=248, PETRI_TRANSITIONS=257} [2025-02-08 05:43:37,641 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 76 predicate places. [2025-02-08 05:43:37,641 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 257 transitions, 1432 flow [2025-02-08 05:43:37,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 144.25) internal successors, (1731), 12 states have internal predecessors, (1731), 0 states have call successors, (0), 0 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-08 05:43:37,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:37,642 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:43:37,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:43:37,642 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:37,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:37,643 INFO L85 PathProgramCache]: Analyzing trace with hash -866026526, now seen corresponding path program 1 times [2025-02-08 05:43:37,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:37,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874766700] [2025-02-08 05:43:37,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:37,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:37,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-08 05:43:37,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-08 05:43:37,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:37,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:37,795 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-08 05:43:37,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:37,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874766700] [2025-02-08 05:43:37,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874766700] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:37,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:37,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:43:37,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174976174] [2025-02-08 05:43:37,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:37,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:43:37,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:37,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:43:37,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:43:37,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 185 [2025-02-08 05:43:37,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 257 transitions, 1432 flow. Second operand has 7 states, 7 states have (on average 157.85714285714286) internal successors, (1105), 7 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:37,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:37,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 185 [2025-02-08 05:43:37,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:38,433 INFO L124 PetriNetUnfolderBase]: 1414/4633 cut-off events. [2025-02-08 05:43:38,433 INFO L125 PetriNetUnfolderBase]: For 8469/8591 co-relation queries the response was YES. [2025-02-08 05:43:38,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11972 conditions, 4633 events. 1414/4633 cut-off events. For 8469/8591 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 38532 event pairs, 268 based on Foata normal form. 93/4391 useless extension candidates. Maximal degree in co-relation 11934. Up to 1273 conditions per place. [2025-02-08 05:43:38,557 INFO L140 encePairwiseOnDemand]: 172/185 looper letters, 101 selfloop transitions, 51 changer transitions 0/357 dead transitions. [2025-02-08 05:43:38,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 357 transitions, 2339 flow [2025-02-08 05:43:38,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 05:43:38,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-08 05:43:38,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2301 transitions. [2025-02-08 05:43:38,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8884169884169885 [2025-02-08 05:43:38,561 INFO L175 Difference]: Start difference. First operand has 248 places, 257 transitions, 1432 flow. Second operand 14 states and 2301 transitions. [2025-02-08 05:43:38,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 357 transitions, 2339 flow [2025-02-08 05:43:38,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 357 transitions, 2292 flow, removed 8 selfloop flow, removed 13 redundant places. [2025-02-08 05:43:38,579 INFO L231 Difference]: Finished difference. Result has 225 places, 305 transitions, 2036 flow [2025-02-08 05:43:38,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=1385, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2036, PETRI_PLACES=225, PETRI_TRANSITIONS=305} [2025-02-08 05:43:38,580 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 53 predicate places. [2025-02-08 05:43:38,580 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 305 transitions, 2036 flow [2025-02-08 05:43:38,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 157.85714285714286) internal successors, (1105), 7 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:38,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:38,581 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:43:38,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:43:38,581 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:38,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:38,582 INFO L85 PathProgramCache]: Analyzing trace with hash 732484054, now seen corresponding path program 1 times [2025-02-08 05:43:38,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:38,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85613407] [2025-02-08 05:43:38,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:38,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:38,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-08 05:43:38,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-08 05:43:38,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:38,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:38,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:43:38,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:38,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85613407] [2025-02-08 05:43:38,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85613407] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:38,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:38,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:43:38,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788446006] [2025-02-08 05:43:38,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:38,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:43:38,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:38,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:43:38,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:43:38,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 185 [2025-02-08 05:43:38,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 305 transitions, 2036 flow. Second operand has 7 states, 7 states have (on average 158.85714285714286) internal successors, (1112), 7 states have internal predecessors, (1112), 0 states have call successors, (0), 0 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-08 05:43:38,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:38,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 185 [2025-02-08 05:43:38,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:39,430 INFO L124 PetriNetUnfolderBase]: 1310/4434 cut-off events. [2025-02-08 05:43:39,430 INFO L125 PetriNetUnfolderBase]: For 11829/11979 co-relation queries the response was YES. [2025-02-08 05:43:39,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12975 conditions, 4434 events. 1310/4434 cut-off events. For 11829/11979 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 36890 event pairs, 242 based on Foata normal form. 63/4174 useless extension candidates. Maximal degree in co-relation 12931. Up to 1173 conditions per place. [2025-02-08 05:43:39,458 INFO L140 encePairwiseOnDemand]: 174/185 looper letters, 93 selfloop transitions, 63 changer transitions 0/362 dead transitions. [2025-02-08 05:43:39,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 362 transitions, 2718 flow [2025-02-08 05:43:39,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 05:43:39,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-08 05:43:39,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2303 transitions. [2025-02-08 05:43:39,460 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8891891891891892 [2025-02-08 05:43:39,460 INFO L175 Difference]: Start difference. First operand has 225 places, 305 transitions, 2036 flow. Second operand 14 states and 2303 transitions. [2025-02-08 05:43:39,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 362 transitions, 2718 flow [2025-02-08 05:43:39,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 362 transitions, 2647 flow, removed 34 selfloop flow, removed 1 redundant places. [2025-02-08 05:43:39,489 INFO L231 Difference]: Finished difference. Result has 241 places, 321 transitions, 2291 flow [2025-02-08 05:43:39,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=1979, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2291, PETRI_PLACES=241, PETRI_TRANSITIONS=321} [2025-02-08 05:43:39,490 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 69 predicate places. [2025-02-08 05:43:39,490 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 321 transitions, 2291 flow [2025-02-08 05:43:39,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 158.85714285714286) internal successors, (1112), 7 states have internal predecessors, (1112), 0 states have call successors, (0), 0 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-08 05:43:39,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:39,490 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:43:39,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:43:39,490 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:39,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:39,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1083950865, now seen corresponding path program 1 times [2025-02-08 05:43:39,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:39,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793252300] [2025-02-08 05:43:39,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:39,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:39,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-08 05:43:39,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-08 05:43:39,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:39,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:39,626 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-08 05:43:39,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:39,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793252300] [2025-02-08 05:43:39,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793252300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:39,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:39,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:43:39,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832259179] [2025-02-08 05:43:39,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:39,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:43:39,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:39,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:43:39,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:43:39,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 185 [2025-02-08 05:43:39,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 321 transitions, 2291 flow. Second operand has 7 states, 7 states have (on average 157.85714285714286) internal successors, (1105), 7 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:39,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:39,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 185 [2025-02-08 05:43:39,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:40,599 INFO L124 PetriNetUnfolderBase]: 1571/5457 cut-off events. [2025-02-08 05:43:40,599 INFO L125 PetriNetUnfolderBase]: For 18405/18620 co-relation queries the response was YES. [2025-02-08 05:43:40,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16698 conditions, 5457 events. 1571/5457 cut-off events. For 18405/18620 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 48796 event pairs, 262 based on Foata normal form. 102/5178 useless extension candidates. Maximal degree in co-relation 16649. Up to 1384 conditions per place. [2025-02-08 05:43:40,648 INFO L140 encePairwiseOnDemand]: 172/185 looper letters, 152 selfloop transitions, 50 changer transitions 0/407 dead transitions. [2025-02-08 05:43:40,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 407 transitions, 3381 flow [2025-02-08 05:43:40,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 05:43:40,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-08 05:43:40,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2305 transitions. [2025-02-08 05:43:40,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.88996138996139 [2025-02-08 05:43:40,651 INFO L175 Difference]: Start difference. First operand has 241 places, 321 transitions, 2291 flow. Second operand 14 states and 2305 transitions. [2025-02-08 05:43:40,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 407 transitions, 3381 flow [2025-02-08 05:43:40,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 407 transitions, 3311 flow, removed 21 selfloop flow, removed 5 redundant places. [2025-02-08 05:43:40,710 INFO L231 Difference]: Finished difference. Result has 259 places, 356 transitions, 2774 flow [2025-02-08 05:43:40,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=2127, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2774, PETRI_PLACES=259, PETRI_TRANSITIONS=356} [2025-02-08 05:43:40,710 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 87 predicate places. [2025-02-08 05:43:40,710 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 356 transitions, 2774 flow [2025-02-08 05:43:40,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 157.85714285714286) internal successors, (1105), 7 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:43:40,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:40,711 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:43:40,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:43:40,711 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:40,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:40,712 INFO L85 PathProgramCache]: Analyzing trace with hash -580702415, now seen corresponding path program 1 times [2025-02-08 05:43:40,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:40,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581040801] [2025-02-08 05:43:40,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:40,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:40,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-08 05:43:40,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-08 05:43:40,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:40,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:40,840 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-08 05:43:40,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:40,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581040801] [2025-02-08 05:43:40,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581040801] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:40,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:40,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:43:40,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72319611] [2025-02-08 05:43:40,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:40,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:43:40,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:40,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:43:40,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:43:40,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 185 [2025-02-08 05:43:40,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 356 transitions, 2774 flow. Second operand has 7 states, 7 states have (on average 158.85714285714286) internal successors, (1112), 7 states have internal predecessors, (1112), 0 states have call successors, (0), 0 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-08 05:43:40,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:40,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 185 [2025-02-08 05:43:40,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:41,716 INFO L124 PetriNetUnfolderBase]: 1444/5216 cut-off events. [2025-02-08 05:43:41,716 INFO L125 PetriNetUnfolderBase]: For 22849/23096 co-relation queries the response was YES. [2025-02-08 05:43:41,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16855 conditions, 5216 events. 1444/5216 cut-off events. For 22849/23096 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 46897 event pairs, 230 based on Foata normal form. 62/4917 useless extension candidates. Maximal degree in co-relation 16796. Up to 1264 conditions per place. [2025-02-08 05:43:41,757 INFO L140 encePairwiseOnDemand]: 174/185 looper letters, 144 selfloop transitions, 62 changer transitions 0/412 dead transitions. [2025-02-08 05:43:41,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 412 transitions, 3679 flow [2025-02-08 05:43:41,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 05:43:41,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-08 05:43:41,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2307 transitions. [2025-02-08 05:43:41,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8907335907335907 [2025-02-08 05:43:41,762 INFO L175 Difference]: Start difference. First operand has 259 places, 356 transitions, 2774 flow. Second operand 14 states and 2307 transitions. [2025-02-08 05:43:41,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 412 transitions, 3679 flow [2025-02-08 05:43:41,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 412 transitions, 3587 flow, removed 46 selfloop flow, removed 0 redundant places. [2025-02-08 05:43:41,829 INFO L231 Difference]: Finished difference. Result has 276 places, 372 transitions, 3038 flow [2025-02-08 05:43:41,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=2696, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3038, PETRI_PLACES=276, PETRI_TRANSITIONS=372} [2025-02-08 05:43:41,830 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 104 predicate places. [2025-02-08 05:43:41,830 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 372 transitions, 3038 flow [2025-02-08 05:43:41,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 158.85714285714286) internal successors, (1112), 7 states have internal predecessors, (1112), 0 states have call successors, (0), 0 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-08 05:43:41,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:41,831 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:43:41,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:43:41,831 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:41,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:41,832 INFO L85 PathProgramCache]: Analyzing trace with hash -2051630742, now seen corresponding path program 1 times [2025-02-08 05:43:41,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:41,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179611239] [2025-02-08 05:43:41,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:41,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:41,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 05:43:41,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 05:43:41,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:41,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:41,900 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-08 05:43:41,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:41,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179611239] [2025-02-08 05:43:41,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179611239] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:41,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:41,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:43:41,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139200987] [2025-02-08 05:43:41,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:41,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:43:41,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:41,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:43:41,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:43:41,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 185 [2025-02-08 05:43:41,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 372 transitions, 3038 flow. Second operand has 5 states, 5 states have (on average 163.6) internal successors, (818), 5 states have internal predecessors, (818), 0 states have call successors, (0), 0 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-08 05:43:41,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:41,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 185 [2025-02-08 05:43:41,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:42,760 INFO L124 PetriNetUnfolderBase]: 1588/6828 cut-off events. [2025-02-08 05:43:42,760 INFO L125 PetriNetUnfolderBase]: For 25658/26021 co-relation queries the response was YES. [2025-02-08 05:43:42,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21200 conditions, 6828 events. 1588/6828 cut-off events. For 25658/26021 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 70786 event pairs, 103 based on Foata normal form. 49/6501 useless extension candidates. Maximal degree in co-relation 21136. Up to 455 conditions per place. [2025-02-08 05:43:42,825 INFO L140 encePairwiseOnDemand]: 177/185 looper letters, 64 selfloop transitions, 7 changer transitions 0/400 dead transitions. [2025-02-08 05:43:42,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 400 transitions, 3301 flow [2025-02-08 05:43:42,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:43:42,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:43:42,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1007 transitions. [2025-02-08 05:43:42,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9072072072072072 [2025-02-08 05:43:42,826 INFO L175 Difference]: Start difference. First operand has 276 places, 372 transitions, 3038 flow. Second operand 6 states and 1007 transitions. [2025-02-08 05:43:42,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 400 transitions, 3301 flow [2025-02-08 05:43:42,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 400 transitions, 3229 flow, removed 24 selfloop flow, removed 4 redundant places. [2025-02-08 05:43:42,927 INFO L231 Difference]: Finished difference. Result has 280 places, 377 transitions, 3021 flow [2025-02-08 05:43:42,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=2976, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3021, PETRI_PLACES=280, PETRI_TRANSITIONS=377} [2025-02-08 05:43:42,928 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 108 predicate places. [2025-02-08 05:43:42,928 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 377 transitions, 3021 flow [2025-02-08 05:43:42,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 163.6) internal successors, (818), 5 states have internal predecessors, (818), 0 states have call successors, (0), 0 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-08 05:43:42,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:42,929 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:43:42,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:43:42,929 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:42,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:42,930 INFO L85 PathProgramCache]: Analyzing trace with hash 189261679, now seen corresponding path program 1 times [2025-02-08 05:43:42,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:42,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60705624] [2025-02-08 05:43:42,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:42,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:42,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 05:43:42,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 05:43:42,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:42,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:43:42,950 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:43:42,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 05:43:42,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 05:43:42,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:42,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:43:43,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:43:43,008 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:43:43,010 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (15 of 16 remaining) [2025-02-08 05:43:43,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-02-08 05:43:43,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-02-08 05:43:43,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-02-08 05:43:43,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-02-08 05:43:43,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-02-08 05:43:43,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-02-08 05:43:43,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 16 remaining) [2025-02-08 05:43:43,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-02-08 05:43:43,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-02-08 05:43:43,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-02-08 05:43:43,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-02-08 05:43:43,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-02-08 05:43:43,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-02-08 05:43:43,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-02-08 05:43:43,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-02-08 05:43:43,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:43:43,013 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:43,072 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:43:43,072 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:43:43,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:43:43 BasicIcfg [2025-02-08 05:43:43,078 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:43:43,078 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:43:43,078 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:43:43,079 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:43:43,079 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:43:28" (3/4) ... [2025-02-08 05:43:43,080 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 05:43:43,081 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:43:43,082 INFO L158 Benchmark]: Toolchain (without parser) took 15617.59ms. Allocated memory was 142.6MB in the beginning and 906.0MB in the end (delta: 763.4MB). Free memory was 110.6MB in the beginning and 461.3MB in the end (delta: -350.7MB). Peak memory consumption was 418.1MB. Max. memory is 16.1GB. [2025-02-08 05:43:43,082 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:43:43,083 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.14ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 82.1MB in the end (delta: 28.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 05:43:43,083 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.71ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 79.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:43:43,084 INFO L158 Benchmark]: Boogie Preprocessor took 15.69ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 78.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:43:43,084 INFO L158 Benchmark]: IcfgBuilder took 395.56ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 53.3MB in the end (delta: 25.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:43:43,084 INFO L158 Benchmark]: TraceAbstraction took 14762.81ms. Allocated memory was 142.6MB in the beginning and 906.0MB in the end (delta: 763.4MB). Free memory was 52.9MB in the beginning and 461.4MB in the end (delta: -408.5MB). Peak memory consumption was 359.3MB. Max. memory is 16.1GB. [2025-02-08 05:43:43,084 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 906.0MB. Free memory was 461.4MB in the beginning and 461.3MB in the end (delta: 115.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:43:43,085 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.14ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 82.1MB in the end (delta: 28.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.71ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 79.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 15.69ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 78.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 395.56ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 53.3MB in the end (delta: 25.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14762.81ms. Allocated memory was 142.6MB in the beginning and 906.0MB in the end (delta: 763.4MB). Free memory was 52.9MB in the beginning and 461.4MB in the end (delta: -408.5MB). Peak memory consumption was 359.3MB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 906.0MB. Free memory was 461.4MB in the beginning and 461.3MB in the end (delta: 115.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1058]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: overapproximation of shiftRight at line 1058, overapproximation of bitwiseOr at line 1048, overapproximation of bitwiseAnd at line 1058, overapproximation of bitwiseAnd at line 1059. Possible FailurePath: [L1043] 0 int threads_mask = -1; VAL [threads_mask=-1] [L1044] 0 int *datas; VAL [datas={0:0}, threads_mask=-1] [L1052] 0 int threads_total = __VERIFIER_nondet_int(); VAL [datas={0:0}, threads_mask=-1, threads_total=31] [L1053] CALL 0 assume_abort_if_not(threads_total >= 0) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1] [L1053] RET 0 assume_abort_if_not(threads_total >= 0) [L1054] CALL 0 assume_abort_if_not(threads_total < 32) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1] [L1054] RET 0 assume_abort_if_not(threads_total < 32) [L1055] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [datas={0:0}, threads_mask=-1, threads_total=31, tids={-3:0}] [L1056] 0 datas = malloc(threads_total * sizeof(int)) VAL [datas={-4:0}, threads_mask=-1, threads_total=31, tids={-3:0}] [L1057] 0 int i = 0; VAL [datas={-4:0}, i=0, threads_mask=-1, threads_total=31, tids={-3:0}] [L1057] COND TRUE 0 i < threads_total VAL [datas={-4:0}, threads_mask=-1] [L1058] EXPR 0 ffs(threads_mask) VAL [datas={-4:0}, i=0, threads_mask=-1, threads_total=31, tids={-3:0}] [L1058] 0 int j = ffs(threads_mask) - 1; VAL [datas={-4:0}, i=0, j=0, threads_mask=-1, threads_total=31, tids={-3:0}] [L1059] 0 threads_mask &= ~(1 << j) VAL [datas={-4:0}, i=0, j=0, threads_mask=-1, threads_total=31, tids={-3:0}] [L1059] EXPR 0 1 << j VAL [datas={-4:0}, i=0, j=0, threads_mask=-1, threads_total=31, tids={-3:0}] [L1059] 0 threads_mask &= ~(1 << j) VAL [datas={-4:0}, i=0, j=0, threads_mask=-2, threads_total=31, tids={-3:0}] [L1060] 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j) VAL [datas={-4:0}, i=0, j=0, threads_mask=-2, threads_total=31, tids={-3:0}] [L1060] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j) VAL [\old(arg)={0:0}, datas={-4:0}, i=0, j=0, threads_mask=-2, threads_total=31, tids={-3:0}] [L1057] 0 i++ VAL [\old(arg)={0:0}, datas={-4:0}, i=1, threads_mask=-2, threads_total=31, tids={-3:0}] [L1057] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, datas={-4:0}, threads_mask=-2] [L1046] 1 int j = (int)arg; VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-2] [L1047] EXPR 1 datas[j] VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-2] [L1047] 1 datas[j] = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-2] [L1048] 1 threads_mask |= 1 << j VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-2] [L1048] EXPR 1 1 << j VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-2] [L1048] 1 threads_mask |= 1 << j VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-1] [L1058] 0 ffs(threads_mask) VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, i=1, j=0, threads_mask=-1, threads_total=31, tids={-3:0}] - UnprovableResult [Line: 1056]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 209 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.6s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2331 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1657 mSDsluCounter, 1067 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 873 mSDsCounter, 191 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5086 IncrementalHoareTripleChecker+Invalid, 5277 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 191 mSolverCounterUnsat, 194 mSDtfsCounter, 5086 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3038occurred in iteration=21, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1854 NumberOfCodeBlocks, 1854 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1718 ConstructedInterpolants, 0 QuantifiedInterpolants, 5348 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 15/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-08 05:43:43,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-race-challenges/per-thread-index-bitmask-race.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Bitvector.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 9dc253a71095a3ed3b49fc56a3d17da307efb7fa91be8525b1f50977899b5b3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:43:45,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:43:45,429 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Bitvector.epf [2025-02-08 05:43:45,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:43:45,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:43:45,459 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:43:45,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:43:45,460 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:43:45,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:43:45,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:43:45,462 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:43:45,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:43:45,462 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:43:45,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:43:45,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:43:45,462 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:43:45,462 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:43:45,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:43:45,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:43:45,462 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:43:45,462 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:43:45,462 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:43:45,462 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 05:43:45,462 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 05:43:45,462 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:43:45,462 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:43:45,462 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:43:45,462 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:43:45,462 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:43:45,462 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:43:45,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:43:45,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:43:45,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:43:45,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:43:45,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:43:45,463 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:43:45,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:43:45,463 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 05:43:45,463 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 05:43:45,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:43:45,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:43:45,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:43:45,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:43:45,463 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 -> 9dc253a71095a3ed3b49fc56a3d17da307efb7fa91be8525b1f50977899b5b3d [2025-02-08 05:43:45,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:43:45,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:43:45,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:43:45,719 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:43:45,719 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:43:45,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i [2025-02-08 05:43:46,968 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21c6573bb/bd7a26fcf70244f9b68391cc5954cbad/FLAG61e75f798 [2025-02-08 05:43:47,243 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:43:47,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i [2025-02-08 05:43:47,260 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21c6573bb/bd7a26fcf70244f9b68391cc5954cbad/FLAG61e75f798 [2025-02-08 05:43:47,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21c6573bb/bd7a26fcf70244f9b68391cc5954cbad [2025-02-08 05:43:47,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:43:47,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:43:47,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:43:47,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:43:47,555 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:43:47,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:43:47" (1/1) ... [2025-02-08 05:43:47,556 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46460977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:47, skipping insertion in model container [2025-02-08 05:43:47,557 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:43:47" (1/1) ... [2025-02-08 05:43:47,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:43:47,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:43:47,905 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:43:47,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:43:48,016 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:43:48,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:48 WrapperNode [2025-02-08 05:43:48,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:43:48,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:43:48,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:43:48,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:43:48,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:48" (1/1) ... [2025-02-08 05:43:48,041 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:48" (1/1) ... [2025-02-08 05:43:48,061 INFO L138 Inliner]: procedures = 274, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 84 [2025-02-08 05:43:48,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:43:48,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:43:48,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:43:48,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:43:48,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:48" (1/1) ... [2025-02-08 05:43:48,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:48" (1/1) ... [2025-02-08 05:43:48,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:48" (1/1) ... [2025-02-08 05:43:48,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:48" (1/1) ... [2025-02-08 05:43:48,083 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:48" (1/1) ... [2025-02-08 05:43:48,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:48" (1/1) ... [2025-02-08 05:43:48,097 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:48" (1/1) ... [2025-02-08 05:43:48,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:48" (1/1) ... [2025-02-08 05:43:48,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:43:48,107 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:43:48,107 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:43:48,107 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:43:48,108 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:48" (1/1) ... [2025-02-08 05:43:48,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:43:48,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:43:48,152 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-08 05:43:48,157 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-08 05:43:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-02-08 05:43:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:43:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-02-08 05:43:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:43:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-02-08 05:43:48,178 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-02-08 05:43:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:43:48,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:43:48,179 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:43:48,295 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:43:48,297 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:43:48,619 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:43:48,623 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:43:48,664 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:43:48,664 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:43:48,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:43:48 BoogieIcfgContainer [2025-02-08 05:43:48,664 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:43:48,666 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:43:48,666 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:43:48,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:43:48,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:43:47" (1/3) ... [2025-02-08 05:43:48,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f28995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:43:48, skipping insertion in model container [2025-02-08 05:43:48,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:48" (2/3) ... [2025-02-08 05:43:48,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f28995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:43:48, skipping insertion in model container [2025-02-08 05:43:48,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:43:48" (3/3) ... [2025-02-08 05:43:48,679 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i [2025-02-08 05:43:48,702 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:43:48,707 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-index-bitmask-race.i that has 2 procedures, 128 locations, 1 initial locations, 2 loop locations, and 11 error locations. [2025-02-08 05:43:48,707 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:43:48,807 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 05:43:48,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 132 transitions, 271 flow [2025-02-08 05:43:48,919 INFO L124 PetriNetUnfolderBase]: 5/185 cut-off events. [2025-02-08 05:43:48,921 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:43:48,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 185 events. 5/185 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 345 event pairs, 0 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 91. Up to 4 conditions per place. [2025-02-08 05:43:48,924 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 132 transitions, 271 flow [2025-02-08 05:43:48,927 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 132 transitions, 271 flow [2025-02-08 05:43:48,932 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:43:48,939 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;@998ef4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:43:48,939 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-08 05:43:48,945 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:43:48,945 INFO L124 PetriNetUnfolderBase]: 2/34 cut-off events. [2025-02-08 05:43:48,945 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:43:48,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:48,945 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] [2025-02-08 05:43:48,946 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:48,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:48,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1775043305, now seen corresponding path program 1 times [2025-02-08 05:43:48,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 05:43:48,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1400918671] [2025-02-08 05:43:48,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:48,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:43:48,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:43:48,966 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-08 05:43:48,967 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-08 05:43:49,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:43:49,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:43:49,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:49,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:49,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 05:43:49,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:43:49,064 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-08 05:43:49,065 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:43:49,065 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 05:43:49,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400918671] [2025-02-08 05:43:49,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400918671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:49,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:49,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:49,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117112513] [2025-02-08 05:43:49,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:49,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:49,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 05:43:49,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:49,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:49,115 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 132 [2025-02-08 05:43:49,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 132 transitions, 271 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 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-08 05:43:49,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:49,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 132 [2025-02-08 05:43:49,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:49,159 INFO L124 PetriNetUnfolderBase]: 5/234 cut-off events. [2025-02-08 05:43:49,159 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:43:49,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 234 events. 5/234 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 543 event pairs, 2 based on Foata normal form. 2/202 useless extension candidates. Maximal degree in co-relation 146. Up to 15 conditions per place. [2025-02-08 05:43:49,161 INFO L140 encePairwiseOnDemand]: 127/132 looper letters, 8 selfloop transitions, 2 changer transitions 2/129 dead transitions. [2025-02-08 05:43:49,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 129 transitions, 285 flow [2025-02-08 05:43:49,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:49,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:49,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2025-02-08 05:43:49,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9343434343434344 [2025-02-08 05:43:49,174 INFO L175 Difference]: Start difference. First operand has 131 places, 132 transitions, 271 flow. Second operand 3 states and 370 transitions. [2025-02-08 05:43:49,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 129 transitions, 285 flow [2025-02-08 05:43:49,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 129 transitions, 285 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:43:49,183 INFO L231 Difference]: Finished difference. Result has 132 places, 127 transitions, 265 flow [2025-02-08 05:43:49,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=265, PETRI_PLACES=132, PETRI_TRANSITIONS=127} [2025-02-08 05:43:49,189 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 1 predicate places. [2025-02-08 05:43:49,189 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 265 flow [2025-02-08 05:43:49,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 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-08 05:43:49,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:49,190 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] [2025-02-08 05:43:49,200 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-08 05:43:49,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:43:49,392 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:49,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:49,394 INFO L85 PathProgramCache]: Analyzing trace with hash 292407050, now seen corresponding path program 1 times [2025-02-08 05:43:49,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 05:43:49,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1989716899] [2025-02-08 05:43:49,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:49,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:43:49,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:43:49,399 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-08 05:43:49,402 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-08 05:43:49,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:43:49,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:43:49,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:49,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:49,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 05:43:49,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:43:49,493 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-08 05:43:49,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:43:49,493 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 05:43:49,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989716899] [2025-02-08 05:43:49,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989716899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:49,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:49,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:49,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890090161] [2025-02-08 05:43:49,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:49,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:49,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 05:43:49,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:49,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:49,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 132 [2025-02-08 05:43:49,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 265 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 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-08 05:43:49,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:49,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 132 [2025-02-08 05:43:49,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:49,558 INFO L124 PetriNetUnfolderBase]: 20/306 cut-off events. [2025-02-08 05:43:49,558 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:43:49,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 306 events. 20/306 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1057 event pairs, 7 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 331. Up to 36 conditions per place. [2025-02-08 05:43:49,560 INFO L140 encePairwiseOnDemand]: 121/132 looper letters, 13 selfloop transitions, 8 changer transitions 0/135 dead transitions. [2025-02-08 05:43:49,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 135 transitions, 323 flow [2025-02-08 05:43:49,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:49,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:49,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2025-02-08 05:43:49,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.946969696969697 [2025-02-08 05:43:49,562 INFO L175 Difference]: Start difference. First operand has 132 places, 127 transitions, 265 flow. Second operand 3 states and 375 transitions. [2025-02-08 05:43:49,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 135 transitions, 323 flow [2025-02-08 05:43:49,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 135 transitions, 319 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:43:49,565 INFO L231 Difference]: Finished difference. Result has 132 places, 135 transitions, 331 flow [2025-02-08 05:43:49,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=331, PETRI_PLACES=132, PETRI_TRANSITIONS=135} [2025-02-08 05:43:49,565 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 1 predicate places. [2025-02-08 05:43:49,565 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 135 transitions, 331 flow [2025-02-08 05:43:49,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 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-08 05:43:49,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:49,566 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] [2025-02-08 05:43:49,572 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-08 05:43:49,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:43:49,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:49,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:49,773 INFO L85 PathProgramCache]: Analyzing trace with hash -130779626, now seen corresponding path program 1 times [2025-02-08 05:43:49,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 05:43:49,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [25116263] [2025-02-08 05:43:49,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:49,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:43:49,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:43:49,779 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-08 05:43:49,780 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-08 05:43:49,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 05:43:49,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 05:43:49,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:49,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:49,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 05:43:49,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:43:49,845 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-08 05:43:49,845 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:43:49,845 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 05:43:49,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25116263] [2025-02-08 05:43:49,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25116263] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:49,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:49,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:49,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609033254] [2025-02-08 05:43:49,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:49,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:49,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 05:43:49,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:49,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:49,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 132 [2025-02-08 05:43:49,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 135 transitions, 331 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 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-08 05:43:49,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:49,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 132 [2025-02-08 05:43:49,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:49,895 INFO L124 PetriNetUnfolderBase]: 24/365 cut-off events. [2025-02-08 05:43:49,895 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:43:49,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 365 events. 24/365 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1412 event pairs, 9 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 347. Up to 40 conditions per place. [2025-02-08 05:43:49,897 INFO L140 encePairwiseOnDemand]: 128/132 looper letters, 7 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2025-02-08 05:43:49,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 135 transitions, 349 flow [2025-02-08 05:43:49,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:49,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:49,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2025-02-08 05:43:49,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2025-02-08 05:43:49,902 INFO L175 Difference]: Start difference. First operand has 132 places, 135 transitions, 331 flow. Second operand 3 states and 374 transitions. [2025-02-08 05:43:49,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 135 transitions, 349 flow [2025-02-08 05:43:49,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 135 transitions, 333 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:43:49,909 INFO L231 Difference]: Finished difference. Result has 131 places, 135 transitions, 325 flow [2025-02-08 05:43:49,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=325, PETRI_PLACES=131, PETRI_TRANSITIONS=135} [2025-02-08 05:43:49,910 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 0 predicate places. [2025-02-08 05:43:49,910 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 135 transitions, 325 flow [2025-02-08 05:43:49,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 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-08 05:43:49,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:49,910 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:49,922 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-08 05:43:50,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:43:50,115 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:50,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:50,116 INFO L85 PathProgramCache]: Analyzing trace with hash -57897533, now seen corresponding path program 1 times [2025-02-08 05:43:50,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 05:43:50,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2145859355] [2025-02-08 05:43:50,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:50,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:43:50,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:43:50,119 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-08 05:43:50,120 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-08 05:43:50,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 05:43:50,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 05:43:50,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:50,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:50,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 05:43:50,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:43:50,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:50,342 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:43:50,342 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 05:43:50,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145859355] [2025-02-08 05:43:50,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145859355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:50,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:50,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:43:50,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58188763] [2025-02-08 05:43:50,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:50,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:43:50,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 05:43:50,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:43:50,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:43:50,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 132 [2025-02-08 05:43:50,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 135 transitions, 325 flow. Second operand has 8 states, 8 states have (on average 107.375) internal successors, (859), 8 states have internal predecessors, (859), 0 states have call successors, (0), 0 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-08 05:43:50,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:50,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 132 [2025-02-08 05:43:50,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:50,686 INFO L124 PetriNetUnfolderBase]: 21/336 cut-off events. [2025-02-08 05:43:50,686 INFO L125 PetriNetUnfolderBase]: For 4/10 co-relation queries the response was YES. [2025-02-08 05:43:50,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 336 events. 21/336 cut-off events. For 4/10 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1211 event pairs, 7 based on Foata normal form. 2/308 useless extension candidates. Maximal degree in co-relation 297. Up to 38 conditions per place. [2025-02-08 05:43:50,688 INFO L140 encePairwiseOnDemand]: 119/132 looper letters, 17 selfloop transitions, 8 changer transitions 5/140 dead transitions. [2025-02-08 05:43:50,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 140 transitions, 395 flow [2025-02-08 05:43:50,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:43:50,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:43:50,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1186 transitions. [2025-02-08 05:43:50,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8168044077134986 [2025-02-08 05:43:50,691 INFO L175 Difference]: Start difference. First operand has 131 places, 135 transitions, 325 flow. Second operand 11 states and 1186 transitions. [2025-02-08 05:43:50,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 140 transitions, 395 flow [2025-02-08 05:43:50,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 140 transitions, 395 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:43:50,693 INFO L231 Difference]: Finished difference. Result has 145 places, 135 transitions, 353 flow [2025-02-08 05:43:50,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=353, PETRI_PLACES=145, PETRI_TRANSITIONS=135} [2025-02-08 05:43:50,694 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 14 predicate places. [2025-02-08 05:43:50,694 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 135 transitions, 353 flow [2025-02-08 05:43:50,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.375) internal successors, (859), 8 states have internal predecessors, (859), 0 states have call successors, (0), 0 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-08 05:43:50,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:50,695 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:50,705 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-08 05:43:50,899 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 [2025-02-08 05:43:50,899 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:50,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:50,901 INFO L85 PathProgramCache]: Analyzing trace with hash -731283921, now seen corresponding path program 1 times [2025-02-08 05:43:50,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 05:43:50,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [114345075] [2025-02-08 05:43:50,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:50,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:43:50,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:43:50,904 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-08 05:43:50,906 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-08 05:43:50,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:43:50,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:43:50,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:50,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:50,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 05:43:50,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:43:50,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:50,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:43:50,974 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 05:43:50,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114345075] [2025-02-08 05:43:50,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114345075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:50,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:50,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:50,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316730318] [2025-02-08 05:43:50,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:50,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:50,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 05:43:50,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:50,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:50,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 132 [2025-02-08 05:43:50,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 135 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 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-08 05:43:50,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:50,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 132 [2025-02-08 05:43:50,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:51,026 INFO L124 PetriNetUnfolderBase]: 34/354 cut-off events. [2025-02-08 05:43:51,026 INFO L125 PetriNetUnfolderBase]: For 43/46 co-relation queries the response was YES. [2025-02-08 05:43:51,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 354 events. 34/354 cut-off events. For 43/46 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1423 event pairs, 11 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 443. Up to 63 conditions per place. [2025-02-08 05:43:51,028 INFO L140 encePairwiseOnDemand]: 126/132 looper letters, 16 selfloop transitions, 7 changer transitions 0/140 dead transitions. [2025-02-08 05:43:51,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 140 transitions, 415 flow [2025-02-08 05:43:51,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:51,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:51,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2025-02-08 05:43:51,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9318181818181818 [2025-02-08 05:43:51,029 INFO L175 Difference]: Start difference. First operand has 145 places, 135 transitions, 353 flow. Second operand 3 states and 369 transitions. [2025-02-08 05:43:51,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 140 transitions, 415 flow [2025-02-08 05:43:51,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 140 transitions, 391 flow, removed 4 selfloop flow, removed 10 redundant places. [2025-02-08 05:43:51,032 INFO L231 Difference]: Finished difference. Result has 136 places, 140 transitions, 385 flow [2025-02-08 05:43:51,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=385, PETRI_PLACES=136, PETRI_TRANSITIONS=140} [2025-02-08 05:43:51,033 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 5 predicate places. [2025-02-08 05:43:51,033 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 140 transitions, 385 flow [2025-02-08 05:43:51,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 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-08 05:43:51,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:51,033 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] [2025-02-08 05:43:51,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 05:43:51,234 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 [2025-02-08 05:43:51,234 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:51,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:51,235 INFO L85 PathProgramCache]: Analyzing trace with hash -754024615, now seen corresponding path program 1 times [2025-02-08 05:43:51,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 05:43:51,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1521700476] [2025-02-08 05:43:51,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:51,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:43:51,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:43:51,239 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-08 05:43:51,240 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-08 05:43:51,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 05:43:51,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 05:43:51,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:51,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:51,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 05:43:51,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:43:51,341 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-08 05:43:51,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:43:51,341 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 05:43:51,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521700476] [2025-02-08 05:43:51,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521700476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:51,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:51,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:43:51,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947699949] [2025-02-08 05:43:51,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:51,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:51,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 05:43:51,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:51,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:51,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 132 [2025-02-08 05:43:51,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 140 transitions, 385 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 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-08 05:43:51,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:51,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 132 [2025-02-08 05:43:51,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:51,384 INFO L124 PetriNetUnfolderBase]: 29/337 cut-off events. [2025-02-08 05:43:51,384 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-08 05:43:51,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 337 events. 29/337 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1271 event pairs, 7 based on Foata normal form. 1/313 useless extension candidates. Maximal degree in co-relation 397. Up to 40 conditions per place. [2025-02-08 05:43:51,385 INFO L140 encePairwiseOnDemand]: 129/132 looper letters, 4 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2025-02-08 05:43:51,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 141 transitions, 399 flow [2025-02-08 05:43:51,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:51,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:51,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2025-02-08 05:43:51,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9646464646464646 [2025-02-08 05:43:51,386 INFO L175 Difference]: Start difference. First operand has 136 places, 140 transitions, 385 flow. Second operand 3 states and 382 transitions. [2025-02-08 05:43:51,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 141 transitions, 399 flow [2025-02-08 05:43:51,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 141 transitions, 385 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:43:51,389 INFO L231 Difference]: Finished difference. Result has 137 places, 141 transitions, 383 flow [2025-02-08 05:43:51,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=137, PETRI_TRANSITIONS=141} [2025-02-08 05:43:51,389 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 6 predicate places. [2025-02-08 05:43:51,389 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 141 transitions, 383 flow [2025-02-08 05:43:51,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 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-08 05:43:51,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:51,390 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:51,396 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-08 05:43:51,590 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 [2025-02-08 05:43:51,591 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:51,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:51,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1603587666, now seen corresponding path program 1 times [2025-02-08 05:43:51,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 05:43:51,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1631367482] [2025-02-08 05:43:51,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:51,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:43:51,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:43:51,596 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-08 05:43:51,597 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-08 05:43:51,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 05:43:51,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 05:43:51,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:51,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:51,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 05:43:51,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:43:51,828 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 9 [2025-02-08 05:43:51,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2025-02-08 05:43:51,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:43:51,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 38 [2025-02-08 05:43:51,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:43:51,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 52 [2025-02-08 05:43:51,969 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-08 05:43:51,969 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:43:51,969 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 05:43:51,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631367482] [2025-02-08 05:43:51,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631367482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:51,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:51,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 05:43:51,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819454582] [2025-02-08 05:43:51,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:51,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 05:43:51,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 05:43:51,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 05:43:51,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-08 05:43:52,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 132 [2025-02-08 05:43:52,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 141 transitions, 383 flow. Second operand has 11 states, 11 states have (on average 94.0) internal successors, (1034), 11 states have internal predecessors, (1034), 0 states have call successors, (0), 0 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-08 05:43:52,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:52,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 132 [2025-02-08 05:43:52,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:52,388 INFO L124 PetriNetUnfolderBase]: 92/606 cut-off events. [2025-02-08 05:43:52,388 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-02-08 05:43:52,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 606 events. 92/606 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3315 event pairs, 8 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 905. Up to 137 conditions per place. [2025-02-08 05:43:52,390 INFO L140 encePairwiseOnDemand]: 111/132 looper letters, 32 selfloop transitions, 20 changer transitions 0/157 dead transitions. [2025-02-08 05:43:52,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 157 transitions, 519 flow [2025-02-08 05:43:52,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 05:43:52,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 05:43:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1157 transitions. [2025-02-08 05:43:52,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7304292929292929 [2025-02-08 05:43:52,393 INFO L175 Difference]: Start difference. First operand has 137 places, 141 transitions, 383 flow. Second operand 12 states and 1157 transitions. [2025-02-08 05:43:52,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 157 transitions, 519 flow [2025-02-08 05:43:52,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 157 transitions, 517 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:43:52,396 INFO L231 Difference]: Finished difference. Result has 152 places, 147 transitions, 461 flow [2025-02-08 05:43:52,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=461, PETRI_PLACES=152, PETRI_TRANSITIONS=147} [2025-02-08 05:43:52,397 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 21 predicate places. [2025-02-08 05:43:52,397 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 147 transitions, 461 flow [2025-02-08 05:43:52,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 94.0) internal successors, (1034), 11 states have internal predecessors, (1034), 0 states have call successors, (0), 0 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-08 05:43:52,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:52,397 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:52,404 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-08 05:43:52,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:43:52,602 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:52,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:52,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1124790628, now seen corresponding path program 1 times [2025-02-08 05:43:52,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 05:43:52,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1686966852] [2025-02-08 05:43:52,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:52,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:43:52,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:43:52,609 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-08 05:43:52,610 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-08 05:43:52,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 05:43:52,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 05:43:52,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:52,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:52,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 05:43:52,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:43:52,719 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 15 treesize of output 13 [2025-02-08 05:43:52,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2025-02-08 05:43:52,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:43:52,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 52 [2025-02-08 05:43:52,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:43:52,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 71 [2025-02-08 05:43:52,830 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-08 05:43:52,830 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:43:52,830 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 05:43:52,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686966852] [2025-02-08 05:43:52,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686966852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:52,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:52,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:43:52,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499911207] [2025-02-08 05:43:52,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:52,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:43:52,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 05:43:52,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:43:52,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:43:52,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 132 [2025-02-08 05:43:52,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 147 transitions, 461 flow. Second operand has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 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-08 05:43:52,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:52,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 132 [2025-02-08 05:43:52,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:53,130 INFO L124 PetriNetUnfolderBase]: 132/640 cut-off events. [2025-02-08 05:43:53,130 INFO L125 PetriNetUnfolderBase]: For 79/83 co-relation queries the response was YES. [2025-02-08 05:43:53,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 640 events. 132/640 cut-off events. For 79/83 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3459 event pairs, 36 based on Foata normal form. 0/586 useless extension candidates. Maximal degree in co-relation 1018. Up to 198 conditions per place. [2025-02-08 05:43:53,133 INFO L140 encePairwiseOnDemand]: 117/132 looper letters, 24 selfloop transitions, 39 changer transitions 0/184 dead transitions. [2025-02-08 05:43:53,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 184 transitions, 693 flow [2025-02-08 05:43:53,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:43:53,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:43:53,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 713 transitions. [2025-02-08 05:43:53,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9002525252525253 [2025-02-08 05:43:53,136 INFO L175 Difference]: Start difference. First operand has 152 places, 147 transitions, 461 flow. Second operand 6 states and 713 transitions. [2025-02-08 05:43:53,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 184 transitions, 693 flow [2025-02-08 05:43:53,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 184 transitions, 667 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:43:53,140 INFO L231 Difference]: Finished difference. Result has 156 places, 184 transitions, 725 flow [2025-02-08 05:43:53,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=725, PETRI_PLACES=156, PETRI_TRANSITIONS=184} [2025-02-08 05:43:53,140 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 25 predicate places. [2025-02-08 05:43:53,140 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 184 transitions, 725 flow [2025-02-08 05:43:53,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 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-08 05:43:53,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:53,141 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:53,148 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-08 05:43:53,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:43:53,342 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:53,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:53,343 INFO L85 PathProgramCache]: Analyzing trace with hash 796120130, now seen corresponding path program 1 times [2025-02-08 05:43:53,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 05:43:53,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [402218164] [2025-02-08 05:43:53,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:53,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:43:53,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:43:53,346 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-08 05:43:53,347 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-08 05:43:53,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 05:43:53,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 05:43:53,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:53,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:53,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 05:43:53,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:43:53,595 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-08 05:43:53,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2025-02-08 05:43:53,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:43:53,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 32 [2025-02-08 05:43:53,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:43:53,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 44 [2025-02-08 05:43:53,772 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-08 05:43:53,772 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:43:53,772 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 05:43:53,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402218164] [2025-02-08 05:43:53,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402218164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:53,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:53,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 05:43:53,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149955326] [2025-02-08 05:43:53,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:53,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 05:43:53,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 05:43:53,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 05:43:53,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-08 05:43:54,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 132 [2025-02-08 05:43:54,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 184 transitions, 725 flow. Second operand has 11 states, 11 states have (on average 96.36363636363636) internal successors, (1060), 11 states have internal predecessors, (1060), 0 states have call successors, (0), 0 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-08 05:43:54,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:54,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 132 [2025-02-08 05:43:54,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:54,278 INFO L124 PetriNetUnfolderBase]: 149/749 cut-off events. [2025-02-08 05:43:54,279 INFO L125 PetriNetUnfolderBase]: For 404/453 co-relation queries the response was YES. [2025-02-08 05:43:54,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1731 conditions, 749 events. 149/749 cut-off events. For 404/453 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4454 event pairs, 20 based on Foata normal form. 0/701 useless extension candidates. Maximal degree in co-relation 1597. Up to 135 conditions per place. [2025-02-08 05:43:54,282 INFO L140 encePairwiseOnDemand]: 107/132 looper letters, 71 selfloop transitions, 47 changer transitions 2/230 dead transitions. [2025-02-08 05:43:54,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 230 transitions, 1188 flow [2025-02-08 05:43:54,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 05:43:54,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 05:43:54,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1200 transitions. [2025-02-08 05:43:54,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576 [2025-02-08 05:43:54,285 INFO L175 Difference]: Start difference. First operand has 156 places, 184 transitions, 725 flow. Second operand 12 states and 1200 transitions. [2025-02-08 05:43:54,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 230 transitions, 1188 flow [2025-02-08 05:43:54,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 230 transitions, 1164 flow, removed 12 selfloop flow, removed 0 redundant places. [2025-02-08 05:43:54,290 INFO L231 Difference]: Finished difference. Result has 172 places, 217 transitions, 1067 flow [2025-02-08 05:43:54,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1067, PETRI_PLACES=172, PETRI_TRANSITIONS=217} [2025-02-08 05:43:54,291 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 41 predicate places. [2025-02-08 05:43:54,291 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 217 transitions, 1067 flow [2025-02-08 05:43:54,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 96.36363636363636) internal successors, (1060), 11 states have internal predecessors, (1060), 0 states have call successors, (0), 0 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-08 05:43:54,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:54,292 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] [2025-02-08 05:43:54,299 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-08 05:43:54,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:43:54,496 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:54,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:54,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1583637024, now seen corresponding path program 1 times [2025-02-08 05:43:54,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 05:43:54,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [482455263] [2025-02-08 05:43:54,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:54,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:43:54,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:43:54,502 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:43:54,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 05:43:54,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 05:43:54,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 05:43:54,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:54,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:54,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 05:43:54,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:43:54,572 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-08 05:43:54,573 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:43:54,573 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 05:43:54,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482455263] [2025-02-08 05:43:54,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482455263] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:54,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:54,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:54,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853372169] [2025-02-08 05:43:54,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:54,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:54,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 05:43:54,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:54,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:54,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 132 [2025-02-08 05:43:54,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 217 transitions, 1067 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 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-08 05:43:54,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:54,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 132 [2025-02-08 05:43:54,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:54,655 INFO L124 PetriNetUnfolderBase]: 150/783 cut-off events. [2025-02-08 05:43:54,655 INFO L125 PetriNetUnfolderBase]: For 458/491 co-relation queries the response was YES. [2025-02-08 05:43:54,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1904 conditions, 783 events. 150/783 cut-off events. For 458/491 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4830 event pairs, 19 based on Foata normal form. 4/759 useless extension candidates. Maximal degree in co-relation 1768. Up to 143 conditions per place. [2025-02-08 05:43:54,659 INFO L140 encePairwiseOnDemand]: 125/132 looper letters, 15 selfloop transitions, 11 changer transitions 12/224 dead transitions. [2025-02-08 05:43:54,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 224 transitions, 1147 flow [2025-02-08 05:43:54,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:54,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:54,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2025-02-08 05:43:54,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2025-02-08 05:43:54,661 INFO L175 Difference]: Start difference. First operand has 172 places, 217 transitions, 1067 flow. Second operand 3 states and 374 transitions. [2025-02-08 05:43:54,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 224 transitions, 1147 flow [2025-02-08 05:43:54,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 224 transitions, 1101 flow, removed 15 selfloop flow, removed 4 redundant places. [2025-02-08 05:43:54,668 INFO L231 Difference]: Finished difference. Result has 172 places, 212 transitions, 1067 flow [2025-02-08 05:43:54,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1067, PETRI_PLACES=172, PETRI_TRANSITIONS=212} [2025-02-08 05:43:54,669 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 41 predicate places. [2025-02-08 05:43:54,669 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 212 transitions, 1067 flow [2025-02-08 05:43:54,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 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-08 05:43:54,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:54,669 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] [2025-02-08 05:43:54,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 05:43:54,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:43:54,870 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:43:54,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:54,871 INFO L85 PathProgramCache]: Analyzing trace with hash 2091825752, now seen corresponding path program 1 times [2025-02-08 05:43:54,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 05:43:54,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1560655536] [2025-02-08 05:43:54,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:54,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:43:54,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:43:54,879 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:43:54,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 05:43:54,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 05:43:54,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 05:43:54,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:54,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:54,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-08 05:43:54,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:43:55,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2025-02-08 05:43:55,093 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-02-08 05:43:55,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-02-08 05:43:55,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-02-08 05:43:56,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2025-02-08 05:43:56,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2025-02-08 05:43:56,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 66 [2025-02-08 05:43:56,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2025-02-08 05:43:56,381 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-08 05:43:56,381 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:43:56,381 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 05:43:56,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560655536] [2025-02-08 05:43:56,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560655536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:56,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:56,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-08 05:43:56,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811657746] [2025-02-08 05:43:56,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:56,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 05:43:56,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 05:43:56,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 05:43:56,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-02-08 05:43:59,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 132 [2025-02-08 05:43:59,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 212 transitions, 1067 flow. Second operand has 20 states, 20 states have (on average 79.05) internal successors, (1581), 20 states have internal predecessors, (1581), 0 states have call successors, (0), 0 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-08 05:43:59,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:59,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 132 [2025-02-08 05:43:59,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:02,188 INFO L124 PetriNetUnfolderBase]: 266/1041 cut-off events. [2025-02-08 05:44:02,189 INFO L125 PetriNetUnfolderBase]: For 985/1109 co-relation queries the response was YES. [2025-02-08 05:44:02,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2949 conditions, 1041 events. 266/1041 cut-off events. For 985/1109 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 6318 event pairs, 39 based on Foata normal form. 69/1086 useless extension candidates. Maximal degree in co-relation 2753. Up to 175 conditions per place. [2025-02-08 05:44:02,194 INFO L140 encePairwiseOnDemand]: 102/132 looper letters, 169 selfloop transitions, 70 changer transitions 0/330 dead transitions. [2025-02-08 05:44:02,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 330 transitions, 2079 flow [2025-02-08 05:44:02,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-08 05:44:02,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-02-08 05:44:02,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2479 transitions. [2025-02-08 05:44:02,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.626010101010101 [2025-02-08 05:44:02,200 INFO L175 Difference]: Start difference. First operand has 172 places, 212 transitions, 1067 flow. Second operand 30 states and 2479 transitions. [2025-02-08 05:44:02,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 330 transitions, 2079 flow [2025-02-08 05:44:02,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 330 transitions, 2051 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:44:02,210 INFO L231 Difference]: Finished difference. Result has 191 places, 228 transitions, 1255 flow [2025-02-08 05:44:02,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1255, PETRI_PLACES=191, PETRI_TRANSITIONS=228} [2025-02-08 05:44:02,210 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 60 predicate places. [2025-02-08 05:44:02,211 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 228 transitions, 1255 flow [2025-02-08 05:44:02,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 79.05) internal successors, (1581), 20 states have internal predecessors, (1581), 0 states have call successors, (0), 0 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-08 05:44:02,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:02,211 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] [2025-02-08 05:44:02,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-08 05:44:02,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:44:02,416 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:44:02,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:02,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1030804472, now seen corresponding path program 1 times [2025-02-08 05:44:02,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 05:44:02,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1052881401] [2025-02-08 05:44:02,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:02,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:44:02,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:44:02,420 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:44:02,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 05:44:02,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 05:44:02,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 05:44:02,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:02,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:02,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 05:44:02,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:44:02,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2025-02-08 05:44:02,538 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-02-08 05:44:02,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-02-08 05:44:02,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-08 05:44:02,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2025-02-08 05:44:02,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2025-02-08 05:44:02,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 44 [2025-02-08 05:44:02,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2025-02-08 05:44:02,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:44:02,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:44:03,065 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul |c_ULTIMATE.start_main_~i~1#1| (_ bv4 32)))) (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~tids~0#1.offset| (_ bv3 32) .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 (_ bv0 1))))) (and (forall ((v_ArrVal_210 (Array (_ BitVec 32) (_ BitVec 1)))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_210) |c_ULTIMATE.start_main_~tids~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tids~0#1.offset| (_ bv2 32) .cse1)) (_ bv0 1))) (forall ((v_ArrVal_210 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store .cse0 c_~datas~0.base v_ArrVal_210) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2))) (forall ((v_ArrVal_210 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store .cse0 c_~datas~0.base v_ArrVal_210) |c_ULTIMATE.start_main_~tids~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tids~0#1.offset| (_ bv1 32) .cse1)))) (forall ((v_ArrVal_210 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store .cse0 c_~datas~0.base v_ArrVal_210) |c_ULTIMATE.start_main_~tids~0#1.base|) (bvadd |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)))))))) is different from false [2025-02-08 05:44:03,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:44:03,370 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66 [2025-02-08 05:44:03,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:44:03,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 38 [2025-02-08 05:44:03,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 05:44:03,391 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-08 05:44:03,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-02-08 05:44:03,399 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-08 05:44:03,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-02-08 05:44:03,405 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-08 05:44:03,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-02-08 05:44:03,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:44:03,547 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 05:44:03,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052881401] [2025-02-08 05:44:03,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052881401] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:44:03,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 05:44:03,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 22 [2025-02-08 05:44:03,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416164980] [2025-02-08 05:44:03,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 05:44:03,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 05:44:03,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 05:44:03,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 05:44:03,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=349, Unknown=36, NotChecked=40, Total=506 [2025-02-08 05:44:03,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 132 [2025-02-08 05:44:03,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 228 transitions, 1255 flow. Second operand has 23 states, 23 states have (on average 77.82608695652173) internal successors, (1790), 23 states have internal predecessors, (1790), 0 states have call successors, (0), 0 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-08 05:44:03,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:03,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 132 [2025-02-08 05:44:03,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:04,737 INFO L124 PetriNetUnfolderBase]: 227/969 cut-off events. [2025-02-08 05:44:04,737 INFO L125 PetriNetUnfolderBase]: For 961/964 co-relation queries the response was YES. [2025-02-08 05:44:04,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2929 conditions, 969 events. 227/969 cut-off events. For 961/964 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 5860 event pairs, 36 based on Foata normal form. 11/944 useless extension candidates. Maximal degree in co-relation 2799. Up to 218 conditions per place. [2025-02-08 05:44:04,742 INFO L140 encePairwiseOnDemand]: 111/132 looper letters, 54 selfloop transitions, 19 changer transitions 97/271 dead transitions. [2025-02-08 05:44:04,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 271 transitions, 1883 flow [2025-02-08 05:44:04,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 05:44:04,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-08 05:44:04,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1512 transitions. [2025-02-08 05:44:04,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6028708133971292 [2025-02-08 05:44:04,745 INFO L175 Difference]: Start difference. First operand has 191 places, 228 transitions, 1255 flow. Second operand 19 states and 1512 transitions. [2025-02-08 05:44:04,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 271 transitions, 1883 flow [2025-02-08 05:44:04,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 271 transitions, 1738 flow, removed 3 selfloop flow, removed 17 redundant places. [2025-02-08 05:44:04,752 INFO L231 Difference]: Finished difference. Result has 191 places, 174 transitions, 799 flow [2025-02-08 05:44:04,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=799, PETRI_PLACES=191, PETRI_TRANSITIONS=174} [2025-02-08 05:44:04,753 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 60 predicate places. [2025-02-08 05:44:04,753 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 174 transitions, 799 flow [2025-02-08 05:44:04,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 77.82608695652173) internal successors, (1790), 23 states have internal predecessors, (1790), 0 states have call successors, (0), 0 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-08 05:44:04,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:04,754 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:44:04,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-08 05:44:04,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:44:04,955 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:44:04,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:04,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1439596649, now seen corresponding path program 1 times [2025-02-08 05:44:04,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 05:44:04,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1434851103] [2025-02-08 05:44:04,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:04,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:44:04,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:44:04,961 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:44:04,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 05:44:05,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 05:44:05,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 05:44:05,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:05,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:44:05,042 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:44:05,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 05:44:05,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 05:44:05,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:05,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:44:05,129 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-08 05:44:05,129 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:44:05,130 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (15 of 16 remaining) [2025-02-08 05:44:05,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-02-08 05:44:05,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-02-08 05:44:05,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-02-08 05:44:05,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-02-08 05:44:05,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-02-08 05:44:05,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-02-08 05:44:05,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 16 remaining) [2025-02-08 05:44:05,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-02-08 05:44:05,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-02-08 05:44:05,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-02-08 05:44:05,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-02-08 05:44:05,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-02-08 05:44:05,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-02-08 05:44:05,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-02-08 05:44:05,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-02-08 05:44:05,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-08 05:44:05,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:44:05,336 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:44:05,394 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:44:05,394 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:44:05,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:44:05 BasicIcfg [2025-02-08 05:44:05,400 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:44:05,401 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:44:05,401 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:44:05,401 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:44:05,402 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:43:48" (3/4) ... [2025-02-08 05:44:05,402 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 05:44:05,449 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-02-08 05:44:05,486 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:44:05,486 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:44:05,486 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:44:05,488 INFO L158 Benchmark]: Toolchain (without parser) took 17935.84ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 90.7MB in the beginning and 91.4MB in the end (delta: -755.8kB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. [2025-02-08 05:44:05,488 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory is still 61.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:44:05,488 INFO L158 Benchmark]: CACSL2BoogieTranslator took 465.55ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 61.0MB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 05:44:05,488 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.51ms. Allocated memory is still 117.4MB. Free memory was 61.0MB in the beginning and 58.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:44:05,488 INFO L158 Benchmark]: Boogie Preprocessor took 44.67ms. Allocated memory is still 117.4MB. Free memory was 58.9MB in the beginning and 57.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:44:05,489 INFO L158 Benchmark]: IcfgBuilder took 557.54ms. Allocated memory is still 117.4MB. Free memory was 57.0MB in the beginning and 90.0MB in the end (delta: -33.0MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2025-02-08 05:44:05,489 INFO L158 Benchmark]: TraceAbstraction took 16734.00ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 89.3MB in the beginning and 101.9MB in the end (delta: -12.7MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. [2025-02-08 05:44:05,489 INFO L158 Benchmark]: Witness Printer took 85.46ms. Allocated memory is still 218.1MB. Free memory was 101.9MB in the beginning and 91.4MB in the end (delta: 10.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:44:05,490 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory is still 61.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 465.55ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 61.0MB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.51ms. Allocated memory is still 117.4MB. Free memory was 61.0MB in the beginning and 58.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.67ms. Allocated memory is still 117.4MB. Free memory was 58.9MB in the beginning and 57.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 557.54ms. Allocated memory is still 117.4MB. Free memory was 57.0MB in the beginning and 90.0MB in the end (delta: -33.0MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * TraceAbstraction took 16734.00ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 89.3MB in the beginning and 101.9MB in the end (delta: -12.7MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. * Witness Printer took 85.46ms. Allocated memory is still 218.1MB. Free memory was 101.9MB in the beginning and 91.4MB in the end (delta: 10.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1058]: Data race detected Data race detected The following path leads to a data race: [L1043] 0 int threads_mask = -1; VAL [threads_mask=-1] [L1044] 0 int *datas; VAL [datas={0:0}, threads_mask=-1] [L1052] 0 int threads_total = __VERIFIER_nondet_int(); VAL [datas={0:0}, threads_mask=-1, threads_total=2] [L1053] CALL 0 assume_abort_if_not(threads_total >= 0) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1] [L1053] RET 0 assume_abort_if_not(threads_total >= 0) [L1054] CALL 0 assume_abort_if_not(threads_total < 32) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1] [L1054] RET 0 assume_abort_if_not(threads_total < 32) [L1055] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [datas={0:0}, threads_mask=-1, threads_total=2, tids={2:0}] [L1056] 0 datas = malloc(threads_total * sizeof(int)) VAL [datas={4:0}, threads_mask=-1, threads_total=2, tids={2:0}] [L1057] 0 int i = 0; VAL [datas={4:0}, i=0, threads_mask=-1, threads_total=2, tids={2:0}] [L1057] COND TRUE 0 i < threads_total VAL [datas={4:0}, threads_mask=-1] [L1058] EXPR 0 ffs(threads_mask) VAL [datas={4:0}, i=0, threads_mask=-1, threads_total=2, tids={2:0}] [L1058] 0 int j = ffs(threads_mask) - 1; VAL [datas={4:0}, i=0, j=0, threads_mask=-1, threads_total=2, tids={2:0}] [L1059] 0 threads_mask &= ~(1 << j) VAL [datas={4:0}, i=0, j=0, threads_mask=-2, threads_total=2, tids={2:0}] [L1060] 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j) VAL [datas={4:0}, i=0, j=0, threads_mask=-2, threads_total=2, tids={2:0}] [L1060] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j) VAL [\old(arg)={0:0}, datas={4:0}, i=0, j=0, threads_mask=-2, threads_total=2, tids={2:0}] [L1046] 1 int j = (int)arg; VAL [\old(arg)={0:0}, arg={0:0}, datas={4:0}, j=0, threads_mask=-2] [L1057] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, datas={4:0}, i=1, j=0, threads_mask=-2, threads_total=2, tids={2:0}] [L1057] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, arg={0:0}, datas={4:0}, j=0, threads_mask=-2] [L1047] EXPR 1 datas[j] VAL [\old(arg)={0:0}, arg={0:0}, datas={4:0}, j=0, threads_mask=-2] [L1047] 1 datas[j] = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, datas={4:0}, j=0, threads_mask=-2] [L1048] 1 threads_mask |= 1 << j VAL [\old(arg)={0:0}, arg={0:0}, datas={4:0}, j=0, threads_mask=-1] [L1058] 0 ffs(threads_mask) VAL [\old(arg)={0:0}, arg={0:0}, datas={4:0}, i=1, j=0, threads_mask=-1, threads_total=2, tids={2:0}] Now there is a data race on ~threads_mask~0 between C: threads_mask |= 1 << j [1048] and C: ffs(threads_mask) [1058] - UnprovableResult [Line: 1056]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 157 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.5s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1659 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1382 mSDsluCounter, 3685 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 126 IncrementalHoareTripleChecker+Unchecked, 3549 mSDsCounter, 150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6016 IncrementalHoareTripleChecker+Invalid, 6292 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 150 mSolverCounterUnsat, 136 mSDtfsCounter, 6016 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 822 GetRequests, 705 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1255occurred in iteration=11, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 792 NumberOfCodeBlocks, 792 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 775 ConstructedInterpolants, 9 QuantifiedInterpolants, 5665 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1101 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 15/17 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-08 05:44:05,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)