./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/ldv-races/race-2_4-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 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_4-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 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:10:39,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:10:39,500 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:10:39,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:10:39,506 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:10:39,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:10:39,530 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:10:39,530 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:10:39,531 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:10:39,531 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:10:39,531 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:10:39,531 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:10:39,531 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:10:39,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:10:39,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:10:39,532 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:10:39,532 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:10:39,532 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:10:39,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:10:39,532 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:10:39,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:10:39,532 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:10:39,532 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:10:39,532 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:10:39,532 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:10:39,532 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:10:39,532 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:10:39,532 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:10:39,532 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:10:39,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:10:39,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:10:39,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:10:39,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:10:39,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:10:39,534 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:10:39,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:10:39,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:10:39,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:10:39,534 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:10:39,534 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:10:39,534 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:10:39,534 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:10:39,534 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 -> 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 [2025-03-13 22:10:39,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:10:39,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:10:39,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:10:39,806 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:10:39,806 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:10:39,808 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_4-container_of.i [2025-03-13 22:10:41,018 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd26850f0/8a5d357d4a1f4c55b209761090d7c994/FLAGcb7e4da40 [2025-03-13 22:10:41,360 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:10:41,360 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_4-container_of.i [2025-03-13 22:10:41,386 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd26850f0/8a5d357d4a1f4c55b209761090d7c994/FLAGcb7e4da40 [2025-03-13 22:10:41,568 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd26850f0/8a5d357d4a1f4c55b209761090d7c994 [2025-03-13 22:10:41,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:10:41,571 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:10:41,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:10:41,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:10:41,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:10:41,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:10:41" (1/1) ... [2025-03-13 22:10:41,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26d327a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:41, skipping insertion in model container [2025-03-13 22:10:41,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:10:41" (1/1) ... [2025-03-13 22:10:41,608 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:10:41,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:10:41,969 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:10:42,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:10:42,073 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:10:42,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:42 WrapperNode [2025-03-13 22:10:42,074 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:10:42,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:10:42,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:10:42,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:10:42,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:42" (1/1) ... [2025-03-13 22:10:42,099 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:42" (1/1) ... [2025-03-13 22:10:42,125 INFO L138 Inliner]: procedures = 248, calls = 56, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 238 [2025-03-13 22:10:42,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:10:42,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:10:42,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:10:42,126 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:10:42,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:42" (1/1) ... [2025-03-13 22:10:42,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:42" (1/1) ... [2025-03-13 22:10:42,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:42" (1/1) ... [2025-03-13 22:10:42,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:42" (1/1) ... [2025-03-13 22:10:42,165 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:42" (1/1) ... [2025-03-13 22:10:42,167 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:42" (1/1) ... [2025-03-13 22:10:42,169 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:42" (1/1) ... [2025-03-13 22:10:42,170 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:42" (1/1) ... [2025-03-13 22:10:42,173 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:10:42,174 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:10:42,174 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:10:42,174 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:10:42,175 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:42" (1/1) ... [2025-03-13 22:10:42,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:10:42,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:10:42,201 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-13 22:10:42,203 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-13 22:10:42,220 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-03-13 22:10:42,221 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-03-13 22:10:42,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 22:10:42,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-13 22:10:42,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 22:10:42,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 22:10:42,222 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:10:42,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:10:42,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:10:42,222 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:10:42,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:10:42,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-13 22:10:42,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:10:42,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:10:42,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:10:42,223 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:10:42,424 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:10:42,425 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:10:42,775 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:10:42,776 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:10:42,776 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:10:42,889 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:10:42,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:10:42 BoogieIcfgContainer [2025-03-13 22:10:42,890 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:10:42,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:10:42,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:10:42,895 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:10:42,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:10:41" (1/3) ... [2025-03-13 22:10:42,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b3dfe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:10:42, skipping insertion in model container [2025-03-13 22:10:42,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:42" (2/3) ... [2025-03-13 22:10:42,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b3dfe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:10:42, skipping insertion in model container [2025-03-13 22:10:42,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:10:42" (3/3) ... [2025-03-13 22:10:42,898 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_4-container_of.i [2025-03-13 22:10:42,910 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:10:42,913 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_4-container_of.i that has 2 procedures, 236 locations, 1 initial locations, 0 loop locations, and 19 error locations. [2025-03-13 22:10:42,913 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:10:42,974 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 22:10:43,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 267 transitions, 548 flow [2025-03-13 22:10:43,103 INFO L124 PetriNetUnfolderBase]: 14/359 cut-off events. [2025-03-13 22:10:43,105 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:10:43,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 359 events. 14/359 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 771 event pairs, 0 based on Foata normal form. 0/312 useless extension candidates. Maximal degree in co-relation 185. Up to 4 conditions per place. [2025-03-13 22:10:43,113 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 267 transitions, 548 flow [2025-03-13 22:10:43,121 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 261 places, 264 transitions, 540 flow [2025-03-13 22:10:43,130 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:10:43,142 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;@7b2f889d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:10:43,143 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-03-13 22:10:43,150 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:10:43,151 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-03-13 22:10:43,151 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:10:43,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:43,152 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:43,153 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-13 22:10:43,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:43,157 INFO L85 PathProgramCache]: Analyzing trace with hash -2147349924, now seen corresponding path program 1 times [2025-03-13 22:10:43,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:43,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051656330] [2025-03-13 22:10:43,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:43,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:43,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-13 22:10:43,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-13 22:10:43,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:43,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:43,895 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-13 22:10:43,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:43,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051656330] [2025-03-13 22:10:43,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051656330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:43,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:43,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:10:43,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649449584] [2025-03-13 22:10:43,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:43,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:10:43,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:43,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:10:43,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:10:44,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 267 [2025-03-13 22:10:44,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 264 transitions, 540 flow. Second operand has 6 states, 6 states have (on average 193.33333333333334) internal successors, (1160), 6 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:44,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:44,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 267 [2025-03-13 22:10:44,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:44,854 INFO L124 PetriNetUnfolderBase]: 1296/4016 cut-off events. [2025-03-13 22:10:44,854 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-13 22:10:44,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6179 conditions, 4016 events. 1296/4016 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 32252 event pairs, 1295 based on Foata normal form. 140/3948 useless extension candidates. Maximal degree in co-relation 5908. Up to 2134 conditions per place. [2025-03-13 22:10:44,884 INFO L140 encePairwiseOnDemand]: 243/267 looper letters, 47 selfloop transitions, 5 changer transitions 6/233 dead transitions. [2025-03-13 22:10:44,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 233 transitions, 582 flow [2025-03-13 22:10:44,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:10:44,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:10:44,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1223 transitions. [2025-03-13 22:10:44,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7634207240948814 [2025-03-13 22:10:44,904 INFO L175 Difference]: Start difference. First operand has 261 places, 264 transitions, 540 flow. Second operand 6 states and 1223 transitions. [2025-03-13 22:10:44,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 233 transitions, 582 flow [2025-03-13 22:10:44,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 233 transitions, 574 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 22:10:44,912 INFO L231 Difference]: Finished difference. Result has 239 places, 227 transitions, 468 flow [2025-03-13 22:10:44,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=468, PETRI_PLACES=239, PETRI_TRANSITIONS=227} [2025-03-13 22:10:44,919 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -22 predicate places. [2025-03-13 22:10:44,920 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 227 transitions, 468 flow [2025-03-13 22:10:44,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 193.33333333333334) internal successors, (1160), 6 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:44,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:44,921 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-13 22:10:44,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:10:44,921 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-13 22:10:44,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:44,922 INFO L85 PathProgramCache]: Analyzing trace with hash 30116377, now seen corresponding path program 1 times [2025-03-13 22:10:44,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:44,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844690779] [2025-03-13 22:10:44,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:44,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:44,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-13 22:10:44,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-13 22:10:44,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:44,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:45,310 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-13 22:10:45,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:45,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844690779] [2025-03-13 22:10:45,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844690779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:45,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:45,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:10:45,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846246194] [2025-03-13 22:10:45,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:45,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:10:45,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:45,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:10:45,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:10:45,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 267 [2025-03-13 22:10:45,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 227 transitions, 468 flow. Second operand has 6 states, 6 states have (on average 193.33333333333334) internal successors, (1160), 6 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:45,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:45,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 267 [2025-03-13 22:10:45,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:45,975 INFO L124 PetriNetUnfolderBase]: 1296/4009 cut-off events. [2025-03-13 22:10:45,976 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 22:10:45,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6162 conditions, 4009 events. 1296/4009 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 32401 event pairs, 1295 based on Foata normal form. 0/3804 useless extension candidates. Maximal degree in co-relation 6119. Up to 2134 conditions per place. [2025-03-13 22:10:45,996 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 47 selfloop transitions, 5 changer transitions 0/226 dead transitions. [2025-03-13 22:10:45,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 226 transitions, 570 flow [2025-03-13 22:10:45,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:10:45,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:10:46,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1205 transitions. [2025-03-13 22:10:46,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7521847690387016 [2025-03-13 22:10:46,001 INFO L175 Difference]: Start difference. First operand has 239 places, 227 transitions, 468 flow. Second operand 6 states and 1205 transitions. [2025-03-13 22:10:46,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 226 transitions, 570 flow [2025-03-13 22:10:46,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 226 transitions, 560 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:10:46,005 INFO L231 Difference]: Finished difference. Result has 232 places, 226 transitions, 466 flow [2025-03-13 22:10:46,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=466, PETRI_PLACES=232, PETRI_TRANSITIONS=226} [2025-03-13 22:10:46,006 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -29 predicate places. [2025-03-13 22:10:46,007 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 226 transitions, 466 flow [2025-03-13 22:10:46,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 193.33333333333334) internal successors, (1160), 6 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:46,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:46,007 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-13 22:10:46,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:10:46,008 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-13 22:10:46,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:46,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1169057966, now seen corresponding path program 1 times [2025-03-13 22:10:46,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:46,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216408160] [2025-03-13 22:10:46,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:46,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:46,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-13 22:10:46,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-13 22:10:46,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:46,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:46,078 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-13 22:10:46,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:46,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216408160] [2025-03-13 22:10:46,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216408160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:46,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:46,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:10:46,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149627735] [2025-03-13 22:10:46,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:46,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:10:46,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:46,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:10:46,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:10:46,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 267 [2025-03-13 22:10:46,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 226 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:46,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:46,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 267 [2025-03-13 22:10:46,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:46,284 INFO L124 PetriNetUnfolderBase]: 401/1334 cut-off events. [2025-03-13 22:10:46,285 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 22:10:46,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2030 conditions, 1334 events. 401/1334 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 8165 event pairs, 395 based on Foata normal form. 0/1280 useless extension candidates. Maximal degree in co-relation 1980. Up to 674 conditions per place. [2025-03-13 22:10:46,291 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 28 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2025-03-13 22:10:46,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 230 transitions, 534 flow [2025-03-13 22:10:46,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:10:46,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:10:46,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 688 transitions. [2025-03-13 22:10:46,296 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8589263420724095 [2025-03-13 22:10:46,297 INFO L175 Difference]: Start difference. First operand has 232 places, 226 transitions, 466 flow. Second operand 3 states and 688 transitions. [2025-03-13 22:10:46,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 230 transitions, 534 flow [2025-03-13 22:10:46,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 230 transitions, 524 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:10:46,300 INFO L231 Difference]: Finished difference. Result has 228 places, 225 transitions, 458 flow [2025-03-13 22:10:46,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=228, PETRI_TRANSITIONS=225} [2025-03-13 22:10:46,301 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -33 predicate places. [2025-03-13 22:10:46,301 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 225 transitions, 458 flow [2025-03-13 22:10:46,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:46,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:46,302 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-13 22:10:46,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:10:46,302 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-13 22:10:46,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:46,303 INFO L85 PathProgramCache]: Analyzing trace with hash 15130907, now seen corresponding path program 1 times [2025-03-13 22:10:46,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:46,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312530545] [2025-03-13 22:10:46,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:46,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:46,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-13 22:10:46,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-13 22:10:46,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:46,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:46,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:10:46,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:46,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312530545] [2025-03-13 22:10:46,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312530545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:46,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:46,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:10:46,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440793691] [2025-03-13 22:10:46,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:46,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:10:46,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:46,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:10:46,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:10:46,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 267 [2025-03-13 22:10:46,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 225 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:46,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:46,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 267 [2025-03-13 22:10:46,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:46,548 INFO L124 PetriNetUnfolderBase]: 416/1829 cut-off events. [2025-03-13 22:10:46,548 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 22:10:46,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2551 conditions, 1829 events. 416/1829 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 12542 event pairs, 345 based on Foata normal form. 0/1700 useless extension candidates. Maximal degree in co-relation 2401. Up to 623 conditions per place. [2025-03-13 22:10:46,556 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 33 selfloop transitions, 2 changer transitions 0/234 dead transitions. [2025-03-13 22:10:46,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 234 transitions, 546 flow [2025-03-13 22:10:46,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:10:46,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:10:46,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 693 transitions. [2025-03-13 22:10:46,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8651685393258427 [2025-03-13 22:10:46,559 INFO L175 Difference]: Start difference. First operand has 228 places, 225 transitions, 458 flow. Second operand 3 states and 693 transitions. [2025-03-13 22:10:46,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 234 transitions, 546 flow [2025-03-13 22:10:46,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 234 transitions, 542 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:10:46,561 INFO L231 Difference]: Finished difference. Result has 227 places, 224 transitions, 456 flow [2025-03-13 22:10:46,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=227, PETRI_TRANSITIONS=224} [2025-03-13 22:10:46,563 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -34 predicate places. [2025-03-13 22:10:46,563 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 224 transitions, 456 flow [2025-03-13 22:10:46,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:46,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:46,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:46,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:10:46,564 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-13 22:10:46,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:46,565 INFO L85 PathProgramCache]: Analyzing trace with hash 2145988560, now seen corresponding path program 1 times [2025-03-13 22:10:46,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:46,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278092712] [2025-03-13 22:10:46,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:46,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:46,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-13 22:10:46,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-13 22:10:46,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:46,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:46,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:10:46,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:46,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278092712] [2025-03-13 22:10:46,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278092712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:46,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:46,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:10:46,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358158934] [2025-03-13 22:10:46,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:46,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:10:46,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:46,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:10:46,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:10:47,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 267 [2025-03-13 22:10:47,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 224 transitions, 456 flow. Second operand has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:47,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:47,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 267 [2025-03-13 22:10:47,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:47,722 INFO L124 PetriNetUnfolderBase]: 1488/4201 cut-off events. [2025-03-13 22:10:47,722 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 22:10:47,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6659 conditions, 4201 events. 1488/4201 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 32921 event pairs, 1027 based on Foata normal form. 0/4029 useless extension candidates. Maximal degree in co-relation 6446. Up to 2110 conditions per place. [2025-03-13 22:10:47,738 INFO L140 encePairwiseOnDemand]: 254/267 looper letters, 61 selfloop transitions, 30 changer transitions 7/269 dead transitions. [2025-03-13 22:10:47,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 269 transitions, 734 flow [2025-03-13 22:10:47,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:10:47,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:10:47,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1271 transitions. [2025-03-13 22:10:47,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7933832709113608 [2025-03-13 22:10:47,741 INFO L175 Difference]: Start difference. First operand has 227 places, 224 transitions, 456 flow. Second operand 6 states and 1271 transitions. [2025-03-13 22:10:47,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 269 transitions, 734 flow [2025-03-13 22:10:47,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 269 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:10:47,746 INFO L231 Difference]: Finished difference. Result has 235 places, 246 transitions, 640 flow [2025-03-13 22:10:47,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=640, PETRI_PLACES=235, PETRI_TRANSITIONS=246} [2025-03-13 22:10:47,747 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -26 predicate places. [2025-03-13 22:10:47,747 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 246 transitions, 640 flow [2025-03-13 22:10:47,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:47,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:47,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, 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-13 22:10:47,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:10:47,748 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-13 22:10:47,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:47,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1465660758, now seen corresponding path program 1 times [2025-03-13 22:10:47,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:47,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609105182] [2025-03-13 22:10:47,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:47,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:47,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-13 22:10:47,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-13 22:10:47,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:47,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:10:47,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:47,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609105182] [2025-03-13 22:10:47,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609105182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:47,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:47,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:10:47,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42347201] [2025-03-13 22:10:47,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:47,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:10:47,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:47,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:10:47,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:10:47,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 267 [2025-03-13 22:10:47,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 246 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 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-13 22:10:47,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:47,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 267 [2025-03-13 22:10:47,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:48,108 INFO L124 PetriNetUnfolderBase]: 797/2049 cut-off events. [2025-03-13 22:10:48,109 INFO L125 PetriNetUnfolderBase]: For 705/751 co-relation queries the response was YES. [2025-03-13 22:10:48,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4425 conditions, 2049 events. 797/2049 cut-off events. For 705/751 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 13896 event pairs, 436 based on Foata normal form. 1/1973 useless extension candidates. Maximal degree in co-relation 3173. Up to 958 conditions per place. [2025-03-13 22:10:48,120 INFO L140 encePairwiseOnDemand]: 265/267 looper letters, 54 selfloop transitions, 1 changer transitions 0/255 dead transitions. [2025-03-13 22:10:48,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 255 transitions, 780 flow [2025-03-13 22:10:48,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:10:48,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:10:48,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2025-03-13 22:10:48,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8751560549313359 [2025-03-13 22:10:48,123 INFO L175 Difference]: Start difference. First operand has 235 places, 246 transitions, 640 flow. Second operand 3 states and 701 transitions. [2025-03-13 22:10:48,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 255 transitions, 780 flow [2025-03-13 22:10:48,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 255 transitions, 780 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:10:48,128 INFO L231 Difference]: Finished difference. Result has 229 places, 245 transitions, 640 flow [2025-03-13 22:10:48,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=229, PETRI_TRANSITIONS=245} [2025-03-13 22:10:48,129 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -32 predicate places. [2025-03-13 22:10:48,129 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 245 transitions, 640 flow [2025-03-13 22:10:48,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 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-13 22:10:48,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:48,130 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:48,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:10:48,130 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-13 22:10:48,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:48,130 INFO L85 PathProgramCache]: Analyzing trace with hash -2065597617, now seen corresponding path program 1 times [2025-03-13 22:10:48,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:48,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350070158] [2025-03-13 22:10:48,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:48,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:48,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-13 22:10:48,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-13 22:10:48,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:48,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:48,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:10:48,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:48,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350070158] [2025-03-13 22:10:48,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350070158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:48,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:48,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:10:48,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634297912] [2025-03-13 22:10:48,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:48,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:10:48,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:48,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:10:48,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:10:48,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 267 [2025-03-13 22:10:48,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 245 transitions, 640 flow. Second operand has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:48,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:48,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 267 [2025-03-13 22:10:48,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:49,539 INFO L124 PetriNetUnfolderBase]: 1709/4143 cut-off events. [2025-03-13 22:10:49,539 INFO L125 PetriNetUnfolderBase]: For 1080/1124 co-relation queries the response was YES. [2025-03-13 22:10:49,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8574 conditions, 4143 events. 1709/4143 cut-off events. For 1080/1124 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 30884 event pairs, 1013 based on Foata normal form. 0/3970 useless extension candidates. Maximal degree in co-relation 8410. Up to 2322 conditions per place. [2025-03-13 22:10:49,560 INFO L140 encePairwiseOnDemand]: 254/267 looper letters, 84 selfloop transitions, 30 changer transitions 11/290 dead transitions. [2025-03-13 22:10:49,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 290 transitions, 1008 flow [2025-03-13 22:10:49,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:10:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:10:49,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1268 transitions. [2025-03-13 22:10:49,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7915106117353309 [2025-03-13 22:10:49,564 INFO L175 Difference]: Start difference. First operand has 229 places, 245 transitions, 640 flow. Second operand 6 states and 1268 transitions. [2025-03-13 22:10:49,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 290 transitions, 1008 flow [2025-03-13 22:10:49,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 290 transitions, 1007 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:10:49,569 INFO L231 Difference]: Finished difference. Result has 238 places, 263 transitions, 867 flow [2025-03-13 22:10:49,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=867, PETRI_PLACES=238, PETRI_TRANSITIONS=263} [2025-03-13 22:10:49,571 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -23 predicate places. [2025-03-13 22:10:49,571 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 263 transitions, 867 flow [2025-03-13 22:10:49,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:49,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:49,572 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:49,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:10:49,572 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-13 22:10:49,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:49,573 INFO L85 PathProgramCache]: Analyzing trace with hash 361619482, now seen corresponding path program 1 times [2025-03-13 22:10:49,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:49,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712756500] [2025-03-13 22:10:49,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:49,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:49,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-13 22:10:49,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-13 22:10:49,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:49,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:10:49,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:49,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712756500] [2025-03-13 22:10:49,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712756500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:49,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:49,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:10:49,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067542614] [2025-03-13 22:10:49,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:49,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:10:49,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:49,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:10:49,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:10:50,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 267 [2025-03-13 22:10:50,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 263 transitions, 867 flow. Second operand has 6 states, 6 states have (on average 200.33333333333334) internal successors, (1202), 6 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:50,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:50,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 267 [2025-03-13 22:10:50,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:50,828 INFO L124 PetriNetUnfolderBase]: 1876/4742 cut-off events. [2025-03-13 22:10:50,828 INFO L125 PetriNetUnfolderBase]: For 2933/3039 co-relation queries the response was YES. [2025-03-13 22:10:50,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11451 conditions, 4742 events. 1876/4742 cut-off events. For 2933/3039 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 37664 event pairs, 887 based on Foata normal form. 0/4615 useless extension candidates. Maximal degree in co-relation 6805. Up to 2473 conditions per place. [2025-03-13 22:10:50,851 INFO L140 encePairwiseOnDemand]: 251/267 looper letters, 115 selfloop transitions, 26 changer transitions 0/307 dead transitions. [2025-03-13 22:10:50,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 307 transitions, 1337 flow [2025-03-13 22:10:50,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:10:50,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:10:50,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1273 transitions. [2025-03-13 22:10:50,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7946317103620475 [2025-03-13 22:10:50,855 INFO L175 Difference]: Start difference. First operand has 238 places, 263 transitions, 867 flow. Second operand 6 states and 1273 transitions. [2025-03-13 22:10:50,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 307 transitions, 1337 flow [2025-03-13 22:10:50,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 307 transitions, 1289 flow, removed 24 selfloop flow, removed 0 redundant places. [2025-03-13 22:10:50,864 INFO L231 Difference]: Finished difference. Result has 236 places, 283 transitions, 1051 flow [2025-03-13 22:10:50,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1051, PETRI_PLACES=236, PETRI_TRANSITIONS=283} [2025-03-13 22:10:50,866 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -25 predicate places. [2025-03-13 22:10:50,866 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 283 transitions, 1051 flow [2025-03-13 22:10:50,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.33333333333334) internal successors, (1202), 6 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:50,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:50,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:50,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:10:50,868 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-13 22:10:50,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:50,869 INFO L85 PathProgramCache]: Analyzing trace with hash -625153344, now seen corresponding path program 1 times [2025-03-13 22:10:50,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:50,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682088491] [2025-03-13 22:10:50,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:50,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:50,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-13 22:10:50,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-13 22:10:50,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:50,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:51,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:10:51,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:51,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682088491] [2025-03-13 22:10:51,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682088491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:51,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:51,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:10:51,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926308515] [2025-03-13 22:10:51,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:51,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:10:51,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:51,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:10:51,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:10:51,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 267 [2025-03-13 22:10:51,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 283 transitions, 1051 flow. Second operand has 6 states, 6 states have (on average 200.33333333333334) internal successors, (1202), 6 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:51,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:51,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 267 [2025-03-13 22:10:51,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:52,004 INFO L124 PetriNetUnfolderBase]: 2224/5081 cut-off events. [2025-03-13 22:10:52,005 INFO L125 PetriNetUnfolderBase]: For 5720/5946 co-relation queries the response was YES. [2025-03-13 22:10:52,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14164 conditions, 5081 events. 2224/5081 cut-off events. For 5720/5946 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 38831 event pairs, 987 based on Foata normal form. 70/5011 useless extension candidates. Maximal degree in co-relation 10165. Up to 2857 conditions per place. [2025-03-13 22:10:52,025 INFO L140 encePairwiseOnDemand]: 252/267 looper letters, 128 selfloop transitions, 36 changer transitions 38/342 dead transitions. [2025-03-13 22:10:52,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 342 transitions, 1771 flow [2025-03-13 22:10:52,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:10:52,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:10:52,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1271 transitions. [2025-03-13 22:10:52,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7933832709113608 [2025-03-13 22:10:52,028 INFO L175 Difference]: Start difference. First operand has 236 places, 283 transitions, 1051 flow. Second operand 6 states and 1271 transitions. [2025-03-13 22:10:52,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 342 transitions, 1771 flow [2025-03-13 22:10:52,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 342 transitions, 1771 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:10:52,037 INFO L231 Difference]: Finished difference. Result has 244 places, 280 transitions, 1381 flow [2025-03-13 22:10:52,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1381, PETRI_PLACES=244, PETRI_TRANSITIONS=280} [2025-03-13 22:10:52,038 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -17 predicate places. [2025-03-13 22:10:52,038 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 280 transitions, 1381 flow [2025-03-13 22:10:52,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.33333333333334) internal successors, (1202), 6 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:52,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:52,039 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] [2025-03-13 22:10:52,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:10:52,039 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-13 22:10:52,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:52,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1245484605, now seen corresponding path program 1 times [2025-03-13 22:10:52,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:52,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175767141] [2025-03-13 22:10:52,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:52,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:52,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-13 22:10:52,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-13 22:10:52,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:52,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:52,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:10:52,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:52,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175767141] [2025-03-13 22:10:52,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175767141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:52,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:52,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:10:52,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339083249] [2025-03-13 22:10:52,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:52,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:10:52,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:52,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:10:52,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:10:52,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 267 [2025-03-13 22:10:52,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 280 transitions, 1381 flow. Second operand has 5 states, 5 states have (on average 217.4) internal successors, (1087), 5 states have internal predecessors, (1087), 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-13 22:10:52,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:52,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 267 [2025-03-13 22:10:52,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:52,380 INFO L124 PetriNetUnfolderBase]: 575/1368 cut-off events. [2025-03-13 22:10:52,380 INFO L125 PetriNetUnfolderBase]: For 2361/2361 co-relation queries the response was YES. [2025-03-13 22:10:52,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3603 conditions, 1368 events. 575/1368 cut-off events. For 2361/2361 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8481 event pairs, 30 based on Foata normal form. 0/1368 useless extension candidates. Maximal degree in co-relation 3581. Up to 587 conditions per place. [2025-03-13 22:10:52,387 INFO L140 encePairwiseOnDemand]: 262/267 looper letters, 61 selfloop transitions, 4 changer transitions 0/163 dead transitions. [2025-03-13 22:10:52,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 163 transitions, 660 flow [2025-03-13 22:10:52,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:10:52,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:10:52,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1356 transitions. [2025-03-13 22:10:52,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.846441947565543 [2025-03-13 22:10:52,390 INFO L175 Difference]: Start difference. First operand has 244 places, 280 transitions, 1381 flow. Second operand 6 states and 1356 transitions. [2025-03-13 22:10:52,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 163 transitions, 660 flow [2025-03-13 22:10:52,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 163 transitions, 520 flow, removed 70 selfloop flow, removed 3 redundant places. [2025-03-13 22:10:52,394 INFO L231 Difference]: Finished difference. Result has 149 places, 123 transitions, 270 flow [2025-03-13 22:10:52,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=270, PETRI_PLACES=149, PETRI_TRANSITIONS=123} [2025-03-13 22:10:52,395 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -112 predicate places. [2025-03-13 22:10:52,395 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 123 transitions, 270 flow [2025-03-13 22:10:52,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 217.4) internal successors, (1087), 5 states have internal predecessors, (1087), 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-13 22:10:52,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:52,396 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-13 22:10:52,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:10:52,396 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-13 22:10:52,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:52,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1805654062, now seen corresponding path program 1 times [2025-03-13 22:10:52,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:52,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215514895] [2025-03-13 22:10:52,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:52,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:52,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-13 22:10:52,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-13 22:10:52,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:52,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:52,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:10:52,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:52,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215514895] [2025-03-13 22:10:52,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215514895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:52,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:52,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:10:52,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435455007] [2025-03-13 22:10:52,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:52,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:10:52,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:52,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:10:52,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:10:52,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 267 [2025-03-13 22:10:52,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 123 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:52,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:52,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 267 [2025-03-13 22:10:52,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:52,585 INFO L124 PetriNetUnfolderBase]: 285/776 cut-off events. [2025-03-13 22:10:52,586 INFO L125 PetriNetUnfolderBase]: For 150/152 co-relation queries the response was YES. [2025-03-13 22:10:52,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1532 conditions, 776 events. 285/776 cut-off events. For 150/152 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4143 event pairs, 280 based on Foata normal form. 6/747 useless extension candidates. Maximal degree in co-relation 1512. Up to 479 conditions per place. [2025-03-13 22:10:52,589 INFO L140 encePairwiseOnDemand]: 265/267 looper letters, 0 selfloop transitions, 0 changer transitions 127/127 dead transitions. [2025-03-13 22:10:52,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 127 transitions, 332 flow [2025-03-13 22:10:52,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:10:52,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:10:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 694 transitions. [2025-03-13 22:10:52,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8664169787765293 [2025-03-13 22:10:52,591 INFO L175 Difference]: Start difference. First operand has 149 places, 123 transitions, 270 flow. Second operand 3 states and 694 transitions. [2025-03-13 22:10:52,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 127 transitions, 332 flow [2025-03-13 22:10:52,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 127 transitions, 325 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 22:10:52,593 INFO L231 Difference]: Finished difference. Result has 146 places, 0 transitions, 0 flow [2025-03-13 22:10:52,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=146, PETRI_TRANSITIONS=0} [2025-03-13 22:10:52,594 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -115 predicate places. [2025-03-13 22:10:52,594 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 0 transitions, 0 flow [2025-03-13 22:10:52,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:52,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (26 of 27 remaining) [2025-03-13 22:10:52,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2025-03-13 22:10:52,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2025-03-13 22:10:52,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2025-03-13 22:10:52,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2025-03-13 22:10:52,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2025-03-13 22:10:52,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining) [2025-03-13 22:10:52,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2025-03-13 22:10:52,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2025-03-13 22:10:52,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2025-03-13 22:10:52,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2025-03-13 22:10:52,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 27 remaining) [2025-03-13 22:10:52,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 27 remaining) [2025-03-13 22:10:52,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2025-03-13 22:10:52,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining) [2025-03-13 22:10:52,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining) [2025-03-13 22:10:52,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 27 remaining) [2025-03-13 22:10:52,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 27 remaining) [2025-03-13 22:10:52,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2025-03-13 22:10:52,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining) [2025-03-13 22:10:52,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining) [2025-03-13 22:10:52,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2025-03-13 22:10:52,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2025-03-13 22:10:52,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2025-03-13 22:10:52,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2025-03-13 22:10:52,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2025-03-13 22:10:52,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2025-03-13 22:10:52,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:10:52,601 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:52,605 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 22:10:52,605 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:10:52,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:10:52 BasicIcfg [2025-03-13 22:10:52,610 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:10:52,611 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:10:52,611 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:10:52,612 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:10:52,613 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:10:42" (3/4) ... [2025-03-13 22:10:52,614 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 22:10:52,616 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure my_callback [2025-03-13 22:10:52,624 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-03-13 22:10:52,624 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-13 22:10:52,624 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 22:10:52,625 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 22:10:52,692 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 22:10:52,692 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 22:10:52,692 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:10:52,693 INFO L158 Benchmark]: Toolchain (without parser) took 11121.43ms. Allocated memory was 142.6MB in the beginning and 738.2MB in the end (delta: 595.6MB). Free memory was 109.6MB in the beginning and 296.0MB in the end (delta: -186.4MB). Peak memory consumption was 407.2MB. Max. memory is 16.1GB. [2025-03-13 22:10:52,694 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:10:52,694 INFO L158 Benchmark]: CACSL2BoogieTranslator took 502.29ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 77.5MB in the end (delta: 32.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-13 22:10:52,694 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.74ms. Allocated memory is still 142.6MB. Free memory was 77.5MB in the beginning and 74.4MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:10:52,696 INFO L158 Benchmark]: Boogie Preprocessor took 46.83ms. Allocated memory is still 142.6MB. Free memory was 74.4MB in the beginning and 70.5MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:10:52,697 INFO L158 Benchmark]: IcfgBuilder took 716.25ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 83.5MB in the end (delta: -13.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-13 22:10:52,697 INFO L158 Benchmark]: TraceAbstraction took 9718.81ms. Allocated memory was 142.6MB in the beginning and 738.2MB in the end (delta: 595.6MB). Free memory was 82.8MB in the beginning and 304.4MB in the end (delta: -221.6MB). Peak memory consumption was 373.7MB. Max. memory is 16.1GB. [2025-03-13 22:10:52,697 INFO L158 Benchmark]: Witness Printer took 81.43ms. Allocated memory is still 738.2MB. Free memory was 304.4MB in the beginning and 296.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:10:52,698 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 502.29ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 77.5MB in the end (delta: 32.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.74ms. Allocated memory is still 142.6MB. Free memory was 77.5MB in the beginning and 74.4MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.83ms. Allocated memory is still 142.6MB. Free memory was 74.4MB in the beginning and 70.5MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 716.25ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 83.5MB in the end (delta: -13.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9718.81ms. Allocated memory was 142.6MB in the beginning and 738.2MB in the end (delta: 595.6MB). Free memory was 82.8MB in the beginning and 304.4MB in the end (delta: -221.6MB). Peak memory consumption was 373.7MB. Max. memory is 16.1GB. * Witness Printer took 81.43ms. Allocated memory is still 738.2MB. Free memory was 304.4MB in the beginning and 296.0MB 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: 3940]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3943]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3946]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3949]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3930]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3973]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3951]: 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: 3974]: 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, 280 locations, 27 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1093 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 673 mSDsluCounter, 85 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 338 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2973 IncrementalHoareTripleChecker+Invalid, 3311 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 338 mSolverCounterUnsat, 73 mSDtfsCounter, 2973 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 18 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.4s InterpolantComputationTime, 753 NumberOfCodeBlocks, 753 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 742 ConstructedInterpolants, 0 QuantifiedInterpolants, 1298 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 24/24 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-13 22:10:52,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE