./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a77d68c8e15036e88d70009e5342d88dd2f93f021b72148028da08073ac36a38 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:37:40,672 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:37:40,731 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:37:40,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:37:40,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:37:40,761 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:37:40,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:37:40,762 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:37:40,762 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:37:40,762 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:37:40,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:37:40,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:37:40,762 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:37:40,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:37:40,762 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:37:40,762 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:37:40,762 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:37:40,764 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:37:40,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:37:40,764 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:37:40,764 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:37:40,764 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:37:40,765 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:37:40,765 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:37:40,765 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:37:40,765 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:37:40,765 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:37:40,765 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:37:40,765 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:37:40,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:37:40,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:37:40,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:37:40,765 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:37:40,765 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:37:40,765 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:37:40,765 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:37:40,765 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:37:40,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:37:40,765 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:37:40,765 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:37:40,765 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:37:40,765 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:37:40,765 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a77d68c8e15036e88d70009e5342d88dd2f93f021b72148028da08073ac36a38 [2025-02-06 09:37:41,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:37:41,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:37:41,055 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:37:41,056 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:37:41,057 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:37:41,058 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-3.i [2025-02-06 09:37:42,177 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d274c4bbc/7e92f63d05da46ae86582367496b6e03/FLAG9d86febce [2025-02-06 09:37:42,430 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:37:42,430 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-3.i [2025-02-06 09:37:42,447 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d274c4bbc/7e92f63d05da46ae86582367496b6e03/FLAG9d86febce [2025-02-06 09:37:42,752 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d274c4bbc/7e92f63d05da46ae86582367496b6e03 [2025-02-06 09:37:42,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:37:42,755 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:37:42,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:37:42,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:37:42,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:37:42,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:37:42" (1/1) ... [2025-02-06 09:37:42,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d89f267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:37:42, skipping insertion in model container [2025-02-06 09:37:42,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:37:42" (1/1) ... [2025-02-06 09:37:42,784 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:37:43,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:37:43,029 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:37:43,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:37:43,109 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:37:43,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:37:43 WrapperNode [2025-02-06 09:37:43,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:37:43,111 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:37:43,111 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:37:43,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:37:43,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:37:43" (1/1) ... [2025-02-06 09:37:43,124 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:37:43" (1/1) ... [2025-02-06 09:37:43,141 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 194 [2025-02-06 09:37:43,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:37:43,142 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:37:43,142 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:37:43,142 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:37:43,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:37:43" (1/1) ... [2025-02-06 09:37:43,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:37:43" (1/1) ... [2025-02-06 09:37:43,149 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:37:43" (1/1) ... [2025-02-06 09:37:43,150 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:37:43" (1/1) ... [2025-02-06 09:37:43,158 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:37:43" (1/1) ... [2025-02-06 09:37:43,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:37:43" (1/1) ... [2025-02-06 09:37:43,160 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:37:43" (1/1) ... [2025-02-06 09:37:43,160 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:37:43" (1/1) ... [2025-02-06 09:37:43,164 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:37:43,164 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:37:43,164 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:37:43,165 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:37:43,165 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:37:43" (1/1) ... [2025-02-06 09:37:43,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:37:43,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:37:43,194 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:37:43,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:37:43,215 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:37:43,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:37:43,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:37:43,216 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-02-06 09:37:43,216 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-02-06 09:37:43,216 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:37:43,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:37:43,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:37:43,217 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:37:43,300 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:37:43,301 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:37:43,561 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:37:43,561 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:37:43,583 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:37:43,583 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:37:43,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:37:43 BoogieIcfgContainer [2025-02-06 09:37:43,583 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:37:43,585 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:37:43,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:37:43,588 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:37:43,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:37:42" (1/3) ... [2025-02-06 09:37:43,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a06ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:37:43, skipping insertion in model container [2025-02-06 09:37:43,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:37:43" (2/3) ... [2025-02-06 09:37:43,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a06ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:37:43, skipping insertion in model container [2025-02-06 09:37:43,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:37:43" (3/3) ... [2025-02-06 09:37:43,590 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-3.i [2025-02-06 09:37:43,599 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:37:43,600 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-counter-outer-race-3.i that has 2 procedures, 230 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-02-06 09:37:43,600 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:37:43,643 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:37:43,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 233 transitions, 470 flow [2025-02-06 09:37:43,727 INFO L124 PetriNetUnfolderBase]: 5/274 cut-off events. [2025-02-06 09:37:43,733 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:37:43,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 274 events. 5/274 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 239 event pairs, 0 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 192. Up to 4 conditions per place. [2025-02-06 09:37:43,736 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 233 transitions, 470 flow [2025-02-06 09:37:43,740 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 233 transitions, 470 flow [2025-02-06 09:37:43,746 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:37:43,754 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;@3aaaed2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:37:43,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-06 09:37:43,779 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:37:43,779 INFO L124 PetriNetUnfolderBase]: 1/160 cut-off events. [2025-02-06 09:37:43,779 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:37:43,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:37:43,780 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:37:43,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:37:43,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:37:43,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1104275436, now seen corresponding path program 1 times [2025-02-06 09:37:43,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:37:43,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590620738] [2025-02-06 09:37:43,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:37:43,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:37:43,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 09:37:43,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 09:37:43,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:37:43,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:37:44,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:37:44,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:37:44,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590620738] [2025-02-06 09:37:44,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590620738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:37:44,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:37:44,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:37:44,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444401558] [2025-02-06 09:37:44,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:37:44,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:37:44,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:37:44,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:37:44,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:37:44,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 233 [2025-02-06 09:37:44,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 233 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:37:44,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:37:44,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 233 [2025-02-06 09:37:44,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:37:44,353 INFO L124 PetriNetUnfolderBase]: 98/708 cut-off events. [2025-02-06 09:37:44,353 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:37:44,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 708 events. 98/708 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3362 event pairs, 33 based on Foata normal form. 1/651 useless extension candidates. Maximal degree in co-relation 731. Up to 138 conditions per place. [2025-02-06 09:37:44,361 INFO L140 encePairwiseOnDemand]: 220/233 looper letters, 32 selfloop transitions, 8 changer transitions 1/249 dead transitions. [2025-02-06 09:37:44,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 249 transitions, 582 flow [2025-02-06 09:37:44,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:37:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:37:44,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 673 transitions. [2025-02-06 09:37:44,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9628040057224606 [2025-02-06 09:37:44,374 INFO L175 Difference]: Start difference. First operand has 233 places, 233 transitions, 470 flow. Second operand 3 states and 673 transitions. [2025-02-06 09:37:44,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 249 transitions, 582 flow [2025-02-06 09:37:44,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 249 transitions, 582 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:37:44,382 INFO L231 Difference]: Finished difference. Result has 237 places, 238 transitions, 534 flow [2025-02-06 09:37:44,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=237, PETRI_TRANSITIONS=238} [2025-02-06 09:37:44,386 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 4 predicate places. [2025-02-06 09:37:44,386 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 238 transitions, 534 flow [2025-02-06 09:37:44,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:37:44,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:37:44,387 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:37:44,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:37:44,387 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:37:44,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:37:44,388 INFO L85 PathProgramCache]: Analyzing trace with hash 316198158, now seen corresponding path program 1 times [2025-02-06 09:37:44,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:37:44,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352759690] [2025-02-06 09:37:44,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:37:44,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:37:44,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-06 09:37:44,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 09:37:44,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:37:44,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:37:44,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:37:44,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:37:44,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352759690] [2025-02-06 09:37:44,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352759690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:37:44,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:37:44,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:37:44,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168016960] [2025-02-06 09:37:44,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:37:44,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:37:44,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:37:44,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:37:44,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:37:44,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 233 [2025-02-06 09:37:44,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 238 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:37:44,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:37:44,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 233 [2025-02-06 09:37:44,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:37:44,734 INFO L124 PetriNetUnfolderBase]: 114/845 cut-off events. [2025-02-06 09:37:44,734 INFO L125 PetriNetUnfolderBase]: For 164/169 co-relation queries the response was YES. [2025-02-06 09:37:44,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 845 events. 114/845 cut-off events. For 164/169 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4478 event pairs, 72 based on Foata normal form. 4/793 useless extension candidates. Maximal degree in co-relation 1058. Up to 226 conditions per place. [2025-02-06 09:37:44,738 INFO L140 encePairwiseOnDemand]: 227/233 looper letters, 29 selfloop transitions, 7 changer transitions 0/247 dead transitions. [2025-02-06 09:37:44,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 247 transitions, 634 flow [2025-02-06 09:37:44,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:37:44,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:37:44,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2025-02-06 09:37:44,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413447782546495 [2025-02-06 09:37:44,740 INFO L175 Difference]: Start difference. First operand has 237 places, 238 transitions, 534 flow. Second operand 3 states and 658 transitions. [2025-02-06 09:37:44,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 247 transitions, 634 flow [2025-02-06 09:37:44,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 247 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:37:44,748 INFO L231 Difference]: Finished difference. Result has 238 places, 243 transitions, 574 flow [2025-02-06 09:37:44,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=238, PETRI_TRANSITIONS=243} [2025-02-06 09:37:44,750 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 5 predicate places. [2025-02-06 09:37:44,750 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 243 transitions, 574 flow [2025-02-06 09:37:44,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:37:44,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:37:44,751 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:37:44,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:37:44,751 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:37:44,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:37:44,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1896165239, now seen corresponding path program 1 times [2025-02-06 09:37:44,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:37:44,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335670058] [2025-02-06 09:37:44,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:37:44,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:37:44,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 09:37:44,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 09:37:44,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:37:44,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:37:44,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:37:44,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:37:44,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335670058] [2025-02-06 09:37:44,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335670058] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:37:44,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:37:44,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:37:44,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634328048] [2025-02-06 09:37:44,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:37:44,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:37:44,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:37:44,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:37:44,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:37:44,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 233 [2025-02-06 09:37:44,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 243 transitions, 574 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:37:44,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:37:44,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 233 [2025-02-06 09:37:44,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:37:45,082 INFO L124 PetriNetUnfolderBase]: 93/762 cut-off events. [2025-02-06 09:37:45,082 INFO L125 PetriNetUnfolderBase]: For 67/70 co-relation queries the response was YES. [2025-02-06 09:37:45,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 762 events. 93/762 cut-off events. For 67/70 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3858 event pairs, 56 based on Foata normal form. 3/712 useless extension candidates. Maximal degree in co-relation 884. Up to 144 conditions per place. [2025-02-06 09:37:45,086 INFO L140 encePairwiseOnDemand]: 230/233 looper letters, 15 selfloop transitions, 2 changer transitions 3/248 dead transitions. [2025-02-06 09:37:45,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 248 transitions, 624 flow [2025-02-06 09:37:45,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:37:45,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:37:45,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2025-02-06 09:37:45,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570815450643777 [2025-02-06 09:37:45,088 INFO L175 Difference]: Start difference. First operand has 238 places, 243 transitions, 574 flow. Second operand 3 states and 669 transitions. [2025-02-06 09:37:45,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 248 transitions, 624 flow [2025-02-06 09:37:45,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 248 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:37:45,093 INFO L231 Difference]: Finished difference. Result has 239 places, 244 transitions, 572 flow [2025-02-06 09:37:45,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=239, PETRI_TRANSITIONS=244} [2025-02-06 09:37:45,094 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 6 predicate places. [2025-02-06 09:37:45,094 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 244 transitions, 572 flow [2025-02-06 09:37:45,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:37:45,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:37:45,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:37:45,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:37:45,096 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:37:45,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:37:45,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1425040558, now seen corresponding path program 1 times [2025-02-06 09:37:45,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:37:45,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592253610] [2025-02-06 09:37:45,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:37:45,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:37:45,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-06 09:37:45,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-06 09:37:45,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:37:45,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:37:45,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:37:45,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:37:45,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592253610] [2025-02-06 09:37:45,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592253610] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:37:45,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:37:45,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:37:45,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340729308] [2025-02-06 09:37:45,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:37:45,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:37:45,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:37:45,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:37:45,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:37:45,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 233 [2025-02-06 09:37:45,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 244 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:37:45,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:37:45,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 233 [2025-02-06 09:37:45,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:37:45,302 INFO L124 PetriNetUnfolderBase]: 93/723 cut-off events. [2025-02-06 09:37:45,303 INFO L125 PetriNetUnfolderBase]: For 36/40 co-relation queries the response was YES. [2025-02-06 09:37:45,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1044 conditions, 723 events. 93/723 cut-off events. For 36/40 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3674 event pairs, 55 based on Foata normal form. 0/679 useless extension candidates. Maximal degree in co-relation 859. Up to 131 conditions per place. [2025-02-06 09:37:45,305 INFO L140 encePairwiseOnDemand]: 228/233 looper letters, 22 selfloop transitions, 4 changer transitions 0/253 dead transitions. [2025-02-06 09:37:45,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 253 transitions, 642 flow [2025-02-06 09:37:45,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:37:45,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:37:45,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2025-02-06 09:37:45,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570815450643777 [2025-02-06 09:37:45,307 INFO L175 Difference]: Start difference. First operand has 239 places, 244 transitions, 572 flow. Second operand 3 states and 669 transitions. [2025-02-06 09:37:45,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 253 transitions, 642 flow [2025-02-06 09:37:45,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 253 transitions, 640 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:37:45,310 INFO L231 Difference]: Finished difference. Result has 242 places, 247 transitions, 600 flow [2025-02-06 09:37:45,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=600, PETRI_PLACES=242, PETRI_TRANSITIONS=247} [2025-02-06 09:37:45,311 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 9 predicate places. [2025-02-06 09:37:45,311 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 247 transitions, 600 flow [2025-02-06 09:37:45,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:37:45,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:37:45,312 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:37:45,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:37:45,312 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:37:45,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:37:45,313 INFO L85 PathProgramCache]: Analyzing trace with hash -785472956, now seen corresponding path program 1 times [2025-02-06 09:37:45,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:37:45,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406960763] [2025-02-06 09:37:45,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:37:45,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:37:45,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-06 09:37:45,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-06 09:37:45,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:37:45,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:37:45,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:37:45,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:37:45,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406960763] [2025-02-06 09:37:45,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406960763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:37:45,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:37:45,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:37:45,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320589186] [2025-02-06 09:37:45,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:37:45,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:37:45,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:37:45,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:37:45,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:37:45,395 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 233 [2025-02-06 09:37:45,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 247 transitions, 600 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:37:45,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:37:45,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 233 [2025-02-06 09:37:45,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:37:45,483 INFO L124 PetriNetUnfolderBase]: 85/770 cut-off events. [2025-02-06 09:37:45,484 INFO L125 PetriNetUnfolderBase]: For 84/91 co-relation queries the response was YES. [2025-02-06 09:37:45,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1146 conditions, 770 events. 85/770 cut-off events. For 84/91 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4089 event pairs, 45 based on Foata normal form. 0/724 useless extension candidates. Maximal degree in co-relation 938. Up to 113 conditions per place. [2025-02-06 09:37:45,486 INFO L140 encePairwiseOnDemand]: 229/233 looper letters, 17 selfloop transitions, 4 changer transitions 1/253 dead transitions. [2025-02-06 09:37:45,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 253 transitions, 660 flow [2025-02-06 09:37:45,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:37:45,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:37:45,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 670 transitions. [2025-02-06 09:37:45,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585121602288984 [2025-02-06 09:37:45,488 INFO L175 Difference]: Start difference. First operand has 242 places, 247 transitions, 600 flow. Second operand 3 states and 670 transitions. [2025-02-06 09:37:45,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 253 transitions, 660 flow [2025-02-06 09:37:45,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 253 transitions, 650 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:37:45,492 INFO L231 Difference]: Finished difference. Result has 244 places, 249 transitions, 620 flow [2025-02-06 09:37:45,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=244, PETRI_TRANSITIONS=249} [2025-02-06 09:37:45,492 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 11 predicate places. [2025-02-06 09:37:45,493 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 249 transitions, 620 flow [2025-02-06 09:37:45,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:37:45,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:37:45,493 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:37:45,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:37:45,494 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:37:45,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:37:45,494 INFO L85 PathProgramCache]: Analyzing trace with hash -252734310, now seen corresponding path program 1 times [2025-02-06 09:37:45,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:37:45,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913904592] [2025-02-06 09:37:45,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:37:45,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:37:45,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-06 09:37:45,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-06 09:37:45,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:37:45,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:37:45,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:37:45,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:37:45,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913904592] [2025-02-06 09:37:45,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913904592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:37:45,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:37:45,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:37:45,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423764901] [2025-02-06 09:37:45,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:37:45,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:37:45,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:37:45,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:37:45,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:37:45,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 233 [2025-02-06 09:37:45,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 249 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:37:45,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:37:45,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 233 [2025-02-06 09:37:45,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:37:45,667 INFO L124 PetriNetUnfolderBase]: 159/956 cut-off events. [2025-02-06 09:37:45,667 INFO L125 PetriNetUnfolderBase]: For 187/193 co-relation queries the response was YES. [2025-02-06 09:37:45,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1633 conditions, 956 events. 159/956 cut-off events. For 187/193 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5496 event pairs, 73 based on Foata normal form. 1/920 useless extension candidates. Maximal degree in co-relation 1450. Up to 274 conditions per place. [2025-02-06 09:37:45,671 INFO L140 encePairwiseOnDemand]: 226/233 looper letters, 29 selfloop transitions, 11 changer transitions 4/262 dead transitions. [2025-02-06 09:37:45,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 262 transitions, 742 flow [2025-02-06 09:37:45,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:37:45,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:37:45,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 665 transitions. [2025-02-06 09:37:45,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513590844062947 [2025-02-06 09:37:45,673 INFO L175 Difference]: Start difference. First operand has 244 places, 249 transitions, 620 flow. Second operand 3 states and 665 transitions. [2025-02-06 09:37:45,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 262 transitions, 742 flow [2025-02-06 09:37:45,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 262 transitions, 734 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:37:45,677 INFO L231 Difference]: Finished difference. Result has 246 places, 253 transitions, 688 flow [2025-02-06 09:37:45,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=246, PETRI_TRANSITIONS=253} [2025-02-06 09:37:45,677 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 13 predicate places. [2025-02-06 09:37:45,677 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 253 transitions, 688 flow [2025-02-06 09:37:45,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:37:45,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:37:45,678 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:37:45,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:37:45,678 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:37:45,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:37:45,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1610865144, now seen corresponding path program 1 times [2025-02-06 09:37:45,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:37:45,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121036760] [2025-02-06 09:37:45,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:37:45,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:37:45,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-06 09:37:45,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-06 09:37:45,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:37:45,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:37:45,717 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:37:45,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-06 09:37:45,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-06 09:37:45,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:37:45,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:37:45,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:37:45,822 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:37:45,823 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-02-06 09:37:45,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-02-06 09:37:45,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-02-06 09:37:45,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-02-06 09:37:45,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-02-06 09:37:45,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-02-06 09:37:45,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-02-06 09:37:45,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-02-06 09:37:45,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-02-06 09:37:45,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-02-06 09:37:45,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-02-06 09:37:45,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:37:45,826 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:37:45,827 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:37:45,828 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 09:37:45,847 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:37:45,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 267 places, 265 transitions, 540 flow [2025-02-06 09:37:45,888 INFO L124 PetriNetUnfolderBase]: 7/355 cut-off events. [2025-02-06 09:37:45,888 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:37:45,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 355 events. 7/355 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 418 event pairs, 0 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 275. Up to 6 conditions per place. [2025-02-06 09:37:45,889 INFO L82 GeneralOperation]: Start removeDead. Operand has 267 places, 265 transitions, 540 flow [2025-02-06 09:37:45,891 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 267 places, 265 transitions, 540 flow [2025-02-06 09:37:45,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:37:45,892 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;@3aaaed2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:37:45,892 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-02-06 09:37:45,904 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:37:45,904 INFO L124 PetriNetUnfolderBase]: 1/160 cut-off events. [2025-02-06 09:37:45,904 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:37:45,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:37:45,904 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:37:45,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:37:45,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:37:45,905 INFO L85 PathProgramCache]: Analyzing trace with hash -268439924, now seen corresponding path program 1 times [2025-02-06 09:37:45,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:37:45,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072159083] [2025-02-06 09:37:45,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:37:45,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:37:45,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 09:37:45,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 09:37:45,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:37:45,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:37:45,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:37:45,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:37:45,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072159083] [2025-02-06 09:37:45,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072159083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:37:45,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:37:45,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:37:45,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54815909] [2025-02-06 09:37:45,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:37:45,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:37:45,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:37:45,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:37:45,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:37:45,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 265 [2025-02-06 09:37:45,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 265 transitions, 540 flow. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:37:45,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:37:45,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 265 [2025-02-06 09:37:45,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:37:46,733 INFO L124 PetriNetUnfolderBase]: 2216/7107 cut-off events. [2025-02-06 09:37:46,735 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-02-06 09:37:46,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10811 conditions, 7107 events. 2216/7107 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 68636 event pairs, 879 based on Foata normal form. 1/6349 useless extension candidates. Maximal degree in co-relation 9184. Up to 2089 conditions per place. [2025-02-06 09:37:46,765 INFO L140 encePairwiseOnDemand]: 248/265 looper letters, 46 selfloop transitions, 11 changer transitions 1/289 dead transitions. [2025-02-06 09:37:46,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 289 transitions, 707 flow [2025-02-06 09:37:46,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:37:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:37:46,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 760 transitions. [2025-02-06 09:37:46,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9559748427672956 [2025-02-06 09:37:46,767 INFO L175 Difference]: Start difference. First operand has 267 places, 265 transitions, 540 flow. Second operand 3 states and 760 transitions. [2025-02-06 09:37:46,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 289 transitions, 707 flow [2025-02-06 09:37:46,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 289 transitions, 707 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:37:46,772 INFO L231 Difference]: Finished difference. Result has 271 places, 273 transitions, 630 flow [2025-02-06 09:37:46,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=271, PETRI_TRANSITIONS=273} [2025-02-06 09:37:46,774 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 4 predicate places. [2025-02-06 09:37:46,774 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 273 transitions, 630 flow [2025-02-06 09:37:46,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:37:46,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:37:46,775 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:37:46,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:37:46,775 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:37:46,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:37:46,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1855502647, now seen corresponding path program 1 times [2025-02-06 09:37:46,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:37:46,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839204357] [2025-02-06 09:37:46,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:37:46,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:37:46,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-06 09:37:46,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 09:37:46,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:37:46,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:37:46,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:37:46,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:37:46,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839204357] [2025-02-06 09:37:46,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839204357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:37:46,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:37:46,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:37:46,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857365123] [2025-02-06 09:37:46,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:37:46,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:37:46,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:37:46,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:37:46,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:37:46,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 265 [2025-02-06 09:37:46,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 273 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:37:46,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:37:46,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 265 [2025-02-06 09:37:46,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:37:47,806 INFO L124 PetriNetUnfolderBase]: 2480/9018 cut-off events. [2025-02-06 09:37:47,807 INFO L125 PetriNetUnfolderBase]: For 2761/2931 co-relation queries the response was YES. [2025-02-06 09:37:47,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15784 conditions, 9018 events. 2480/9018 cut-off events. For 2761/2931 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 94794 event pairs, 1597 based on Foata normal form. 62/8284 useless extension candidates. Maximal degree in co-relation 13582. Up to 3442 conditions per place. [2025-02-06 09:37:47,851 INFO L140 encePairwiseOnDemand]: 257/265 looper letters, 42 selfloop transitions, 12 changer transitions 0/291 dead transitions. [2025-02-06 09:37:47,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 291 transitions, 798 flow [2025-02-06 09:37:47,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:37:47,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:37:47,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2025-02-06 09:37:47,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9383647798742139 [2025-02-06 09:37:47,853 INFO L175 Difference]: Start difference. First operand has 271 places, 273 transitions, 630 flow. Second operand 3 states and 746 transitions. [2025-02-06 09:37:47,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 291 transitions, 798 flow [2025-02-06 09:37:47,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 291 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:37:47,864 INFO L231 Difference]: Finished difference. Result has 272 places, 283 transitions, 714 flow [2025-02-06 09:37:47,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=272, PETRI_TRANSITIONS=283} [2025-02-06 09:37:47,866 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 5 predicate places. [2025-02-06 09:37:47,866 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 283 transitions, 714 flow [2025-02-06 09:37:47,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:37:47,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:37:47,867 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:37:47,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:37:47,867 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:37:47,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:37:47,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1925002889, now seen corresponding path program 1 times [2025-02-06 09:37:47,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:37:47,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537291620] [2025-02-06 09:37:47,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:37:47,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:37:47,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 09:37:47,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 09:37:47,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:37:47,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:37:47,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:37:47,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:37:47,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537291620] [2025-02-06 09:37:47,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537291620] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:37:47,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:37:47,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:37:47,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263896957] [2025-02-06 09:37:47,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:37:47,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:37:47,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:37:47,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:37:47,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:37:47,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 265 [2025-02-06 09:37:47,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 283 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:37:47,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:37:47,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 265 [2025-02-06 09:37:47,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:37:48,852 INFO L124 PetriNetUnfolderBase]: 1983/8135 cut-off events. [2025-02-06 09:37:48,852 INFO L125 PetriNetUnfolderBase]: For 1234/1676 co-relation queries the response was YES. [2025-02-06 09:37:48,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13280 conditions, 8135 events. 1983/8135 cut-off events. For 1234/1676 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 86971 event pairs, 1348 based on Foata normal form. 34/7361 useless extension candidates. Maximal degree in co-relation 11427. Up to 2229 conditions per place. [2025-02-06 09:37:48,890 INFO L140 encePairwiseOnDemand]: 262/265 looper letters, 21 selfloop transitions, 2 changer transitions 3/288 dead transitions. [2025-02-06 09:37:48,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 288 transitions, 776 flow [2025-02-06 09:37:48,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:37:48,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:37:48,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2025-02-06 09:37:48,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9471698113207547 [2025-02-06 09:37:48,894 INFO L175 Difference]: Start difference. First operand has 272 places, 283 transitions, 714 flow. Second operand 3 states and 753 transitions. [2025-02-06 09:37:48,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 288 transitions, 776 flow [2025-02-06 09:37:48,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 288 transitions, 752 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:37:48,906 INFO L231 Difference]: Finished difference. Result has 273 places, 284 transitions, 702 flow [2025-02-06 09:37:48,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=702, PETRI_PLACES=273, PETRI_TRANSITIONS=284} [2025-02-06 09:37:48,907 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 6 predicate places. [2025-02-06 09:37:48,907 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 284 transitions, 702 flow [2025-02-06 09:37:48,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:37:48,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:37:48,908 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:37:48,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:37:48,909 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:37:48,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:37:48,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1883509732, now seen corresponding path program 1 times [2025-02-06 09:37:48,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:37:48,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973382743] [2025-02-06 09:37:48,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:37:48,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:37:48,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-06 09:37:48,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-06 09:37:48,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:37:48,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:37:48,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:37:48,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:37:48,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973382743] [2025-02-06 09:37:48,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973382743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:37:48,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:37:48,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:37:48,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894862053] [2025-02-06 09:37:48,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:37:48,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:37:48,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:37:48,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:37:48,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:37:49,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 265 [2025-02-06 09:37:49,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 284 transitions, 702 flow. Second operand has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:37:49,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:37:49,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 265 [2025-02-06 09:37:49,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:37:50,026 INFO L124 PetriNetUnfolderBase]: 2291/9260 cut-off events. [2025-02-06 09:37:50,027 INFO L125 PetriNetUnfolderBase]: For 924/1846 co-relation queries the response was YES. [2025-02-06 09:37:50,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14911 conditions, 9260 events. 2291/9260 cut-off events. For 924/1846 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 104371 event pairs, 1280 based on Foata normal form. 11/8256 useless extension candidates. Maximal degree in co-relation 14725. Up to 2144 conditions per place. [2025-02-06 09:37:50,070 INFO L140 encePairwiseOnDemand]: 259/265 looper letters, 33 selfloop transitions, 5 changer transitions 0/299 dead transitions. [2025-02-06 09:37:50,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 299 transitions, 813 flow [2025-02-06 09:37:50,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:37:50,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:37:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2025-02-06 09:37:50,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9547169811320755 [2025-02-06 09:37:50,075 INFO L175 Difference]: Start difference. First operand has 273 places, 284 transitions, 702 flow. Second operand 3 states and 759 transitions. [2025-02-06 09:37:50,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 299 transitions, 813 flow [2025-02-06 09:37:50,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 299 transitions, 811 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:37:50,079 INFO L231 Difference]: Finished difference. Result has 276 places, 288 transitions, 738 flow [2025-02-06 09:37:50,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=276, PETRI_TRANSITIONS=288} [2025-02-06 09:37:50,080 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 9 predicate places. [2025-02-06 09:37:50,080 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 288 transitions, 738 flow [2025-02-06 09:37:50,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:37:50,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:37:50,081 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:37:50,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:37:50,081 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:37:50,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:37:50,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1002099758, now seen corresponding path program 1 times [2025-02-06 09:37:50,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:37:50,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717929570] [2025-02-06 09:37:50,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:37:50,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:37:50,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-06 09:37:50,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-06 09:37:50,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:37:50,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:37:50,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:37:50,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:37:50,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717929570] [2025-02-06 09:37:50,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717929570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:37:50,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:37:50,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:37:50,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290510508] [2025-02-06 09:37:50,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:37:50,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:37:50,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:37:50,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:37:50,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:37:50,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 265 [2025-02-06 09:37:50,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 288 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:37:50,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:37:50,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 265 [2025-02-06 09:37:50,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:37:50,961 INFO L124 PetriNetUnfolderBase]: 2197/9610 cut-off events. [2025-02-06 09:37:50,961 INFO L125 PetriNetUnfolderBase]: For 1505/2497 co-relation queries the response was YES. [2025-02-06 09:37:50,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15865 conditions, 9610 events. 2197/9610 cut-off events. For 1505/2497 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 110658 event pairs, 1245 based on Foata normal form. 9/8572 useless extension candidates. Maximal degree in co-relation 14042. Up to 1989 conditions per place. [2025-02-06 09:37:51,001 INFO L140 encePairwiseOnDemand]: 260/265 looper letters, 29 selfloop transitions, 6 changer transitions 0/300 dead transitions. [2025-02-06 09:37:51,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 300 transitions, 842 flow [2025-02-06 09:37:51,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:37:51,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:37:51,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2025-02-06 09:37:51,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9547169811320755 [2025-02-06 09:37:51,003 INFO L175 Difference]: Start difference. First operand has 276 places, 288 transitions, 738 flow. Second operand 3 states and 759 transitions. [2025-02-06 09:37:51,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 300 transitions, 842 flow [2025-02-06 09:37:51,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 300 transitions, 828 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:37:51,010 INFO L231 Difference]: Finished difference. Result has 278 places, 292 transitions, 776 flow [2025-02-06 09:37:51,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=776, PETRI_PLACES=278, PETRI_TRANSITIONS=292} [2025-02-06 09:37:51,010 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 11 predicate places. [2025-02-06 09:37:51,011 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 292 transitions, 776 flow [2025-02-06 09:37:51,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:37:51,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:37:51,011 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:37:51,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:37:51,011 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:37:51,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:37:51,012 INFO L85 PathProgramCache]: Analyzing trace with hash 26748505, now seen corresponding path program 1 times [2025-02-06 09:37:51,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:37:51,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493774850] [2025-02-06 09:37:51,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:37:51,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:37:51,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-06 09:37:51,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-06 09:37:51,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:37:51,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:37:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:37:51,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:37:51,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493774850] [2025-02-06 09:37:51,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493774850] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:37:51,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:37:51,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:37:51,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187637025] [2025-02-06 09:37:51,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:37:51,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:37:51,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:37:51,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:37:51,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:37:51,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 265 [2025-02-06 09:37:51,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 292 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:37:51,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:37:51,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 265 [2025-02-06 09:37:51,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:37:52,156 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][274], [289#true, Black: 270#true, 220#L695-7true, 268#true, Black: 291#(= |#race~data~0| 0), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 294#true, 62#L712-2true, 266#true, Black: 282#(<= (+ ~threads_alive~0 1) 0), 126#L695-2true, Black: 286#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|)]) [2025-02-06 09:37:52,157 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-02-06 09:37:52,157 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-02-06 09:37:52,157 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-02-06 09:37:52,157 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-02-06 09:37:52,332 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][168], [Black: 270#true, 289#true, 220#L695-7true, 268#true, Black: 291#(= |#race~data~0| 0), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 294#true, 62#L712-2true, 266#true, Black: 282#(<= (+ ~threads_alive~0 1) 0), 264#L697-3true, Black: 286#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|)]) [2025-02-06 09:37:52,332 INFO L294 olderBase$Statistics]: this new event has 254 ancestors and is cut-off event [2025-02-06 09:37:52,332 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-02-06 09:37:52,333 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-02-06 09:37:52,333 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-02-06 09:37:52,360 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][168], [40#L697true, 289#true, Black: 270#true, 220#L695-7true, 268#true, Black: 291#(= |#race~data~0| 0), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 294#true, 62#L712-2true, 266#true, Black: 282#(<= (+ ~threads_alive~0 1) 0), Black: 286#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|)]) [2025-02-06 09:37:52,360 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2025-02-06 09:37:52,360 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-02-06 09:37:52,360 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-02-06 09:37:52,361 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-02-06 09:37:52,480 INFO L124 PetriNetUnfolderBase]: 4088/14017 cut-off events. [2025-02-06 09:37:52,480 INFO L125 PetriNetUnfolderBase]: For 5681/6083 co-relation queries the response was YES. [2025-02-06 09:37:52,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26510 conditions, 14017 events. 4088/14017 cut-off events. For 5681/6083 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 159076 event pairs, 2076 based on Foata normal form. 74/12729 useless extension candidates. Maximal degree in co-relation 23278. Up to 5203 conditions per place. [2025-02-06 09:37:52,531 INFO L140 encePairwiseOnDemand]: 256/265 looper letters, 49 selfloop transitions, 19 changer transitions 0/318 dead transitions. [2025-02-06 09:37:52,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 318 transitions, 1013 flow [2025-02-06 09:37:52,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:37:52,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:37:52,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 754 transitions. [2025-02-06 09:37:52,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9484276729559749 [2025-02-06 09:37:52,533 INFO L175 Difference]: Start difference. First operand has 278 places, 292 transitions, 776 flow. Second operand 3 states and 754 transitions. [2025-02-06 09:37:52,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 318 transitions, 1013 flow [2025-02-06 09:37:52,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 318 transitions, 1001 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:37:52,541 INFO L231 Difference]: Finished difference. Result has 280 places, 307 transitions, 946 flow [2025-02-06 09:37:52,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=946, PETRI_PLACES=280, PETRI_TRANSITIONS=307} [2025-02-06 09:37:52,542 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 13 predicate places. [2025-02-06 09:37:52,542 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 307 transitions, 946 flow [2025-02-06 09:37:52,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:37:52,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:37:52,543 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:37:52,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:37:52,543 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:37:52,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:37:52,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1822410532, now seen corresponding path program 1 times [2025-02-06 09:37:52,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:37:52,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609562762] [2025-02-06 09:37:52,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:37:52,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:37:52,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-06 09:37:52,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-06 09:37:52,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:37:52,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:37:52,568 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:37:52,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-06 09:37:52,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-06 09:37:52,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:37:52,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:37:52,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:37:52,613 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:37:52,613 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr2ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2025-02-06 09:37:52,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-02-06 09:37:52,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-02-06 09:37:52,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-02-06 09:37:52,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-02-06 09:37:52,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining) [2025-02-06 09:37:52,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-02-06 09:37:52,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-02-06 09:37:52,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-02-06 09:37:52,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-02-06 09:37:52,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-02-06 09:37:52,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-02-06 09:37:52,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-02-06 09:37:52,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-02-06 09:37:52,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:37:52,614 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:37:52,715 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2025-02-06 09:37:52,716 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2025-02-06 09:37:52,717 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2025-02-06 09:37:52,727 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-02-06 09:37:52,727 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:37:52,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:37:52 BasicIcfg [2025-02-06 09:37:52,732 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:37:52,733 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:37:52,733 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:37:52,733 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:37:52,734 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:37:43" (3/4) ... [2025-02-06 09:37:52,735 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 09:37:52,793 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2025-02-06 09:37:52,793 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2025-02-06 09:37:52,796 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2025-02-06 09:37:52,821 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 8. [2025-02-06 09:37:52,858 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:37:52,859 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:37:52,859 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:37:52,860 INFO L158 Benchmark]: Toolchain (without parser) took 10104.61ms. Allocated memory was 201.3MB in the beginning and 847.2MB in the end (delta: 645.9MB). Free memory was 157.9MB in the beginning and 185.4MB in the end (delta: -27.5MB). Peak memory consumption was 614.5MB. Max. memory is 16.1GB. [2025-02-06 09:37:52,861 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 209.7MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:37:52,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.47ms. Allocated memory is still 201.3MB. Free memory was 157.9MB in the beginning and 137.6MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 09:37:52,861 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.01ms. Allocated memory is still 201.3MB. Free memory was 137.6MB in the beginning and 135.2MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:37:52,863 INFO L158 Benchmark]: Boogie Preprocessor took 21.81ms. Allocated memory is still 201.3MB. Free memory was 135.2MB in the beginning and 133.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:37:52,863 INFO L158 Benchmark]: IcfgBuilder took 418.90ms. Allocated memory is still 201.3MB. Free memory was 133.5MB in the beginning and 110.9MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 09:37:52,863 INFO L158 Benchmark]: TraceAbstraction took 9147.51ms. Allocated memory was 201.3MB in the beginning and 847.2MB in the end (delta: 645.9MB). Free memory was 110.3MB in the beginning and 248.3MB in the end (delta: -138.0MB). Peak memory consumption was 505.4MB. Max. memory is 16.1GB. [2025-02-06 09:37:52,864 INFO L158 Benchmark]: Witness Printer took 125.71ms. Allocated memory is still 847.2MB. Free memory was 248.3MB in the beginning and 185.4MB in the end (delta: 62.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-06 09:37:52,865 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 209.7MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.47ms. Allocated memory is still 201.3MB. Free memory was 157.9MB in the beginning and 137.6MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.01ms. Allocated memory is still 201.3MB. Free memory was 137.6MB in the beginning and 135.2MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.81ms. Allocated memory is still 201.3MB. Free memory was 135.2MB in the beginning and 133.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 418.90ms. Allocated memory is still 201.3MB. Free memory was 133.5MB in the beginning and 110.9MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9147.51ms. Allocated memory was 201.3MB in the beginning and 847.2MB in the end (delta: 645.9MB). Free memory was 110.3MB in the beginning and 248.3MB in the end (delta: -138.0MB). Peak memory consumption was 505.4MB. Max. memory is 16.1GB. * Witness Printer took 125.71ms. Allocated memory is still 847.2MB. Free memory was 248.3MB in the beginning and 185.4MB in the end (delta: 62.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 692]: Data race detected Data race detected The following path leads to a data race: [L685] 0 int threads_alive = -1; VAL [threads_alive=-1] [L686] 0 pthread_mutex_t threads_alive_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [threads_alive=-1, threads_alive_mutex={1:0}] [L687] 0 pthread_cond_t threads_alive_cond = { { {0}, {0}, {0, 0}, {0, 0}, 0, 0, {0, 0} } }; VAL [threads_alive=-1, threads_alive_mutex={1:0}] [L688] 0 int data = 0; VAL [data=0, threads_alive=-1, threads_alive_mutex={1:0}] [L689] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={2:0}, threads_alive=-1, threads_alive_mutex={1:0}] [L701] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, data_mutex={2:0}, threads_alive=-1, threads_alive_mutex={1:0}, threads_total=1] [L702] CALL 0 assume_abort_if_not(threads_total >= 0) [L682] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data=0, data_mutex={2:0}, threads_alive=-1, threads_alive_mutex={1:0}] [L702] RET 0 assume_abort_if_not(threads_total >= 0) [L703] 0 int i = 0; VAL [data=0, data_mutex={2:0}, i=0, threads_alive=-1, threads_alive_mutex={1:0}, threads_total=1] [L703] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={2:0}, i=0, threads_alive=-1, threads_alive_mutex={1:0}, threads_total=1] [L705] 0 threads_alive++ VAL [data=0, data_mutex={2:0}, i=0, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L707] 0 pthread_t tid; VAL [data=0, data_mutex={2:0}, i=0, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L708] FCALL, FORK 0 pthread_create(&tid, ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={2:0}, i=0, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1, tid=-1] [L703] 0 i++ VAL [\old(arg)={0:0}, data=0, data_mutex={2:0}, i=1, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L703] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, data=0, data_mutex={2:0}, i=1, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L712] COND TRUE 0 \read(threads_alive) [L712] COND FALSE 0 !(\read(threads_alive)) VAL [\old(arg)={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L692] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}] [L715] 0 return data; VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L692] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}] Now there is a data race on ~data~0 between C: return data; [715] and C: data = __VERIFIER_nondet_int() [692] - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 263 locations, 11 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.2s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 146 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 270 IncrementalHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 19 mSDtfsCounter, 270 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=688occurred in iteration=6, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1222 NumberOfCodeBlocks, 1222 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1021 ConstructedInterpolants, 0 QuantifiedInterpolants, 1639 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 295 locations, 14 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 226 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 107 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 384 IncrementalHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 14 mSDtfsCounter, 384 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=946occurred in iteration=6, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 1222 NumberOfCodeBlocks, 1222 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1021 ConstructedInterpolants, 0 QuantifiedInterpolants, 1639 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-06 09:37:52,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)