./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 6883737711af32a6a824eca7af237353e2fdaf7712a6b3c22083c0d47b565ee7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:27:44,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:27:44,966 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:27:44,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:27:44,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:27:44,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:27:44,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:27:44,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:27:44,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:27:44,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:27:44,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:27:44,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:27:44,992 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:27:44,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:27:44,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:27:44,992 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:27:44,992 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:27:44,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:27:44,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:27:44,992 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:27:44,992 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:27:44,992 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:27:44,992 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:27:44,992 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:27:44,992 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:27:44,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:27:44,993 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:27:44,993 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:27:44,993 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:27:44,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:27:44,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:27:44,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:27:44,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:27:44,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:27:44,993 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:27:44,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:27:44,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:27:44,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:27:44,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:27:44,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:27:44,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:27:44,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:27:44,993 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-jdk21/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 -> 6883737711af32a6a824eca7af237353e2fdaf7712a6b3c22083c0d47b565ee7 [2025-02-06 09:27:45,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:27:45,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:27:45,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:27:45,187 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:27:45,187 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:27:45,188 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2025-02-06 09:27:46,377 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2489fd40/2828edb425ef4c30b57b77b660097afb/FLAG7e2238bec [2025-02-06 09:27:46,716 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:27:46,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2025-02-06 09:27:46,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2489fd40/2828edb425ef4c30b57b77b660097afb/FLAG7e2238bec [2025-02-06 09:27:46,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2489fd40/2828edb425ef4c30b57b77b660097afb [2025-02-06 09:27:46,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:27:46,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:27:46,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:27:46,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:27:46,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:27:46,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:27:46" (1/1) ... [2025-02-06 09:27:46,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1296832a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:46, skipping insertion in model container [2025-02-06 09:27:46,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:27:46" (1/1) ... [2025-02-06 09:27:46,792 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:27:47,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:27:47,074 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:27:47,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:27:47,151 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:27:47,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:47 WrapperNode [2025-02-06 09:27:47,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:27:47,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:27:47,153 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:27:47,153 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:27:47,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:47" (1/1) ... [2025-02-06 09:27:47,172 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:47" (1/1) ... [2025-02-06 09:27:47,197 INFO L138 Inliner]: procedures = 165, calls = 47, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 198 [2025-02-06 09:27:47,201 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:27:47,202 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:27:47,202 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:27:47,202 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:27:47,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:47" (1/1) ... [2025-02-06 09:27:47,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:47" (1/1) ... [2025-02-06 09:27:47,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:47" (1/1) ... [2025-02-06 09:27:47,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:47" (1/1) ... [2025-02-06 09:27:47,220 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:47" (1/1) ... [2025-02-06 09:27:47,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:47" (1/1) ... [2025-02-06 09:27:47,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:47" (1/1) ... [2025-02-06 09:27:47,226 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:47" (1/1) ... [2025-02-06 09:27:47,229 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:27:47,233 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:27:47,233 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:27:47,233 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:27:47,233 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:47" (1/1) ... [2025-02-06 09:27:47,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:27:47,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:27:47,260 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:27:47,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:27:47,279 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:27:47,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:27:47,279 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:27:47,279 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:27:47,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:27:47,279 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:27:47,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:27:47,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:27:47,280 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:27:47,376 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:27:47,377 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:27:47,675 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:27:47,677 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:27:47,715 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:27:47,715 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:27:47,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:27:47 BoogieIcfgContainer [2025-02-06 09:27:47,716 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:27:47,719 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:27:47,719 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:27:47,722 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:27:47,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:27:46" (1/3) ... [2025-02-06 09:27:47,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c26a8e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:27:47, skipping insertion in model container [2025-02-06 09:27:47,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:47" (2/3) ... [2025-02-06 09:27:47,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c26a8e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:27:47, skipping insertion in model container [2025-02-06 09:27:47,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:27:47" (3/3) ... [2025-02-06 09:27:47,724 INFO L128 eAbstractionObserver]: Analyzing ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2025-02-06 09:27:47,734 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:27:47,736 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i that has 2 procedures, 226 locations, 1 initial locations, 0 loop locations, and 9 error locations. [2025-02-06 09:27:47,738 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:27:47,814 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:27:47,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 237 transitions, 478 flow [2025-02-06 09:27:47,952 INFO L124 PetriNetUnfolderBase]: 11/240 cut-off events. [2025-02-06 09:27:47,955 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:27:47,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 240 events. 11/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 281 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 193. Up to 2 conditions per place. [2025-02-06 09:27:47,964 INFO L82 GeneralOperation]: Start removeDead. Operand has 229 places, 237 transitions, 478 flow [2025-02-06 09:27:47,970 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 235 transitions, 473 flow [2025-02-06 09:27:47,977 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:27:47,991 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;@37bddace, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:27:47,992 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-02-06 09:27:48,008 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:27:48,011 INFO L124 PetriNetUnfolderBase]: 0/61 cut-off events. [2025-02-06 09:27:48,011 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:27:48,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:48,012 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-02-06 09:27:48,012 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:27:48,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:48,019 INFO L85 PathProgramCache]: Analyzing trace with hash 95577846, now seen corresponding path program 1 times [2025-02-06 09:27:48,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:48,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372802225] [2025-02-06 09:27:48,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:48,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:48,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 09:27:48,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 09:27:48,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:48,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:48,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:48,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:48,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372802225] [2025-02-06 09:27:48,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372802225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:48,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:48,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:48,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192865379] [2025-02-06 09:27:48,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:48,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:48,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:48,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:48,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:48,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 237 [2025-02-06 09:27:48,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 235 transitions, 473 flow. Second operand has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:48,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:48,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 237 [2025-02-06 09:27:48,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:48,530 INFO L124 PetriNetUnfolderBase]: 122/1316 cut-off events. [2025-02-06 09:27:48,530 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:27:48,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1590 conditions, 1316 events. 122/1316 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 7828 event pairs, 87 based on Foata normal form. 112/1278 useless extension candidates. Maximal degree in co-relation 1541. Up to 236 conditions per place. [2025-02-06 09:27:48,539 INFO L140 encePairwiseOnDemand]: 221/237 looper letters, 30 selfloop transitions, 5 changer transitions 0/229 dead transitions. [2025-02-06 09:27:48,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 229 transitions, 531 flow [2025-02-06 09:27:48,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:48,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions. [2025-02-06 09:27:48,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9156118143459916 [2025-02-06 09:27:48,555 INFO L175 Difference]: Start difference. First operand has 228 places, 235 transitions, 473 flow. Second operand 3 states and 651 transitions. [2025-02-06 09:27:48,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 229 transitions, 531 flow [2025-02-06 09:27:48,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 229 transitions, 530 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:27:48,563 INFO L231 Difference]: Finished difference. Result has 225 places, 223 transitions, 478 flow [2025-02-06 09:27:48,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=225, PETRI_TRANSITIONS=223} [2025-02-06 09:27:48,568 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -3 predicate places. [2025-02-06 09:27:48,569 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 223 transitions, 478 flow [2025-02-06 09:27:48,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:48,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:48,569 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:48,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:27:48,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:27:48,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:48,571 INFO L85 PathProgramCache]: Analyzing trace with hash 2088200025, now seen corresponding path program 1 times [2025-02-06 09:27:48,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:48,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135764310] [2025-02-06 09:27:48,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:48,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:48,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 09:27:48,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 09:27:48,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:48,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:48,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:48,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:48,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135764310] [2025-02-06 09:27:48,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135764310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:48,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:48,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:48,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568293030] [2025-02-06 09:27:48,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:48,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:48,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:48,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:48,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:48,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 237 [2025-02-06 09:27:48,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 223 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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-02-06 09:27:48,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:48,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 237 [2025-02-06 09:27:48,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:48,843 INFO L124 PetriNetUnfolderBase]: 113/1198 cut-off events. [2025-02-06 09:27:48,843 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-06 09:27:48,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1538 conditions, 1198 events. 113/1198 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7005 event pairs, 84 based on Foata normal form. 0/1093 useless extension candidates. Maximal degree in co-relation 1488. Up to 221 conditions per place. [2025-02-06 09:27:48,849 INFO L140 encePairwiseOnDemand]: 232/237 looper letters, 28 selfloop transitions, 4 changer transitions 0/232 dead transitions. [2025-02-06 09:27:48,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 232 transitions, 560 flow [2025-02-06 09:27:48,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:48,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:48,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2025-02-06 09:27:48,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8945147679324894 [2025-02-06 09:27:48,853 INFO L175 Difference]: Start difference. First operand has 225 places, 223 transitions, 478 flow. Second operand 3 states and 636 transitions. [2025-02-06 09:27:48,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 232 transitions, 560 flow [2025-02-06 09:27:48,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 232 transitions, 550 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:48,858 INFO L231 Difference]: Finished difference. Result has 227 places, 226 transitions, 498 flow [2025-02-06 09:27:48,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=227, PETRI_TRANSITIONS=226} [2025-02-06 09:27:48,860 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -1 predicate places. [2025-02-06 09:27:48,860 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 226 transitions, 498 flow [2025-02-06 09:27:48,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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-02-06 09:27:48,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:48,861 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-02-06 09:27:48,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:27:48,862 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:27:48,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:48,862 INFO L85 PathProgramCache]: Analyzing trace with hash 367565723, now seen corresponding path program 1 times [2025-02-06 09:27:48,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:48,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320031257] [2025-02-06 09:27:48,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:48,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:48,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 09:27:48,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 09:27:48,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:48,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:48,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:48,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:48,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320031257] [2025-02-06 09:27:48,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320031257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:48,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:48,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:48,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69815285] [2025-02-06 09:27:48,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:48,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:48,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:48,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:48,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:48,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 237 [2025-02-06 09:27:48,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 226 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 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-02-06 09:27:48,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:48,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 237 [2025-02-06 09:27:48,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:49,134 INFO L124 PetriNetUnfolderBase]: 122/2008 cut-off events. [2025-02-06 09:27:49,134 INFO L125 PetriNetUnfolderBase]: For 46/49 co-relation queries the response was YES. [2025-02-06 09:27:49,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2431 conditions, 2008 events. 122/2008 cut-off events. For 46/49 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 14304 event pairs, 26 based on Foata normal form. 0/1814 useless extension candidates. Maximal degree in co-relation 2381. Up to 146 conditions per place. [2025-02-06 09:27:49,140 INFO L140 encePairwiseOnDemand]: 233/237 looper letters, 30 selfloop transitions, 4 changer transitions 0/240 dead transitions. [2025-02-06 09:27:49,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 240 transitions, 598 flow [2025-02-06 09:27:49,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:49,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:49,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 649 transitions. [2025-02-06 09:27:49,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9127988748241913 [2025-02-06 09:27:49,142 INFO L175 Difference]: Start difference. First operand has 227 places, 226 transitions, 498 flow. Second operand 3 states and 649 transitions. [2025-02-06 09:27:49,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 240 transitions, 598 flow [2025-02-06 09:27:49,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 240 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:49,146 INFO L231 Difference]: Finished difference. Result has 229 places, 228 transitions, 518 flow [2025-02-06 09:27:49,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=518, PETRI_PLACES=229, PETRI_TRANSITIONS=228} [2025-02-06 09:27:49,147 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 1 predicate places. [2025-02-06 09:27:49,147 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 228 transitions, 518 flow [2025-02-06 09:27:49,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 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-02-06 09:27:49,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:49,147 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] [2025-02-06 09:27:49,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:27:49,148 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:27:49,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:49,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2015629549, now seen corresponding path program 1 times [2025-02-06 09:27:49,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:49,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10380025] [2025-02-06 09:27:49,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:49,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:49,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 09:27:49,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 09:27:49,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:49,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:49,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:49,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:49,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10380025] [2025-02-06 09:27:49,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10380025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:49,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:49,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:49,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711395188] [2025-02-06 09:27:49,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:49,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:49,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:49,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:49,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:49,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 237 [2025-02-06 09:27:49,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 228 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 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-02-06 09:27:49,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:49,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 237 [2025-02-06 09:27:49,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:49,517 INFO L124 PetriNetUnfolderBase]: 240/3005 cut-off events. [2025-02-06 09:27:49,518 INFO L125 PetriNetUnfolderBase]: For 25/28 co-relation queries the response was YES. [2025-02-06 09:27:49,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3692 conditions, 3005 events. 240/3005 cut-off events. For 25/28 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 24985 event pairs, 34 based on Foata normal form. 0/2707 useless extension candidates. Maximal degree in co-relation 3641. Up to 299 conditions per place. [2025-02-06 09:27:49,530 INFO L140 encePairwiseOnDemand]: 232/237 looper letters, 31 selfloop transitions, 4 changer transitions 0/243 dead transitions. [2025-02-06 09:27:49,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 243 transitions, 618 flow [2025-02-06 09:27:49,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:49,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:49,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 648 transitions. [2025-02-06 09:27:49,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9113924050632911 [2025-02-06 09:27:49,534 INFO L175 Difference]: Start difference. First operand has 229 places, 228 transitions, 518 flow. Second operand 3 states and 648 transitions. [2025-02-06 09:27:49,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 243 transitions, 618 flow [2025-02-06 09:27:49,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 243 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:49,540 INFO L231 Difference]: Finished difference. Result has 231 places, 231 transitions, 540 flow [2025-02-06 09:27:49,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=540, PETRI_PLACES=231, PETRI_TRANSITIONS=231} [2025-02-06 09:27:49,541 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 3 predicate places. [2025-02-06 09:27:49,542 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 231 transitions, 540 flow [2025-02-06 09:27:49,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 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-02-06 09:27:49,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:49,542 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] [2025-02-06 09:27:49,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:27:49,543 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:27:49,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:49,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1449171681, now seen corresponding path program 1 times [2025-02-06 09:27:49,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:49,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847266424] [2025-02-06 09:27:49,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:49,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:49,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-06 09:27:49,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 09:27:49,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:49,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:49,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:49,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:49,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847266424] [2025-02-06 09:27:49,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847266424] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:49,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:49,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 09:27:49,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963694301] [2025-02-06 09:27:49,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:49,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:49,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:49,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:49,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:49,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 237 [2025-02-06 09:27:49,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 231 transitions, 540 flow. Second operand has 6 states, 6 states have (on average 208.16666666666666) internal successors, (1249), 6 states have internal predecessors, (1249), 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-02-06 09:27:49,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:49,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 237 [2025-02-06 09:27:49,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:50,094 INFO L124 PetriNetUnfolderBase]: 40/1040 cut-off events. [2025-02-06 09:27:50,094 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-06 09:27:50,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1272 conditions, 1040 events. 40/1040 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 5010 event pairs, 23 based on Foata normal form. 8/973 useless extension candidates. Maximal degree in co-relation 1218. Up to 82 conditions per place. [2025-02-06 09:27:50,097 INFO L140 encePairwiseOnDemand]: 227/237 looper letters, 17 selfloop transitions, 10 changer transitions 1/229 dead transitions. [2025-02-06 09:27:50,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 229 transitions, 562 flow [2025-02-06 09:27:50,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:27:50,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 09:27:50,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1066 transitions. [2025-02-06 09:27:50,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8995780590717299 [2025-02-06 09:27:50,100 INFO L175 Difference]: Start difference. First operand has 231 places, 231 transitions, 540 flow. Second operand 5 states and 1066 transitions. [2025-02-06 09:27:50,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 229 transitions, 562 flow [2025-02-06 09:27:50,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 229 transitions, 532 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-02-06 09:27:50,104 INFO L231 Difference]: Finished difference. Result has 226 places, 222 transitions, 498 flow [2025-02-06 09:27:50,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=498, PETRI_PLACES=226, PETRI_TRANSITIONS=222} [2025-02-06 09:27:50,105 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -2 predicate places. [2025-02-06 09:27:50,105 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 222 transitions, 498 flow [2025-02-06 09:27:50,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 208.16666666666666) internal successors, (1249), 6 states have internal predecessors, (1249), 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-02-06 09:27:50,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:50,106 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:50,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:27:50,106 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:27:50,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:50,107 INFO L85 PathProgramCache]: Analyzing trace with hash 188639647, now seen corresponding path program 1 times [2025-02-06 09:27:50,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:50,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855290541] [2025-02-06 09:27:50,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:50,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:50,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 09:27:50,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 09:27:50,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:50,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:50,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:50,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:50,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855290541] [2025-02-06 09:27:50,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855290541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:50,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:50,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:50,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801978861] [2025-02-06 09:27:50,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:50,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:50,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:50,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:50,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:50,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 237 [2025-02-06 09:27:50,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 222 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 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-02-06 09:27:50,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:50,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 237 [2025-02-06 09:27:50,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:50,278 INFO L124 PetriNetUnfolderBase]: 66/1216 cut-off events. [2025-02-06 09:27:50,279 INFO L125 PetriNetUnfolderBase]: For 104/106 co-relation queries the response was YES. [2025-02-06 09:27:50,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1572 conditions, 1216 events. 66/1216 cut-off events. For 104/106 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 6827 event pairs, 59 based on Foata normal form. 0/1122 useless extension candidates. Maximal degree in co-relation 1518. Up to 189 conditions per place. [2025-02-06 09:27:50,282 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 28 selfloop transitions, 3 changer transitions 0/223 dead transitions. [2025-02-06 09:27:50,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 223 transitions, 565 flow [2025-02-06 09:27:50,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:50,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:50,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 626 transitions. [2025-02-06 09:27:50,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8804500703234881 [2025-02-06 09:27:50,284 INFO L175 Difference]: Start difference. First operand has 226 places, 222 transitions, 498 flow. Second operand 3 states and 626 transitions. [2025-02-06 09:27:50,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 223 transitions, 565 flow [2025-02-06 09:27:50,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 223 transitions, 562 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:50,287 INFO L231 Difference]: Finished difference. Result has 225 places, 221 transitions, 499 flow [2025-02-06 09:27:50,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=499, PETRI_PLACES=225, PETRI_TRANSITIONS=221} [2025-02-06 09:27:50,288 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -3 predicate places. [2025-02-06 09:27:50,288 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 221 transitions, 499 flow [2025-02-06 09:27:50,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 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-02-06 09:27:50,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:50,288 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-02-06 09:27:50,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:27:50,288 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:27:50,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:50,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1021020146, now seen corresponding path program 1 times [2025-02-06 09:27:50,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:50,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719336983] [2025-02-06 09:27:50,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:50,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:50,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 09:27:50,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 09:27:50,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:50,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:50,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:50,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:50,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719336983] [2025-02-06 09:27:50,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719336983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:50,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:50,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:50,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350695091] [2025-02-06 09:27:50,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:50,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:50,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:50,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:50,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:50,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 237 [2025-02-06 09:27:50,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 221 transitions, 499 flow. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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-02-06 09:27:50,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:50,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 237 [2025-02-06 09:27:50,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:50,448 INFO L124 PetriNetUnfolderBase]: 69/1218 cut-off events. [2025-02-06 09:27:50,449 INFO L125 PetriNetUnfolderBase]: For 114/118 co-relation queries the response was YES. [2025-02-06 09:27:50,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1600 conditions, 1218 events. 69/1218 cut-off events. For 114/118 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6821 event pairs, 60 based on Foata normal form. 0/1132 useless extension candidates. Maximal degree in co-relation 1547. Up to 193 conditions per place. [2025-02-06 09:27:50,453 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 28 selfloop transitions, 3 changer transitions 0/222 dead transitions. [2025-02-06 09:27:50,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 222 transitions, 566 flow [2025-02-06 09:27:50,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:50,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 626 transitions. [2025-02-06 09:27:50,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8804500703234881 [2025-02-06 09:27:50,454 INFO L175 Difference]: Start difference. First operand has 225 places, 221 transitions, 499 flow. Second operand 3 states and 626 transitions. [2025-02-06 09:27:50,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 222 transitions, 566 flow [2025-02-06 09:27:50,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 222 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:50,458 INFO L231 Difference]: Finished difference. Result has 224 places, 220 transitions, 497 flow [2025-02-06 09:27:50,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=497, PETRI_PLACES=224, PETRI_TRANSITIONS=220} [2025-02-06 09:27:50,459 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -4 predicate places. [2025-02-06 09:27:50,459 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 220 transitions, 497 flow [2025-02-06 09:27:50,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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-02-06 09:27:50,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:50,459 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] [2025-02-06 09:27:50,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:27:50,460 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:27:50,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:50,460 INFO L85 PathProgramCache]: Analyzing trace with hash -2144097140, now seen corresponding path program 1 times [2025-02-06 09:27:50,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:50,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168746824] [2025-02-06 09:27:50,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:50,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:50,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 09:27:50,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 09:27:50,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:50,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:50,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:50,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:50,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168746824] [2025-02-06 09:27:50,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168746824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:50,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:50,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:50,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542226545] [2025-02-06 09:27:50,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:50,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:50,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:50,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:50,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:50,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 237 [2025-02-06 09:27:50,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 220 transitions, 497 flow. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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-02-06 09:27:50,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:50,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 237 [2025-02-06 09:27:50,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:50,643 INFO L124 PetriNetUnfolderBase]: 112/1285 cut-off events. [2025-02-06 09:27:50,643 INFO L125 PetriNetUnfolderBase]: For 116/123 co-relation queries the response was YES. [2025-02-06 09:27:50,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1770 conditions, 1285 events. 112/1285 cut-off events. For 116/123 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7216 event pairs, 82 based on Foata normal form. 0/1182 useless extension candidates. Maximal degree in co-relation 1717. Up to 254 conditions per place. [2025-02-06 09:27:50,647 INFO L140 encePairwiseOnDemand]: 231/237 looper letters, 29 selfloop transitions, 5 changer transitions 9/230 dead transitions. [2025-02-06 09:27:50,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 230 transitions, 603 flow [2025-02-06 09:27:50,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:50,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:50,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 633 transitions. [2025-02-06 09:27:50,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.890295358649789 [2025-02-06 09:27:50,649 INFO L175 Difference]: Start difference. First operand has 224 places, 220 transitions, 497 flow. Second operand 3 states and 633 transitions. [2025-02-06 09:27:50,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 230 transitions, 603 flow [2025-02-06 09:27:50,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 230 transitions, 597 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:50,653 INFO L231 Difference]: Finished difference. Result has 226 places, 217 transitions, 502 flow [2025-02-06 09:27:50,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=226, PETRI_TRANSITIONS=217} [2025-02-06 09:27:50,656 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -2 predicate places. [2025-02-06 09:27:50,656 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 217 transitions, 502 flow [2025-02-06 09:27:50,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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-02-06 09:27:50,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:50,657 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:50,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:27:50,657 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:27:50,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:50,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1692200893, now seen corresponding path program 1 times [2025-02-06 09:27:50,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:50,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702122504] [2025-02-06 09:27:50,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:50,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:50,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 09:27:50,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 09:27:50,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:50,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:50,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:50,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:50,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702122504] [2025-02-06 09:27:50,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702122504] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:50,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:50,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:50,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989988155] [2025-02-06 09:27:50,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:50,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:50,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:50,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:50,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:50,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 237 [2025-02-06 09:27:50,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 217 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 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-02-06 09:27:50,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:50,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 237 [2025-02-06 09:27:50,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:50,803 INFO L124 PetriNetUnfolderBase]: 73/1011 cut-off events. [2025-02-06 09:27:50,803 INFO L125 PetriNetUnfolderBase]: For 111/114 co-relation queries the response was YES. [2025-02-06 09:27:50,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1419 conditions, 1011 events. 73/1011 cut-off events. For 111/114 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4905 event pairs, 52 based on Foata normal form. 0/943 useless extension candidates. Maximal degree in co-relation 1366. Up to 172 conditions per place. [2025-02-06 09:27:50,806 INFO L140 encePairwiseOnDemand]: 232/237 looper letters, 28 selfloop transitions, 5 changer transitions 0/224 dead transitions. [2025-02-06 09:27:50,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 224 transitions, 589 flow [2025-02-06 09:27:50,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:50,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:50,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 634 transitions. [2025-02-06 09:27:50,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8917018284106891 [2025-02-06 09:27:50,808 INFO L175 Difference]: Start difference. First operand has 226 places, 217 transitions, 502 flow. Second operand 3 states and 634 transitions. [2025-02-06 09:27:50,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 224 transitions, 589 flow [2025-02-06 09:27:50,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 224 transitions, 575 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:50,811 INFO L231 Difference]: Finished difference. Result has 228 places, 220 transitions, 526 flow [2025-02-06 09:27:50,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=228, PETRI_TRANSITIONS=220} [2025-02-06 09:27:50,811 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 0 predicate places. [2025-02-06 09:27:50,812 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 220 transitions, 526 flow [2025-02-06 09:27:50,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 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-02-06 09:27:50,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:50,812 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:50,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:27:50,812 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:27:50,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:50,813 INFO L85 PathProgramCache]: Analyzing trace with hash -901093121, now seen corresponding path program 1 times [2025-02-06 09:27:50,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:50,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153194053] [2025-02-06 09:27:50,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:50,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:50,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 09:27:50,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 09:27:50,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:50,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:50,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:50,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:50,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153194053] [2025-02-06 09:27:50,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153194053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:50,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:50,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:50,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985723510] [2025-02-06 09:27:50,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:50,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:50,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:50,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:50,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:50,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 237 [2025-02-06 09:27:50,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 220 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 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-02-06 09:27:50,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:50,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 237 [2025-02-06 09:27:50,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:50,944 INFO L124 PetriNetUnfolderBase]: 63/1035 cut-off events. [2025-02-06 09:27:50,944 INFO L125 PetriNetUnfolderBase]: For 198/203 co-relation queries the response was YES. [2025-02-06 09:27:50,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1472 conditions, 1035 events. 63/1035 cut-off events. For 198/203 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5103 event pairs, 30 based on Foata normal form. 0/972 useless extension candidates. Maximal degree in co-relation 1418. Up to 110 conditions per place. [2025-02-06 09:27:50,946 INFO L140 encePairwiseOnDemand]: 232/237 looper letters, 24 selfloop transitions, 3 changer transitions 12/232 dead transitions. [2025-02-06 09:27:50,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 232 transitions, 644 flow [2025-02-06 09:27:50,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:50,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:50,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 642 transitions. [2025-02-06 09:27:50,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9029535864978903 [2025-02-06 09:27:50,948 INFO L175 Difference]: Start difference. First operand has 228 places, 220 transitions, 526 flow. Second operand 3 states and 642 transitions. [2025-02-06 09:27:50,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 232 transitions, 644 flow [2025-02-06 09:27:50,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 232 transitions, 634 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:50,951 INFO L231 Difference]: Finished difference. Result has 230 places, 218 transitions, 530 flow [2025-02-06 09:27:50,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=230, PETRI_TRANSITIONS=218} [2025-02-06 09:27:50,952 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 2 predicate places. [2025-02-06 09:27:50,952 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 218 transitions, 530 flow [2025-02-06 09:27:50,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 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-02-06 09:27:50,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:50,953 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:50,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:27:50,953 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:27:50,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:50,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1620383298, now seen corresponding path program 1 times [2025-02-06 09:27:50,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:50,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145513353] [2025-02-06 09:27:50,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:50,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:50,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-06 09:27:50,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-06 09:27:50,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:50,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:51,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-02-06 09:27:51,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:51,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145513353] [2025-02-06 09:27:51,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145513353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:51,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:51,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 09:27:51,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703584203] [2025-02-06 09:27:51,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:51,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 09:27:51,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:51,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 09:27:51,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 09:27:51,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 237 [2025-02-06 09:27:51,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 218 transitions, 530 flow. Second operand has 7 states, 7 states have (on average 208.14285714285714) internal successors, (1457), 7 states have internal predecessors, (1457), 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-02-06 09:27:51,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:51,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 237 [2025-02-06 09:27:51,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:51,513 INFO L124 PetriNetUnfolderBase]: 16/563 cut-off events. [2025-02-06 09:27:51,513 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-02-06 09:27:51,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 563 events. 16/563 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1649 event pairs, 2 based on Foata normal form. 6/540 useless extension candidates. Maximal degree in co-relation 681. Up to 45 conditions per place. [2025-02-06 09:27:51,514 INFO L140 encePairwiseOnDemand]: 231/237 looper letters, 0 selfloop transitions, 0 changer transitions 209/209 dead transitions. [2025-02-06 09:27:51,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 209 transitions, 543 flow [2025-02-06 09:27:51,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:51,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1261 transitions. [2025-02-06 09:27:51,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8867791842475387 [2025-02-06 09:27:51,517 INFO L175 Difference]: Start difference. First operand has 230 places, 218 transitions, 530 flow. Second operand 6 states and 1261 transitions. [2025-02-06 09:27:51,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 209 transitions, 543 flow [2025-02-06 09:27:51,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 209 transitions, 502 flow, removed 8 selfloop flow, removed 8 redundant places. [2025-02-06 09:27:51,519 INFO L231 Difference]: Finished difference. Result has 217 places, 0 transitions, 0 flow [2025-02-06 09:27:51,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=217, PETRI_TRANSITIONS=0} [2025-02-06 09:27:51,519 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -11 predicate places. [2025-02-06 09:27:51,519 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 0 transitions, 0 flow [2025-02-06 09:27:51,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 208.14285714285714) internal successors, (1457), 7 states have internal predecessors, (1457), 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-02-06 09:27:51,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2025-02-06 09:27:51,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-02-06 09:27:51,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-02-06 09:27:51,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-02-06 09:27:51,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-02-06 09:27:51,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining) [2025-02-06 09:27:51,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-02-06 09:27:51,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-02-06 09:27:51,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-02-06 09:27:51,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-02-06 09:27:51,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-02-06 09:27:51,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-02-06 09:27:51,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-02-06 09:27:51,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-02-06 09:27:51,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:27:51,523 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:51,526 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 09:27:51,526 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:27:51,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:27:51 BasicIcfg [2025-02-06 09:27:51,529 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:27:51,529 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:27:51,529 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:27:51,529 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:27:51,530 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:27:47" (3/4) ... [2025-02-06 09:27:51,531 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 09:27:51,533 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-02-06 09:27:51,535 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-02-06 09:27:51,535 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 09:27:51,535 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 09:27:51,535 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 09:27:51,585 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:27:51,585 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:27:51,585 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:27:51,586 INFO L158 Benchmark]: Toolchain (without parser) took 4839.66ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 112.9MB in the beginning and 162.4MB in the end (delta: -49.5MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2025-02-06 09:27:51,586 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:27:51,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.19ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 92.0MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 09:27:51,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.81ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 89.7MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:27:51,587 INFO L158 Benchmark]: Boogie Preprocessor took 27.08ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 88.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:27:51,587 INFO L158 Benchmark]: IcfgBuilder took 483.25ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 65.0MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 09:27:51,587 INFO L158 Benchmark]: TraceAbstraction took 3810.35ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 64.5MB in the beginning and 168.5MB in the end (delta: -104.0MB). Peak memory consumption was 78.2MB. Max. memory is 16.1GB. [2025-02-06 09:27:51,587 INFO L158 Benchmark]: Witness Printer took 56.17ms. Allocated memory is still 209.7MB. Free memory was 168.5MB in the beginning and 162.4MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:27:51,588 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.17ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.19ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 92.0MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.81ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 89.7MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.08ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 88.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 483.25ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 65.0MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3810.35ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 64.5MB in the beginning and 168.5MB in the end (delta: -104.0MB). Peak memory consumption was 78.2MB. Max. memory is 16.1GB. * Witness Printer took 56.17ms. Allocated memory is still 209.7MB. Free memory was 168.5MB in the beginning and 162.4MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 737]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 738]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 739]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 742]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 746]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 716]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 717]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 722]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 723]: 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 3 procedures, 332 locations, 14 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 442 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 269 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 812 IncrementalHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 34 mSDtfsCounter, 812 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=540occurred in iteration=4, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 985 NumberOfCodeBlocks, 985 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 974 ConstructedInterpolants, 0 QuantifiedInterpolants, 2347 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 09:27:51,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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