./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb010ae024b402436affeb854f96a5f9e0df3d8ec2cfe8b3a7f33676b7169a2c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:01:56,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:01:56,118 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:01:56,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:01:56,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:01:56,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:01:56,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:01:56,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:01:56,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:01:56,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:01:56,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:01:56,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:01:56,147 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:01:56,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:01:56,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:01:56,147 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:01:56,147 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:01:56,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:01:56,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:01:56,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:01:56,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:01:56,147 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:01:56,149 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:01:56,149 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:01:56,149 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:01:56,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:01:56,149 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:01:56,149 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:01:56,149 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:01:56,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:01:56,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:01:56,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:01:56,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:01:56,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:01:56,150 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:01:56,150 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:01:56,150 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:01:56,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:01:56,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:01:56,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:01:56,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:01:56,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:01:56,150 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb010ae024b402436affeb854f96a5f9e0df3d8ec2cfe8b3a7f33676b7169a2c [2025-03-08 22:01:56,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:01:56,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:01:56,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:01:56,373 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:01:56,373 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:01:56,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i [2025-03-08 22:01:57,496 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/973d346b8/f11c90d5aec34759aa26cd17b3f19b06/FLAG0435ffdf4 [2025-03-08 22:01:57,761 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:01:57,762 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i [2025-03-08 22:01:57,778 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/973d346b8/f11c90d5aec34759aa26cd17b3f19b06/FLAG0435ffdf4 [2025-03-08 22:01:58,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/973d346b8/f11c90d5aec34759aa26cd17b3f19b06 [2025-03-08 22:01:58,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:01:58,069 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:01:58,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:01:58,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:01:58,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:01:58,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:01:58" (1/1) ... [2025-03-08 22:01:58,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a530299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58, skipping insertion in model container [2025-03-08 22:01:58,074 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:01:58" (1/1) ... [2025-03-08 22:01:58,093 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:01:58,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:01:58,377 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:01:58,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:01:58,436 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:01:58,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58 WrapperNode [2025-03-08 22:01:58,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:01:58,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:01:58,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:01:58,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:01:58,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58" (1/1) ... [2025-03-08 22:01:58,448 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58" (1/1) ... [2025-03-08 22:01:58,460 INFO L138 Inliner]: procedures = 170, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2025-03-08 22:01:58,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:01:58,461 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:01:58,461 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:01:58,461 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:01:58,466 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58" (1/1) ... [2025-03-08 22:01:58,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58" (1/1) ... [2025-03-08 22:01:58,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58" (1/1) ... [2025-03-08 22:01:58,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58" (1/1) ... [2025-03-08 22:01:58,477 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58" (1/1) ... [2025-03-08 22:01:58,481 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58" (1/1) ... [2025-03-08 22:01:58,482 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58" (1/1) ... [2025-03-08 22:01:58,483 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58" (1/1) ... [2025-03-08 22:01:58,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:01:58,485 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:01:58,485 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:01:58,485 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:01:58,486 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58" (1/1) ... [2025-03-08 22:01:58,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:01:58,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:01:58,522 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:01:58,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:01:58,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:01:58,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:01:58,544 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 22:01:58,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:01:58,544 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-08 22:01:58,545 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-08 22:01:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:01:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 22:01:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:01:58,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:01:58,546 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:01:58,653 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:01:58,655 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:01:58,880 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:01:58,880 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:01:58,898 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:01:58,899 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:01:58,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:01:58 BoogieIcfgContainer [2025-03-08 22:01:58,899 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:01:58,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:01:58,901 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:01:58,904 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:01:58,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:01:58" (1/3) ... [2025-03-08 22:01:58,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@525f0d32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:01:58, skipping insertion in model container [2025-03-08 22:01:58,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58" (2/3) ... [2025-03-08 22:01:58,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@525f0d32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:01:58, skipping insertion in model container [2025-03-08 22:01:58,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:01:58" (3/3) ... [2025-03-08 22:01:58,906 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_21-deref_read_racing.i [2025-03-08 22:01:58,918 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:01:58,920 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_21-deref_read_racing.i that has 2 procedures, 142 locations, 1 initial locations, 4 loop locations, and 10 error locations. [2025-03-08 22:01:58,921 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:01:58,989 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 22:01:59,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 152 transitions, 308 flow [2025-03-08 22:01:59,081 INFO L124 PetriNetUnfolderBase]: 14/202 cut-off events. [2025-03-08 22:01:59,084 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:01:59,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 202 events. 14/202 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 594 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 121. Up to 4 conditions per place. [2025-03-08 22:01:59,092 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 152 transitions, 308 flow [2025-03-08 22:01:59,099 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 152 transitions, 308 flow [2025-03-08 22:01:59,106 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:01:59,115 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;@248d41eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:01:59,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-08 22:01:59,127 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:01:59,128 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2025-03-08 22:01:59,128 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:01:59,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:01:59,129 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] [2025-03-08 22:01:59,131 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-08 22:01:59,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:01:59,136 INFO L85 PathProgramCache]: Analyzing trace with hash 309722205, now seen corresponding path program 1 times [2025-03-08 22:01:59,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:01:59,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429722443] [2025-03-08 22:01:59,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:01:59,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:01:59,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 22:01:59,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 22:01:59,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:01:59,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:01:59,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:01:59,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:01:59,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429722443] [2025-03-08 22:01:59,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429722443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:01:59,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:01:59,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:01:59,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261961213] [2025-03-08 22:01:59,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:01:59,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:01:59,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:01:59,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:01:59,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:01:59,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 152 [2025-03-08 22:01:59,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 152 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:01:59,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:01:59,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 152 [2025-03-08 22:01:59,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:01:59,511 INFO L124 PetriNetUnfolderBase]: 36/469 cut-off events. [2025-03-08 22:01:59,512 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 22:01:59,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 469 events. 36/469 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1966 event pairs, 20 based on Foata normal form. 42/458 useless extension candidates. Maximal degree in co-relation 516. Up to 80 conditions per place. [2025-03-08 22:01:59,517 INFO L140 encePairwiseOnDemand]: 139/152 looper letters, 19 selfloop transitions, 2 changer transitions 0/146 dead transitions. [2025-03-08 22:01:59,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 146 transitions, 338 flow [2025-03-08 22:01:59,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:01:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:01:59,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2025-03-08 22:01:59,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9122807017543859 [2025-03-08 22:01:59,531 INFO L175 Difference]: Start difference. First operand has 145 places, 152 transitions, 308 flow. Second operand 3 states and 416 transitions. [2025-03-08 22:01:59,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 146 transitions, 338 flow [2025-03-08 22:01:59,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 146 transitions, 338 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:01:59,539 INFO L231 Difference]: Finished difference. Result has 146 places, 140 transitions, 292 flow [2025-03-08 22:01:59,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=146, PETRI_TRANSITIONS=140} [2025-03-08 22:01:59,546 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 1 predicate places. [2025-03-08 22:01:59,546 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 140 transitions, 292 flow [2025-03-08 22:01:59,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:01:59,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:01:59,547 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] [2025-03-08 22:01:59,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:01:59,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-08 22:01:59,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:01:59,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1662235516, now seen corresponding path program 1 times [2025-03-08 22:01:59,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:01:59,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768679624] [2025-03-08 22:01:59,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:01:59,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:01:59,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 22:01:59,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 22:01:59,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:01:59,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:01:59,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:01:59,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:01:59,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768679624] [2025-03-08 22:01:59,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768679624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:01:59,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:01:59,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:01:59,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513694669] [2025-03-08 22:01:59,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:01:59,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:01:59,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:01:59,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:01:59,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:01:59,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 152 [2025-03-08 22:01:59,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 140 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:01:59,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:01:59,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 152 [2025-03-08 22:01:59,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:01:59,721 INFO L124 PetriNetUnfolderBase]: 40/574 cut-off events. [2025-03-08 22:01:59,721 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 22:01:59,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 574 events. 40/574 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2789 event pairs, 28 based on Foata normal form. 0/520 useless extension candidates. Maximal degree in co-relation 636. Up to 92 conditions per place. [2025-03-08 22:01:59,724 INFO L140 encePairwiseOnDemand]: 147/152 looper letters, 17 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2025-03-08 22:01:59,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 141 transitions, 332 flow [2025-03-08 22:01:59,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:01:59,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:01:59,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2025-03-08 22:01:59,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8574561403508771 [2025-03-08 22:01:59,727 INFO L175 Difference]: Start difference. First operand has 146 places, 140 transitions, 292 flow. Second operand 3 states and 391 transitions. [2025-03-08 22:01:59,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 141 transitions, 332 flow [2025-03-08 22:01:59,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 141 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:01:59,731 INFO L231 Difference]: Finished difference. Result has 144 places, 139 transitions, 296 flow [2025-03-08 22:01:59,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=144, PETRI_TRANSITIONS=139} [2025-03-08 22:01:59,731 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, -1 predicate places. [2025-03-08 22:01:59,732 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 139 transitions, 296 flow [2025-03-08 22:01:59,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:01:59,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:01:59,733 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:01:59,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:01:59,733 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-08 22:01:59,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:01:59,734 INFO L85 PathProgramCache]: Analyzing trace with hash -21776086, now seen corresponding path program 1 times [2025-03-08 22:01:59,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:01:59,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272208954] [2025-03-08 22:01:59,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:01:59,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:01:59,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 22:01:59,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 22:01:59,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:01:59,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:01:59,760 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:01:59,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 22:01:59,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 22:01:59,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:01:59,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:01:59,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:01:59,796 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:01:59,797 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-03-08 22:01:59,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2025-03-08 22:01:59,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2025-03-08 22:01:59,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2025-03-08 22:01:59,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2025-03-08 22:01:59,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2025-03-08 22:01:59,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 17 remaining) [2025-03-08 22:01:59,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2025-03-08 22:01:59,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2025-03-08 22:01:59,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2025-03-08 22:01:59,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2025-03-08 22:01:59,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 17 remaining) [2025-03-08 22:01:59,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2025-03-08 22:01:59,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2025-03-08 22:01:59,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2025-03-08 22:01:59,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2025-03-08 22:01:59,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2025-03-08 22:01:59,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:01:59,802 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 22:01:59,804 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 22:01:59,804 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 22:01:59,834 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 22:01:59,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 221 transitions, 452 flow [2025-03-08 22:01:59,885 INFO L124 PetriNetUnfolderBase]: 24/324 cut-off events. [2025-03-08 22:01:59,885 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 22:01:59,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332 conditions, 324 events. 24/324 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1307 event pairs, 0 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 203. Up to 6 conditions per place. [2025-03-08 22:01:59,887 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 221 transitions, 452 flow [2025-03-08 22:01:59,891 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 221 transitions, 452 flow [2025-03-08 22:01:59,893 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:01:59,894 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;@248d41eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:01:59,894 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-08 22:01:59,897 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:01:59,898 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2025-03-08 22:01:59,898 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:01:59,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:01:59,898 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] [2025-03-08 22:01:59,898 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-08 22:01:59,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:01:59,899 INFO L85 PathProgramCache]: Analyzing trace with hash 992232250, now seen corresponding path program 1 times [2025-03-08 22:01:59,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:01:59,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621916092] [2025-03-08 22:01:59,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:01:59,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:01:59,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 22:01:59,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 22:01:59,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:01:59,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:01:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:01:59,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:01:59,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621916092] [2025-03-08 22:01:59,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621916092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:01:59,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:01:59,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:01:59,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149833438] [2025-03-08 22:01:59,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:01:59,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:01:59,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:01:59,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:01:59,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:01:59,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 221 [2025-03-08 22:01:59,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 221 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:01:59,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:01:59,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 221 [2025-03-08 22:01:59,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:00,487 INFO L124 PetriNetUnfolderBase]: 582/4351 cut-off events. [2025-03-08 22:02:00,488 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-08 22:02:00,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5354 conditions, 4351 events. 582/4351 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 41004 event pairs, 468 based on Foata normal form. 455/4357 useless extension candidates. Maximal degree in co-relation 716. Up to 969 conditions per place. [2025-03-08 22:02:00,512 INFO L140 encePairwiseOnDemand]: 202/221 looper letters, 27 selfloop transitions, 2 changer transitions 0/210 dead transitions. [2025-03-08 22:02:00,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 210 transitions, 488 flow [2025-03-08 22:02:00,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:00,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:00,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 598 transitions. [2025-03-08 22:02:00,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9019607843137255 [2025-03-08 22:02:00,514 INFO L175 Difference]: Start difference. First operand has 210 places, 221 transitions, 452 flow. Second operand 3 states and 598 transitions. [2025-03-08 22:02:00,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 210 transitions, 488 flow [2025-03-08 22:02:00,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 210 transitions, 488 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:02:00,519 INFO L231 Difference]: Finished difference. Result has 211 places, 204 transitions, 428 flow [2025-03-08 22:02:00,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=428, PETRI_PLACES=211, PETRI_TRANSITIONS=204} [2025-03-08 22:02:00,519 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, 1 predicate places. [2025-03-08 22:02:00,520 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 204 transitions, 428 flow [2025-03-08 22:02:00,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:00,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:00,521 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] [2025-03-08 22:02:00,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:02:00,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-08 22:02:00,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:00,521 INFO L85 PathProgramCache]: Analyzing trace with hash 685094677, now seen corresponding path program 1 times [2025-03-08 22:02:00,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:00,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295159411] [2025-03-08 22:02:00,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:00,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:00,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 22:02:00,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 22:02:00,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:00,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:00,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:02:00,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:00,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295159411] [2025-03-08 22:02:00,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295159411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:00,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:00,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:02:00,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194470257] [2025-03-08 22:02:00,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:00,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:00,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:00,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:00,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:00,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 221 [2025-03-08 22:02:00,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 204 transitions, 428 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:00,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:00,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 221 [2025-03-08 22:02:00,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:01,298 INFO L124 PetriNetUnfolderBase]: 1030/6067 cut-off events. [2025-03-08 22:02:01,299 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-08 22:02:01,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7806 conditions, 6067 events. 1030/6067 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 60709 event pairs, 811 based on Foata normal form. 0/5569 useless extension candidates. Maximal degree in co-relation 7758. Up to 1672 conditions per place. [2025-03-08 22:02:01,327 INFO L140 encePairwiseOnDemand]: 213/221 looper letters, 31 selfloop transitions, 3 changer transitions 0/207 dead transitions. [2025-03-08 22:02:01,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 207 transitions, 507 flow [2025-03-08 22:02:01,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:01,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:01,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2025-03-08 22:02:01,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8416289592760181 [2025-03-08 22:02:01,329 INFO L175 Difference]: Start difference. First operand has 211 places, 204 transitions, 428 flow. Second operand 3 states and 558 transitions. [2025-03-08 22:02:01,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 207 transitions, 507 flow [2025-03-08 22:02:01,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 207 transitions, 505 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:02:01,332 INFO L231 Difference]: Finished difference. Result has 208 places, 202 transitions, 437 flow [2025-03-08 22:02:01,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=437, PETRI_PLACES=208, PETRI_TRANSITIONS=202} [2025-03-08 22:02:01,333 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, -2 predicate places. [2025-03-08 22:02:01,333 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 202 transitions, 437 flow [2025-03-08 22:02:01,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:01,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:01,334 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] [2025-03-08 22:02:01,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:02:01,334 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-08 22:02:01,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:01,335 INFO L85 PathProgramCache]: Analyzing trace with hash -799769925, now seen corresponding path program 1 times [2025-03-08 22:02:01,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:01,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945761141] [2025-03-08 22:02:01,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:01,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:01,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 22:02:01,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 22:02:01,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:01,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:01,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:02:01,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:01,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945761141] [2025-03-08 22:02:01,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945761141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:01,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:01,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:02:01,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992504114] [2025-03-08 22:02:01,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:01,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:02:01,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:01,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:02:01,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:02:01,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 221 [2025-03-08 22:02:01,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 202 transitions, 437 flow. Second operand has 5 states, 5 states have (on average 181.6) internal successors, (908), 5 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:01,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:01,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 221 [2025-03-08 22:02:01,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:01,842 INFO L124 PetriNetUnfolderBase]: 798/4307 cut-off events. [2025-03-08 22:02:01,842 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-08 22:02:01,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5861 conditions, 4307 events. 798/4307 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 39486 event pairs, 107 based on Foata normal form. 7/3873 useless extension candidates. Maximal degree in co-relation 3637. Up to 1024 conditions per place. [2025-03-08 22:02:01,869 INFO L140 encePairwiseOnDemand]: 216/221 looper letters, 52 selfloop transitions, 5 changer transitions 0/234 dead transitions. [2025-03-08 22:02:01,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 234 transitions, 615 flow [2025-03-08 22:02:01,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:02:01,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:02:01,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1138 transitions. [2025-03-08 22:02:01,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8582202111613876 [2025-03-08 22:02:01,872 INFO L175 Difference]: Start difference. First operand has 208 places, 202 transitions, 437 flow. Second operand 6 states and 1138 transitions. [2025-03-08 22:02:01,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 234 transitions, 615 flow [2025-03-08 22:02:01,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 234 transitions, 615 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:02:01,880 INFO L231 Difference]: Finished difference. Result has 216 places, 204 transitions, 463 flow [2025-03-08 22:02:01,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=463, PETRI_PLACES=216, PETRI_TRANSITIONS=204} [2025-03-08 22:02:01,882 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, 6 predicate places. [2025-03-08 22:02:01,882 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 204 transitions, 463 flow [2025-03-08 22:02:01,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 181.6) internal successors, (908), 5 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:01,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:01,883 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] [2025-03-08 22:02:01,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:02:01,883 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-08 22:02:01,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:01,884 INFO L85 PathProgramCache]: Analyzing trace with hash 649910491, now seen corresponding path program 1 times [2025-03-08 22:02:01,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:01,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826807097] [2025-03-08 22:02:01,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:01,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:01,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 22:02:01,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 22:02:01,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:01,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:02,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:02:02,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:02,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826807097] [2025-03-08 22:02:02,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826807097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:02,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:02,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:02:02,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192601641] [2025-03-08 22:02:02,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:02,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:02:02,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:02,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:02:02,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:02:02,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 221 [2025-03-08 22:02:02,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 204 transitions, 463 flow. Second operand has 6 states, 6 states have (on average 144.5) internal successors, (867), 6 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:02,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:02,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 221 [2025-03-08 22:02:02,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:04,425 INFO L124 PetriNetUnfolderBase]: 8391/20713 cut-off events. [2025-03-08 22:02:04,425 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2025-03-08 22:02:04,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35191 conditions, 20713 events. 8391/20713 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 891. Compared 228176 event pairs, 2271 based on Foata normal form. 0/19847 useless extension candidates. Maximal degree in co-relation 34907. Up to 6204 conditions per place. [2025-03-08 22:02:04,550 INFO L140 encePairwiseOnDemand]: 177/221 looper letters, 209 selfloop transitions, 84 changer transitions 0/436 dead transitions. [2025-03-08 22:02:04,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 436 transitions, 1533 flow [2025-03-08 22:02:04,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:02:04,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:02:04,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1155 transitions. [2025-03-08 22:02:04,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8710407239819005 [2025-03-08 22:02:04,553 INFO L175 Difference]: Start difference. First operand has 216 places, 204 transitions, 463 flow. Second operand 6 states and 1155 transitions. [2025-03-08 22:02:04,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 436 transitions, 1533 flow [2025-03-08 22:02:04,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 436 transitions, 1527 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-08 22:02:04,559 INFO L231 Difference]: Finished difference. Result has 224 places, 296 transitions, 1089 flow [2025-03-08 22:02:04,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1089, PETRI_PLACES=224, PETRI_TRANSITIONS=296} [2025-03-08 22:02:04,560 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, 14 predicate places. [2025-03-08 22:02:04,560 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 296 transitions, 1089 flow [2025-03-08 22:02:04,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 144.5) internal successors, (867), 6 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:04,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:04,561 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:04,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:02:04,561 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-08 22:02:04,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:04,561 INFO L85 PathProgramCache]: Analyzing trace with hash -351430650, now seen corresponding path program 1 times [2025-03-08 22:02:04,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:04,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892488295] [2025-03-08 22:02:04,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:04,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:04,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 22:02:04,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 22:02:04,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:04,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:02:04,573 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:02:04,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 22:02:04,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 22:02:04,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:04,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:02:04,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:02:04,585 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:02:04,585 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-03-08 22:02:04,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-03-08 22:02:04,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-03-08 22:02:04,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-03-08 22:02:04,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-03-08 22:02:04,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-03-08 22:02:04,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-03-08 22:02:04,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-03-08 22:02:04,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-03-08 22:02:04,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-03-08 22:02:04,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-03-08 22:02:04,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-03-08 22:02:04,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-03-08 22:02:04,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-03-08 22:02:04,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-03-08 22:02:04,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-03-08 22:02:04,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-03-08 22:02:04,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-03-08 22:02:04,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-03-08 22:02:04,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-03-08 22:02:04,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-03-08 22:02:04,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-03-08 22:02:04,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-03-08 22:02:04,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:02:04,589 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-08 22:02:04,589 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 22:02:04,589 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-08 22:02:04,622 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 22:02:04,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 290 transitions, 598 flow [2025-03-08 22:02:04,662 INFO L124 PetriNetUnfolderBase]: 34/446 cut-off events. [2025-03-08 22:02:04,662 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-08 22:02:04,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 446 events. 34/446 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2082 event pairs, 0 based on Foata normal form. 0/374 useless extension candidates. Maximal degree in co-relation 328. Up to 8 conditions per place. [2025-03-08 22:02:04,666 INFO L82 GeneralOperation]: Start removeDead. Operand has 275 places, 290 transitions, 598 flow [2025-03-08 22:02:04,670 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 290 transitions, 598 flow [2025-03-08 22:02:04,671 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:02:04,672 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;@248d41eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:02:04,672 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-08 22:02:04,674 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:02:04,674 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2025-03-08 22:02:04,674 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:02:04,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:04,674 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] [2025-03-08 22:02:04,674 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-08 22:02:04,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:04,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1979580324, now seen corresponding path program 1 times [2025-03-08 22:02:04,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:04,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568427684] [2025-03-08 22:02:04,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:04,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:04,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 22:02:04,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 22:02:04,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:04,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:04,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:02:04,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:04,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568427684] [2025-03-08 22:02:04,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568427684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:04,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:04,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:02:04,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734093547] [2025-03-08 22:02:04,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:04,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:04,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:04,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:04,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:04,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 290 [2025-03-08 22:02:04,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 290 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:04,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:04,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 290 [2025-03-08 22:02:04,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:08,252 INFO L124 PetriNetUnfolderBase]: 6462/34486 cut-off events. [2025-03-08 22:02:08,253 INFO L125 PetriNetUnfolderBase]: For 337/337 co-relation queries the response was YES. [2025-03-08 22:02:08,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43967 conditions, 34486 events. 6462/34486 cut-off events. For 337/337 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 468517 event pairs, 5662 based on Foata normal form. 4410/35584 useless extension candidates. Maximal degree in co-relation 5596. Up to 9250 conditions per place. [2025-03-08 22:02:08,612 INFO L140 encePairwiseOnDemand]: 265/290 looper letters, 34 selfloop transitions, 2 changer transitions 0/273 dead transitions. [2025-03-08 22:02:08,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 273 transitions, 636 flow [2025-03-08 22:02:08,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:08,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:08,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 779 transitions. [2025-03-08 22:02:08,614 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8954022988505748 [2025-03-08 22:02:08,614 INFO L175 Difference]: Start difference. First operand has 275 places, 290 transitions, 598 flow. Second operand 3 states and 779 transitions. [2025-03-08 22:02:08,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 273 transitions, 636 flow [2025-03-08 22:02:08,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 273 transitions, 634 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-08 22:02:08,619 INFO L231 Difference]: Finished difference. Result has 276 places, 267 transitions, 560 flow [2025-03-08 22:02:08,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=276, PETRI_TRANSITIONS=267} [2025-03-08 22:02:08,620 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 1 predicate places. [2025-03-08 22:02:08,620 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 267 transitions, 560 flow [2025-03-08 22:02:08,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:08,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:08,621 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] [2025-03-08 22:02:08,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:02:08,621 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-08 22:02:08,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:08,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1125368837, now seen corresponding path program 1 times [2025-03-08 22:02:08,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:08,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611428923] [2025-03-08 22:02:08,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:08,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:08,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 22:02:08,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 22:02:08,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:08,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:08,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:02:08,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:08,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611428923] [2025-03-08 22:02:08,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611428923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:08,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:08,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:02:08,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600408207] [2025-03-08 22:02:08,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:08,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:08,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:08,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:08,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:08,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 290 [2025-03-08 22:02:08,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 267 transitions, 560 flow. Second operand has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:08,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:08,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 290 [2025-03-08 22:02:08,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:15,345 INFO L124 PetriNetUnfolderBase]: 17970/76574 cut-off events. [2025-03-08 22:02:15,345 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2025-03-08 22:02:15,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102272 conditions, 76574 events. 17970/76574 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 1437. Compared 1127018 event pairs, 13022 based on Foata normal form. 0/71000 useless extension candidates. Maximal degree in co-relation 102223. Up to 25204 conditions per place. [2025-03-08 22:02:16,060 INFO L140 encePairwiseOnDemand]: 279/290 looper letters, 45 selfloop transitions, 4 changer transitions 0/272 dead transitions. [2025-03-08 22:02:16,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 272 transitions, 678 flow [2025-03-08 22:02:16,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:16,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:16,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2025-03-08 22:02:16,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2025-03-08 22:02:16,063 INFO L175 Difference]: Start difference. First operand has 276 places, 267 transitions, 560 flow. Second operand 3 states and 725 transitions. [2025-03-08 22:02:16,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 272 transitions, 678 flow [2025-03-08 22:02:16,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 272 transitions, 676 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:02:16,067 INFO L231 Difference]: Finished difference. Result has 271 places, 264 transitions, 572 flow [2025-03-08 22:02:16,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=271, PETRI_TRANSITIONS=264} [2025-03-08 22:02:16,071 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -4 predicate places. [2025-03-08 22:02:16,072 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 264 transitions, 572 flow [2025-03-08 22:02:16,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:16,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:16,072 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] [2025-03-08 22:02:16,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:02:16,073 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-08 22:02:16,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:16,073 INFO L85 PathProgramCache]: Analyzing trace with hash -597857383, now seen corresponding path program 1 times [2025-03-08 22:02:16,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:16,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852464214] [2025-03-08 22:02:16,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:16,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:16,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 22:02:16,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 22:02:16,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:16,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:16,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:02:16,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:16,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852464214] [2025-03-08 22:02:16,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852464214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:16,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:16,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:02:16,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814219037] [2025-03-08 22:02:16,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:16,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:02:16,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:16,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:02:16,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:02:16,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 290 [2025-03-08 22:02:16,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 264 transitions, 572 flow. Second operand has 5 states, 5 states have (on average 237.6) internal successors, (1188), 5 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:16,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:16,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 290 [2025-03-08 22:02:16,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:20,572 INFO L124 PetriNetUnfolderBase]: 10497/42583 cut-off events. [2025-03-08 22:02:20,572 INFO L125 PetriNetUnfolderBase]: For 1347/1347 co-relation queries the response was YES. [2025-03-08 22:02:20,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59265 conditions, 42583 events. 10497/42583 cut-off events. For 1347/1347 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 571484 event pairs, 5751 based on Foata normal form. 7/38515 useless extension candidates. Maximal degree in co-relation 38644. Up to 14468 conditions per place. [2025-03-08 22:02:20,845 INFO L140 encePairwiseOnDemand]: 285/290 looper letters, 61 selfloop transitions, 5 changer transitions 0/298 dead transitions. [2025-03-08 22:02:20,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 298 transitions, 774 flow [2025-03-08 22:02:20,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:02:20,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:02:20,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1483 transitions. [2025-03-08 22:02:20,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8522988505747127 [2025-03-08 22:02:20,847 INFO L175 Difference]: Start difference. First operand has 271 places, 264 transitions, 572 flow. Second operand 6 states and 1483 transitions. [2025-03-08 22:02:20,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 298 transitions, 774 flow [2025-03-08 22:02:20,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 298 transitions, 774 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:02:20,853 INFO L231 Difference]: Finished difference. Result has 279 places, 267 transitions, 604 flow [2025-03-08 22:02:20,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=604, PETRI_PLACES=279, PETRI_TRANSITIONS=267} [2025-03-08 22:02:20,854 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 4 predicate places. [2025-03-08 22:02:20,854 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 267 transitions, 604 flow [2025-03-08 22:02:20,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 237.6) internal successors, (1188), 5 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:20,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:20,855 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] [2025-03-08 22:02:20,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:02:20,855 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-08 22:02:20,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:20,855 INFO L85 PathProgramCache]: Analyzing trace with hash -18527999, now seen corresponding path program 1 times [2025-03-08 22:02:20,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:20,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199728487] [2025-03-08 22:02:20,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:20,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:20,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 22:02:20,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 22:02:20,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:20,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:21,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:02:21,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:21,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199728487] [2025-03-08 22:02:21,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199728487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:21,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:21,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:02:21,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156167696] [2025-03-08 22:02:21,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:21,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:02:21,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:21,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:02:21,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:02:21,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 290 [2025-03-08 22:02:21,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 267 transitions, 604 flow. Second operand has 6 states, 6 states have (on average 178.5) internal successors, (1071), 6 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:21,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:21,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 290 [2025-03-08 22:02:21,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand