./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8cea87724a542982ff884c708bfc22195aa1904db80300e5b965108c3d86cb2f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:54:29,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:54:29,085 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:54:29,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:54:29,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:54:29,102 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:54:29,103 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:54:29,103 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:54:29,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:54:29,103 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:54:29,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:54:29,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:54:29,103 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:54:29,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:54:29,104 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:54:29,104 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:54:29,104 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:54:29,104 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:54:29,104 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:54:29,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:54:29,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:54:29,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:54:29,104 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:54:29,104 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:54:29,104 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:54:29,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:54:29,104 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:54:29,104 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:54:29,104 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:54:29,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:54:29,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:54:29,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:54:29,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:54:29,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:54:29,105 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:54:29,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:54:29,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:54:29,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:54:29,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:54:29,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:54:29,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:54:29,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:54:29,105 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8cea87724a542982ff884c708bfc22195aa1904db80300e5b965108c3d86cb2f [2025-03-04 06:54:29,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:54:29,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:54:29,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:54:29,341 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:54:29,341 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:54:29,342 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c [2025-03-04 06:54:30,485 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6a07c68c/c9bab605a6da40d19ca8e8bcb067f5f1/FLAGd7ddac737 [2025-03-04 06:54:30,687 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:54:30,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c [2025-03-04 06:54:30,699 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6a07c68c/c9bab605a6da40d19ca8e8bcb067f5f1/FLAGd7ddac737 [2025-03-04 06:54:31,055 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6a07c68c/c9bab605a6da40d19ca8e8bcb067f5f1 [2025-03-04 06:54:31,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:54:31,058 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:54:31,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:54:31,059 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:54:31,062 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:54:31,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:54:31" (1/1) ... [2025-03-04 06:54:31,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@747f5cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:31, skipping insertion in model container [2025-03-04 06:54:31,063 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:54:31" (1/1) ... [2025-03-04 06:54:31,075 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:54:31,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:54:31,206 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:54:31,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:54:31,230 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:54:31,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:31 WrapperNode [2025-03-04 06:54:31,231 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:54:31,232 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:54:31,232 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:54:31,232 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:54:31,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:31" (1/1) ... [2025-03-04 06:54:31,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:31" (1/1) ... [2025-03-04 06:54:31,255 INFO L138 Inliner]: procedures = 19, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 78 [2025-03-04 06:54:31,256 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:54:31,257 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:54:31,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:54:31,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:54:31,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:31" (1/1) ... [2025-03-04 06:54:31,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:31" (1/1) ... [2025-03-04 06:54:31,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:31" (1/1) ... [2025-03-04 06:54:31,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:31" (1/1) ... [2025-03-04 06:54:31,271 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:31" (1/1) ... [2025-03-04 06:54:31,276 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:31" (1/1) ... [2025-03-04 06:54:31,277 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:31" (1/1) ... [2025-03-04 06:54:31,278 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:31" (1/1) ... [2025-03-04 06:54:31,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:54:31,283 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:54:31,283 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:54:31,283 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:54:31,284 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:31" (1/1) ... [2025-03-04 06:54:31,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:54:31,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:54:31,319 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:54:31,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:54:31,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:54:31,342 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 06:54:31,343 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 06:54:31,343 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 06:54:31,343 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 06:54:31,343 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 06:54:31,343 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 06:54:31,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:54:31,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:54:31,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:54:31,344 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:54:31,417 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:54:31,419 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:54:31,731 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:54:31,732 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:54:31,758 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:54:31,758 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:54:31,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:54:31 BoogieIcfgContainer [2025-03-04 06:54:31,759 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:54:31,761 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:54:31,761 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:54:31,765 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:54:31,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:54:31" (1/3) ... [2025-03-04 06:54:31,765 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c0c776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:54:31, skipping insertion in model container [2025-03-04 06:54:31,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:54:31" (2/3) ... [2025-03-04 06:54:31,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c0c776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:54:31, skipping insertion in model container [2025-03-04 06:54:31,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:54:31" (3/3) ... [2025-03-04 06:54:31,767 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-3-extended.wvr.c [2025-03-04 06:54:31,779 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:54:31,781 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-3-extended.wvr.c that has 4 procedures, 207 locations, 1 initial locations, 3 loop locations, and 24 error locations. [2025-03-04 06:54:31,782 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:54:31,861 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 06:54:31,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 216 places, 222 transitions, 465 flow [2025-03-04 06:54:31,966 INFO L124 PetriNetUnfolderBase]: 16/219 cut-off events. [2025-03-04 06:54:31,970 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:54:31,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 219 events. 16/219 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 478 event pairs, 0 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 159. Up to 4 conditions per place. [2025-03-04 06:54:31,975 INFO L82 GeneralOperation]: Start removeDead. Operand has 216 places, 222 transitions, 465 flow [2025-03-04 06:54:31,981 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 202 transitions, 419 flow [2025-03-04 06:54:31,987 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:54:31,994 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;@391780b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:54:31,994 INFO L334 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2025-03-04 06:54:32,000 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:54:32,000 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-04 06:54:32,000 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:54:32,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:32,001 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:54:32,001 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:54:32,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:32,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1084991765, now seen corresponding path program 1 times [2025-03-04 06:54:32,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:32,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982915326] [2025-03-04 06:54:32,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:32,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:32,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 06:54:32,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 06:54:32,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:32,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:32,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:54:32,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:32,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982915326] [2025-03-04 06:54:32,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982915326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:32,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:32,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:32,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827448565] [2025-03-04 06:54:32,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:32,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:32,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:32,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:32,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:32,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 222 [2025-03-04 06:54:32,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 202 transitions, 419 flow. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:32,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:32,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 222 [2025-03-04 06:54:32,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:32,382 INFO L124 PetriNetUnfolderBase]: 148/774 cut-off events. [2025-03-04 06:54:32,382 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-04 06:54:32,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 774 events. 148/774 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4280 event pairs, 55 based on Foata normal form. 53/675 useless extension candidates. Maximal degree in co-relation 878. Up to 164 conditions per place. [2025-03-04 06:54:32,396 INFO L140 encePairwiseOnDemand]: 216/222 looper letters, 18 selfloop transitions, 2 changer transitions 0/198 dead transitions. [2025-03-04 06:54:32,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 198 transitions, 451 flow [2025-03-04 06:54:32,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:32,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:32,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 606 transitions. [2025-03-04 06:54:32,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2025-03-04 06:54:32,416 INFO L175 Difference]: Start difference. First operand has 197 places, 202 transitions, 419 flow. Second operand 3 states and 606 transitions. [2025-03-04 06:54:32,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 198 transitions, 451 flow [2025-03-04 06:54:32,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 198 transitions, 442 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:54:32,423 INFO L231 Difference]: Finished difference. Result has 193 places, 198 transitions, 406 flow [2025-03-04 06:54:32,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=193, PETRI_TRANSITIONS=198} [2025-03-04 06:54:32,428 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -4 predicate places. [2025-03-04 06:54:32,429 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 198 transitions, 406 flow [2025-03-04 06:54:32,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:32,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:32,429 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] [2025-03-04 06:54:32,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:54:32,430 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:54:32,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:32,430 INFO L85 PathProgramCache]: Analyzing trace with hash 249538427, now seen corresponding path program 1 times [2025-03-04 06:54:32,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:32,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019537905] [2025-03-04 06:54:32,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:32,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:32,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 06:54:32,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 06:54:32,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:32,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:32,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:54:32,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:32,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019537905] [2025-03-04 06:54:32,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019537905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:32,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:32,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:32,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395500079] [2025-03-04 06:54:32,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:32,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:32,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:32,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:32,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:32,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 222 [2025-03-04 06:54:32,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 198 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:32,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:32,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 222 [2025-03-04 06:54:32,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:32,607 INFO L124 PetriNetUnfolderBase]: 167/812 cut-off events. [2025-03-04 06:54:32,607 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-04 06:54:32,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1062 conditions, 812 events. 167/812 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4955 event pairs, 83 based on Foata normal form. 0/652 useless extension candidates. Maximal degree in co-relation 1033. Up to 204 conditions per place. [2025-03-04 06:54:32,613 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 18 selfloop transitions, 2 changer transitions 0/197 dead transitions. [2025-03-04 06:54:32,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 197 transitions, 444 flow [2025-03-04 06:54:32,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:32,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:32,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 603 transitions. [2025-03-04 06:54:32,615 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9054054054054054 [2025-03-04 06:54:32,616 INFO L175 Difference]: Start difference. First operand has 193 places, 198 transitions, 406 flow. Second operand 3 states and 603 transitions. [2025-03-04 06:54:32,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 197 transitions, 444 flow [2025-03-04 06:54:32,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 197 transitions, 440 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:32,618 INFO L231 Difference]: Finished difference. Result has 192 places, 197 transitions, 404 flow [2025-03-04 06:54:32,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=404, PETRI_PLACES=192, PETRI_TRANSITIONS=197} [2025-03-04 06:54:32,619 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -5 predicate places. [2025-03-04 06:54:32,619 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 197 transitions, 404 flow [2025-03-04 06:54:32,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:32,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:32,620 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] [2025-03-04 06:54:32,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:54:32,620 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:54:32,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:32,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1117347774, now seen corresponding path program 1 times [2025-03-04 06:54:32,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:32,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107386209] [2025-03-04 06:54:32,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:32,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:32,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 06:54:32,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 06:54:32,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:32,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:32,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:54:32,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:32,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107386209] [2025-03-04 06:54:32,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107386209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:32,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:32,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:32,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562175088] [2025-03-04 06:54:32,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:32,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:32,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:32,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:32,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:32,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 222 [2025-03-04 06:54:32,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 197 transitions, 404 flow. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:32,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:32,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 222 [2025-03-04 06:54:32,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:32,775 INFO L124 PetriNetUnfolderBase]: 141/683 cut-off events. [2025-03-04 06:54:32,775 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-04 06:54:32,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 683 events. 141/683 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3746 event pairs, 67 based on Foata normal form. 0/556 useless extension candidates. Maximal degree in co-relation 844. Up to 173 conditions per place. [2025-03-04 06:54:32,784 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 18 selfloop transitions, 2 changer transitions 0/196 dead transitions. [2025-03-04 06:54:32,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 196 transitions, 442 flow [2025-03-04 06:54:32,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:32,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:32,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 603 transitions. [2025-03-04 06:54:32,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9054054054054054 [2025-03-04 06:54:32,788 INFO L175 Difference]: Start difference. First operand has 192 places, 197 transitions, 404 flow. Second operand 3 states and 603 transitions. [2025-03-04 06:54:32,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 196 transitions, 442 flow [2025-03-04 06:54:32,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 196 transitions, 438 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:32,792 INFO L231 Difference]: Finished difference. Result has 191 places, 196 transitions, 402 flow [2025-03-04 06:54:32,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=191, PETRI_TRANSITIONS=196} [2025-03-04 06:54:32,793 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -6 predicate places. [2025-03-04 06:54:32,794 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 196 transitions, 402 flow [2025-03-04 06:54:32,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:32,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:32,794 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] [2025-03-04 06:54:32,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:54:32,795 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:54:32,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:32,795 INFO L85 PathProgramCache]: Analyzing trace with hash -474518848, now seen corresponding path program 1 times [2025-03-04 06:54:32,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:32,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564095935] [2025-03-04 06:54:32,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:32,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:32,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 06:54:32,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 06:54:32,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:32,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:32,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:54:32,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:32,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564095935] [2025-03-04 06:54:32,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564095935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:32,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:32,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:32,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809794496] [2025-03-04 06:54:32,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:32,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:32,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:32,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:32,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:32,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 222 [2025-03-04 06:54:32,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 196 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:32,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:32,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 222 [2025-03-04 06:54:32,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:32,924 INFO L124 PetriNetUnfolderBase]: 112/655 cut-off events. [2025-03-04 06:54:32,925 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:54:32,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 655 events. 112/655 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3295 event pairs, 39 based on Foata normal form. 0/520 useless extension candidates. Maximal degree in co-relation 768. Up to 120 conditions per place. [2025-03-04 06:54:32,931 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 16 selfloop transitions, 2 changer transitions 0/195 dead transitions. [2025-03-04 06:54:32,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 195 transitions, 436 flow [2025-03-04 06:54:32,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:32,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:32,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 607 transitions. [2025-03-04 06:54:32,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9114114114114115 [2025-03-04 06:54:32,933 INFO L175 Difference]: Start difference. First operand has 191 places, 196 transitions, 402 flow. Second operand 3 states and 607 transitions. [2025-03-04 06:54:32,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 195 transitions, 436 flow [2025-03-04 06:54:32,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 195 transitions, 432 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:32,936 INFO L231 Difference]: Finished difference. Result has 190 places, 195 transitions, 400 flow [2025-03-04 06:54:32,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=190, PETRI_TRANSITIONS=195} [2025-03-04 06:54:32,937 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -7 predicate places. [2025-03-04 06:54:32,937 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 195 transitions, 400 flow [2025-03-04 06:54:32,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:32,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:32,938 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] [2025-03-04 06:54:32,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:54:32,938 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:54:32,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:32,938 INFO L85 PathProgramCache]: Analyzing trace with hash 352712416, now seen corresponding path program 1 times [2025-03-04 06:54:32,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:32,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085460250] [2025-03-04 06:54:32,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:32,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:32,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 06:54:32,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 06:54:32,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:32,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:32,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:54:32,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:32,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085460250] [2025-03-04 06:54:32,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085460250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:32,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:32,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:32,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293968731] [2025-03-04 06:54:32,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:32,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:32,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:32,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:32,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:33,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 222 [2025-03-04 06:54:33,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 195 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:33,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:33,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 222 [2025-03-04 06:54:33,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:33,102 INFO L124 PetriNetUnfolderBase]: 125/737 cut-off events. [2025-03-04 06:54:33,102 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-04 06:54:33,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 913 conditions, 737 events. 125/737 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4438 event pairs, 53 based on Foata normal form. 0/582 useless extension candidates. Maximal degree in co-relation 869. Up to 142 conditions per place. [2025-03-04 06:54:33,109 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 16 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2025-03-04 06:54:33,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 194 transitions, 434 flow [2025-03-04 06:54:33,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:33,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:33,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 607 transitions. [2025-03-04 06:54:33,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9114114114114115 [2025-03-04 06:54:33,113 INFO L175 Difference]: Start difference. First operand has 190 places, 195 transitions, 400 flow. Second operand 3 states and 607 transitions. [2025-03-04 06:54:33,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 194 transitions, 434 flow [2025-03-04 06:54:33,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 194 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:33,116 INFO L231 Difference]: Finished difference. Result has 189 places, 194 transitions, 398 flow [2025-03-04 06:54:33,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=398, PETRI_PLACES=189, PETRI_TRANSITIONS=194} [2025-03-04 06:54:33,119 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -8 predicate places. [2025-03-04 06:54:33,120 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 194 transitions, 398 flow [2025-03-04 06:54:33,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:33,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:33,121 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:54:33,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:54:33,121 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:54:33,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:33,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1620095581, now seen corresponding path program 1 times [2025-03-04 06:54:33,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:33,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564600351] [2025-03-04 06:54:33,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:33,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:33,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 06:54:33,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 06:54:33,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:33,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:33,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:54:33,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:33,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564600351] [2025-03-04 06:54:33,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564600351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:33,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:33,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:33,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350143907] [2025-03-04 06:54:33,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:33,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:33,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:33,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:33,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:33,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 222 [2025-03-04 06:54:33,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 194 transitions, 398 flow. Second operand has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:33,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:33,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 222 [2025-03-04 06:54:33,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:33,265 INFO L124 PetriNetUnfolderBase]: 111/656 cut-off events. [2025-03-04 06:54:33,266 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-04 06:54:33,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 803 conditions, 656 events. 111/656 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3660 event pairs, 45 based on Foata normal form. 0/526 useless extension candidates. Maximal degree in co-relation 754. Up to 125 conditions per place. [2025-03-04 06:54:33,272 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 16 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2025-03-04 06:54:33,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 193 transitions, 432 flow [2025-03-04 06:54:33,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:33,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:33,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 607 transitions. [2025-03-04 06:54:33,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9114114114114115 [2025-03-04 06:54:33,275 INFO L175 Difference]: Start difference. First operand has 189 places, 194 transitions, 398 flow. Second operand 3 states and 607 transitions. [2025-03-04 06:54:33,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 193 transitions, 432 flow [2025-03-04 06:54:33,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 193 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:33,278 INFO L231 Difference]: Finished difference. Result has 188 places, 193 transitions, 396 flow [2025-03-04 06:54:33,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=396, PETRI_PLACES=188, PETRI_TRANSITIONS=193} [2025-03-04 06:54:33,278 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -9 predicate places. [2025-03-04 06:54:33,278 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 193 transitions, 396 flow [2025-03-04 06:54:33,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:33,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:33,279 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:54:33,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:54:33,279 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:54:33,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:33,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1268943287, now seen corresponding path program 1 times [2025-03-04 06:54:33,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:33,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109344384] [2025-03-04 06:54:33,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:33,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:33,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 06:54:33,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 06:54:33,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:33,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:33,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:54:33,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:33,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109344384] [2025-03-04 06:54:33,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109344384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:33,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:33,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:33,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235654811] [2025-03-04 06:54:33,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:33,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:33,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:33,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:33,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:33,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 222 [2025-03-04 06:54:33,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 193 transitions, 396 flow. Second operand has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:33,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:33,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 222 [2025-03-04 06:54:33,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:33,455 INFO L124 PetriNetUnfolderBase]: 148/907 cut-off events. [2025-03-04 06:54:33,455 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:54:33,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 907 events. 148/907 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5048 event pairs, 35 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 1039. Up to 109 conditions per place. [2025-03-04 06:54:33,464 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 20 selfloop transitions, 2 changer transitions 0/199 dead transitions. [2025-03-04 06:54:33,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 199 transitions, 455 flow [2025-03-04 06:54:33,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:33,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:33,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 623 transitions. [2025-03-04 06:54:33,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354354354354354 [2025-03-04 06:54:33,466 INFO L175 Difference]: Start difference. First operand has 188 places, 193 transitions, 396 flow. Second operand 3 states and 623 transitions. [2025-03-04 06:54:33,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 199 transitions, 455 flow [2025-03-04 06:54:33,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 199 transitions, 451 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:33,470 INFO L231 Difference]: Finished difference. Result has 188 places, 193 transitions, 400 flow [2025-03-04 06:54:33,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=188, PETRI_TRANSITIONS=193} [2025-03-04 06:54:33,473 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -9 predicate places. [2025-03-04 06:54:33,473 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 193 transitions, 400 flow [2025-03-04 06:54:33,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:33,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:33,474 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-03-04 06:54:33,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:54:33,474 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:54:33,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:33,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1213104455, now seen corresponding path program 1 times [2025-03-04 06:54:33,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:33,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965579031] [2025-03-04 06:54:33,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:33,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:33,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 06:54:33,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 06:54:33,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:33,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:54:33,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:33,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965579031] [2025-03-04 06:54:33,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965579031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:33,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:33,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:33,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293246049] [2025-03-04 06:54:33,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:33,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:33,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:33,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:33,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:33,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 222 [2025-03-04 06:54:33,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 193 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:33,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:33,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 222 [2025-03-04 06:54:33,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:33,605 INFO L124 PetriNetUnfolderBase]: 184/667 cut-off events. [2025-03-04 06:54:33,605 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-04 06:54:33,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 985 conditions, 667 events. 184/667 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3482 event pairs, 15 based on Foata normal form. 0/576 useless extension candidates. Maximal degree in co-relation 867. Up to 183 conditions per place. [2025-03-04 06:54:33,611 INFO L140 encePairwiseOnDemand]: 216/222 looper letters, 25 selfloop transitions, 3 changer transitions 0/199 dead transitions. [2025-03-04 06:54:33,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 199 transitions, 473 flow [2025-03-04 06:54:33,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:33,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:33,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 613 transitions. [2025-03-04 06:54:33,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9204204204204204 [2025-03-04 06:54:33,613 INFO L175 Difference]: Start difference. First operand has 188 places, 193 transitions, 400 flow. Second operand 3 states and 613 transitions. [2025-03-04 06:54:33,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 199 transitions, 473 flow [2025-03-04 06:54:33,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 199 transitions, 471 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:54:33,616 INFO L231 Difference]: Finished difference. Result has 187 places, 191 transitions, 405 flow [2025-03-04 06:54:33,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=405, PETRI_PLACES=187, PETRI_TRANSITIONS=191} [2025-03-04 06:54:33,616 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -10 predicate places. [2025-03-04 06:54:33,617 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 191 transitions, 405 flow [2025-03-04 06:54:33,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:33,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:33,617 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] [2025-03-04 06:54:33,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:54:33,618 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:54:33,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:33,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1933540453, now seen corresponding path program 1 times [2025-03-04 06:54:33,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:33,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718436744] [2025-03-04 06:54:33,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:33,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:33,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 06:54:33,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 06:54:33,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:33,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:33,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:54:33,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:33,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718436744] [2025-03-04 06:54:33,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718436744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:33,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:33,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:33,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444150491] [2025-03-04 06:54:33,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:33,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:33,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:33,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:33,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:33,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 222 [2025-03-04 06:54:33,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 191 transitions, 405 flow. Second operand has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:33,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:33,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 222 [2025-03-04 06:54:33,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:33,784 INFO L124 PetriNetUnfolderBase]: 221/1341 cut-off events. [2025-03-04 06:54:33,784 INFO L125 PetriNetUnfolderBase]: For 24/37 co-relation queries the response was YES. [2025-03-04 06:54:33,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1627 conditions, 1341 events. 221/1341 cut-off events. For 24/37 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 8947 event pairs, 44 based on Foata normal form. 0/1057 useless extension candidates. Maximal degree in co-relation 1190. Up to 160 conditions per place. [2025-03-04 06:54:33,793 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 20 selfloop transitions, 2 changer transitions 0/197 dead transitions. [2025-03-04 06:54:33,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 197 transitions, 464 flow [2025-03-04 06:54:33,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:33,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:33,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 623 transitions. [2025-03-04 06:54:33,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354354354354354 [2025-03-04 06:54:33,796 INFO L175 Difference]: Start difference. First operand has 187 places, 191 transitions, 405 flow. Second operand 3 states and 623 transitions. [2025-03-04 06:54:33,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 197 transitions, 464 flow [2025-03-04 06:54:33,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 197 transitions, 461 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:54:33,798 INFO L231 Difference]: Finished difference. Result has 188 places, 191 transitions, 410 flow [2025-03-04 06:54:33,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=188, PETRI_TRANSITIONS=191} [2025-03-04 06:54:33,799 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -9 predicate places. [2025-03-04 06:54:33,800 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 191 transitions, 410 flow [2025-03-04 06:54:33,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:33,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:33,800 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-03-04 06:54:33,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:54:33,800 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:54:33,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:33,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1997266857, now seen corresponding path program 1 times [2025-03-04 06:54:33,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:33,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850920874] [2025-03-04 06:54:33,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:33,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:33,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 06:54:33,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:54:33,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:33,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:33,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:54:33,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:33,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850920874] [2025-03-04 06:54:33,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850920874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:33,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:33,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:33,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992542669] [2025-03-04 06:54:33,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:33,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:33,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:33,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:33,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:33,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 222 [2025-03-04 06:54:33,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 191 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:33,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:33,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 222 [2025-03-04 06:54:33,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:33,968 INFO L124 PetriNetUnfolderBase]: 380/1485 cut-off events. [2025-03-04 06:54:33,968 INFO L125 PetriNetUnfolderBase]: For 54/61 co-relation queries the response was YES. [2025-03-04 06:54:33,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2062 conditions, 1485 events. 380/1485 cut-off events. For 54/61 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 9918 event pairs, 55 based on Foata normal form. 1/1197 useless extension candidates. Maximal degree in co-relation 1485. Up to 360 conditions per place. [2025-03-04 06:54:33,983 INFO L140 encePairwiseOnDemand]: 216/222 looper letters, 24 selfloop transitions, 3 changer transitions 0/196 dead transitions. [2025-03-04 06:54:33,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 196 transitions, 478 flow [2025-03-04 06:54:33,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:33,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:33,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 612 transitions. [2025-03-04 06:54:33,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.918918918918919 [2025-03-04 06:54:33,984 INFO L175 Difference]: Start difference. First operand has 188 places, 191 transitions, 410 flow. Second operand 3 states and 612 transitions. [2025-03-04 06:54:33,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 196 transitions, 478 flow [2025-03-04 06:54:33,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 196 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:54:33,988 INFO L231 Difference]: Finished difference. Result has 187 places, 189 transitions, 415 flow [2025-03-04 06:54:33,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=415, PETRI_PLACES=187, PETRI_TRANSITIONS=189} [2025-03-04 06:54:33,990 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -10 predicate places. [2025-03-04 06:54:33,990 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 189 transitions, 415 flow [2025-03-04 06:54:33,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:33,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:33,991 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:54:33,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:54:33,991 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:54:33,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:33,992 INFO L85 PathProgramCache]: Analyzing trace with hash 385906381, now seen corresponding path program 1 times [2025-03-04 06:54:33,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:33,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844145988] [2025-03-04 06:54:33,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:33,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:33,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 06:54:34,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 06:54:34,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:34,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:34,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:54:34,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:34,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844145988] [2025-03-04 06:54:34,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844145988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:34,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:34,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:34,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970663935] [2025-03-04 06:54:34,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:34,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:34,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:34,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:34,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:34,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 222 [2025-03-04 06:54:34,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 189 transitions, 415 flow. Second operand has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:34,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:34,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 222 [2025-03-04 06:54:34,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:34,126 INFO L124 PetriNetUnfolderBase]: 178/957 cut-off events. [2025-03-04 06:54:34,126 INFO L125 PetriNetUnfolderBase]: For 40/48 co-relation queries the response was YES. [2025-03-04 06:54:34,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1242 conditions, 957 events. 178/957 cut-off events. For 40/48 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 5948 event pairs, 30 based on Foata normal form. 1/797 useless extension candidates. Maximal degree in co-relation 913. Up to 144 conditions per place. [2025-03-04 06:54:34,132 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 20 selfloop transitions, 2 changer transitions 0/195 dead transitions. [2025-03-04 06:54:34,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 195 transitions, 473 flow [2025-03-04 06:54:34,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:34,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:34,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 623 transitions. [2025-03-04 06:54:34,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354354354354354 [2025-03-04 06:54:34,134 INFO L175 Difference]: Start difference. First operand has 187 places, 189 transitions, 415 flow. Second operand 3 states and 623 transitions. [2025-03-04 06:54:34,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 195 transitions, 473 flow [2025-03-04 06:54:34,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 195 transitions, 470 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:54:34,138 INFO L231 Difference]: Finished difference. Result has 188 places, 189 transitions, 420 flow [2025-03-04 06:54:34,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=185, 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=420, PETRI_PLACES=188, PETRI_TRANSITIONS=189} [2025-03-04 06:54:34,139 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -9 predicate places. [2025-03-04 06:54:34,139 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 189 transitions, 420 flow [2025-03-04 06:54:34,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:34,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:34,140 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:54:34,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:54:34,140 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:54:34,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:34,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1536664339, now seen corresponding path program 1 times [2025-03-04 06:54:34,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:34,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395354530] [2025-03-04 06:54:34,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:34,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:34,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 06:54:34,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 06:54:34,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:34,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:34,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:54:34,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:34,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395354530] [2025-03-04 06:54:34,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395354530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:34,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:34,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:34,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624121357] [2025-03-04 06:54:34,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:34,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:34,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:34,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:34,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:34,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 222 [2025-03-04 06:54:34,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 189 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:34,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:34,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 222 [2025-03-04 06:54:34,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:34,275 INFO L124 PetriNetUnfolderBase]: 198/828 cut-off events. [2025-03-04 06:54:34,275 INFO L125 PetriNetUnfolderBase]: For 32/45 co-relation queries the response was YES. [2025-03-04 06:54:34,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1214 conditions, 828 events. 198/828 cut-off events. For 32/45 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4966 event pairs, 70 based on Foata normal form. 1/712 useless extension candidates. Maximal degree in co-relation 1026. Up to 203 conditions per place. [2025-03-04 06:54:34,281 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 24 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2025-03-04 06:54:34,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 194 transitions, 485 flow [2025-03-04 06:54:34,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:34,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:34,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 614 transitions. [2025-03-04 06:54:34,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9219219219219219 [2025-03-04 06:54:34,283 INFO L175 Difference]: Start difference. First operand has 188 places, 189 transitions, 420 flow. Second operand 3 states and 614 transitions. [2025-03-04 06:54:34,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 194 transitions, 485 flow [2025-03-04 06:54:34,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 194 transitions, 483 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:54:34,286 INFO L231 Difference]: Finished difference. Result has 188 places, 188 transitions, 420 flow [2025-03-04 06:54:34,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=186, 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=3, PETRI_FLOW=420, PETRI_PLACES=188, PETRI_TRANSITIONS=188} [2025-03-04 06:54:34,287 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -9 predicate places. [2025-03-04 06:54:34,287 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 188 transitions, 420 flow [2025-03-04 06:54:34,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:34,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:34,287 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:54:34,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:54:34,287 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:54:34,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:34,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1089941543, now seen corresponding path program 1 times [2025-03-04 06:54:34,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:34,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401969884] [2025-03-04 06:54:34,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:34,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:34,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:54:34,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:54:34,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:34,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:34,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:54:34,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:34,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401969884] [2025-03-04 06:54:34,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401969884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:34,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:34,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:34,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688647904] [2025-03-04 06:54:34,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:34,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:34,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:34,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:34,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:34,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 222 [2025-03-04 06:54:34,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 188 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:34,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:34,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 222 [2025-03-04 06:54:34,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:34,424 INFO L124 PetriNetUnfolderBase]: 266/1035 cut-off events. [2025-03-04 06:54:34,424 INFO L125 PetriNetUnfolderBase]: For 68/77 co-relation queries the response was YES. [2025-03-04 06:54:34,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1502 conditions, 1035 events. 266/1035 cut-off events. For 68/77 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6749 event pairs, 30 based on Foata normal form. 1/916 useless extension candidates. Maximal degree in co-relation 1150. Up to 280 conditions per place. [2025-03-04 06:54:34,430 INFO L140 encePairwiseOnDemand]: 216/222 looper letters, 23 selfloop transitions, 3 changer transitions 0/192 dead transitions. [2025-03-04 06:54:34,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 192 transitions, 482 flow [2025-03-04 06:54:34,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:34,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:34,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 611 transitions. [2025-03-04 06:54:34,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9174174174174174 [2025-03-04 06:54:34,432 INFO L175 Difference]: Start difference. First operand has 188 places, 188 transitions, 420 flow. Second operand 3 states and 611 transitions. [2025-03-04 06:54:34,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 192 transitions, 482 flow [2025-03-04 06:54:34,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 192 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:34,434 INFO L231 Difference]: Finished difference. Result has 186 places, 186 transitions, 423 flow [2025-03-04 06:54:34,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=423, PETRI_PLACES=186, PETRI_TRANSITIONS=186} [2025-03-04 06:54:34,435 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -11 predicate places. [2025-03-04 06:54:34,435 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 186 transitions, 423 flow [2025-03-04 06:54:34,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:34,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:34,435 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] [2025-03-04 06:54:34,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:54:34,435 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:54:34,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:34,436 INFO L85 PathProgramCache]: Analyzing trace with hash 915971644, now seen corresponding path program 1 times [2025-03-04 06:54:34,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:34,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851831269] [2025-03-04 06:54:34,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:34,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:34,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 06:54:34,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 06:54:34,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:34,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:34,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:54:34,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:34,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851831269] [2025-03-04 06:54:34,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851831269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:34,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:34,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:34,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711485097] [2025-03-04 06:54:34,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:34,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:34,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:34,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:34,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:34,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 222 [2025-03-04 06:54:34,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 186 transitions, 423 flow. Second operand has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:34,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:34,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 222 [2025-03-04 06:54:34,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:34,580 INFO L124 PetriNetUnfolderBase]: 304/1205 cut-off events. [2025-03-04 06:54:34,581 INFO L125 PetriNetUnfolderBase]: For 78/83 co-relation queries the response was YES. [2025-03-04 06:54:34,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1827 conditions, 1205 events. 304/1205 cut-off events. For 78/83 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 7758 event pairs, 120 based on Foata normal form. 0/1060 useless extension candidates. Maximal degree in co-relation 1258. Up to 307 conditions per place. [2025-03-04 06:54:34,590 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 24 selfloop transitions, 2 changer transitions 0/191 dead transitions. [2025-03-04 06:54:34,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 191 transitions, 488 flow [2025-03-04 06:54:34,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:34,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:34,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 614 transitions. [2025-03-04 06:54:34,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9219219219219219 [2025-03-04 06:54:34,592 INFO L175 Difference]: Start difference. First operand has 186 places, 186 transitions, 423 flow. Second operand 3 states and 614 transitions. [2025-03-04 06:54:34,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 191 transitions, 488 flow [2025-03-04 06:54:34,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 191 transitions, 485 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:54:34,595 INFO L231 Difference]: Finished difference. Result has 186 places, 185 transitions, 422 flow [2025-03-04 06:54:34,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=186, PETRI_TRANSITIONS=185} [2025-03-04 06:54:34,597 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -11 predicate places. [2025-03-04 06:54:34,597 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 185 transitions, 422 flow [2025-03-04 06:54:34,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:34,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:34,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:54:34,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:54:34,598 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:54:34,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:34,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1857193826, now seen corresponding path program 1 times [2025-03-04 06:54:34,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:34,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641241575] [2025-03-04 06:54:34,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:34,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:34,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 06:54:34,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 06:54:34,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:34,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:54:34,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:34,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641241575] [2025-03-04 06:54:34,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641241575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:34,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:34,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:34,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279581547] [2025-03-04 06:54:34,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:34,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:34,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:34,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:34,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:34,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 222 [2025-03-04 06:54:34,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 185 transitions, 422 flow. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:34,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:34,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 222 [2025-03-04 06:54:34,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:34,743 INFO L124 PetriNetUnfolderBase]: 266/1014 cut-off events. [2025-03-04 06:54:34,744 INFO L125 PetriNetUnfolderBase]: For 98/106 co-relation queries the response was YES. [2025-03-04 06:54:34,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1542 conditions, 1014 events. 266/1014 cut-off events. For 98/106 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 6470 event pairs, 115 based on Foata normal form. 0/911 useless extension candidates. Maximal degree in co-relation 1287. Up to 290 conditions per place. [2025-03-04 06:54:34,750 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 24 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2025-03-04 06:54:34,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 190 transitions, 486 flow [2025-03-04 06:54:34,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:34,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:34,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 614 transitions. [2025-03-04 06:54:34,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9219219219219219 [2025-03-04 06:54:34,752 INFO L175 Difference]: Start difference. First operand has 186 places, 185 transitions, 422 flow. Second operand 3 states and 614 transitions. [2025-03-04 06:54:34,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 190 transitions, 486 flow [2025-03-04 06:54:34,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 190 transitions, 482 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:34,754 INFO L231 Difference]: Finished difference. Result has 185 places, 184 transitions, 420 flow [2025-03-04 06:54:34,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=185, PETRI_TRANSITIONS=184} [2025-03-04 06:54:34,756 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -12 predicate places. [2025-03-04 06:54:34,756 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 184 transitions, 420 flow [2025-03-04 06:54:34,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:34,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:34,756 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-03-04 06:54:34,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:54:34,757 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:54:34,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:34,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1302748379, now seen corresponding path program 1 times [2025-03-04 06:54:34,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:34,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069195134] [2025-03-04 06:54:34,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:34,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:34,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 06:54:34,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 06:54:34,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:34,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:34,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:54:34,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:34,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069195134] [2025-03-04 06:54:34,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069195134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:34,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:34,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:34,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363147782] [2025-03-04 06:54:34,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:34,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:34,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:34,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:34,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:34,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 222 [2025-03-04 06:54:34,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 184 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:34,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:34,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 222 [2025-03-04 06:54:34,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:34,881 INFO L124 PetriNetUnfolderBase]: 181/808 cut-off events. [2025-03-04 06:54:34,881 INFO L125 PetriNetUnfolderBase]: For 32/41 co-relation queries the response was YES. [2025-03-04 06:54:34,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1211 conditions, 808 events. 181/808 cut-off events. For 32/41 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4513 event pairs, 62 based on Foata normal form. 0/716 useless extension candidates. Maximal degree in co-relation 1019. Up to 183 conditions per place. [2025-03-04 06:54:34,887 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 22 selfloop transitions, 2 changer transitions 0/189 dead transitions. [2025-03-04 06:54:34,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 189 transitions, 481 flow [2025-03-04 06:54:34,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:34,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:34,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 618 transitions. [2025-03-04 06:54:34,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9279279279279279 [2025-03-04 06:54:34,889 INFO L175 Difference]: Start difference. First operand has 185 places, 184 transitions, 420 flow. Second operand 3 states and 618 transitions. [2025-03-04 06:54:34,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 189 transitions, 481 flow [2025-03-04 06:54:34,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 189 transitions, 477 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:34,891 INFO L231 Difference]: Finished difference. Result has 184 places, 183 transitions, 418 flow [2025-03-04 06:54:34,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=184, PETRI_TRANSITIONS=183} [2025-03-04 06:54:34,892 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -13 predicate places. [2025-03-04 06:54:34,892 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 183 transitions, 418 flow [2025-03-04 06:54:34,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:34,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:34,893 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-03-04 06:54:34,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:54:34,893 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:54:34,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:34,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1840927236, now seen corresponding path program 1 times [2025-03-04 06:54:34,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:34,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371090230] [2025-03-04 06:54:34,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:34,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:34,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 06:54:34,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 06:54:34,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:34,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:34,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:54:34,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:34,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371090230] [2025-03-04 06:54:34,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371090230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:34,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:34,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:34,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176719100] [2025-03-04 06:54:34,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:34,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:34,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:34,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:34,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:34,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 222 [2025-03-04 06:54:34,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 183 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:34,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:34,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 222 [2025-03-04 06:54:34,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:35,047 INFO L124 PetriNetUnfolderBase]: 277/1193 cut-off events. [2025-03-04 06:54:35,047 INFO L125 PetriNetUnfolderBase]: For 67/71 co-relation queries the response was YES. [2025-03-04 06:54:35,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1770 conditions, 1193 events. 277/1193 cut-off events. For 67/71 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 7487 event pairs, 102 based on Foata normal form. 0/1059 useless extension candidates. Maximal degree in co-relation 1753. Up to 269 conditions per place. [2025-03-04 06:54:35,054 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 22 selfloop transitions, 2 changer transitions 0/188 dead transitions. [2025-03-04 06:54:35,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 188 transitions, 479 flow [2025-03-04 06:54:35,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:35,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:35,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 618 transitions. [2025-03-04 06:54:35,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9279279279279279 [2025-03-04 06:54:35,056 INFO L175 Difference]: Start difference. First operand has 184 places, 183 transitions, 418 flow. Second operand 3 states and 618 transitions. [2025-03-04 06:54:35,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 188 transitions, 479 flow [2025-03-04 06:54:35,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 188 transitions, 475 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:35,059 INFO L231 Difference]: Finished difference. Result has 183 places, 182 transitions, 416 flow [2025-03-04 06:54:35,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=181, 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=416, PETRI_PLACES=183, PETRI_TRANSITIONS=182} [2025-03-04 06:54:35,059 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -14 predicate places. [2025-03-04 06:54:35,059 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 182 transitions, 416 flow [2025-03-04 06:54:35,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:35,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:54:35,060 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] [2025-03-04 06:54:35,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:54:35,060 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:54:35,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:54:35,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1457002726, now seen corresponding path program 1 times [2025-03-04 06:54:35,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:54:35,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615425940] [2025-03-04 06:54:35,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:54:35,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:54:35,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 06:54:35,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 06:54:35,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:54:35,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:54:35,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:54:35,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:54:35,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615425940] [2025-03-04 06:54:35,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615425940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:54:35,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:54:35,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:54:35,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129721481] [2025-03-04 06:54:35,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:54:35,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:54:35,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:54:35,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:54:35,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:54:35,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 222 [2025-03-04 06:54:35,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 182 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:35,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:54:35,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 222 [2025-03-04 06:54:35,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:54:35,195 INFO L124 PetriNetUnfolderBase]: 240/975 cut-off events. [2025-03-04 06:54:35,195 INFO L125 PetriNetUnfolderBase]: For 94/101 co-relation queries the response was YES. [2025-03-04 06:54:35,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1467 conditions, 975 events. 240/975 cut-off events. For 94/101 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 6256 event pairs, 98 based on Foata normal form. 0/882 useless extension candidates. Maximal degree in co-relation 1434. Up to 254 conditions per place. [2025-03-04 06:54:35,199 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 0 selfloop transitions, 0 changer transitions 187/187 dead transitions. [2025-03-04 06:54:35,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 187 transitions, 476 flow [2025-03-04 06:54:35,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:54:35,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:54:35,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 618 transitions. [2025-03-04 06:54:35,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9279279279279279 [2025-03-04 06:54:35,201 INFO L175 Difference]: Start difference. First operand has 183 places, 182 transitions, 416 flow. Second operand 3 states and 618 transitions. [2025-03-04 06:54:35,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 187 transitions, 476 flow [2025-03-04 06:54:35,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 187 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:54:35,203 INFO L231 Difference]: Finished difference. Result has 182 places, 0 transitions, 0 flow [2025-03-04 06:54:35,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=182, PETRI_TRANSITIONS=0} [2025-03-04 06:54:35,203 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -15 predicate places. [2025-03-04 06:54:35,203 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 0 transitions, 0 flow [2025-03-04 06:54:35,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:54:35,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (44 of 45 remaining) [2025-03-04 06:54:35,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (43 of 45 remaining) [2025-03-04 06:54:35,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (42 of 45 remaining) [2025-03-04 06:54:35,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (41 of 45 remaining) [2025-03-04 06:54:35,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (40 of 45 remaining) [2025-03-04 06:54:35,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (39 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (38 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (37 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (36 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (35 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (34 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (33 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (32 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (31 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (30 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (29 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (28 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (27 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (17 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (16 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (15 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (14 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (13 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (12 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (10 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (9 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (7 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (6 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 45 remaining) [2025-03-04 06:54:35,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 45 remaining) [2025-03-04 06:54:35,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 45 remaining) [2025-03-04 06:54:35,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 45 remaining) [2025-03-04 06:54:35,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:54:35,207 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:54:35,214 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:54:35,214 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:54:35,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:54:35 BasicIcfg [2025-03-04 06:54:35,218 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:54:35,218 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:54:35,218 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:54:35,218 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:54:35,219 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:54:31" (3/4) ... [2025-03-04 06:54:35,219 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:54:35,221 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 06:54:35,221 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 06:54:35,221 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 06:54:35,224 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-04 06:54:35,224 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 06:54:35,224 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 06:54:35,224 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:54:35,281 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:54:35,282 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:54:35,282 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:54:35,282 INFO L158 Benchmark]: Toolchain (without parser) took 4224.48ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 114.1MB in the beginning and 252.1MB in the end (delta: -138.0MB). Peak memory consumption was 120.6MB. Max. memory is 16.1GB. [2025-03-04 06:54:35,282 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:54:35,283 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.57ms. Allocated memory is still 142.6MB. Free memory was 114.1MB in the beginning and 102.2MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:54:35,283 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.05ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 100.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:54:35,283 INFO L158 Benchmark]: Boogie Preprocessor took 25.32ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.7MB in the end (delta: 964.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:54:35,283 INFO L158 Benchmark]: IcfgBuilder took 476.09ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 80.5MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 06:54:35,283 INFO L158 Benchmark]: TraceAbstraction took 3457.16ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 80.0MB in the beginning and 256.4MB in the end (delta: -176.4MB). Peak memory consumption was 78.7MB. Max. memory is 16.1GB. [2025-03-04 06:54:35,283 INFO L158 Benchmark]: Witness Printer took 63.62ms. Allocated memory is still 402.7MB. Free memory was 256.4MB in the beginning and 252.1MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:54:35,284 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.15ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.57ms. Allocated memory is still 142.6MB. Free memory was 114.1MB in the beginning and 102.2MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.05ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 100.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.32ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.7MB in the end (delta: 964.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 476.09ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 80.5MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3457.16ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 80.0MB in the beginning and 256.4MB in the end (delta: -176.4MB). Peak memory consumption was 78.7MB. Max. memory is 16.1GB. * Witness Printer took 63.62ms. Allocated memory is still 402.7MB. Free memory was 256.4MB in the beginning and 252.1MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 326 locations, 45 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: 3.3s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 498 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 206 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 797 IncrementalHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 18 mSDtfsCounter, 797 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=423occurred in iteration=13, InterpolantAutomatonStates: 54, 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.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1052 NumberOfCodeBlocks, 1052 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1034 ConstructedInterpolants, 0 QuantifiedInterpolants, 1070 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 24 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:54:35,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE