./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 10:59:13,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:59:13,378 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 10:59:13,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:59:13,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:59:13,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:59:13,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:59:13,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:59:13,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:59:13,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:59:13,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:59:13,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:59:13,412 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:59:13,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:59:13,413 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:59:13,413 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:59:13,413 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:59:13,413 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:59:13,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:59:13,413 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:59:13,413 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:59:13,413 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:59:13,413 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 10:59:13,413 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 10:59:13,413 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:59:13,413 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:59:13,413 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:59:13,413 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:59:13,414 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:59:13,414 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:59:13,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:59:13,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:59:13,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:59:13,414 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:59:13,414 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:59:13,414 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:59:13,414 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:59:13,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:59:13,414 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:59:13,414 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:59:13,414 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:59:13,414 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:59:13,414 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-17 10:59:13,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:59:13,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:59:13,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:59:13,669 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:59:13,669 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:59:13,670 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-17 10:59:14,923 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad326638/7d2b1731205f4e58ba77e6442e7bfc9f/FLAG1a41dc4a9 [2025-03-17 10:59:15,259 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:59:15,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_3-container_of.i [2025-03-17 10:59:15,291 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad326638/7d2b1731205f4e58ba77e6442e7bfc9f/FLAG1a41dc4a9 [2025-03-17 10:59:15,308 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad326638/7d2b1731205f4e58ba77e6442e7bfc9f [2025-03-17 10:59:15,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:59:15,312 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:59:15,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:59:15,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:59:15,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:59:15,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:59:15" (1/1) ... [2025-03-17 10:59:15,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74071be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:15, skipping insertion in model container [2025-03-17 10:59:15,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:59:15" (1/1) ... [2025-03-17 10:59:15,369 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:59:15,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:59:15,734 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:59:15,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:59:15,825 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:59:15,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:15 WrapperNode [2025-03-17 10:59:15,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:59:15,827 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:59:15,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:59:15,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:59:15,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:15" (1/1) ... [2025-03-17 10:59:15,852 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:15" (1/1) ... [2025-03-17 10:59:15,874 INFO L138 Inliner]: procedures = 248, calls = 56, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 238 [2025-03-17 10:59:15,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:59:15,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:59:15,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:59:15,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:59:15,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:15" (1/1) ... [2025-03-17 10:59:15,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:15" (1/1) ... [2025-03-17 10:59:15,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:15" (1/1) ... [2025-03-17 10:59:15,892 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:15" (1/1) ... [2025-03-17 10:59:15,908 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:15" (1/1) ... [2025-03-17 10:59:15,909 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:15" (1/1) ... [2025-03-17 10:59:15,914 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:15" (1/1) ... [2025-03-17 10:59:15,915 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:15" (1/1) ... [2025-03-17 10:59:15,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:59:15,919 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:59:15,919 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:59:15,919 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:59:15,920 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:15" (1/1) ... [2025-03-17 10:59:15,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:59:15,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:59:15,950 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-17 10:59:15,952 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-17 10:59:15,970 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-03-17 10:59:15,971 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-03-17 10:59:15,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 10:59:15,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 10:59:15,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:59:15,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 10:59:15,971 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 10:59:15,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 10:59:15,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 10:59:15,971 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 10:59:15,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:59:15,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 10:59:15,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 10:59:15,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:59:15,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:59:15,974 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 10:59:16,191 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:59:16,193 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:59:16,583 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 10:59:16,583 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:59:16,718 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:59:16,720 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 10:59:16,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:59:16 BoogieIcfgContainer [2025-03-17 10:59:16,720 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:59:16,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:59:16,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:59:16,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:59:16,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:59:15" (1/3) ... [2025-03-17 10:59:16,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a419998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:59:16, skipping insertion in model container [2025-03-17 10:59:16,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:15" (2/3) ... [2025-03-17 10:59:16,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a419998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:59:16, skipping insertion in model container [2025-03-17 10:59:16,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:59:16" (3/3) ... [2025-03-17 10:59:16,729 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_3-container_of.i [2025-03-17 10:59:16,742 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:59:16,743 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_3-container_of.i that has 2 procedures, 235 locations, 1 initial locations, 0 loop locations, and 19 error locations. [2025-03-17 10:59:16,743 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 10:59:16,814 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 10:59:16,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 262 places, 266 transitions, 546 flow [2025-03-17 10:59:16,937 INFO L124 PetriNetUnfolderBase]: 14/349 cut-off events. [2025-03-17 10:59:16,938 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 10:59:16,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 349 events. 14/349 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 692 event pairs, 0 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 176. Up to 4 conditions per place. [2025-03-17 10:59:16,948 INFO L82 GeneralOperation]: Start removeDead. Operand has 262 places, 266 transitions, 546 flow [2025-03-17 10:59:16,954 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 260 places, 263 transitions, 538 flow [2025-03-17 10:59:16,962 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:59:16,975 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;@7b456561, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:59:16,975 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-03-17 10:59:16,986 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:59:16,987 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-03-17 10:59:16,987 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:59:16,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:16,987 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-17 10:59:16,988 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-17 10:59:16,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:16,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1230415569, now seen corresponding path program 1 times [2025-03-17 10:59:16,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:16,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763980680] [2025-03-17 10:59:16,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:16,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:17,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 10:59:17,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 10:59:17,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:17,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:17,747 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-17 10:59:17,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:17,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763980680] [2025-03-17 10:59:17,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763980680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:17,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:17,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:17,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445488140] [2025-03-17 10:59:17,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:17,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:59:17,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:17,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:59:17,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:59:18,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 266 [2025-03-17 10:59:18,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 263 transitions, 538 flow. Second operand has 6 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 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-17 10:59:18,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:18,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 266 [2025-03-17 10:59:18,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:18,693 INFO L124 PetriNetUnfolderBase]: 1296/4247 cut-off events. [2025-03-17 10:59:18,693 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-17 10:59:18,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6406 conditions, 4247 events. 1296/4247 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 34813 event pairs, 1295 based on Foata normal form. 140/4097 useless extension candidates. Maximal degree in co-relation 6144. Up to 2130 conditions per place. [2025-03-17 10:59:18,721 INFO L140 encePairwiseOnDemand]: 242/266 looper letters, 47 selfloop transitions, 5 changer transitions 6/232 dead transitions. [2025-03-17 10:59:18,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 232 transitions, 580 flow [2025-03-17 10:59:18,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:18,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:18,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1217 transitions. [2025-03-17 10:59:18,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7625313283208021 [2025-03-17 10:59:18,735 INFO L175 Difference]: Start difference. First operand has 260 places, 263 transitions, 538 flow. Second operand 6 states and 1217 transitions. [2025-03-17 10:59:18,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 232 transitions, 580 flow [2025-03-17 10:59:18,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 232 transitions, 572 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 10:59:18,743 INFO L231 Difference]: Finished difference. Result has 238 places, 226 transitions, 466 flow [2025-03-17 10:59:18,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=466, PETRI_PLACES=238, PETRI_TRANSITIONS=226} [2025-03-17 10:59:18,747 INFO L279 CegarLoopForPetriNet]: 260 programPoint places, -22 predicate places. [2025-03-17 10:59:18,747 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 226 transitions, 466 flow [2025-03-17 10:59:18,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 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-17 10:59:18,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:18,748 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-17 10:59:18,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:59:18,748 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-17 10:59:18,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:18,749 INFO L85 PathProgramCache]: Analyzing trace with hash 312109221, now seen corresponding path program 1 times [2025-03-17 10:59:18,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:18,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140649314] [2025-03-17 10:59:18,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:18,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:18,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 10:59:18,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 10:59:18,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:18,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:19,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:59:19,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:19,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140649314] [2025-03-17 10:59:19,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140649314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:19,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:19,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:19,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969533303] [2025-03-17 10:59:19,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:19,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:59:19,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:19,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:59:19,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:59:19,413 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 266 [2025-03-17 10:59:19,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 226 transitions, 466 flow. Second operand has 6 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 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-17 10:59:19,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:19,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 266 [2025-03-17 10:59:19,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:19,874 INFO L124 PetriNetUnfolderBase]: 1296/4234 cut-off events. [2025-03-17 10:59:19,874 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 10:59:19,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6383 conditions, 4234 events. 1296/4234 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 34705 event pairs, 1295 based on Foata normal form. 0/3946 useless extension candidates. Maximal degree in co-relation 6340. Up to 2130 conditions per place. [2025-03-17 10:59:19,897 INFO L140 encePairwiseOnDemand]: 260/266 looper letters, 47 selfloop transitions, 5 changer transitions 0/225 dead transitions. [2025-03-17 10:59:19,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 225 transitions, 568 flow [2025-03-17 10:59:19,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:19,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:19,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1199 transitions. [2025-03-17 10:59:19,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7512531328320802 [2025-03-17 10:59:19,900 INFO L175 Difference]: Start difference. First operand has 238 places, 226 transitions, 466 flow. Second operand 6 states and 1199 transitions. [2025-03-17 10:59:19,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 225 transitions, 568 flow [2025-03-17 10:59:19,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 225 transitions, 558 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 10:59:19,904 INFO L231 Difference]: Finished difference. Result has 231 places, 225 transitions, 464 flow [2025-03-17 10:59:19,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=464, PETRI_PLACES=231, PETRI_TRANSITIONS=225} [2025-03-17 10:59:19,905 INFO L279 CegarLoopForPetriNet]: 260 programPoint places, -29 predicate places. [2025-03-17 10:59:19,905 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 225 transitions, 464 flow [2025-03-17 10:59:19,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 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-17 10:59:19,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:19,906 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-17 10:59:19,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:59:19,906 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-17 10:59:19,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:19,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1212369823, now seen corresponding path program 1 times [2025-03-17 10:59:19,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:19,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865681381] [2025-03-17 10:59:19,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:19,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:19,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 10:59:19,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 10:59:19,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:19,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:19,973 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-17 10:59:19,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:19,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865681381] [2025-03-17 10:59:19,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865681381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:19,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:19,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:19,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075228353] [2025-03-17 10:59:19,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:19,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:19,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:19,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:19,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:19,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 266 [2025-03-17 10:59:19,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 225 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 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-17 10:59:19,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:19,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 266 [2025-03-17 10:59:19,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:20,251 INFO L124 PetriNetUnfolderBase]: 401/2378 cut-off events. [2025-03-17 10:59:20,252 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 10:59:20,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3070 conditions, 2378 events. 401/2378 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 18407 event pairs, 395 based on Foata normal form. 0/2191 useless extension candidates. Maximal degree in co-relation 3020. Up to 670 conditions per place. [2025-03-17 10:59:20,264 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 28 selfloop transitions, 2 changer transitions 0/229 dead transitions. [2025-03-17 10:59:20,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 229 transitions, 532 flow [2025-03-17 10:59:20,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:20,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:20,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 685 transitions. [2025-03-17 10:59:20,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8583959899749374 [2025-03-17 10:59:20,267 INFO L175 Difference]: Start difference. First operand has 231 places, 225 transitions, 464 flow. Second operand 3 states and 685 transitions. [2025-03-17 10:59:20,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 229 transitions, 532 flow [2025-03-17 10:59:20,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 229 transitions, 522 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 10:59:20,271 INFO L231 Difference]: Finished difference. Result has 227 places, 224 transitions, 456 flow [2025-03-17 10:59:20,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=227, PETRI_TRANSITIONS=224} [2025-03-17 10:59:20,272 INFO L279 CegarLoopForPetriNet]: 260 programPoint places, -33 predicate places. [2025-03-17 10:59:20,272 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 224 transitions, 456 flow [2025-03-17 10:59:20,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 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-17 10:59:20,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:20,272 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-17 10:59:20,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:59:20,273 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-17 10:59:20,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:20,273 INFO L85 PathProgramCache]: Analyzing trace with hash 936156706, now seen corresponding path program 1 times [2025-03-17 10:59:20,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:20,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813760376] [2025-03-17 10:59:20,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:20,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:20,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 10:59:20,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 10:59:20,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:20,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:20,337 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-17 10:59:20,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:20,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813760376] [2025-03-17 10:59:20,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813760376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:20,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:20,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:20,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931431684] [2025-03-17 10:59:20,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:20,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:20,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:20,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:20,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:20,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 266 [2025-03-17 10:59:20,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 224 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:59:20,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:20,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 266 [2025-03-17 10:59:20,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:20,642 INFO L124 PetriNetUnfolderBase]: 395/2366 cut-off events. [2025-03-17 10:59:20,643 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 10:59:20,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3041 conditions, 2366 events. 395/2366 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 17511 event pairs, 270 based on Foata normal form. 0/2194 useless extension candidates. Maximal degree in co-relation 2900. Up to 458 conditions per place. [2025-03-17 10:59:20,654 INFO L140 encePairwiseOnDemand]: 264/266 looper letters, 30 selfloop transitions, 1 changer transitions 0/233 dead transitions. [2025-03-17 10:59:20,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 233 transitions, 536 flow [2025-03-17 10:59:20,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:20,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:20,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 698 transitions. [2025-03-17 10:59:20,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.87468671679198 [2025-03-17 10:59:20,656 INFO L175 Difference]: Start difference. First operand has 227 places, 224 transitions, 456 flow. Second operand 3 states and 698 transitions. [2025-03-17 10:59:20,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 233 transitions, 536 flow [2025-03-17 10:59:20,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 233 transitions, 532 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:59:20,659 INFO L231 Difference]: Finished difference. Result has 226 places, 223 transitions, 452 flow [2025-03-17 10:59:20,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=226, PETRI_TRANSITIONS=223} [2025-03-17 10:59:20,660 INFO L279 CegarLoopForPetriNet]: 260 programPoint places, -34 predicate places. [2025-03-17 10:59:20,660 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 223 transitions, 452 flow [2025-03-17 10:59:20,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:59:20,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:20,661 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-17 10:59:20,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:59:20,661 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-17 10:59:20,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:20,662 INFO L85 PathProgramCache]: Analyzing trace with hash 2095740624, now seen corresponding path program 1 times [2025-03-17 10:59:20,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:20,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394502228] [2025-03-17 10:59:20,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:20,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:20,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 10:59:20,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 10:59:20,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:20,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:20,715 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 10:59:20,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:20,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394502228] [2025-03-17 10:59:20,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394502228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:20,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:20,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:20,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098163686] [2025-03-17 10:59:20,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:20,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:20,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:20,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:20,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:20,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 266 [2025-03-17 10:59:20,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 223 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:59:20,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:20,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 266 [2025-03-17 10:59:20,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:20,963 INFO L124 PetriNetUnfolderBase]: 415/2501 cut-off events. [2025-03-17 10:59:20,964 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 10:59:20,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3236 conditions, 2501 events. 415/2501 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 18685 event pairs, 345 based on Foata normal form. 0/2318 useless extension candidates. Maximal degree in co-relation 3018. Up to 619 conditions per place. [2025-03-17 10:59:20,979 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 33 selfloop transitions, 2 changer transitions 0/232 dead transitions. [2025-03-17 10:59:20,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 232 transitions, 540 flow [2025-03-17 10:59:20,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:20,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:20,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 690 transitions. [2025-03-17 10:59:20,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8646616541353384 [2025-03-17 10:59:20,982 INFO L175 Difference]: Start difference. First operand has 226 places, 223 transitions, 452 flow. Second operand 3 states and 690 transitions. [2025-03-17 10:59:20,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 232 transitions, 540 flow [2025-03-17 10:59:20,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 232 transitions, 539 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:59:20,988 INFO L231 Difference]: Finished difference. Result has 226 places, 222 transitions, 453 flow [2025-03-17 10:59:20,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=453, PETRI_PLACES=226, PETRI_TRANSITIONS=222} [2025-03-17 10:59:20,990 INFO L279 CegarLoopForPetriNet]: 260 programPoint places, -34 predicate places. [2025-03-17 10:59:20,990 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 222 transitions, 453 flow [2025-03-17 10:59:20,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:59:20,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:20,992 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-17 10:59:20,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:59:20,992 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-17 10:59:20,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:20,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1121577397, now seen corresponding path program 1 times [2025-03-17 10:59:20,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:20,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293258098] [2025-03-17 10:59:20,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:20,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:21,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 10:59:21,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 10:59:21,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:21,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:21,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 10:59:21,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:21,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293258098] [2025-03-17 10:59:21,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293258098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:21,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:21,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:21,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895978011] [2025-03-17 10:59:21,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:21,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:59:21,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:21,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:59:21,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:59:21,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 266 [2025-03-17 10:59:21,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 222 transitions, 453 flow. Second operand has 6 states, 6 states have (on average 197.66666666666666) internal successors, (1186), 6 states have internal predecessors, (1186), 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-17 10:59:21,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:21,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 266 [2025-03-17 10:59:21,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:22,307 INFO L124 PetriNetUnfolderBase]: 1487/4649 cut-off events. [2025-03-17 10:59:22,307 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 10:59:22,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7137 conditions, 4649 events. 1487/4649 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 37081 event pairs, 1027 based on Foata normal form. 0/4415 useless extension candidates. Maximal degree in co-relation 6933. Up to 2116 conditions per place. [2025-03-17 10:59:22,337 INFO L140 encePairwiseOnDemand]: 253/266 looper letters, 61 selfloop transitions, 30 changer transitions 7/267 dead transitions. [2025-03-17 10:59:22,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 267 transitions, 731 flow [2025-03-17 10:59:22,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:22,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:22,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1265 transitions. [2025-03-17 10:59:22,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7926065162907269 [2025-03-17 10:59:22,341 INFO L175 Difference]: Start difference. First operand has 226 places, 222 transitions, 453 flow. Second operand 6 states and 1265 transitions. [2025-03-17 10:59:22,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 267 transitions, 731 flow [2025-03-17 10:59:22,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 267 transitions, 727 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:59:22,348 INFO L231 Difference]: Finished difference. Result has 234 places, 244 transitions, 637 flow [2025-03-17 10:59:22,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=637, PETRI_PLACES=234, PETRI_TRANSITIONS=244} [2025-03-17 10:59:22,349 INFO L279 CegarLoopForPetriNet]: 260 programPoint places, -26 predicate places. [2025-03-17 10:59:22,349 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 244 transitions, 637 flow [2025-03-17 10:59:22,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.66666666666666) internal successors, (1186), 6 states have internal predecessors, (1186), 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-17 10:59:22,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:22,350 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:22,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:59:22,350 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-17 10:59:22,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:22,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1084606748, now seen corresponding path program 1 times [2025-03-17 10:59:22,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:22,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296475340] [2025-03-17 10:59:22,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:22,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:22,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-17 10:59:22,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 10:59:22,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:22,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:22,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 10:59:22,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:22,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296475340] [2025-03-17 10:59:22,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296475340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:22,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:22,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:22,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643768651] [2025-03-17 10:59:22,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:22,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:59:22,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:22,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:59:22,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:59:23,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 266 [2025-03-17 10:59:23,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 244 transitions, 637 flow. Second operand has 6 states, 6 states have (on average 197.66666666666666) internal successors, (1186), 6 states have internal predecessors, (1186), 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-17 10:59:23,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:23,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 266 [2025-03-17 10:59:23,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:23,512 INFO L124 PetriNetUnfolderBase]: 1749/4671 cut-off events. [2025-03-17 10:59:23,512 INFO L125 PetriNetUnfolderBase]: For 1107/1107 co-relation queries the response was YES. [2025-03-17 10:59:23,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9241 conditions, 4671 events. 1749/4671 cut-off events. For 1107/1107 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 35543 event pairs, 1009 based on Foata normal form. 0/4484 useless extension candidates. Maximal degree in co-relation 3096. Up to 2310 conditions per place. [2025-03-17 10:59:23,537 INFO L140 encePairwiseOnDemand]: 253/266 looper letters, 84 selfloop transitions, 30 changer transitions 11/289 dead transitions. [2025-03-17 10:59:23,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 289 transitions, 1005 flow [2025-03-17 10:59:23,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:23,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:23,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1262 transitions. [2025-03-17 10:59:23,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7907268170426065 [2025-03-17 10:59:23,541 INFO L175 Difference]: Start difference. First operand has 234 places, 244 transitions, 637 flow. Second operand 6 states and 1262 transitions. [2025-03-17 10:59:23,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 289 transitions, 1005 flow [2025-03-17 10:59:23,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 289 transitions, 1005 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:59:23,551 INFO L231 Difference]: Finished difference. Result has 237 places, 262 transitions, 865 flow [2025-03-17 10:59:23,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=865, PETRI_PLACES=237, PETRI_TRANSITIONS=262} [2025-03-17 10:59:23,553 INFO L279 CegarLoopForPetriNet]: 260 programPoint places, -23 predicate places. [2025-03-17 10:59:23,553 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 262 transitions, 865 flow [2025-03-17 10:59:23,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.66666666666666) internal successors, (1186), 6 states have internal predecessors, (1186), 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-17 10:59:23,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:23,554 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] [2025-03-17 10:59:23,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:59:23,554 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-17 10:59:23,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:23,555 INFO L85 PathProgramCache]: Analyzing trace with hash 655406631, now seen corresponding path program 1 times [2025-03-17 10:59:23,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:23,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440596510] [2025-03-17 10:59:23,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:23,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:23,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 10:59:23,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 10:59:23,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:23,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:23,897 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 10:59:23,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:23,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440596510] [2025-03-17 10:59:23,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440596510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:23,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:23,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:23,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95307499] [2025-03-17 10:59:23,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:23,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:59:23,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:23,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:59:23,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:59:24,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 266 [2025-03-17 10:59:24,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 262 transitions, 865 flow. Second operand has 6 states, 6 states have (on average 199.33333333333334) internal successors, (1196), 6 states have internal predecessors, (1196), 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-17 10:59:24,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:24,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 266 [2025-03-17 10:59:24,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:24,707 INFO L124 PetriNetUnfolderBase]: 1891/5002 cut-off events. [2025-03-17 10:59:24,708 INFO L125 PetriNetUnfolderBase]: For 2754/2802 co-relation queries the response was YES. [2025-03-17 10:59:24,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11833 conditions, 5002 events. 1891/5002 cut-off events. For 2754/2802 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 39588 event pairs, 879 based on Foata normal form. 0/4861 useless extension candidates. Maximal degree in co-relation 7051. Up to 2453 conditions per place. [2025-03-17 10:59:24,730 INFO L140 encePairwiseOnDemand]: 250/266 looper letters, 115 selfloop transitions, 26 changer transitions 0/306 dead transitions. [2025-03-17 10:59:24,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 306 transitions, 1335 flow [2025-03-17 10:59:24,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:24,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:24,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1267 transitions. [2025-03-17 10:59:24,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.793859649122807 [2025-03-17 10:59:24,734 INFO L175 Difference]: Start difference. First operand has 237 places, 262 transitions, 865 flow. Second operand 6 states and 1267 transitions. [2025-03-17 10:59:24,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 306 transitions, 1335 flow [2025-03-17 10:59:24,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 306 transitions, 1287 flow, removed 24 selfloop flow, removed 0 redundant places. [2025-03-17 10:59:24,747 INFO L231 Difference]: Finished difference. Result has 235 places, 282 transitions, 1049 flow [2025-03-17 10:59:24,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1049, PETRI_PLACES=235, PETRI_TRANSITIONS=282} [2025-03-17 10:59:24,749 INFO L279 CegarLoopForPetriNet]: 260 programPoint places, -25 predicate places. [2025-03-17 10:59:24,750 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 282 transitions, 1049 flow [2025-03-17 10:59:24,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 199.33333333333334) internal successors, (1196), 6 states have internal predecessors, (1196), 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-17 10:59:24,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:24,751 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:24,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 10:59:24,751 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-17 10:59:24,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:24,752 INFO L85 PathProgramCache]: Analyzing trace with hash 972828038, now seen corresponding path program 1 times [2025-03-17 10:59:24,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:24,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125237993] [2025-03-17 10:59:24,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:24,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:24,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 10:59:24,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 10:59:24,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:24,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:25,103 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 10:59:25,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:25,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125237993] [2025-03-17 10:59:25,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125237993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:25,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:25,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:25,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350414372] [2025-03-17 10:59:25,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:25,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:59:25,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:25,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:59:25,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:59:25,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 266 [2025-03-17 10:59:25,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 282 transitions, 1049 flow. Second operand has 6 states, 6 states have (on average 199.33333333333334) internal successors, (1196), 6 states have internal predecessors, (1196), 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-17 10:59:25,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:25,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 266 [2025-03-17 10:59:25,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:26,009 INFO L124 PetriNetUnfolderBase]: 2271/5519 cut-off events. [2025-03-17 10:59:26,009 INFO L125 PetriNetUnfolderBase]: For 5622/5794 co-relation queries the response was YES. [2025-03-17 10:59:26,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14844 conditions, 5519 events. 2271/5519 cut-off events. For 5622/5794 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 42442 event pairs, 975 based on Foata normal form. 70/5435 useless extension candidates. Maximal degree in co-relation 9504. Up to 2837 conditions per place. [2025-03-17 10:59:26,045 INFO L140 encePairwiseOnDemand]: 251/266 looper letters, 128 selfloop transitions, 36 changer transitions 37/341 dead transitions. [2025-03-17 10:59:26,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 341 transitions, 1769 flow [2025-03-17 10:59:26,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:26,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1265 transitions. [2025-03-17 10:59:26,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7926065162907269 [2025-03-17 10:59:26,048 INFO L175 Difference]: Start difference. First operand has 235 places, 282 transitions, 1049 flow. Second operand 6 states and 1265 transitions. [2025-03-17 10:59:26,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 341 transitions, 1769 flow [2025-03-17 10:59:26,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 341 transitions, 1769 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:59:26,059 INFO L231 Difference]: Finished difference. Result has 243 places, 280 transitions, 1381 flow [2025-03-17 10:59:26,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=1047, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1381, PETRI_PLACES=243, PETRI_TRANSITIONS=280} [2025-03-17 10:59:26,060 INFO L279 CegarLoopForPetriNet]: 260 programPoint places, -17 predicate places. [2025-03-17 10:59:26,060 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 280 transitions, 1381 flow [2025-03-17 10:59:26,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 199.33333333333334) internal successors, (1196), 6 states have internal predecessors, (1196), 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-17 10:59:26,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:26,061 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] [2025-03-17 10:59:26,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 10:59:26,061 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-17 10:59:26,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:26,062 INFO L85 PathProgramCache]: Analyzing trace with hash 909171575, now seen corresponding path program 1 times [2025-03-17 10:59:26,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:26,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488054359] [2025-03-17 10:59:26,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:26,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:26,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 10:59:26,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 10:59:26,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:26,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:26,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 10:59:26,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:26,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488054359] [2025-03-17 10:59:26,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488054359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:26,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:26,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:26,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697723003] [2025-03-17 10:59:26,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:26,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:59:26,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:26,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:59:26,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:59:26,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 266 [2025-03-17 10:59:26,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 280 transitions, 1381 flow. Second operand has 5 states, 5 states have (on average 217.2) internal successors, (1086), 5 states have internal predecessors, (1086), 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-17 10:59:26,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:26,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 266 [2025-03-17 10:59:26,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:26,495 INFO L124 PetriNetUnfolderBase]: 575/1492 cut-off events. [2025-03-17 10:59:26,495 INFO L125 PetriNetUnfolderBase]: For 2243/2243 co-relation queries the response was YES. [2025-03-17 10:59:26,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3727 conditions, 1492 events. 575/1492 cut-off events. For 2243/2243 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9810 event pairs, 270 based on Foata normal form. 0/1481 useless extension candidates. Maximal degree in co-relation 3705. Up to 460 conditions per place. [2025-03-17 10:59:26,503 INFO L140 encePairwiseOnDemand]: 261/266 looper letters, 61 selfloop transitions, 4 changer transitions 0/164 dead transitions. [2025-03-17 10:59:26,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 164 transitions, 662 flow [2025-03-17 10:59:26,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:26,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1350 transitions. [2025-03-17 10:59:26,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8458646616541353 [2025-03-17 10:59:26,506 INFO L175 Difference]: Start difference. First operand has 243 places, 280 transitions, 1381 flow. Second operand 6 states and 1350 transitions. [2025-03-17 10:59:26,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 164 transitions, 662 flow [2025-03-17 10:59:26,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 164 transitions, 522 flow, removed 70 selfloop flow, removed 3 redundant places. [2025-03-17 10:59:26,510 INFO L231 Difference]: Finished difference. Result has 150 places, 124 transitions, 272 flow [2025-03-17 10:59:26,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, 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-17 10:59:26,511 INFO L279 CegarLoopForPetriNet]: 260 programPoint places, -110 predicate places. [2025-03-17 10:59:26,511 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 124 transitions, 272 flow [2025-03-17 10:59:26,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 217.2) internal successors, (1086), 5 states have internal predecessors, (1086), 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-17 10:59:26,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:26,512 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-17 10:59:26,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 10:59:26,512 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-17 10:59:26,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:26,513 INFO L85 PathProgramCache]: Analyzing trace with hash 876870706, now seen corresponding path program 1 times [2025-03-17 10:59:26,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:26,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848953159] [2025-03-17 10:59:26,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:26,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:26,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 10:59:26,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 10:59:26,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:26,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 10:59:26,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:26,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848953159] [2025-03-17 10:59:26,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848953159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:26,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:26,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:26,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661361931] [2025-03-17 10:59:26,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:26,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:26,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:26,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:26,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:26,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 266 [2025-03-17 10:59:26,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 124 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 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-17 10:59:26,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:26,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 266 [2025-03-17 10:59:26,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:26,683 INFO L124 PetriNetUnfolderBase]: 290/976 cut-off events. [2025-03-17 10:59:26,683 INFO L125 PetriNetUnfolderBase]: For 125/127 co-relation queries the response was YES. [2025-03-17 10:59:26,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1788 conditions, 976 events. 290/976 cut-off events. For 125/127 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5930 event pairs, 280 based on Foata normal form. 0/944 useless extension candidates. Maximal degree in co-relation 1768. Up to 479 conditions per place. [2025-03-17 10:59:26,688 INFO L140 encePairwiseOnDemand]: 264/266 looper letters, 0 selfloop transitions, 0 changer transitions 128/128 dead transitions. [2025-03-17 10:59:26,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 128 transitions, 336 flow [2025-03-17 10:59:26,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:26,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:26,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 692 transitions. [2025-03-17 10:59:26,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8671679197994987 [2025-03-17 10:59:26,690 INFO L175 Difference]: Start difference. First operand has 150 places, 124 transitions, 272 flow. Second operand 3 states and 692 transitions. [2025-03-17 10:59:26,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 128 transitions, 336 flow [2025-03-17 10:59:26,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 128 transitions, 329 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 10:59:26,692 INFO L231 Difference]: Finished difference. Result has 147 places, 0 transitions, 0 flow [2025-03-17 10:59:26,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, 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-17 10:59:26,693 INFO L279 CegarLoopForPetriNet]: 260 programPoint places, -113 predicate places. [2025-03-17 10:59:26,693 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 0 transitions, 0 flow [2025-03-17 10:59:26,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 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-17 10:59:26,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (26 of 27 remaining) [2025-03-17 10:59:26,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2025-03-17 10:59:26,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2025-03-17 10:59:26,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2025-03-17 10:59:26,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2025-03-17 10:59:26,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2025-03-17 10:59:26,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining) [2025-03-17 10:59:26,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2025-03-17 10:59:26,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2025-03-17 10:59:26,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2025-03-17 10:59:26,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2025-03-17 10:59:26,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (15 of 27 remaining) [2025-03-17 10:59:26,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 27 remaining) [2025-03-17 10:59:26,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2025-03-17 10:59:26,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining) [2025-03-17 10:59:26,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining) [2025-03-17 10:59:26,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 27 remaining) [2025-03-17 10:59:26,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 27 remaining) [2025-03-17 10:59:26,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2025-03-17 10:59:26,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining) [2025-03-17 10:59:26,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining) [2025-03-17 10:59:26,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2025-03-17 10:59:26,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2025-03-17 10:59:26,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2025-03-17 10:59:26,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2025-03-17 10:59:26,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2025-03-17 10:59:26,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2025-03-17 10:59:26,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 10:59:26,699 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:26,703 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 10:59:26,703 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 10:59:26,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 10:59:26 BasicIcfg [2025-03-17 10:59:26,707 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 10:59:26,707 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 10:59:26,707 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 10:59:26,707 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 10:59:26,708 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:59:16" (3/4) ... [2025-03-17 10:59:26,709 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 10:59:26,711 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure my_callback [2025-03-17 10:59:26,716 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-03-17 10:59:26,717 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-17 10:59:26,718 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 10:59:26,718 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 10:59:26,799 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 10:59:26,800 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 10:59:26,800 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 10:59:26,800 INFO L158 Benchmark]: Toolchain (without parser) took 11488.61ms. Allocated memory was 167.8MB in the beginning and 738.2MB in the end (delta: 570.4MB). Free memory was 130.4MB in the beginning and 432.7MB in the end (delta: -302.4MB). Peak memory consumption was 270.1MB. Max. memory is 16.1GB. [2025-03-17 10:59:26,801 INFO L158 Benchmark]: CDTParser took 1.12ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 10:59:26,801 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.50ms. Allocated memory is still 167.8MB. Free memory was 130.0MB in the beginning and 98.1MB in the end (delta: 31.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 10:59:26,801 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.42ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 94.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 10:59:26,801 INFO L158 Benchmark]: Boogie Preprocessor took 43.84ms. Allocated memory is still 167.8MB. Free memory was 94.9MB in the beginning and 91.4MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 10:59:26,801 INFO L158 Benchmark]: IcfgBuilder took 800.95ms. Allocated memory is still 167.8MB. Free memory was 91.4MB in the beginning and 122.7MB in the end (delta: -31.2MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. [2025-03-17 10:59:26,802 INFO L158 Benchmark]: TraceAbstraction took 9984.80ms. Allocated memory was 167.8MB in the beginning and 738.2MB in the end (delta: 570.4MB). Free memory was 121.8MB in the beginning and 441.1MB in the end (delta: -319.3MB). Peak memory consumption was 252.5MB. Max. memory is 16.1GB. [2025-03-17 10:59:26,802 INFO L158 Benchmark]: Witness Printer took 92.43ms. Allocated memory is still 738.2MB. Free memory was 441.1MB in the beginning and 432.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 10:59:26,803 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.12ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 513.50ms. Allocated memory is still 167.8MB. Free memory was 130.0MB in the beginning and 98.1MB in the end (delta: 31.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.42ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 94.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.84ms. Allocated memory is still 167.8MB. Free memory was 94.9MB in the beginning and 91.4MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 800.95ms. Allocated memory is still 167.8MB. Free memory was 91.4MB in the beginning and 122.7MB in the end (delta: -31.2MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9984.80ms. Allocated memory was 167.8MB in the beginning and 738.2MB in the end (delta: 570.4MB). Free memory was 121.8MB in the beginning and 441.1MB in the end (delta: -319.3MB). Peak memory consumption was 252.5MB. Max. memory is 16.1GB. * Witness Printer took 92.43ms. Allocated memory is still 738.2MB. Free memory was 441.1MB in the beginning and 432.7MB 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: 3973]: 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: 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: 3974]: 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: 3975]: 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: 3976]: 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: 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, 279 locations, 290 edges, 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: 9.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1137 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 672 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 341 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2818 IncrementalHoareTripleChecker+Invalid, 3159 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 341 mSolverCounterUnsat, 31 mSDtfsCounter, 2818 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=1381occurred 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.5s InterpolantComputationTime, 748 NumberOfCodeBlocks, 748 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 737 ConstructedInterpolants, 0 QuantifiedInterpolants, 1293 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 71/71 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-17 10:59:26,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE