./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-multiply-verify.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 d79cb5dae664e13779624ff0ffbc531b419f89e2c7510a92e890992a52ee7c98 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:55:46,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:55:46,201 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:55:46,207 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:55:46,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:55:46,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:55:46,234 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:55:46,234 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:55:46,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:55:46,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:55:46,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:55:46,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:55:46,237 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:55:46,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:55:46,237 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:55:46,237 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:55:46,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:55:46,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:55:46,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:55:46,238 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:55:46,238 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:55:46,238 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:55:46,238 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:55:46,238 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:55:46,238 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:55:46,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:55:46,238 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:55:46,238 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:55:46,238 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:55:46,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:55:46,239 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:55:46,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:55:46,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:55:46,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:55:46,239 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:55:46,239 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:55:46,239 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:55:46,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:55:46,239 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:55:46,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:55:46,240 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:55:46,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:55:46,240 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 -> d79cb5dae664e13779624ff0ffbc531b419f89e2c7510a92e890992a52ee7c98 [2025-03-04 06:55:46,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:55:46,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:55:46,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:55:46,499 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:55:46,499 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:55:46,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c [2025-03-04 06:55:47,697 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df6dffa84/3211f7c0040e40029b5f89aa81e4943f/FLAG1f3d17be7 [2025-03-04 06:55:47,931 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:55:47,936 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c [2025-03-04 06:55:47,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df6dffa84/3211f7c0040e40029b5f89aa81e4943f/FLAG1f3d17be7 [2025-03-04 06:55:48,270 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df6dffa84/3211f7c0040e40029b5f89aa81e4943f [2025-03-04 06:55:48,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:55:48,273 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:55:48,274 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:55:48,274 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:55:48,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:55:48,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:55:48" (1/1) ... [2025-03-04 06:55:48,278 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c442006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:48, skipping insertion in model container [2025-03-04 06:55:48,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:55:48" (1/1) ... [2025-03-04 06:55:48,292 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:55:48,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:55:48,450 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:55:48,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:55:48,495 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:55:48,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:48 WrapperNode [2025-03-04 06:55:48,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:55:48,497 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:55:48,497 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:55:48,497 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:55:48,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:48" (1/1) ... [2025-03-04 06:55:48,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:48" (1/1) ... [2025-03-04 06:55:48,541 INFO L138 Inliner]: procedures = 25, calls = 36, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 299 [2025-03-04 06:55:48,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:55:48,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:55:48,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:55:48,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:55:48,552 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:48" (1/1) ... [2025-03-04 06:55:48,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:48" (1/1) ... [2025-03-04 06:55:48,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:48" (1/1) ... [2025-03-04 06:55:48,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:48" (1/1) ... [2025-03-04 06:55:48,568 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:48" (1/1) ... [2025-03-04 06:55:48,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:48" (1/1) ... [2025-03-04 06:55:48,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:48" (1/1) ... [2025-03-04 06:55:48,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:48" (1/1) ... [2025-03-04 06:55:48,583 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:55:48,584 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:55:48,584 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:55:48,584 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:55:48,584 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:48" (1/1) ... [2025-03-04 06:55:48,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:55:48,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:55:48,613 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:55:48,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:55:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:55:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 06:55:48,632 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 06:55:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 06:55:48,632 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 06:55:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 06:55:48,633 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 06:55:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:55:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:55:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 06:55:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 06:55:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:55:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:55:48,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:55:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:55:48,634 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:55:48,719 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:55:48,721 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:55:49,141 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:55:49,142 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:55:49,319 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:55:49,322 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:55:49,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:55:49 BoogieIcfgContainer [2025-03-04 06:55:49,322 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:55:49,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:55:49,324 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:55:49,328 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:55:49,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:55:48" (1/3) ... [2025-03-04 06:55:49,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9c6284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:55:49, skipping insertion in model container [2025-03-04 06:55:49,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:48" (2/3) ... [2025-03-04 06:55:49,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9c6284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:55:49, skipping insertion in model container [2025-03-04 06:55:49,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:55:49" (3/3) ... [2025-03-04 06:55:49,330 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-multiply-verify.wvr.c [2025-03-04 06:55:49,341 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:55:49,343 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-multiply-verify.wvr.c that has 4 procedures, 248 locations, 1 initial locations, 3 loop locations, and 42 error locations. [2025-03-04 06:55:49,344 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:55:49,437 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 06:55:49,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 257 places, 255 transitions, 531 flow [2025-03-04 06:55:49,551 INFO L124 PetriNetUnfolderBase]: 8/252 cut-off events. [2025-03-04 06:55:49,552 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:55:49,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 252 events. 8/252 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 362 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 188. Up to 2 conditions per place. [2025-03-04 06:55:49,559 INFO L82 GeneralOperation]: Start removeDead. Operand has 257 places, 255 transitions, 531 flow [2025-03-04 06:55:49,565 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 238 places, 235 transitions, 488 flow [2025-03-04 06:55:49,574 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:55:49,584 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;@56e76fec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:55:49,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2025-03-04 06:55:49,590 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:55:49,590 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-04 06:55:49,591 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:55:49,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:49,591 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] [2025-03-04 06:55:49,594 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-03-04 06:55:49,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:49,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1563240395, now seen corresponding path program 1 times [2025-03-04 06:55:49,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:49,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969904499] [2025-03-04 06:55:49,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:49,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:49,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 06:55:49,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 06:55:49,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:49,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:49,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:49,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969904499] [2025-03-04 06:55:49,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969904499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:49,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:49,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:49,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119383101] [2025-03-04 06:55:49,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:49,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:49,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:49,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:49,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:49,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 255 [2025-03-04 06:55:49,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 235 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:49,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:49,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 255 [2025-03-04 06:55:49,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:49,925 INFO L124 PetriNetUnfolderBase]: 96/510 cut-off events. [2025-03-04 06:55:49,926 INFO L125 PetriNetUnfolderBase]: For 74/94 co-relation queries the response was YES. [2025-03-04 06:55:49,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 510 events. 96/510 cut-off events. For 74/94 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2265 event pairs, 71 based on Foata normal form. 2/455 useless extension candidates. Maximal degree in co-relation 548. Up to 160 conditions per place. [2025-03-04 06:55:49,934 INFO L140 encePairwiseOnDemand]: 225/255 looper letters, 16 selfloop transitions, 2 changer transitions 2/207 dead transitions. [2025-03-04 06:55:49,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 207 transitions, 468 flow [2025-03-04 06:55:49,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:49,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:49,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2025-03-04 06:55:49,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8679738562091504 [2025-03-04 06:55:49,947 INFO L175 Difference]: Start difference. First operand has 238 places, 235 transitions, 488 flow. Second operand 3 states and 664 transitions. [2025-03-04 06:55:49,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 207 transitions, 468 flow [2025-03-04 06:55:49,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 207 transitions, 456 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 06:55:49,955 INFO L231 Difference]: Finished difference. Result has 210 places, 205 transitions, 420 flow [2025-03-04 06:55:49,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=210, PETRI_TRANSITIONS=205} [2025-03-04 06:55:49,960 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -28 predicate places. [2025-03-04 06:55:49,961 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 205 transitions, 420 flow [2025-03-04 06:55:49,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:49,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:49,962 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:49,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:55:49,962 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-03-04 06:55:49,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:49,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1818415396, now seen corresponding path program 1 times [2025-03-04 06:55:49,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:49,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667910588] [2025-03-04 06:55:49,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:49,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:49,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 06:55:49,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 06:55:49,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:49,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:50,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:50,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:50,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667910588] [2025-03-04 06:55:50,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667910588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:50,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:50,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:50,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922268458] [2025-03-04 06:55:50,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:50,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:50,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:50,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:50,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:50,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 255 [2025-03-04 06:55:50,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 205 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:50,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:50,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 255 [2025-03-04 06:55:50,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:50,153 INFO L124 PetriNetUnfolderBase]: 43/728 cut-off events. [2025-03-04 06:55:50,154 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-04 06:55:50,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 728 events. 43/728 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3906 event pairs, 38 based on Foata normal form. 0/617 useless extension candidates. Maximal degree in co-relation 797. Up to 81 conditions per place. [2025-03-04 06:55:50,159 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 14 selfloop transitions, 2 changer transitions 0/204 dead transitions. [2025-03-04 06:55:50,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 204 transitions, 450 flow [2025-03-04 06:55:50,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:50,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:50,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 641 transitions. [2025-03-04 06:55:50,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8379084967320262 [2025-03-04 06:55:50,162 INFO L175 Difference]: Start difference. First operand has 210 places, 205 transitions, 420 flow. Second operand 3 states and 641 transitions. [2025-03-04 06:55:50,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 204 transitions, 450 flow [2025-03-04 06:55:50,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 204 transitions, 446 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:50,168 INFO L231 Difference]: Finished difference. Result has 207 places, 204 transitions, 418 flow [2025-03-04 06:55:50,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=207, PETRI_TRANSITIONS=204} [2025-03-04 06:55:50,170 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -31 predicate places. [2025-03-04 06:55:50,170 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 204 transitions, 418 flow [2025-03-04 06:55:50,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:50,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:50,171 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] [2025-03-04 06:55:50,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:55:50,171 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-03-04 06:55:50,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:50,172 INFO L85 PathProgramCache]: Analyzing trace with hash -306549116, now seen corresponding path program 1 times [2025-03-04 06:55:50,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:50,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74738203] [2025-03-04 06:55:50,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:50,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:50,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 06:55:50,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 06:55:50,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:50,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:50,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:50,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:50,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74738203] [2025-03-04 06:55:50,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74738203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:50,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:50,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:50,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259005172] [2025-03-04 06:55:50,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:50,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:50,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:50,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:50,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:50,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 255 [2025-03-04 06:55:50,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 204 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:50,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:50,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 255 [2025-03-04 06:55:50,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:50,375 INFO L124 PetriNetUnfolderBase]: 43/727 cut-off events. [2025-03-04 06:55:50,376 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-04 06:55:50,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 727 events. 43/727 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3863 event pairs, 38 based on Foata normal form. 0/617 useless extension candidates. Maximal degree in co-relation 790. Up to 82 conditions per place. [2025-03-04 06:55:50,380 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 15 selfloop transitions, 2 changer transitions 0/203 dead transitions. [2025-03-04 06:55:50,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 203 transitions, 450 flow [2025-03-04 06:55:50,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:50,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:50,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 639 transitions. [2025-03-04 06:55:50,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8352941176470589 [2025-03-04 06:55:50,382 INFO L175 Difference]: Start difference. First operand has 207 places, 204 transitions, 418 flow. Second operand 3 states and 639 transitions. [2025-03-04 06:55:50,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 203 transitions, 450 flow [2025-03-04 06:55:50,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 203 transitions, 446 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:50,387 INFO L231 Difference]: Finished difference. Result has 206 places, 203 transitions, 416 flow [2025-03-04 06:55:50,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=416, PETRI_PLACES=206, PETRI_TRANSITIONS=203} [2025-03-04 06:55:50,388 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -32 predicate places. [2025-03-04 06:55:50,389 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 203 transitions, 416 flow [2025-03-04 06:55:50,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:50,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:50,389 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:50,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:55:50,389 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-03-04 06:55:50,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:50,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1872546177, now seen corresponding path program 1 times [2025-03-04 06:55:50,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:50,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451410336] [2025-03-04 06:55:50,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:50,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:50,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 06:55:50,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 06:55:50,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:50,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:50,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:50,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:50,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451410336] [2025-03-04 06:55:50,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451410336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:50,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:50,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:50,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699600781] [2025-03-04 06:55:50,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:50,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:50,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:50,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:50,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:50,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 255 [2025-03-04 06:55:50,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 203 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:50,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:50,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 255 [2025-03-04 06:55:50,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:50,596 INFO L124 PetriNetUnfolderBase]: 79/764 cut-off events. [2025-03-04 06:55:50,596 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2025-03-04 06:55:50,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 764 events. 79/764 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4272 event pairs, 74 based on Foata normal form. 0/654 useless extension candidates. Maximal degree in co-relation 881. Up to 144 conditions per place. [2025-03-04 06:55:50,602 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 17 selfloop transitions, 2 changer transitions 0/202 dead transitions. [2025-03-04 06:55:50,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 202 transitions, 452 flow [2025-03-04 06:55:50,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:50,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:50,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 635 transitions. [2025-03-04 06:55:50,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8300653594771242 [2025-03-04 06:55:50,604 INFO L175 Difference]: Start difference. First operand has 206 places, 203 transitions, 416 flow. Second operand 3 states and 635 transitions. [2025-03-04 06:55:50,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 202 transitions, 452 flow [2025-03-04 06:55:50,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 202 transitions, 448 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:50,607 INFO L231 Difference]: Finished difference. Result has 205 places, 202 transitions, 414 flow [2025-03-04 06:55:50,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=205, PETRI_TRANSITIONS=202} [2025-03-04 06:55:50,609 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -33 predicate places. [2025-03-04 06:55:50,609 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 202 transitions, 414 flow [2025-03-04 06:55:50,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:50,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:50,610 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:50,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:55:50,610 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-03-04 06:55:50,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:50,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1515922121, now seen corresponding path program 1 times [2025-03-04 06:55:50,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:50,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061091138] [2025-03-04 06:55:50,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:50,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:50,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:55:50,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:55:50,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:50,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:50,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:50,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:50,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061091138] [2025-03-04 06:55:50,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061091138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:50,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:50,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:50,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756716954] [2025-03-04 06:55:50,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:50,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:50,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:50,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:50,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:50,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 255 [2025-03-04 06:55:50,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 202 transitions, 414 flow. Second operand has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:50,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:50,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 255 [2025-03-04 06:55:50,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:50,786 INFO L124 PetriNetUnfolderBase]: 115/777 cut-off events. [2025-03-04 06:55:50,787 INFO L125 PetriNetUnfolderBase]: For 25/26 co-relation queries the response was YES. [2025-03-04 06:55:50,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 999 conditions, 777 events. 115/777 cut-off events. For 25/26 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4384 event pairs, 110 based on Foata normal form. 0/692 useless extension candidates. Maximal degree in co-relation 945. Up to 203 conditions per place. [2025-03-04 06:55:50,792 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 17 selfloop transitions, 1 changer transitions 0/199 dead transitions. [2025-03-04 06:55:50,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 199 transitions, 444 flow [2025-03-04 06:55:50,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:50,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:50,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2025-03-04 06:55:50,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8313725490196079 [2025-03-04 06:55:50,795 INFO L175 Difference]: Start difference. First operand has 205 places, 202 transitions, 414 flow. Second operand 3 states and 636 transitions. [2025-03-04 06:55:50,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 199 transitions, 444 flow [2025-03-04 06:55:50,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 199 transitions, 440 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:50,801 INFO L231 Difference]: Finished difference. Result has 202 places, 199 transitions, 406 flow [2025-03-04 06:55:50,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=202, PETRI_TRANSITIONS=199} [2025-03-04 06:55:50,802 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -36 predicate places. [2025-03-04 06:55:50,803 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 199 transitions, 406 flow [2025-03-04 06:55:50,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:50,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:50,804 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:50,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:55:50,804 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-03-04 06:55:50,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:50,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1605020478, now seen corresponding path program 1 times [2025-03-04 06:55:50,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:50,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636550306] [2025-03-04 06:55:50,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:50,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:50,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 06:55:50,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 06:55:50,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:50,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:50,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:55:50,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:50,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636550306] [2025-03-04 06:55:50,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636550306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:50,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:50,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:50,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42897123] [2025-03-04 06:55:50,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:50,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:50,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:50,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:50,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:50,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 255 [2025-03-04 06:55:50,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 199 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:50,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:50,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 255 [2025-03-04 06:55:50,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:50,931 INFO L124 PetriNetUnfolderBase]: 43/700 cut-off events. [2025-03-04 06:55:50,931 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-04 06:55:50,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 700 events. 43/700 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3654 event pairs, 38 based on Foata normal form. 0/617 useless extension candidates. Maximal degree in co-relation 745. Up to 81 conditions per place. [2025-03-04 06:55:50,935 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 14 selfloop transitions, 2 changer transitions 0/198 dead transitions. [2025-03-04 06:55:50,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 198 transitions, 436 flow [2025-03-04 06:55:50,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:50,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:50,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 641 transitions. [2025-03-04 06:55:50,937 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8379084967320262 [2025-03-04 06:55:50,937 INFO L175 Difference]: Start difference. First operand has 202 places, 199 transitions, 406 flow. Second operand 3 states and 641 transitions. [2025-03-04 06:55:50,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 198 transitions, 436 flow [2025-03-04 06:55:50,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 198 transitions, 435 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:50,939 INFO L231 Difference]: Finished difference. Result has 202 places, 198 transitions, 407 flow [2025-03-04 06:55:50,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=200, 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=407, PETRI_PLACES=202, PETRI_TRANSITIONS=198} [2025-03-04 06:55:50,942 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -36 predicate places. [2025-03-04 06:55:50,942 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 198 transitions, 407 flow [2025-03-04 06:55:50,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:50,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:50,943 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] [2025-03-04 06:55:50,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:55:50,943 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-03-04 06:55:50,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:50,944 INFO L85 PathProgramCache]: Analyzing trace with hash 706503664, now seen corresponding path program 1 times [2025-03-04 06:55:50,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:50,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032385306] [2025-03-04 06:55:50,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:50,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:50,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 06:55:50,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 06:55:50,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:50,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:50,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:50,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:50,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032385306] [2025-03-04 06:55:50,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032385306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:50,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:50,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:50,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434616884] [2025-03-04 06:55:50,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:50,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:50,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:50,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:50,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:50,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 255 [2025-03-04 06:55:50,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 198 transitions, 407 flow. Second operand has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:50,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:50,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 255 [2025-03-04 06:55:50,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:51,069 INFO L124 PetriNetUnfolderBase]: 43/699 cut-off events. [2025-03-04 06:55:51,070 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-04 06:55:51,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 699 events. 43/699 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3655 event pairs, 38 based on Foata normal form. 0/617 useless extension candidates. Maximal degree in co-relation 744. Up to 79 conditions per place. [2025-03-04 06:55:51,074 INFO L140 encePairwiseOnDemand]: 253/255 looper letters, 13 selfloop transitions, 1 changer transitions 0/197 dead transitions. [2025-03-04 06:55:51,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 197 transitions, 433 flow [2025-03-04 06:55:51,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:51,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:51,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 648 transitions. [2025-03-04 06:55:51,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8470588235294118 [2025-03-04 06:55:51,076 INFO L175 Difference]: Start difference. First operand has 202 places, 198 transitions, 407 flow. Second operand 3 states and 648 transitions. [2025-03-04 06:55:51,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 197 transitions, 433 flow [2025-03-04 06:55:51,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 197 transitions, 429 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:51,078 INFO L231 Difference]: Finished difference. Result has 201 places, 197 transitions, 403 flow [2025-03-04 06:55:51,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=403, PETRI_PLACES=201, PETRI_TRANSITIONS=197} [2025-03-04 06:55:51,080 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -37 predicate places. [2025-03-04 06:55:51,081 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 197 transitions, 403 flow [2025-03-04 06:55:51,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:51,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:51,082 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] [2025-03-04 06:55:51,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:55:51,082 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-03-04 06:55:51,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:51,083 INFO L85 PathProgramCache]: Analyzing trace with hash -809059466, now seen corresponding path program 1 times [2025-03-04 06:55:51,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:51,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014473970] [2025-03-04 06:55:51,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:51,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:51,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 06:55:51,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 06:55:51,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:51,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:51,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:51,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:51,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014473970] [2025-03-04 06:55:51,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014473970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:51,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:51,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:51,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537790492] [2025-03-04 06:55:51,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:51,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:51,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:51,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:51,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:51,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 255 [2025-03-04 06:55:51,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 197 transitions, 403 flow. Second operand has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:51,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:51,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 255 [2025-03-04 06:55:51,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:51,258 INFO L124 PetriNetUnfolderBase]: 79/736 cut-off events. [2025-03-04 06:55:51,258 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2025-03-04 06:55:51,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 898 conditions, 736 events. 79/736 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3990 event pairs, 74 based on Foata normal form. 0/654 useless extension candidates. Maximal degree in co-relation 844. Up to 143 conditions per place. [2025-03-04 06:55:51,262 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 16 selfloop transitions, 2 changer transitions 0/196 dead transitions. [2025-03-04 06:55:51,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 196 transitions, 437 flow [2025-03-04 06:55:51,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:51,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 637 transitions. [2025-03-04 06:55:51,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8326797385620915 [2025-03-04 06:55:51,264 INFO L175 Difference]: Start difference. First operand has 201 places, 197 transitions, 403 flow. Second operand 3 states and 637 transitions. [2025-03-04 06:55:51,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 196 transitions, 437 flow [2025-03-04 06:55:51,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 196 transitions, 436 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:51,266 INFO L231 Difference]: Finished difference. Result has 201 places, 196 transitions, 404 flow [2025-03-04 06:55:51,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=199, 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=404, PETRI_PLACES=201, PETRI_TRANSITIONS=196} [2025-03-04 06:55:51,267 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -37 predicate places. [2025-03-04 06:55:51,267 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 196 transitions, 404 flow [2025-03-04 06:55:51,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:51,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:51,268 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] [2025-03-04 06:55:51,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:55:51,268 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-03-04 06:55:51,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:51,268 INFO L85 PathProgramCache]: Analyzing trace with hash -321855737, now seen corresponding path program 1 times [2025-03-04 06:55:51,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:51,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220577627] [2025-03-04 06:55:51,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:51,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:51,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 06:55:51,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 06:55:51,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:51,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:51,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:51,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220577627] [2025-03-04 06:55:51,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220577627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:51,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:51,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:55:51,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596168703] [2025-03-04 06:55:51,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:51,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:55:51,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:51,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:55:51,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:55:51,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 255 [2025-03-04 06:55:51,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 196 transitions, 404 flow. Second operand has 6 states, 6 states have (on average 194.5) internal successors, (1167), 6 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:51,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:51,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 255 [2025-03-04 06:55:51,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:51,953 INFO L124 PetriNetUnfolderBase]: 187/849 cut-off events. [2025-03-04 06:55:51,953 INFO L125 PetriNetUnfolderBase]: For 40/41 co-relation queries the response was YES. [2025-03-04 06:55:51,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 849 events. 187/849 cut-off events. For 40/41 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5100 event pairs, 182 based on Foata normal form. 0/767 useless extension candidates. Maximal degree in co-relation 1154. Up to 334 conditions per place. [2025-03-04 06:55:51,958 INFO L140 encePairwiseOnDemand]: 249/255 looper letters, 27 selfloop transitions, 5 changer transitions 0/195 dead transitions. [2025-03-04 06:55:51,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 195 transitions, 466 flow [2025-03-04 06:55:51,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:55:51,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:55:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1191 transitions. [2025-03-04 06:55:51,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7784313725490196 [2025-03-04 06:55:51,962 INFO L175 Difference]: Start difference. First operand has 201 places, 196 transitions, 404 flow. Second operand 6 states and 1191 transitions. [2025-03-04 06:55:51,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 195 transitions, 466 flow [2025-03-04 06:55:51,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 195 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:51,964 INFO L231 Difference]: Finished difference. Result has 203 places, 195 transitions, 408 flow [2025-03-04 06:55:51,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=408, PETRI_PLACES=203, PETRI_TRANSITIONS=195} [2025-03-04 06:55:51,966 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -35 predicate places. [2025-03-04 06:55:51,966 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 195 transitions, 408 flow [2025-03-04 06:55:51,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 194.5) internal successors, (1167), 6 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:51,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:51,967 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:51,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:55:51,968 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-03-04 06:55:51,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:51,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1648470266, now seen corresponding path program 1 times [2025-03-04 06:55:51,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:51,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018323194] [2025-03-04 06:55:51,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:51,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:51,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 06:55:51,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 06:55:51,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:51,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:52,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:52,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:52,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018323194] [2025-03-04 06:55:52,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018323194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:52,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:52,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:52,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995785753] [2025-03-04 06:55:52,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:52,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:52,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:52,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:52,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:52,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 255 [2025-03-04 06:55:52,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 195 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:52,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:52,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 255 [2025-03-04 06:55:52,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:52,135 INFO L124 PetriNetUnfolderBase]: 148/659 cut-off events. [2025-03-04 06:55:52,135 INFO L125 PetriNetUnfolderBase]: For 13/38 co-relation queries the response was YES. [2025-03-04 06:55:52,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 659 events. 148/659 cut-off events. For 13/38 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3294 event pairs, 97 based on Foata normal form. 0/610 useless extension candidates. Maximal degree in co-relation 922. Up to 235 conditions per place. [2025-03-04 06:55:52,141 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 19 selfloop transitions, 2 changer transitions 0/198 dead transitions. [2025-03-04 06:55:52,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 198 transitions, 458 flow [2025-03-04 06:55:52,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:52,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:52,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 647 transitions. [2025-03-04 06:55:52,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8457516339869281 [2025-03-04 06:55:52,143 INFO L175 Difference]: Start difference. First operand has 203 places, 195 transitions, 408 flow. Second operand 3 states and 647 transitions. [2025-03-04 06:55:52,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 198 transitions, 458 flow [2025-03-04 06:55:52,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 198 transitions, 448 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:55:52,150 INFO L231 Difference]: Finished difference. Result has 199 places, 195 transitions, 408 flow [2025-03-04 06:55:52,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=199, PETRI_TRANSITIONS=195} [2025-03-04 06:55:52,151 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -39 predicate places. [2025-03-04 06:55:52,151 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 195 transitions, 408 flow [2025-03-04 06:55:52,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:52,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:52,152 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:52,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:55:52,152 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-03-04 06:55:52,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:52,152 INFO L85 PathProgramCache]: Analyzing trace with hash -41409715, now seen corresponding path program 1 times [2025-03-04 06:55:52,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:52,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509783936] [2025-03-04 06:55:52,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:52,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:52,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 06:55:52,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 06:55:52,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:52,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:52,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:52,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:52,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509783936] [2025-03-04 06:55:52,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509783936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:52,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:52,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:52,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604502615] [2025-03-04 06:55:52,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:52,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:52,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:52,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:52,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:52,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 255 [2025-03-04 06:55:52,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 195 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:52,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:52,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 255 [2025-03-04 06:55:52,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:52,372 INFO L124 PetriNetUnfolderBase]: 129/874 cut-off events. [2025-03-04 06:55:52,372 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-04 06:55:52,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1133 conditions, 874 events. 129/874 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5220 event pairs, 38 based on Foata normal form. 0/803 useless extension candidates. Maximal degree in co-relation 1080. Up to 198 conditions per place. [2025-03-04 06:55:52,379 INFO L140 encePairwiseOnDemand]: 250/255 looper letters, 21 selfloop transitions, 3 changer transitions 0/201 dead transitions. [2025-03-04 06:55:52,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 201 transitions, 470 flow [2025-03-04 06:55:52,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:52,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:52,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 650 transitions. [2025-03-04 06:55:52,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8496732026143791 [2025-03-04 06:55:52,382 INFO L175 Difference]: Start difference. First operand has 199 places, 195 transitions, 408 flow. Second operand 3 states and 650 transitions. [2025-03-04 06:55:52,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 201 transitions, 470 flow [2025-03-04 06:55:52,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 201 transitions, 470 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:55:52,385 INFO L231 Difference]: Finished difference. Result has 200 places, 196 transitions, 425 flow [2025-03-04 06:55:52,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=425, PETRI_PLACES=200, PETRI_TRANSITIONS=196} [2025-03-04 06:55:52,386 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -38 predicate places. [2025-03-04 06:55:52,386 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 196 transitions, 425 flow [2025-03-04 06:55:52,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:52,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:52,386 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:52,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:55:52,387 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-03-04 06:55:52,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:52,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1941716273, now seen corresponding path program 1 times [2025-03-04 06:55:52,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:52,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813268786] [2025-03-04 06:55:52,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:52,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:52,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 06:55:52,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 06:55:52,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:52,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:52,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:52,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:52,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813268786] [2025-03-04 06:55:52,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813268786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:52,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:52,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:55:52,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720093375] [2025-03-04 06:55:52,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:52,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:52,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:52,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:52,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:52,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 255 [2025-03-04 06:55:52,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 196 transitions, 425 flow. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:52,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:52,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 255 [2025-03-04 06:55:52,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:52,590 INFO L124 PetriNetUnfolderBase]: 42/608 cut-off events. [2025-03-04 06:55:52,590 INFO L125 PetriNetUnfolderBase]: For 28/31 co-relation queries the response was YES. [2025-03-04 06:55:52,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 608 events. 42/608 cut-off events. For 28/31 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2706 event pairs, 16 based on Foata normal form. 7/571 useless extension candidates. Maximal degree in co-relation 705. Up to 60 conditions per place. [2025-03-04 06:55:52,593 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 18 selfloop transitions, 3 changer transitions 0/199 dead transitions. [2025-03-04 06:55:52,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 199 transitions, 472 flow [2025-03-04 06:55:52,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2025-03-04 06:55:52,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8562091503267973 [2025-03-04 06:55:52,595 INFO L175 Difference]: Start difference. First operand has 200 places, 196 transitions, 425 flow. Second operand 3 states and 655 transitions. [2025-03-04 06:55:52,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 199 transitions, 472 flow [2025-03-04 06:55:52,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 199 transitions, 472 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:55:52,600 INFO L231 Difference]: Finished difference. Result has 203 places, 195 transitions, 431 flow [2025-03-04 06:55:52,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=431, PETRI_PLACES=203, PETRI_TRANSITIONS=195} [2025-03-04 06:55:52,601 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -35 predicate places. [2025-03-04 06:55:52,602 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 195 transitions, 431 flow [2025-03-04 06:55:52,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:52,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:52,603 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:52,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:55:52,603 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-03-04 06:55:52,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:52,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1896960640, now seen corresponding path program 1 times [2025-03-04 06:55:52,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:52,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820401018] [2025-03-04 06:55:52,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:52,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:52,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 06:55:52,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 06:55:52,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:52,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:52,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:52,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:52,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820401018] [2025-03-04 06:55:52,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820401018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:52,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:52,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:55:52,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701439555] [2025-03-04 06:55:52,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:52,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:55:52,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:52,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:55:52,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:55:52,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 255 [2025-03-04 06:55:52,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 195 transitions, 431 flow. Second operand has 4 states, 4 states have (on average 213.25) internal successors, (853), 4 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:52,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:52,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 255 [2025-03-04 06:55:52,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:52,867 INFO L124 PetriNetUnfolderBase]: 31/366 cut-off events. [2025-03-04 06:55:52,868 INFO L125 PetriNetUnfolderBase]: For 50/53 co-relation queries the response was YES. [2025-03-04 06:55:52,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 366 events. 31/366 cut-off events. For 50/53 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 937 event pairs, 8 based on Foata normal form. 9/352 useless extension candidates. Maximal degree in co-relation 458. Up to 24 conditions per place. [2025-03-04 06:55:52,869 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 18 selfloop transitions, 5 changer transitions 0/201 dead transitions. [2025-03-04 06:55:52,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 201 transitions, 493 flow [2025-03-04 06:55:52,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:55:52,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 06:55:52,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 868 transitions. [2025-03-04 06:55:52,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8509803921568627 [2025-03-04 06:55:52,872 INFO L175 Difference]: Start difference. First operand has 203 places, 195 transitions, 431 flow. Second operand 4 states and 868 transitions. [2025-03-04 06:55:52,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 201 transitions, 493 flow [2025-03-04 06:55:52,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 201 transitions, 486 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:52,876 INFO L231 Difference]: Finished difference. Result has 205 places, 195 transitions, 440 flow [2025-03-04 06:55:52,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=440, PETRI_PLACES=205, PETRI_TRANSITIONS=195} [2025-03-04 06:55:52,876 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -33 predicate places. [2025-03-04 06:55:52,877 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 195 transitions, 440 flow [2025-03-04 06:55:52,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 213.25) internal successors, (853), 4 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:52,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:52,877 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:52,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:55:52,878 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-03-04 06:55:52,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:52,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1957584669, now seen corresponding path program 1 times [2025-03-04 06:55:52,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:52,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164237560] [2025-03-04 06:55:52,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:52,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:52,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 06:55:52,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 06:55:52,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:52,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:53,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:53,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:53,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164237560] [2025-03-04 06:55:53,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164237560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:53,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:53,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:55:53,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357723586] [2025-03-04 06:55:53,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:53,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:55:53,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:53,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:55:53,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:55:53,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 255 [2025-03-04 06:55:53,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 195 transitions, 440 flow. Second operand has 6 states, 6 states have (on average 203.5) internal successors, (1221), 6 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:53,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:53,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 255 [2025-03-04 06:55:53,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:53,529 INFO L124 PetriNetUnfolderBase]: 42/384 cut-off events. [2025-03-04 06:55:53,529 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2025-03-04 06:55:53,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 384 events. 42/384 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1123 event pairs, 22 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 517. Up to 65 conditions per place. [2025-03-04 06:55:53,531 INFO L140 encePairwiseOnDemand]: 250/255 looper letters, 30 selfloop transitions, 4 changer transitions 0/202 dead transitions. [2025-03-04 06:55:53,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 202 transitions, 530 flow [2025-03-04 06:55:53,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:55:53,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:55:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1239 transitions. [2025-03-04 06:55:53,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8098039215686275 [2025-03-04 06:55:53,534 INFO L175 Difference]: Start difference. First operand has 205 places, 195 transitions, 440 flow. Second operand 6 states and 1239 transitions. [2025-03-04 06:55:53,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 202 transitions, 530 flow [2025-03-04 06:55:53,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 202 transitions, 518 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 06:55:53,537 INFO L231 Difference]: Finished difference. Result has 206 places, 194 transitions, 434 flow [2025-03-04 06:55:53,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=434, PETRI_PLACES=206, PETRI_TRANSITIONS=194} [2025-03-04 06:55:53,538 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -32 predicate places. [2025-03-04 06:55:53,538 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 194 transitions, 434 flow [2025-03-04 06:55:53,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 203.5) internal successors, (1221), 6 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:53,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:53,540 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:53,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:55:53,540 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-03-04 06:55:53,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:53,541 INFO L85 PathProgramCache]: Analyzing trace with hash -801318248, now seen corresponding path program 1 times [2025-03-04 06:55:53,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:53,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457960391] [2025-03-04 06:55:53,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:53,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:53,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 06:55:53,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 06:55:53,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:53,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:54,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:54,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:54,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457960391] [2025-03-04 06:55:54,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457960391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:54,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:54,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:55:54,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035835029] [2025-03-04 06:55:54,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:54,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:55:54,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:54,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:55:54,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:55:54,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 255 [2025-03-04 06:55:54,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 194 transitions, 434 flow. Second operand has 6 states, 6 states have (on average 203.5) internal successors, (1221), 6 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:54,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:54,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 255 [2025-03-04 06:55:54,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:54,213 INFO L124 PetriNetUnfolderBase]: 42/371 cut-off events. [2025-03-04 06:55:54,213 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-04 06:55:54,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 371 events. 42/371 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1064 event pairs, 22 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 490. Up to 65 conditions per place. [2025-03-04 06:55:54,215 INFO L140 encePairwiseOnDemand]: 250/255 looper letters, 30 selfloop transitions, 4 changer transitions 0/201 dead transitions. [2025-03-04 06:55:54,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 201 transitions, 524 flow [2025-03-04 06:55:54,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:55:54,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:55:54,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1239 transitions. [2025-03-04 06:55:54,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8098039215686275 [2025-03-04 06:55:54,218 INFO L175 Difference]: Start difference. First operand has 206 places, 194 transitions, 434 flow. Second operand 6 states and 1239 transitions. [2025-03-04 06:55:54,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 201 transitions, 524 flow [2025-03-04 06:55:54,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 201 transitions, 517 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 06:55:54,223 INFO L231 Difference]: Finished difference. Result has 206 places, 193 transitions, 433 flow [2025-03-04 06:55:54,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=433, PETRI_PLACES=206, PETRI_TRANSITIONS=193} [2025-03-04 06:55:54,224 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -32 predicate places. [2025-03-04 06:55:54,224 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 193 transitions, 433 flow [2025-03-04 06:55:54,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 203.5) internal successors, (1221), 6 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:54,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:54,225 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:54,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:55:54,225 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-03-04 06:55:54,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:54,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1547013018, now seen corresponding path program 1 times [2025-03-04 06:55:54,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:54,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875762269] [2025-03-04 06:55:54,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:54,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:54,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 06:55:54,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 06:55:54,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:54,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:54,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:54,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:54,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875762269] [2025-03-04 06:55:54,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875762269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:54,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:54,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:54,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637646161] [2025-03-04 06:55:54,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:54,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:54,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:54,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:54,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:54,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 255 [2025-03-04 06:55:54,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 193 transitions, 433 flow. Second operand has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:54,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:54,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 255 [2025-03-04 06:55:54,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:54,381 INFO L124 PetriNetUnfolderBase]: 40/360 cut-off events. [2025-03-04 06:55:54,382 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-03-04 06:55:54,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 360 events. 40/360 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1015 event pairs, 26 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 472. Up to 69 conditions per place. [2025-03-04 06:55:54,384 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 18 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2025-03-04 06:55:54,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 194 transitions, 477 flow [2025-03-04 06:55:54,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:54,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:54,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2025-03-04 06:55:54,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8444444444444444 [2025-03-04 06:55:54,386 INFO L175 Difference]: Start difference. First operand has 206 places, 193 transitions, 433 flow. Second operand 3 states and 646 transitions. [2025-03-04 06:55:54,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 194 transitions, 477 flow [2025-03-04 06:55:54,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 194 transitions, 470 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 06:55:54,390 INFO L231 Difference]: Finished difference. Result has 203 places, 192 transitions, 428 flow [2025-03-04 06:55:54,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=428, PETRI_PLACES=203, PETRI_TRANSITIONS=192} [2025-03-04 06:55:54,391 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -35 predicate places. [2025-03-04 06:55:54,391 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 192 transitions, 428 flow [2025-03-04 06:55:54,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:54,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:54,392 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:54,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:55:54,392 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-03-04 06:55:54,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:54,393 INFO L85 PathProgramCache]: Analyzing trace with hash 99959271, now seen corresponding path program 1 times [2025-03-04 06:55:54,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:54,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679697180] [2025-03-04 06:55:54,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:54,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:54,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 06:55:54,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 06:55:54,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:54,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:54,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:54,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:54,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679697180] [2025-03-04 06:55:54,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679697180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:54,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:54,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:54,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181878825] [2025-03-04 06:55:54,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:54,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:54,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:54,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:54,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:54,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 255 [2025-03-04 06:55:54,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 192 transitions, 428 flow. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:54,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:54,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 255 [2025-03-04 06:55:54,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:54,511 INFO L124 PetriNetUnfolderBase]: 34/346 cut-off events. [2025-03-04 06:55:54,512 INFO L125 PetriNetUnfolderBase]: For 57/58 co-relation queries the response was YES. [2025-03-04 06:55:54,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498 conditions, 346 events. 34/346 cut-off events. For 57/58 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 942 event pairs, 24 based on Foata normal form. 1/329 useless extension candidates. Maximal degree in co-relation 461. Up to 63 conditions per place. [2025-03-04 06:55:54,513 INFO L140 encePairwiseOnDemand]: 253/255 looper letters, 0 selfloop transitions, 0 changer transitions 191/191 dead transitions. [2025-03-04 06:55:54,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 191 transitions, 456 flow [2025-03-04 06:55:54,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:54,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:54,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 647 transitions. [2025-03-04 06:55:54,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8457516339869281 [2025-03-04 06:55:54,514 INFO L175 Difference]: Start difference. First operand has 203 places, 192 transitions, 428 flow. Second operand 3 states and 647 transitions. [2025-03-04 06:55:54,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 191 transitions, 456 flow [2025-03-04 06:55:54,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 191 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:54,516 INFO L231 Difference]: Finished difference. Result has 202 places, 0 transitions, 0 flow [2025-03-04 06:55:54,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=202, PETRI_TRANSITIONS=0} [2025-03-04 06:55:54,517 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -36 predicate places. [2025-03-04 06:55:54,517 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 0 transitions, 0 flow [2025-03-04 06:55:54,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:54,519 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (76 of 77 remaining) [2025-03-04 06:55:54,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (75 of 77 remaining) [2025-03-04 06:55:54,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (74 of 77 remaining) [2025-03-04 06:55:54,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (73 of 77 remaining) [2025-03-04 06:55:54,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (72 of 77 remaining) [2025-03-04 06:55:54,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (71 of 77 remaining) [2025-03-04 06:55:54,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (70 of 77 remaining) [2025-03-04 06:55:54,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (69 of 77 remaining) [2025-03-04 06:55:54,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (68 of 77 remaining) [2025-03-04 06:55:54,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (67 of 77 remaining) [2025-03-04 06:55:54,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (66 of 77 remaining) [2025-03-04 06:55:54,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (65 of 77 remaining) [2025-03-04 06:55:54,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (64 of 77 remaining) [2025-03-04 06:55:54,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (63 of 77 remaining) [2025-03-04 06:55:54,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (62 of 77 remaining) [2025-03-04 06:55:54,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (61 of 77 remaining) [2025-03-04 06:55:54,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (60 of 77 remaining) [2025-03-04 06:55:54,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (59 of 77 remaining) [2025-03-04 06:55:54,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (58 of 77 remaining) [2025-03-04 06:55:54,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (57 of 77 remaining) [2025-03-04 06:55:54,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (56 of 77 remaining) [2025-03-04 06:55:54,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (55 of 77 remaining) [2025-03-04 06:55:54,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (54 of 77 remaining) [2025-03-04 06:55:54,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (53 of 77 remaining) [2025-03-04 06:55:54,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (52 of 77 remaining) [2025-03-04 06:55:54,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (51 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (50 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (49 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (48 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (47 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (46 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (45 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (44 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (43 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (42 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (41 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (40 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (38 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (37 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (36 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (31 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (30 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (29 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (28 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (27 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (26 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (25 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (24 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (23 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (21 of 77 remaining) [2025-03-04 06:55:54,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (20 of 77 remaining) [2025-03-04 06:55:54,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (19 of 77 remaining) [2025-03-04 06:55:54,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (18 of 77 remaining) [2025-03-04 06:55:54,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (17 of 77 remaining) [2025-03-04 06:55:54,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (16 of 77 remaining) [2025-03-04 06:55:54,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 77 remaining) [2025-03-04 06:55:54,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (14 of 77 remaining) [2025-03-04 06:55:54,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (13 of 77 remaining) [2025-03-04 06:55:54,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (12 of 77 remaining) [2025-03-04 06:55:54,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (11 of 77 remaining) [2025-03-04 06:55:54,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 77 remaining) [2025-03-04 06:55:54,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 77 remaining) [2025-03-04 06:55:54,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 77 remaining) [2025-03-04 06:55:54,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 77 remaining) [2025-03-04 06:55:54,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 77 remaining) [2025-03-04 06:55:54,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 77 remaining) [2025-03-04 06:55:54,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 77 remaining) [2025-03-04 06:55:54,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 77 remaining) [2025-03-04 06:55:54,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 77 remaining) [2025-03-04 06:55:54,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 77 remaining) [2025-03-04 06:55:54,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 77 remaining) [2025-03-04 06:55:54,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:55:54,523 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:54,529 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:55:54,529 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:55:54,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:55:54 BasicIcfg [2025-03-04 06:55:54,534 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:55:54,535 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:55:54,535 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:55:54,535 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:55:54,535 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:55:49" (3/4) ... [2025-03-04 06:55:54,537 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:55:54,539 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 06:55:54,539 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 06:55:54,539 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 06:55:54,542 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-03-04 06:55:54,543 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 06:55:54,543 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 06:55:54,543 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:55:54,596 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:55:54,596 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:55:54,596 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:55:54,596 INFO L158 Benchmark]: Toolchain (without parser) took 6323.57ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 123.6MB in the beginning and 241.9MB in the end (delta: -118.3MB). Peak memory consumption was 115.9MB. Max. memory is 16.1GB. [2025-03-04 06:55:54,597 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:55:54,597 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.06ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 110.7MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:55:54,597 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.56ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 108.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:55:54,597 INFO L158 Benchmark]: Boogie Preprocessor took 37.91ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 106.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:55:54,597 INFO L158 Benchmark]: IcfgBuilder took 738.56ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 49.0MB in the end (delta: 57.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-04 06:55:54,597 INFO L158 Benchmark]: TraceAbstraction took 5210.70ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 48.4MB in the beginning and 250.3MB in the end (delta: -201.9MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2025-03-04 06:55:54,598 INFO L158 Benchmark]: Witness Printer took 61.03ms. Allocated memory is still 402.7MB. Free memory was 250.3MB in the beginning and 241.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:55:54,601 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.32ms. Allocated memory is still 201.3MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.06ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 110.7MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.56ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 108.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.91ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 106.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 738.56ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 49.0MB in the end (delta: 57.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5210.70ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 48.4MB in the beginning and 250.3MB in the end (delta: -201.9MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. * Witness Printer took 61.03ms. Allocated memory is still 402.7MB. Free memory was 250.3MB in the beginning and 241.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: 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: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: 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: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 121]: 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: 109]: 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, 345 locations, 77 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: 5.1s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 460 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 251 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1014 IncrementalHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 56 mSDtfsCounter, 1014 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=488occurred in iteration=0, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1507 NumberOfCodeBlocks, 1507 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1490 ConstructedInterpolants, 0 QuantifiedInterpolants, 2105 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 42 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:55:54,614 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