./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/ldv-races/race-2_3-container_of.i --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/ldv-races/race-2_3-container_of.i -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 11cd6df53312b6388eb67fa3ddad4ddfe9675663ccf0a1507d8b60fd9abceccc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:40:09,614 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:40:09,671 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:40:09,677 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:40:09,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:40:09,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:40:09,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:40:09,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:40:09,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:40:09,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:40:09,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:40:09,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:40:09,703 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:40:09,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:40:09,704 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:40:09,704 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:40:09,704 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:40:09,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:40:09,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:40:09,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:40:09,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:40:09,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:40:09,704 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:40:09,704 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:40:09,704 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:40:09,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:40:09,704 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:40:09,704 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:40:09,704 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:40:09,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:40:09,704 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:40:09,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:40:09,705 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:40:09,705 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:40:09,705 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:40:09,705 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:40:09,705 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:40:09,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:40:09,705 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:40:09,705 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:40:09,705 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:40:09,705 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:40:09,705 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 -> 11cd6df53312b6388eb67fa3ddad4ddfe9675663ccf0a1507d8b60fd9abceccc [2025-03-04 06:40:09,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:40:09,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:40:09,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:40:09,966 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:40:09,967 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:40:09,968 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_3-container_of.i [2025-03-04 06:40:11,150 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea37167f4/99dbf0ef0436415bb3fc6f5ae54e1e8c/FLAG1ac27dd4f [2025-03-04 06:40:11,500 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:40:11,501 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_3-container_of.i [2025-03-04 06:40:11,530 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea37167f4/99dbf0ef0436415bb3fc6f5ae54e1e8c/FLAG1ac27dd4f [2025-03-04 06:40:11,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea37167f4/99dbf0ef0436415bb3fc6f5ae54e1e8c [2025-03-04 06:40:11,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:40:11,735 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:40:11,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:40:11,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:40:11,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:40:11,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:40:11" (1/1) ... [2025-03-04 06:40:11,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ba44762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:11, skipping insertion in model container [2025-03-04 06:40:11,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:40:11" (1/1) ... [2025-03-04 06:40:11,793 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:40:12,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:40:12,074 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:40:12,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:40:12,174 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:40:12,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:12 WrapperNode [2025-03-04 06:40:12,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:40:12,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:40:12,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:40:12,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:40:12,181 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:40:12" (1/1) ... [2025-03-04 06:40:12,196 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:40:12" (1/1) ... [2025-03-04 06:40:12,221 INFO L138 Inliner]: procedures = 248, calls = 56, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 238 [2025-03-04 06:40:12,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:40:12,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:40:12,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:40:12,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:40:12,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:12" (1/1) ... [2025-03-04 06:40:12,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:12" (1/1) ... [2025-03-04 06:40:12,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:12" (1/1) ... [2025-03-04 06:40:12,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:12" (1/1) ... [2025-03-04 06:40:12,263 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:12" (1/1) ... [2025-03-04 06:40:12,265 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:12" (1/1) ... [2025-03-04 06:40:12,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:12" (1/1) ... [2025-03-04 06:40:12,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:12" (1/1) ... [2025-03-04 06:40:12,273 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:40:12,273 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:40:12,274 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:40:12,274 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:40:12,275 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:12" (1/1) ... [2025-03-04 06:40:12,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:40:12,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:40:12,307 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:40:12,310 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:40:12,328 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-03-04 06:40:12,328 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-03-04 06:40:12,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 06:40:12,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:40:12,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:40:12,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 06:40:12,329 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:40:12,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:40:12,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:40:12,329 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:40:12,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:40:12,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 06:40:12,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:40:12,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:40:12,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:40:12,330 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:40:12,528 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:40:12,529 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:40:12,899 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:40:12,899 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:40:13,002 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:40:13,002 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:40:13,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:40:13 BoogieIcfgContainer [2025-03-04 06:40:13,003 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:40:13,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:40:13,005 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:40:13,010 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:40:13,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:40:11" (1/3) ... [2025-03-04 06:40:13,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e542166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:40:13, skipping insertion in model container [2025-03-04 06:40:13,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:12" (2/3) ... [2025-03-04 06:40:13,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e542166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:40:13, skipping insertion in model container [2025-03-04 06:40:13,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:40:13" (3/3) ... [2025-03-04 06:40:13,012 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_3-container_of.i [2025-03-04 06:40:13,028 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:40:13,030 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_3-container_of.i that has 2 procedures, 236 locations, 1 initial locations, 0 loop locations, and 19 error locations. [2025-03-04 06:40:13,030 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:40:13,101 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:40:13,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 267 transitions, 548 flow [2025-03-04 06:40:13,237 INFO L124 PetriNetUnfolderBase]: 14/351 cut-off events. [2025-03-04 06:40:13,238 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:40:13,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 351 events. 14/351 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 697 event pairs, 0 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 177. Up to 4 conditions per place. [2025-03-04 06:40:13,247 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 267 transitions, 548 flow [2025-03-04 06:40:13,253 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 261 places, 264 transitions, 540 flow [2025-03-04 06:40:13,262 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:40:13,274 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;@2107aa01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:40:13,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-03-04 06:40:13,285 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:40:13,286 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-03-04 06:40:13,286 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:40:13,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:13,286 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:40:13,288 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:40:13,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:13,292 INFO L85 PathProgramCache]: Analyzing trace with hash -300033484, now seen corresponding path program 1 times [2025-03-04 06:40:13,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:13,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196039145] [2025-03-04 06:40:13,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:13,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:13,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 06:40:13,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 06:40:13,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:13,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:14,052 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:40:14,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:14,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196039145] [2025-03-04 06:40:14,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196039145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:14,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:14,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:40:14,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914800573] [2025-03-04 06:40:14,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:14,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:40:14,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:14,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:40:14,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:40:14,320 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 267 [2025-03-04 06:40:14,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 264 transitions, 540 flow. Second operand has 6 states, 6 states have (on average 193.33333333333334) internal successors, (1160), 6 states have internal predecessors, (1160), 0 states have call successors, (0), 0 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:40:14,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:14,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 267 [2025-03-04 06:40:14,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:15,071 INFO L124 PetriNetUnfolderBase]: 1296/4266 cut-off events. [2025-03-04 06:40:15,072 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-04 06:40:15,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6425 conditions, 4266 events. 1296/4266 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 34792 event pairs, 1295 based on Foata normal form. 140/4116 useless extension candidates. Maximal degree in co-relation 6162. Up to 2130 conditions per place. [2025-03-04 06:40:15,109 INFO L140 encePairwiseOnDemand]: 243/267 looper letters, 47 selfloop transitions, 5 changer transitions 6/233 dead transitions. [2025-03-04 06:40:15,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 233 transitions, 582 flow [2025-03-04 06:40:15,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:40:15,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:40:15,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1223 transitions. [2025-03-04 06:40:15,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7634207240948814 [2025-03-04 06:40:15,130 INFO L175 Difference]: Start difference. First operand has 261 places, 264 transitions, 540 flow. Second operand 6 states and 1223 transitions. [2025-03-04 06:40:15,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 233 transitions, 582 flow [2025-03-04 06:40:15,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 233 transitions, 574 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 06:40:15,145 INFO L231 Difference]: Finished difference. Result has 239 places, 227 transitions, 468 flow [2025-03-04 06:40:15,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=468, PETRI_PLACES=239, PETRI_TRANSITIONS=227} [2025-03-04 06:40:15,149 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -22 predicate places. [2025-03-04 06:40:15,150 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 227 transitions, 468 flow [2025-03-04 06:40:15,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 193.33333333333334) internal successors, (1160), 6 states have internal predecessors, (1160), 0 states have call successors, (0), 0 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:40:15,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:15,151 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] [2025-03-04 06:40:15,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:40:15,151 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:40:15,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:15,152 INFO L85 PathProgramCache]: Analyzing trace with hash -783193940, now seen corresponding path program 1 times [2025-03-04 06:40:15,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:15,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039822681] [2025-03-04 06:40:15,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:15,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:15,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 06:40:15,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 06:40:15,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:15,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:15,527 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:40:15,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:15,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039822681] [2025-03-04 06:40:15,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039822681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:15,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:15,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:40:15,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920290711] [2025-03-04 06:40:15,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:15,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:40:15,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:15,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:40:15,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:40:15,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 267 [2025-03-04 06:40:15,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 227 transitions, 468 flow. Second operand has 6 states, 6 states have (on average 193.33333333333334) internal successors, (1160), 6 states have internal predecessors, (1160), 0 states have call successors, (0), 0 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:40:15,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:15,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 267 [2025-03-04 06:40:15,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:16,233 INFO L124 PetriNetUnfolderBase]: 1296/4259 cut-off events. [2025-03-04 06:40:16,234 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 06:40:16,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6408 conditions, 4259 events. 1296/4259 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 34809 event pairs, 1295 based on Foata normal form. 0/3972 useless extension candidates. Maximal degree in co-relation 6365. Up to 2130 conditions per place. [2025-03-04 06:40:16,260 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 47 selfloop transitions, 5 changer transitions 0/226 dead transitions. [2025-03-04 06:40:16,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 226 transitions, 570 flow [2025-03-04 06:40:16,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:40:16,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:40:16,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1205 transitions. [2025-03-04 06:40:16,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7521847690387016 [2025-03-04 06:40:16,263 INFO L175 Difference]: Start difference. First operand has 239 places, 227 transitions, 468 flow. Second operand 6 states and 1205 transitions. [2025-03-04 06:40:16,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 226 transitions, 570 flow [2025-03-04 06:40:16,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 226 transitions, 560 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:40:16,274 INFO L231 Difference]: Finished difference. Result has 232 places, 226 transitions, 466 flow [2025-03-04 06:40:16,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=466, PETRI_PLACES=232, PETRI_TRANSITIONS=226} [2025-03-04 06:40:16,275 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -29 predicate places. [2025-03-04 06:40:16,275 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 226 transitions, 466 flow [2025-03-04 06:40:16,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 193.33333333333334) internal successors, (1160), 6 states have internal predecessors, (1160), 0 states have call successors, (0), 0 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:40:16,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:16,276 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] [2025-03-04 06:40:16,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:40:16,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:40:16,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:16,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1508907364, now seen corresponding path program 1 times [2025-03-04 06:40:16,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:16,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983681238] [2025-03-04 06:40:16,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:16,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:16,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 06:40:16,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 06:40:16,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:16,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:16,361 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:40:16,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:16,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983681238] [2025-03-04 06:40:16,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983681238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:16,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:16,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:16,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140598555] [2025-03-04 06:40:16,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:16,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:16,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:16,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:16,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:16,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 267 [2025-03-04 06:40:16,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 226 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 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:40:16,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:16,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 267 [2025-03-04 06:40:16,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:16,614 INFO L124 PetriNetUnfolderBase]: 401/2397 cut-off events. [2025-03-04 06:40:16,615 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 06:40:16,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3089 conditions, 2397 events. 401/2397 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 18539 event pairs, 395 based on Foata normal form. 0/2210 useless extension candidates. Maximal degree in co-relation 3039. Up to 670 conditions per place. [2025-03-04 06:40:16,624 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 28 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2025-03-04 06:40:16,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 230 transitions, 534 flow [2025-03-04 06:40:16,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:16,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:16,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 688 transitions. [2025-03-04 06:40:16,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8589263420724095 [2025-03-04 06:40:16,627 INFO L175 Difference]: Start difference. First operand has 232 places, 226 transitions, 466 flow. Second operand 3 states and 688 transitions. [2025-03-04 06:40:16,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 230 transitions, 534 flow [2025-03-04 06:40:16,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 230 transitions, 524 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:40:16,630 INFO L231 Difference]: Finished difference. Result has 228 places, 225 transitions, 458 flow [2025-03-04 06:40:16,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=228, PETRI_TRANSITIONS=225} [2025-03-04 06:40:16,631 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -33 predicate places. [2025-03-04 06:40:16,631 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 225 transitions, 458 flow [2025-03-04 06:40:16,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 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:40:16,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:16,632 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] [2025-03-04 06:40:16,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:40:16,632 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:40:16,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:16,633 INFO L85 PathProgramCache]: Analyzing trace with hash -998731542, now seen corresponding path program 1 times [2025-03-04 06:40:16,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:16,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475343396] [2025-03-04 06:40:16,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:16,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:16,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 06:40:16,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 06:40:16,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:16,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:40:16,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:16,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475343396] [2025-03-04 06:40:16,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475343396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:16,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:16,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:16,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471739392] [2025-03-04 06:40:16,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:16,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:16,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:16,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:16,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:16,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 267 [2025-03-04 06:40:16,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 225 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 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:40:16,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:16,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 267 [2025-03-04 06:40:16,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:16,952 INFO L124 PetriNetUnfolderBase]: 395/2386 cut-off events. [2025-03-04 06:40:16,952 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:40:16,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3061 conditions, 2386 events. 395/2386 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 17620 event pairs, 270 based on Foata normal form. 0/2214 useless extension candidates. Maximal degree in co-relation 2919. Up to 458 conditions per place. [2025-03-04 06:40:16,960 INFO L140 encePairwiseOnDemand]: 265/267 looper letters, 30 selfloop transitions, 1 changer transitions 0/234 dead transitions. [2025-03-04 06:40:16,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 234 transitions, 538 flow [2025-03-04 06:40:16,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:16,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:16,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2025-03-04 06:40:16,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8751560549313359 [2025-03-04 06:40:16,962 INFO L175 Difference]: Start difference. First operand has 228 places, 225 transitions, 458 flow. Second operand 3 states and 701 transitions. [2025-03-04 06:40:16,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 234 transitions, 538 flow [2025-03-04 06:40:16,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 234 transitions, 534 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:16,965 INFO L231 Difference]: Finished difference. Result has 227 places, 224 transitions, 454 flow [2025-03-04 06:40:16,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=227, PETRI_TRANSITIONS=224} [2025-03-04 06:40:16,966 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -34 predicate places. [2025-03-04 06:40:16,966 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 224 transitions, 454 flow [2025-03-04 06:40:16,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 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:40:16,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:16,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] [2025-03-04 06:40:16,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:40:16,967 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:40:16,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:16,968 INFO L85 PathProgramCache]: Analyzing trace with hash -12269455, now seen corresponding path program 1 times [2025-03-04 06:40:16,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:16,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295781353] [2025-03-04 06:40:16,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:16,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:16,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 06:40:16,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 06:40:16,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:16,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:17,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:40:17,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:17,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295781353] [2025-03-04 06:40:17,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295781353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:17,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:17,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:17,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051379652] [2025-03-04 06:40:17,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:17,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:17,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:17,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:17,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:17,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 267 [2025-03-04 06:40:17,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 224 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 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:40:17,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:17,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 267 [2025-03-04 06:40:17,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:17,452 INFO L124 PetriNetUnfolderBase]: 415/3786 cut-off events. [2025-03-04 06:40:17,452 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 06:40:17,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4539 conditions, 3786 events. 415/3786 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 34138 event pairs, 160 based on Foata normal form. 0/3488 useless extension candidates. Maximal degree in co-relation 4260. Up to 619 conditions per place. [2025-03-04 06:40:17,478 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 33 selfloop transitions, 2 changer transitions 0/233 dead transitions. [2025-03-04 06:40:17,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 233 transitions, 542 flow [2025-03-04 06:40:17,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:17,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:17,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 693 transitions. [2025-03-04 06:40:17,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8651685393258427 [2025-03-04 06:40:17,481 INFO L175 Difference]: Start difference. First operand has 227 places, 224 transitions, 454 flow. Second operand 3 states and 693 transitions. [2025-03-04 06:40:17,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 233 transitions, 542 flow [2025-03-04 06:40:17,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 233 transitions, 541 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:40:17,490 INFO L231 Difference]: Finished difference. Result has 227 places, 223 transitions, 455 flow [2025-03-04 06:40:17,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=455, PETRI_PLACES=227, PETRI_TRANSITIONS=223} [2025-03-04 06:40:17,491 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -34 predicate places. [2025-03-04 06:40:17,493 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 223 transitions, 455 flow [2025-03-04 06:40:17,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 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:40:17,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:17,494 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] [2025-03-04 06:40:17,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:40:17,495 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:40:17,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:17,495 INFO L85 PathProgramCache]: Analyzing trace with hash 691125164, now seen corresponding path program 1 times [2025-03-04 06:40:17,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:17,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792528139] [2025-03-04 06:40:17,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:17,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:17,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 06:40:17,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 06:40:17,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:17,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:17,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:40:17,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:17,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792528139] [2025-03-04 06:40:17,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792528139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:17,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:17,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:40:17,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880955704] [2025-03-04 06:40:17,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:17,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:40:17,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:17,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:40:17,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:40:18,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 267 [2025-03-04 06:40:18,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 223 transitions, 455 flow. Second operand has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 0 states have call successors, (0), 0 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:40:18,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:18,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 267 [2025-03-04 06:40:18,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:18,696 INFO L124 PetriNetUnfolderBase]: 1487/4669 cut-off events. [2025-03-04 06:40:18,697 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 06:40:18,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7157 conditions, 4669 events. 1487/4669 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 37133 event pairs, 1027 based on Foata normal form. 0/4435 useless extension candidates. Maximal degree in co-relation 6952. Up to 2116 conditions per place. [2025-03-04 06:40:18,723 INFO L140 encePairwiseOnDemand]: 254/267 looper letters, 61 selfloop transitions, 30 changer transitions 7/268 dead transitions. [2025-03-04 06:40:18,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 268 transitions, 733 flow [2025-03-04 06:40:18,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:40:18,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:40:18,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1271 transitions. [2025-03-04 06:40:18,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7933832709113608 [2025-03-04 06:40:18,727 INFO L175 Difference]: Start difference. First operand has 227 places, 223 transitions, 455 flow. Second operand 6 states and 1271 transitions. [2025-03-04 06:40:18,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 268 transitions, 733 flow [2025-03-04 06:40:18,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 268 transitions, 729 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:18,734 INFO L231 Difference]: Finished difference. Result has 235 places, 245 transitions, 639 flow [2025-03-04 06:40:18,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=639, PETRI_PLACES=235, PETRI_TRANSITIONS=245} [2025-03-04 06:40:18,735 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -26 predicate places. [2025-03-04 06:40:18,735 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 245 transitions, 639 flow [2025-03-04 06:40:18,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 0 states have call successors, (0), 0 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:40:18,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:18,736 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:40:18,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:40:18,736 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:40:18,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:18,738 INFO L85 PathProgramCache]: Analyzing trace with hash 46565779, now seen corresponding path program 1 times [2025-03-04 06:40:18,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:18,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777008517] [2025-03-04 06:40:18,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:18,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:18,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 06:40:18,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 06:40:18,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:18,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:19,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:40:19,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:19,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777008517] [2025-03-04 06:40:19,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777008517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:19,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:19,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:40:19,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839952532] [2025-03-04 06:40:19,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:19,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:40:19,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:19,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:40:19,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:40:19,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 267 [2025-03-04 06:40:19,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 245 transitions, 639 flow. Second operand has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 0 states have call successors, (0), 0 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:40:19,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:19,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 267 [2025-03-04 06:40:19,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:20,131 INFO L124 PetriNetUnfolderBase]: 1749/4697 cut-off events. [2025-03-04 06:40:20,132 INFO L125 PetriNetUnfolderBase]: For 1107/1107 co-relation queries the response was YES. [2025-03-04 06:40:20,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9267 conditions, 4697 events. 1749/4697 cut-off events. For 1107/1107 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 35748 event pairs, 1009 based on Foata normal form. 0/4511 useless extension candidates. Maximal degree in co-relation 3122. Up to 2310 conditions per place. [2025-03-04 06:40:20,151 INFO L140 encePairwiseOnDemand]: 254/267 looper letters, 84 selfloop transitions, 30 changer transitions 11/290 dead transitions. [2025-03-04 06:40:20,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 290 transitions, 1007 flow [2025-03-04 06:40:20,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:40:20,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:40:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1268 transitions. [2025-03-04 06:40:20,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7915106117353309 [2025-03-04 06:40:20,154 INFO L175 Difference]: Start difference. First operand has 235 places, 245 transitions, 639 flow. Second operand 6 states and 1268 transitions. [2025-03-04 06:40:20,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 290 transitions, 1007 flow [2025-03-04 06:40:20,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 290 transitions, 1007 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:40:20,161 INFO L231 Difference]: Finished difference. Result has 238 places, 263 transitions, 867 flow [2025-03-04 06:40:20,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=867, PETRI_PLACES=238, PETRI_TRANSITIONS=263} [2025-03-04 06:40:20,162 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -23 predicate places. [2025-03-04 06:40:20,162 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 263 transitions, 867 flow [2025-03-04 06:40:20,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 0 states have call successors, (0), 0 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:40:20,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:20,163 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:40:20,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:40:20,163 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:40:20,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:20,164 INFO L85 PathProgramCache]: Analyzing trace with hash -814273865, now seen corresponding path program 1 times [2025-03-04 06:40:20,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:20,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146198029] [2025-03-04 06:40:20,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:20,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:20,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 06:40:20,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 06:40:20,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:20,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:20,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:40:20,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:20,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146198029] [2025-03-04 06:40:20,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146198029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:20,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:20,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:40:20,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298746362] [2025-03-04 06:40:20,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:20,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:40:20,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:20,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:40:20,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:40:20,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 267 [2025-03-04 06:40:20,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 263 transitions, 867 flow. Second operand has 6 states, 6 states have (on average 200.33333333333334) internal successors, (1202), 6 states have internal predecessors, (1202), 0 states have call successors, (0), 0 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:40:20,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:20,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 267 [2025-03-04 06:40:20,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:21,491 INFO L124 PetriNetUnfolderBase]: 1891/5028 cut-off events. [2025-03-04 06:40:21,491 INFO L125 PetriNetUnfolderBase]: For 2754/2802 co-relation queries the response was YES. [2025-03-04 06:40:21,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11859 conditions, 5028 events. 1891/5028 cut-off events. For 2754/2802 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 39749 event pairs, 879 based on Foata normal form. 0/4888 useless extension candidates. Maximal degree in co-relation 7077. Up to 2453 conditions per place. [2025-03-04 06:40:21,519 INFO L140 encePairwiseOnDemand]: 251/267 looper letters, 115 selfloop transitions, 26 changer transitions 0/307 dead transitions. [2025-03-04 06:40:21,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 307 transitions, 1337 flow [2025-03-04 06:40:21,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:40:21,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:40:21,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1273 transitions. [2025-03-04 06:40:21,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7946317103620475 [2025-03-04 06:40:21,522 INFO L175 Difference]: Start difference. First operand has 238 places, 263 transitions, 867 flow. Second operand 6 states and 1273 transitions. [2025-03-04 06:40:21,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 307 transitions, 1337 flow [2025-03-04 06:40:21,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 307 transitions, 1289 flow, removed 24 selfloop flow, removed 0 redundant places. [2025-03-04 06:40:21,533 INFO L231 Difference]: Finished difference. Result has 236 places, 283 transitions, 1051 flow [2025-03-04 06:40:21,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1051, PETRI_PLACES=236, PETRI_TRANSITIONS=283} [2025-03-04 06:40:21,534 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -25 predicate places. [2025-03-04 06:40:21,534 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 283 transitions, 1051 flow [2025-03-04 06:40:21,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.33333333333334) internal successors, (1202), 6 states have internal predecessors, (1202), 0 states have call successors, (0), 0 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:40:21,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:21,534 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:40:21,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:40:21,535 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:40:21,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:21,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1902430920, now seen corresponding path program 1 times [2025-03-04 06:40:21,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:21,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413628592] [2025-03-04 06:40:21,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:21,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:21,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 06:40:21,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 06:40:21,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:21,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:21,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:40:21,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:21,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413628592] [2025-03-04 06:40:21,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413628592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:21,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:21,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:40:21,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686241142] [2025-03-04 06:40:21,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:21,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:40:21,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:21,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:40:21,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:40:22,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 267 [2025-03-04 06:40:22,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 283 transitions, 1051 flow. Second operand has 6 states, 6 states have (on average 200.33333333333334) internal successors, (1202), 6 states have internal predecessors, (1202), 0 states have call successors, (0), 0 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:40:22,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:22,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 267 [2025-03-04 06:40:22,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:22,915 INFO L124 PetriNetUnfolderBase]: 2271/5545 cut-off events. [2025-03-04 06:40:22,915 INFO L125 PetriNetUnfolderBase]: For 5574/5746 co-relation queries the response was YES. [2025-03-04 06:40:22,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14870 conditions, 5545 events. 2271/5545 cut-off events. For 5574/5746 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 42600 event pairs, 975 based on Foata normal form. 70/5462 useless extension candidates. Maximal degree in co-relation 9529. Up to 2837 conditions per place. [2025-03-04 06:40:22,947 INFO L140 encePairwiseOnDemand]: 252/267 looper letters, 128 selfloop transitions, 36 changer transitions 37/342 dead transitions. [2025-03-04 06:40:22,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 342 transitions, 1771 flow [2025-03-04 06:40:22,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:40:22,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:40:22,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1271 transitions. [2025-03-04 06:40:22,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7933832709113608 [2025-03-04 06:40:22,950 INFO L175 Difference]: Start difference. First operand has 236 places, 283 transitions, 1051 flow. Second operand 6 states and 1271 transitions. [2025-03-04 06:40:22,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 342 transitions, 1771 flow [2025-03-04 06:40:22,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 342 transitions, 1771 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:40:22,962 INFO L231 Difference]: Finished difference. Result has 244 places, 281 transitions, 1383 flow [2025-03-04 06:40:22,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1383, PETRI_PLACES=244, PETRI_TRANSITIONS=281} [2025-03-04 06:40:22,963 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -17 predicate places. [2025-03-04 06:40:22,963 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 281 transitions, 1383 flow [2025-03-04 06:40:22,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.33333333333334) internal successors, (1202), 6 states have internal predecessors, (1202), 0 states have call successors, (0), 0 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:40:22,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:22,964 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:40:22,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:40:22,965 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:40:22,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:22,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1616832290, now seen corresponding path program 1 times [2025-03-04 06:40:22,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:22,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082895366] [2025-03-04 06:40:22,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:22,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:22,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 06:40:22,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 06:40:22,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:22,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:23,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:40:23,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:23,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082895366] [2025-03-04 06:40:23,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082895366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:23,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:23,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:40:23,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562673093] [2025-03-04 06:40:23,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:23,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:40:23,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:23,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:40:23,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:40:23,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 267 [2025-03-04 06:40:23,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 281 transitions, 1383 flow. Second operand has 5 states, 5 states have (on average 218.2) internal successors, (1091), 5 states have internal predecessors, (1091), 0 states have call successors, (0), 0 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:40:23,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:23,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 267 [2025-03-04 06:40:23,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:23,383 INFO L124 PetriNetUnfolderBase]: 575/1498 cut-off events. [2025-03-04 06:40:23,384 INFO L125 PetriNetUnfolderBase]: For 2243/2243 co-relation queries the response was YES. [2025-03-04 06:40:23,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3733 conditions, 1498 events. 575/1498 cut-off events. For 2243/2243 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9936 event pairs, 270 based on Foata normal form. 0/1488 useless extension candidates. Maximal degree in co-relation 3711. Up to 460 conditions per place. [2025-03-04 06:40:23,393 INFO L140 encePairwiseOnDemand]: 262/267 looper letters, 61 selfloop transitions, 4 changer transitions 0/164 dead transitions. [2025-03-04 06:40:23,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 164 transitions, 662 flow [2025-03-04 06:40:23,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:40:23,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:40:23,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1356 transitions. [2025-03-04 06:40:23,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.846441947565543 [2025-03-04 06:40:23,397 INFO L175 Difference]: Start difference. First operand has 244 places, 281 transitions, 1383 flow. Second operand 6 states and 1356 transitions. [2025-03-04 06:40:23,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 164 transitions, 662 flow [2025-03-04 06:40:23,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 164 transitions, 522 flow, removed 70 selfloop flow, removed 3 redundant places. [2025-03-04 06:40:23,402 INFO L231 Difference]: Finished difference. Result has 150 places, 124 transitions, 272 flow [2025-03-04 06:40:23,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=272, PETRI_PLACES=150, PETRI_TRANSITIONS=124} [2025-03-04 06:40:23,404 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -111 predicate places. [2025-03-04 06:40:23,404 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 124 transitions, 272 flow [2025-03-04 06:40:23,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 218.2) internal successors, (1091), 5 states have internal predecessors, (1091), 0 states have call successors, (0), 0 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:40:23,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:23,406 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] [2025-03-04 06:40:23,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:40:23,406 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:40:23,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:23,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1226107979, now seen corresponding path program 1 times [2025-03-04 06:40:23,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:23,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147259826] [2025-03-04 06:40:23,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:23,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:23,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 06:40:23,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 06:40:23,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:23,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:40:23,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:23,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147259826] [2025-03-04 06:40:23,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147259826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:23,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:23,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:23,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751045545] [2025-03-04 06:40:23,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:23,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:23,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:23,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:23,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:23,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 267 [2025-03-04 06:40:23,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 124 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 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:40:23,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:23,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 267 [2025-03-04 06:40:23,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:23,611 INFO L124 PetriNetUnfolderBase]: 290/982 cut-off events. [2025-03-04 06:40:23,611 INFO L125 PetriNetUnfolderBase]: For 125/127 co-relation queries the response was YES. [2025-03-04 06:40:23,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1794 conditions, 982 events. 290/982 cut-off events. For 125/127 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5967 event pairs, 280 based on Foata normal form. 0/952 useless extension candidates. Maximal degree in co-relation 1774. Up to 479 conditions per place. [2025-03-04 06:40:23,615 INFO L140 encePairwiseOnDemand]: 265/267 looper letters, 0 selfloop transitions, 0 changer transitions 128/128 dead transitions. [2025-03-04 06:40:23,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 128 transitions, 336 flow [2025-03-04 06:40:23,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:23,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:23,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 695 transitions. [2025-03-04 06:40:23,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.867665418227216 [2025-03-04 06:40:23,617 INFO L175 Difference]: Start difference. First operand has 150 places, 124 transitions, 272 flow. Second operand 3 states and 695 transitions. [2025-03-04 06:40:23,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 128 transitions, 336 flow [2025-03-04 06:40:23,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 128 transitions, 329 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 06:40:23,619 INFO L231 Difference]: Finished difference. Result has 147 places, 0 transitions, 0 flow [2025-03-04 06:40:23,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=147, PETRI_TRANSITIONS=0} [2025-03-04 06:40:23,620 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -114 predicate places. [2025-03-04 06:40:23,620 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 0 transitions, 0 flow [2025-03-04 06:40:23,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 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:40:23,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (26 of 27 remaining) [2025-03-04 06:40:23,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2025-03-04 06:40:23,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2025-03-04 06:40:23,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2025-03-04 06:40:23,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2025-03-04 06:40:23,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2025-03-04 06:40:23,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining) [2025-03-04 06:40:23,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2025-03-04 06:40:23,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2025-03-04 06:40:23,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2025-03-04 06:40:23,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2025-03-04 06:40:23,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 27 remaining) [2025-03-04 06:40:23,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 27 remaining) [2025-03-04 06:40:23,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2025-03-04 06:40:23,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining) [2025-03-04 06:40:23,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining) [2025-03-04 06:40:23,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 27 remaining) [2025-03-04 06:40:23,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 27 remaining) [2025-03-04 06:40:23,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2025-03-04 06:40:23,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining) [2025-03-04 06:40:23,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining) [2025-03-04 06:40:23,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2025-03-04 06:40:23,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2025-03-04 06:40:23,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2025-03-04 06:40:23,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2025-03-04 06:40:23,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2025-03-04 06:40:23,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2025-03-04 06:40:23,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:40:23,625 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:40:23,629 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:40:23,629 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:40:23,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:40:23 BasicIcfg [2025-03-04 06:40:23,633 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:40:23,634 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:40:23,634 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:40:23,634 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:40:23,634 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:40:13" (3/4) ... [2025-03-04 06:40:23,636 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:40:23,638 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure my_callback [2025-03-04 06:40:23,643 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-03-04 06:40:23,644 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 06:40:23,644 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 06:40:23,644 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:40:23,722 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:40:23,722 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:40:23,723 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:40:23,723 INFO L158 Benchmark]: Toolchain (without parser) took 11988.02ms. Allocated memory was 142.6MB in the beginning and 738.2MB in the end (delta: 595.6MB). Free memory was 104.2MB in the beginning and 580.1MB in the end (delta: -475.9MB). Peak memory consumption was 117.0MB. Max. memory is 16.1GB. [2025-03-04 06:40:23,724 INFO L158 Benchmark]: CDTParser took 0.95ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:40:23,725 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.47ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 71.8MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 06:40:23,725 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.45ms. Allocated memory is still 142.6MB. Free memory was 71.8MB in the beginning and 68.2MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:40:23,725 INFO L158 Benchmark]: Boogie Preprocessor took 47.41ms. Allocated memory is still 142.6MB. Free memory was 68.2MB in the beginning and 65.3MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:40:23,725 INFO L158 Benchmark]: IcfgBuilder took 729.50ms. Allocated memory is still 142.6MB. Free memory was 65.3MB in the beginning and 81.4MB in the end (delta: -16.1MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2025-03-04 06:40:23,725 INFO L158 Benchmark]: TraceAbstraction took 10628.44ms. Allocated memory was 142.6MB in the beginning and 738.2MB in the end (delta: 595.6MB). Free memory was 80.7MB in the beginning and 588.5MB in the end (delta: -507.8MB). Peak memory consumption was 456.0MB. Max. memory is 16.1GB. [2025-03-04 06:40:23,726 INFO L158 Benchmark]: Witness Printer took 89.02ms. Allocated memory is still 738.2MB. Free memory was 588.5MB in the beginning and 580.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:40:23,728 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.95ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 438.47ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 71.8MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.45ms. Allocated memory is still 142.6MB. Free memory was 71.8MB in the beginning and 68.2MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.41ms. Allocated memory is still 142.6MB. Free memory was 68.2MB in the beginning and 65.3MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 729.50ms. Allocated memory is still 142.6MB. Free memory was 65.3MB in the beginning and 81.4MB in the end (delta: -16.1MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10628.44ms. Allocated memory was 142.6MB in the beginning and 738.2MB in the end (delta: 595.6MB). Free memory was 80.7MB in the beginning and 588.5MB in the end (delta: -507.8MB). Peak memory consumption was 456.0MB. Max. memory is 16.1GB. * Witness Printer took 89.02ms. Allocated memory is still 738.2MB. Free memory was 588.5MB in the beginning and 580.1MB 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: 3923]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3924]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3929]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3951]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3930]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3973]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3952]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3933]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3936]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3939]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3942]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3974]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3969]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3975]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3970]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3976]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3907]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3910]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3913]: 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 4 procedures, 280 locations, 27 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: 10.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1087 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 665 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 348 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2942 IncrementalHoareTripleChecker+Invalid, 3290 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 348 mSolverCounterUnsat, 72 mSDtfsCounter, 2942 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1383occurred in iteration=9, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 753 NumberOfCodeBlocks, 753 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 742 ConstructedInterpolants, 0 QuantifiedInterpolants, 1298 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 22/22 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 19 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:40:23,745 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