./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9b6f5676df76ead7ff47af365c70465c7b9cb0ddd7acfe90754727af80919440 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:18:27,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:18:27,400 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:18:27,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:18:27,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:18:27,418 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:18:27,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:18:27,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:18:27,419 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:18:27,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:18:27,420 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:18:27,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:18:27,420 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:18:27,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:18:27,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:18:27,420 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:18:27,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:18:27,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:18:27,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:18:27,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:18:27,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:18:27,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:18:27,421 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:18:27,421 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:18:27,421 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:18:27,421 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:18:27,421 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:18:27,421 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:18:27,421 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:18:27,421 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:18:27,421 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:18:27,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:18:27,422 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:18:27,422 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:18:27,422 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:18:27,422 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:18:27,422 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:18:27,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:18:27,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:18:27,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:18:27,422 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:18:27,422 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:18:27,422 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9b6f5676df76ead7ff47af365c70465c7b9cb0ddd7acfe90754727af80919440 [2025-03-17 11:18:27,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:18:27,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:18:27,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:18:27,675 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:18:27,675 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:18:27,676 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-2.i [2025-03-17 11:18:28,867 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecdda5961/f262e8990c6946c48a389b3b5321b5a5/FLAG7e1abad58 [2025-03-17 11:18:29,159 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:18:29,161 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-2.i [2025-03-17 11:18:29,175 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecdda5961/f262e8990c6946c48a389b3b5321b5a5/FLAG7e1abad58 [2025-03-17 11:18:29,445 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecdda5961/f262e8990c6946c48a389b3b5321b5a5 [2025-03-17 11:18:29,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:18:29,448 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:18:29,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:18:29,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:18:29,452 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:18:29,452 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:18:29" (1/1) ... [2025-03-17 11:18:29,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85ed606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:29, skipping insertion in model container [2025-03-17 11:18:29,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:18:29" (1/1) ... [2025-03-17 11:18:29,477 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:18:29,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:18:29,805 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:18:29,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:18:29,890 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:18:29,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:29 WrapperNode [2025-03-17 11:18:29,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:18:29,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:18:29,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:18:29,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:18:29,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:29" (1/1) ... [2025-03-17 11:18:29,907 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:29" (1/1) ... [2025-03-17 11:18:29,922 INFO L138 Inliner]: procedures = 265, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2025-03-17 11:18:29,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:18:29,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:18:29,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:18:29,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:18:29,927 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:29" (1/1) ... [2025-03-17 11:18:29,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:29" (1/1) ... [2025-03-17 11:18:29,930 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:29" (1/1) ... [2025-03-17 11:18:29,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:29" (1/1) ... [2025-03-17 11:18:29,935 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:29" (1/1) ... [2025-03-17 11:18:29,935 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:29" (1/1) ... [2025-03-17 11:18:29,936 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:29" (1/1) ... [2025-03-17 11:18:29,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:29" (1/1) ... [2025-03-17 11:18:29,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:18:29,941 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:18:29,941 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:18:29,941 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:18:29,942 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:29" (1/1) ... [2025-03-17 11:18:29,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:18:29,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:18:29,970 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:18:29,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:18:29,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:18:29,987 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 11:18:29,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:18:29,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:18:29,987 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 11:18:29,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:18:29,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:18:29,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:18:29,988 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-17 11:18:29,988 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-17 11:18:29,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:18:29,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:18:29,989 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:18:30,077 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:18:30,078 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:18:30,259 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:18:30,259 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:18:30,274 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:18:30,275 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:18:30,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:18:30 BoogieIcfgContainer [2025-03-17 11:18:30,276 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:18:30,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:18:30,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:18:30,280 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:18:30,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:18:29" (1/3) ... [2025-03-17 11:18:30,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d00d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:18:30, skipping insertion in model container [2025-03-17 11:18:30,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:29" (2/3) ... [2025-03-17 11:18:30,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d00d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:18:30, skipping insertion in model container [2025-03-17 11:18:30,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:18:30" (3/3) ... [2025-03-17 11:18:30,283 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic-race-2.i [2025-03-17 11:18:30,294 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:18:30,296 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-array-dynamic-race-2.i that has 2 procedures, 85 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-17 11:18:30,298 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:18:30,344 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-17 11:18:30,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 87 transitions, 181 flow [2025-03-17 11:18:30,420 INFO L124 PetriNetUnfolderBase]: 2/119 cut-off events. [2025-03-17 11:18:30,422 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:18:30,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 119 events. 2/119 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 212 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 60. Up to 3 conditions per place. [2025-03-17 11:18:30,426 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 87 transitions, 181 flow [2025-03-17 11:18:30,429 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 87 transitions, 181 flow [2025-03-17 11:18:30,437 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:18:30,445 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;@6227c2f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:18:30,446 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 11:18:30,461 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:18:30,461 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-03-17 11:18:30,462 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:18:30,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:30,463 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] [2025-03-17 11:18:30,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-17 11:18:30,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:30,470 INFO L85 PathProgramCache]: Analyzing trace with hash 869954638, now seen corresponding path program 1 times [2025-03-17 11:18:30,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:30,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6295394] [2025-03-17 11:18:30,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:30,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:30,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 11:18:30,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 11:18:30,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:30,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:30,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:18:30,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:30,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6295394] [2025-03-17 11:18:30,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6295394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:30,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:30,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:18:30,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444751495] [2025-03-17 11:18:30,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:30,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:18:30,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:30,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:18:30,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:18:30,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 87 [2025-03-17 11:18:30,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 87 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:30,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:30,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 87 [2025-03-17 11:18:30,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:30,771 INFO L124 PetriNetUnfolderBase]: 8/161 cut-off events. [2025-03-17 11:18:30,771 INFO L125 PetriNetUnfolderBase]: For 7/10 co-relation queries the response was YES. [2025-03-17 11:18:30,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 161 events. 8/161 cut-off events. For 7/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 416 event pairs, 1 based on Foata normal form. 1/145 useless extension candidates. Maximal degree in co-relation 122. Up to 16 conditions per place. [2025-03-17 11:18:30,773 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 8 selfloop transitions, 3 changer transitions 2/90 dead transitions. [2025-03-17 11:18:30,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 90 transitions, 211 flow [2025-03-17 11:18:30,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:18:30,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:18:30,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2025-03-17 11:18:30,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9501915708812261 [2025-03-17 11:18:30,787 INFO L175 Difference]: Start difference. First operand has 88 places, 87 transitions, 181 flow. Second operand 3 states and 248 transitions. [2025-03-17 11:18:30,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 90 transitions, 211 flow [2025-03-17 11:18:30,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 90 transitions, 211 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:18:30,798 INFO L231 Difference]: Finished difference. Result has 92 places, 87 transitions, 199 flow [2025-03-17 11:18:30,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=92, PETRI_TRANSITIONS=87} [2025-03-17 11:18:30,802 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 4 predicate places. [2025-03-17 11:18:30,803 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 199 flow [2025-03-17 11:18:30,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:30,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:30,803 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] [2025-03-17 11:18:30,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:18:30,803 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-17 11:18:30,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:30,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1026356441, now seen corresponding path program 1 times [2025-03-17 11:18:30,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:30,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206775223] [2025-03-17 11:18:30,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:30,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:30,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 11:18:30,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 11:18:30,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:30,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:31,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:18:31,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:31,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206775223] [2025-03-17 11:18:31,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206775223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:31,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:31,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:18:31,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308681425] [2025-03-17 11:18:31,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:31,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:18:31,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:31,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:18:31,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:18:31,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 87 [2025-03-17 11:18:31,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:31,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:31,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 87 [2025-03-17 11:18:31,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:31,534 INFO L124 PetriNetUnfolderBase]: 31/266 cut-off events. [2025-03-17 11:18:31,534 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-17 11:18:31,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 266 events. 31/266 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1201 event pairs, 5 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 304. Up to 62 conditions per place. [2025-03-17 11:18:31,538 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 24 selfloop transitions, 5 changer transitions 0/94 dead transitions. [2025-03-17 11:18:31,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 94 transitions, 271 flow [2025-03-17 11:18:31,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:18:31,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:18:31,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 414 transitions. [2025-03-17 11:18:31,543 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7931034482758621 [2025-03-17 11:18:31,543 INFO L175 Difference]: Start difference. First operand has 92 places, 87 transitions, 199 flow. Second operand 6 states and 414 transitions. [2025-03-17 11:18:31,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 94 transitions, 271 flow [2025-03-17 11:18:31,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 94 transitions, 265 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:18:31,545 INFO L231 Difference]: Finished difference. Result has 93 places, 86 transitions, 201 flow [2025-03-17 11:18:31,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=201, PETRI_PLACES=93, PETRI_TRANSITIONS=86} [2025-03-17 11:18:31,546 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 5 predicate places. [2025-03-17 11:18:31,546 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 86 transitions, 201 flow [2025-03-17 11:18:31,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:31,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:31,546 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] [2025-03-17 11:18:31,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:18:31,546 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-17 11:18:31,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:31,549 INFO L85 PathProgramCache]: Analyzing trace with hash 874665698, now seen corresponding path program 1 times [2025-03-17 11:18:31,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:31,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990898761] [2025-03-17 11:18:31,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:31,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:31,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 11:18:31,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 11:18:31,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:31,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:18:31,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:31,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990898761] [2025-03-17 11:18:31,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990898761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:31,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:31,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:18:31,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80721980] [2025-03-17 11:18:31,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:31,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:18:31,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:31,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:18:31,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:18:31,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 87 [2025-03-17 11:18:31,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 86 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:31,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:31,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 87 [2025-03-17 11:18:31,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:31,755 INFO L124 PetriNetUnfolderBase]: 17/230 cut-off events. [2025-03-17 11:18:31,755 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:18:31,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 230 events. 17/230 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 812 event pairs, 1 based on Foata normal form. 1/217 useless extension candidates. Maximal degree in co-relation 227. Up to 49 conditions per place. [2025-03-17 11:18:31,756 INFO L140 encePairwiseOnDemand]: 79/87 looper letters, 15 selfloop transitions, 2 changer transitions 5/93 dead transitions. [2025-03-17 11:18:31,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 93 transitions, 259 flow [2025-03-17 11:18:31,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:18:31,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:18:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 449 transitions. [2025-03-17 11:18:31,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8601532567049809 [2025-03-17 11:18:31,759 INFO L175 Difference]: Start difference. First operand has 93 places, 86 transitions, 201 flow. Second operand 6 states and 449 transitions. [2025-03-17 11:18:31,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 93 transitions, 259 flow [2025-03-17 11:18:31,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 93 transitions, 249 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:18:31,761 INFO L231 Difference]: Finished difference. Result has 97 places, 86 transitions, 209 flow [2025-03-17 11:18:31,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=209, PETRI_PLACES=97, PETRI_TRANSITIONS=86} [2025-03-17 11:18:31,763 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 9 predicate places. [2025-03-17 11:18:31,764 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 86 transitions, 209 flow [2025-03-17 11:18:31,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:31,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:31,764 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] [2025-03-17 11:18:31,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:18:31,765 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-17 11:18:31,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:31,766 INFO L85 PathProgramCache]: Analyzing trace with hash -557423892, now seen corresponding path program 1 times [2025-03-17 11:18:31,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:31,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459209186] [2025-03-17 11:18:31,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:31,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:31,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 11:18:31,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 11:18:31,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:31,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:31,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:18:31,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:31,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459209186] [2025-03-17 11:18:31,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459209186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:31,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:31,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:18:31,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173655699] [2025-03-17 11:18:31,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:31,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:18:31,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:31,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:18:31,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:18:31,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 87 [2025-03-17 11:18:31,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 86 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:31,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:31,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 87 [2025-03-17 11:18:31,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:31,848 INFO L124 PetriNetUnfolderBase]: 5/167 cut-off events. [2025-03-17 11:18:31,848 INFO L125 PetriNetUnfolderBase]: For 19/31 co-relation queries the response was YES. [2025-03-17 11:18:31,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 167 events. 5/167 cut-off events. For 19/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 478 event pairs, 3 based on Foata normal form. 1/159 useless extension candidates. Maximal degree in co-relation 187. Up to 25 conditions per place. [2025-03-17 11:18:31,850 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 8 selfloop transitions, 4 changer transitions 3/89 dead transitions. [2025-03-17 11:18:31,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 89 transitions, 245 flow [2025-03-17 11:18:31,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:18:31,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:18:31,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2025-03-17 11:18:31,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9272030651340997 [2025-03-17 11:18:31,852 INFO L175 Difference]: Start difference. First operand has 97 places, 86 transitions, 209 flow. Second operand 3 states and 242 transitions. [2025-03-17 11:18:31,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 89 transitions, 245 flow [2025-03-17 11:18:31,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 89 transitions, 231 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-17 11:18:31,855 INFO L231 Difference]: Finished difference. Result has 93 places, 86 transitions, 217 flow [2025-03-17 11:18:31,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=217, PETRI_PLACES=93, PETRI_TRANSITIONS=86} [2025-03-17 11:18:31,857 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 5 predicate places. [2025-03-17 11:18:31,857 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 86 transitions, 217 flow [2025-03-17 11:18:31,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:31,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:31,858 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] [2025-03-17 11:18:31,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:18:31,858 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-17 11:18:31,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:31,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1891954513, now seen corresponding path program 1 times [2025-03-17 11:18:31,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:31,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896001223] [2025-03-17 11:18:31,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:31,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:31,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 11:18:31,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 11:18:31,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:31,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:32,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:18:32,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:32,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896001223] [2025-03-17 11:18:32,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896001223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:32,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:32,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:18:32,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359245037] [2025-03-17 11:18:32,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:32,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:18:32,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:32,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:18:32,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:18:32,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 87 [2025-03-17 11:18:32,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 86 transitions, 217 flow. Second operand has 6 states, 6 states have (on average 68.16666666666667) internal successors, (409), 6 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:32,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:32,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 87 [2025-03-17 11:18:32,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:32,262 INFO L124 PetriNetUnfolderBase]: 25/280 cut-off events. [2025-03-17 11:18:32,262 INFO L125 PetriNetUnfolderBase]: For 48/51 co-relation queries the response was YES. [2025-03-17 11:18:32,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 280 events. 25/280 cut-off events. For 48/51 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1206 event pairs, 15 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 370. Up to 55 conditions per place. [2025-03-17 11:18:32,264 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 12 selfloop transitions, 0 changer transitions 18/93 dead transitions. [2025-03-17 11:18:32,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 93 transitions, 285 flow [2025-03-17 11:18:32,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:18:32,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:18:32,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 424 transitions. [2025-03-17 11:18:32,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8122605363984674 [2025-03-17 11:18:32,265 INFO L175 Difference]: Start difference. First operand has 93 places, 86 transitions, 217 flow. Second operand 6 states and 424 transitions. [2025-03-17 11:18:32,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 93 transitions, 285 flow [2025-03-17 11:18:32,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 93 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:18:32,267 INFO L231 Difference]: Finished difference. Result has 95 places, 75 transitions, 184 flow [2025-03-17 11:18:32,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=95, PETRI_TRANSITIONS=75} [2025-03-17 11:18:32,268 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 7 predicate places. [2025-03-17 11:18:32,268 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 75 transitions, 184 flow [2025-03-17 11:18:32,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.16666666666667) internal successors, (409), 6 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:32,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:32,269 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-17 11:18:32,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:18:32,269 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-17 11:18:32,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:32,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1886398143, now seen corresponding path program 1 times [2025-03-17 11:18:32,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:32,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900386325] [2025-03-17 11:18:32,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:32,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:32,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 11:18:32,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 11:18:32,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:32,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:18:32,294 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:18:32,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 11:18:32,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 11:18:32,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:32,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:18:32,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:18:32,322 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:18:32,323 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-17 11:18:32,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2025-03-17 11:18:32,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2025-03-17 11:18:32,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2025-03-17 11:18:32,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2025-03-17 11:18:32,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2025-03-17 11:18:32,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:18:32,325 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-17 11:18:32,327 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:18:32,327 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 11:18:32,338 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 11:18:32,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 105 transitions, 226 flow [2025-03-17 11:18:32,354 INFO L124 PetriNetUnfolderBase]: 4/199 cut-off events. [2025-03-17 11:18:32,354 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 11:18:32,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 199 events. 4/199 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 435 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 121. Up to 6 conditions per place. [2025-03-17 11:18:32,354 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 105 transitions, 226 flow [2025-03-17 11:18:32,355 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 105 transitions, 226 flow [2025-03-17 11:18:32,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:18:32,356 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;@6227c2f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:18:32,356 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-17 11:18:32,359 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:18:32,359 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-03-17 11:18:32,359 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:18:32,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:32,359 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] [2025-03-17 11:18:32,360 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-17 11:18:32,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:32,360 INFO L85 PathProgramCache]: Analyzing trace with hash 466686830, now seen corresponding path program 1 times [2025-03-17 11:18:32,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:32,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47961037] [2025-03-17 11:18:32,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:32,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:32,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 11:18:32,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 11:18:32,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:32,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:32,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:18:32,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:32,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47961037] [2025-03-17 11:18:32,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47961037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:32,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:32,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:18:32,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35338728] [2025-03-17 11:18:32,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:32,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:18:32,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:32,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:18:32,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:18:32,387 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 105 [2025-03-17 11:18:32,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 105 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:32,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:32,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 105 [2025-03-17 11:18:32,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:32,458 INFO L124 PetriNetUnfolderBase]: 119/719 cut-off events. [2025-03-17 11:18:32,459 INFO L125 PetriNetUnfolderBase]: For 68/92 co-relation queries the response was YES. [2025-03-17 11:18:32,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 719 events. 119/719 cut-off events. For 68/92 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4233 event pairs, 50 based on Foata normal form. 1/635 useless extension candidates. Maximal degree in co-relation 741. Up to 139 conditions per place. [2025-03-17 11:18:32,463 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 16 selfloop transitions, 4 changer transitions 1/111 dead transitions. [2025-03-17 11:18:32,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 111 transitions, 278 flow [2025-03-17 11:18:32,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:18:32,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:18:32,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2025-03-17 11:18:32,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9365079365079365 [2025-03-17 11:18:32,464 INFO L175 Difference]: Start difference. First operand has 107 places, 105 transitions, 226 flow. Second operand 3 states and 295 transitions. [2025-03-17 11:18:32,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 111 transitions, 278 flow [2025-03-17 11:18:32,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 111 transitions, 278 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:18:32,466 INFO L231 Difference]: Finished difference. Result has 111 places, 106 transitions, 252 flow [2025-03-17 11:18:32,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=111, PETRI_TRANSITIONS=106} [2025-03-17 11:18:32,467 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 4 predicate places. [2025-03-17 11:18:32,467 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 106 transitions, 252 flow [2025-03-17 11:18:32,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:32,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:32,468 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] [2025-03-17 11:18:32,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:18:32,468 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-17 11:18:32,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:32,468 INFO L85 PathProgramCache]: Analyzing trace with hash 33052953, now seen corresponding path program 1 times [2025-03-17 11:18:32,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:32,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353514323] [2025-03-17 11:18:32,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:32,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:32,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 11:18:32,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 11:18:32,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:32,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:32,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:18:32,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:32,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353514323] [2025-03-17 11:18:32,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353514323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:32,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:32,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:18:32,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954476520] [2025-03-17 11:18:32,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:32,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:18:32,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:32,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:18:32,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:18:32,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 105 [2025-03-17 11:18:32,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 106 transitions, 252 flow. Second operand has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:32,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:32,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 105 [2025-03-17 11:18:32,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:32,931 INFO L124 PetriNetUnfolderBase]: 299/1306 cut-off events. [2025-03-17 11:18:32,931 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-03-17 11:18:32,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2039 conditions, 1306 events. 299/1306 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9710 event pairs, 58 based on Foata normal form. 0/1174 useless extension candidates. Maximal degree in co-relation 1408. Up to 372 conditions per place. [2025-03-17 11:18:32,939 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 36 selfloop transitions, 5 changer transitions 0/121 dead transitions. [2025-03-17 11:18:32,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 121 transitions, 364 flow [2025-03-17 11:18:32,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:18:32,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:18:32,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 510 transitions. [2025-03-17 11:18:32,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8095238095238095 [2025-03-17 11:18:32,942 INFO L175 Difference]: Start difference. First operand has 111 places, 106 transitions, 252 flow. Second operand 6 states and 510 transitions. [2025-03-17 11:18:32,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 121 transitions, 364 flow [2025-03-17 11:18:32,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 121 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:18:32,948 INFO L231 Difference]: Finished difference. Result has 112 places, 105 transitions, 252 flow [2025-03-17 11:18:32,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=112, PETRI_TRANSITIONS=105} [2025-03-17 11:18:32,949 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 5 predicate places. [2025-03-17 11:18:32,949 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 105 transitions, 252 flow [2025-03-17 11:18:32,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:32,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:32,949 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] [2025-03-17 11:18:32,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:18:32,950 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-17 11:18:32,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:32,950 INFO L85 PathProgramCache]: Analyzing trace with hash -118637790, now seen corresponding path program 1 times [2025-03-17 11:18:32,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:32,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269414890] [2025-03-17 11:18:32,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:32,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:32,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 11:18:32,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 11:18:32,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:32,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:33,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:18:33,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:33,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269414890] [2025-03-17 11:18:33,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269414890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:33,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:33,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:18:33,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713548381] [2025-03-17 11:18:33,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:33,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:18:33,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:33,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:18:33,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:18:33,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 105 [2025-03-17 11:18:33,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 105 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:33,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:33,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 105 [2025-03-17 11:18:33,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:33,177 INFO L124 PetriNetUnfolderBase]: 179/1195 cut-off events. [2025-03-17 11:18:33,178 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-17 11:18:33,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1678 conditions, 1195 events. 179/1195 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 8662 event pairs, 75 based on Foata normal form. 1/1082 useless extension candidates. Maximal degree in co-relation 560. Up to 300 conditions per place. [2025-03-17 11:18:33,184 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 20 selfloop transitions, 2 changer transitions 5/113 dead transitions. [2025-03-17 11:18:33,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 113 transitions, 322 flow [2025-03-17 11:18:33,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:18:33,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:18:33,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 538 transitions. [2025-03-17 11:18:33,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8539682539682539 [2025-03-17 11:18:33,185 INFO L175 Difference]: Start difference. First operand has 112 places, 105 transitions, 252 flow. Second operand 6 states and 538 transitions. [2025-03-17 11:18:33,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 113 transitions, 322 flow [2025-03-17 11:18:33,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 113 transitions, 312 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:18:33,187 INFO L231 Difference]: Finished difference. Result has 116 places, 106 transitions, 264 flow [2025-03-17 11:18:33,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=264, PETRI_PLACES=116, PETRI_TRANSITIONS=106} [2025-03-17 11:18:33,188 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 9 predicate places. [2025-03-17 11:18:33,188 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 106 transitions, 264 flow [2025-03-17 11:18:33,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:33,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:33,189 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] [2025-03-17 11:18:33,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:18:33,189 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-17 11:18:33,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:33,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1049164476, now seen corresponding path program 1 times [2025-03-17 11:18:33,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:33,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570753834] [2025-03-17 11:18:33,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:33,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:33,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 11:18:33,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 11:18:33,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:33,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:33,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:18:33,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:33,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570753834] [2025-03-17 11:18:33,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570753834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:33,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:33,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:18:33,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28303192] [2025-03-17 11:18:33,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:33,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:18:33,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:33,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:18:33,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:18:33,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 105 [2025-03-17 11:18:33,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 106 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:33,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:33,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 105 [2025-03-17 11:18:33,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:33,343 INFO L124 PetriNetUnfolderBase]: 165/981 cut-off events. [2025-03-17 11:18:33,343 INFO L125 PetriNetUnfolderBase]: For 182/299 co-relation queries the response was YES. [2025-03-17 11:18:33,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 981 events. 165/981 cut-off events. For 182/299 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7106 event pairs, 88 based on Foata normal form. 3/880 useless extension candidates. Maximal degree in co-relation 1539. Up to 269 conditions per place. [2025-03-17 11:18:33,347 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 19 selfloop transitions, 7 changer transitions 0/115 dead transitions. [2025-03-17 11:18:33,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 115 transitions, 348 flow [2025-03-17 11:18:33,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:18:33,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:18:33,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2025-03-17 11:18:33,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2025-03-17 11:18:33,349 INFO L175 Difference]: Start difference. First operand has 116 places, 106 transitions, 264 flow. Second operand 3 states and 291 transitions. [2025-03-17 11:18:33,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 115 transitions, 348 flow [2025-03-17 11:18:33,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 115 transitions, 336 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-17 11:18:33,352 INFO L231 Difference]: Finished difference. Result has 113 places, 111 transitions, 308 flow [2025-03-17 11:18:33,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=113, PETRI_TRANSITIONS=111} [2025-03-17 11:18:33,352 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 6 predicate places. [2025-03-17 11:18:33,352 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 111 transitions, 308 flow [2025-03-17 11:18:33,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:33,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:33,354 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] [2025-03-17 11:18:33,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:18:33,354 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-17 11:18:33,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:33,355 INFO L85 PathProgramCache]: Analyzing trace with hash -180802584, now seen corresponding path program 1 times [2025-03-17 11:18:33,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:33,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935850911] [2025-03-17 11:18:33,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:33,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:33,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 11:18:33,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 11:18:33,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:33,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:33,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:18:33,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:33,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935850911] [2025-03-17 11:18:33,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935850911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:33,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:33,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:18:33,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347831365] [2025-03-17 11:18:33,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:33,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:18:33,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:33,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:18:33,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:18:33,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 105 [2025-03-17 11:18:33,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 111 transitions, 308 flow. Second operand has 6 states, 6 states have (on average 82.16666666666667) internal successors, (493), 6 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:33,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:33,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 105 [2025-03-17 11:18:33,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:33,830 INFO L124 PetriNetUnfolderBase]: 356/1815 cut-off events. [2025-03-17 11:18:33,830 INFO L125 PetriNetUnfolderBase]: For 304/350 co-relation queries the response was YES. [2025-03-17 11:18:33,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2992 conditions, 1815 events. 356/1815 cut-off events. For 304/350 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 15312 event pairs, 177 based on Foata normal form. 3/1659 useless extension candidates. Maximal degree in co-relation 2422. Up to 360 conditions per place. [2025-03-17 11:18:33,840 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 34 selfloop transitions, 5 changer transitions 0/126 dead transitions. [2025-03-17 11:18:33,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 126 transitions, 416 flow [2025-03-17 11:18:33,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:18:33,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:18:33,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 520 transitions. [2025-03-17 11:18:33,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8253968253968254 [2025-03-17 11:18:33,841 INFO L175 Difference]: Start difference. First operand has 113 places, 111 transitions, 308 flow. Second operand 6 states and 520 transitions. [2025-03-17 11:18:33,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 126 transitions, 416 flow [2025-03-17 11:18:33,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 126 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:18:33,845 INFO L231 Difference]: Finished difference. Result has 115 places, 110 transitions, 302 flow [2025-03-17 11:18:33,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=302, PETRI_PLACES=115, PETRI_TRANSITIONS=110} [2025-03-17 11:18:33,846 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 8 predicate places. [2025-03-17 11:18:33,846 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 110 transitions, 302 flow [2025-03-17 11:18:33,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.16666666666667) internal successors, (493), 6 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:33,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:33,846 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] [2025-03-17 11:18:33,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:18:33,847 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-17 11:18:33,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:33,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1638726094, now seen corresponding path program 1 times [2025-03-17 11:18:33,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:33,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877299506] [2025-03-17 11:18:33,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:33,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:33,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 11:18:33,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 11:18:33,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:33,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:33,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:18:33,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:33,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877299506] [2025-03-17 11:18:33,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877299506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:33,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:33,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:18:33,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955048575] [2025-03-17 11:18:33,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:33,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:18:33,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:33,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:18:33,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:18:34,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 105 [2025-03-17 11:18:34,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 110 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:34,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:34,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 105 [2025-03-17 11:18:34,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:34,137 INFO L124 PetriNetUnfolderBase]: 141/992 cut-off events. [2025-03-17 11:18:34,137 INFO L125 PetriNetUnfolderBase]: For 139/167 co-relation queries the response was YES. [2025-03-17 11:18:34,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1572 conditions, 992 events. 141/992 cut-off events. For 139/167 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 6861 event pairs, 43 based on Foata normal form. 15/943 useless extension candidates. Maximal degree in co-relation 974. Up to 189 conditions per place. [2025-03-17 11:18:34,141 INFO L140 encePairwiseOnDemand]: 98/105 looper letters, 23 selfloop transitions, 6 changer transitions 6/123 dead transitions. [2025-03-17 11:18:34,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 123 transitions, 402 flow [2025-03-17 11:18:34,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:18:34,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:18:34,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 540 transitions. [2025-03-17 11:18:34,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2025-03-17 11:18:34,143 INFO L175 Difference]: Start difference. First operand has 115 places, 110 transitions, 302 flow. Second operand 6 states and 540 transitions. [2025-03-17 11:18:34,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 123 transitions, 402 flow [2025-03-17 11:18:34,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 123 transitions, 390 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:18:34,145 INFO L231 Difference]: Finished difference. Result has 117 places, 110 transitions, 308 flow [2025-03-17 11:18:34,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=308, PETRI_PLACES=117, PETRI_TRANSITIONS=110} [2025-03-17 11:18:34,145 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 10 predicate places. [2025-03-17 11:18:34,145 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 110 transitions, 308 flow [2025-03-17 11:18:34,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:34,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:34,146 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-17 11:18:34,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:18:34,146 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-17 11:18:34,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:34,147 INFO L85 PathProgramCache]: Analyzing trace with hash -244837071, now seen corresponding path program 1 times [2025-03-17 11:18:34,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:34,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390585157] [2025-03-17 11:18:34,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:34,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:34,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 11:18:34,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 11:18:34,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:34,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:18:34,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:34,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390585157] [2025-03-17 11:18:34,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390585157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:34,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:34,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:18:34,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937307085] [2025-03-17 11:18:34,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:34,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:18:34,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:34,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:18:34,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:18:34,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 105 [2025-03-17 11:18:34,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 110 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:34,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:34,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 105 [2025-03-17 11:18:34,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:34,244 INFO L124 PetriNetUnfolderBase]: 56/601 cut-off events. [2025-03-17 11:18:34,244 INFO L125 PetriNetUnfolderBase]: For 214/275 co-relation queries the response was YES. [2025-03-17 11:18:34,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 984 conditions, 601 events. 56/601 cut-off events. For 214/275 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3615 event pairs, 30 based on Foata normal form. 3/581 useless extension candidates. Maximal degree in co-relation 867. Up to 119 conditions per place. [2025-03-17 11:18:34,247 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 19 selfloop transitions, 7 changer transitions 1/117 dead transitions. [2025-03-17 11:18:34,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 117 transitions, 385 flow [2025-03-17 11:18:34,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:18:34,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:18:34,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 290 transitions. [2025-03-17 11:18:34,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2025-03-17 11:18:34,248 INFO L175 Difference]: Start difference. First operand has 117 places, 110 transitions, 308 flow. Second operand 3 states and 290 transitions. [2025-03-17 11:18:34,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 117 transitions, 385 flow [2025-03-17 11:18:34,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 117 transitions, 377 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 11:18:34,251 INFO L231 Difference]: Finished difference. Result has 118 places, 113 transitions, 350 flow [2025-03-17 11:18:34,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=118, PETRI_TRANSITIONS=113} [2025-03-17 11:18:34,252 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 11 predicate places. [2025-03-17 11:18:34,252 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 113 transitions, 350 flow [2025-03-17 11:18:34,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:34,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:34,253 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-17 11:18:34,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:18:34,253 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-17 11:18:34,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:34,253 INFO L85 PathProgramCache]: Analyzing trace with hash -891395964, now seen corresponding path program 1 times [2025-03-17 11:18:34,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:34,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803897579] [2025-03-17 11:18:34,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:34,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:34,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 11:18:34,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 11:18:34,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:34,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:18:34,274 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:18:34,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 11:18:34,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 11:18:34,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:34,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:18:34,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:18:34,294 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:18:34,294 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-17 11:18:34,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-17 11:18:34,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-03-17 11:18:34,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-03-17 11:18:34,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-17 11:18:34,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-17 11:18:34,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-17 11:18:34,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:18:34,295 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:18:34,295 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:18:34,296 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-17 11:18:34,311 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 11:18:34,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 123 transitions, 273 flow [2025-03-17 11:18:34,334 INFO L124 PetriNetUnfolderBase]: 9/324 cut-off events. [2025-03-17 11:18:34,334 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-17 11:18:34,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 324 events. 9/324 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 911 event pairs, 1 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 207. Up to 12 conditions per place. [2025-03-17 11:18:34,335 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 123 transitions, 273 flow [2025-03-17 11:18:34,337 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 123 transitions, 273 flow [2025-03-17 11:18:34,338 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:18:34,338 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;@6227c2f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:18:34,338 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-17 11:18:34,341 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:18:34,341 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-03-17 11:18:34,341 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:18:34,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:34,341 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] [2025-03-17 11:18:34,341 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-17 11:18:34,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:34,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1478272818, now seen corresponding path program 1 times [2025-03-17 11:18:34,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:34,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640740677] [2025-03-17 11:18:34,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:34,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:34,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 11:18:34,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 11:18:34,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:34,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:34,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:18:34,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:34,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640740677] [2025-03-17 11:18:34,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640740677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:34,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:34,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:18:34,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451339381] [2025-03-17 11:18:34,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:34,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:18:34,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:34,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:18:34,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:18:34,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 123 [2025-03-17 11:18:34,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 123 transitions, 273 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:34,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:34,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 123 [2025-03-17 11:18:34,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:34,708 INFO L124 PetriNetUnfolderBase]: 1071/3960 cut-off events. [2025-03-17 11:18:34,708 INFO L125 PetriNetUnfolderBase]: For 363/468 co-relation queries the response was YES. [2025-03-17 11:18:34,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5875 conditions, 3960 events. 1071/3960 cut-off events. For 363/468 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 35773 event pairs, 542 based on Foata normal form. 1/3520 useless extension candidates. Maximal degree in co-relation 4604. Up to 1110 conditions per place. [2025-03-17 11:18:34,768 INFO L140 encePairwiseOnDemand]: 116/123 looper letters, 23 selfloop transitions, 5 changer transitions 1/132 dead transitions. [2025-03-17 11:18:34,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 132 transitions, 347 flow [2025-03-17 11:18:34,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:18:34,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:18:34,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2025-03-17 11:18:34,769 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.926829268292683 [2025-03-17 11:18:34,769 INFO L175 Difference]: Start difference. First operand has 126 places, 123 transitions, 273 flow. Second operand 3 states and 342 transitions. [2025-03-17 11:18:34,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 132 transitions, 347 flow [2025-03-17 11:18:34,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 132 transitions, 347 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:18:34,772 INFO L231 Difference]: Finished difference. Result has 130 places, 125 transitions, 307 flow [2025-03-17 11:18:34,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=307, PETRI_PLACES=130, PETRI_TRANSITIONS=125} [2025-03-17 11:18:34,773 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 4 predicate places. [2025-03-17 11:18:34,773 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 125 transitions, 307 flow [2025-03-17 11:18:34,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:34,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:34,773 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] [2025-03-17 11:18:34,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:18:34,773 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-17 11:18:34,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:34,774 INFO L85 PathProgramCache]: Analyzing trace with hash -762391079, now seen corresponding path program 1 times [2025-03-17 11:18:34,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:34,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173074339] [2025-03-17 11:18:34,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:34,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:34,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 11:18:34,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 11:18:34,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:34,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:34,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:18:34,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:34,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173074339] [2025-03-17 11:18:34,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173074339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:34,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:34,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:18:34,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72196346] [2025-03-17 11:18:34,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:34,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:18:34,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:34,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:18:34,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:18:35,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 123 [2025-03-17 11:18:35,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 125 transitions, 307 flow. Second operand has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:35,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:35,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 123 [2025-03-17 11:18:35,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:35,602 INFO L124 PetriNetUnfolderBase]: 2135/6767 cut-off events. [2025-03-17 11:18:35,603 INFO L125 PetriNetUnfolderBase]: For 513/513 co-relation queries the response was YES. [2025-03-17 11:18:35,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10999 conditions, 6767 events. 2135/6767 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 67202 event pairs, 440 based on Foata normal form. 0/5977 useless extension candidates. Maximal degree in co-relation 6937. Up to 2247 conditions per place. [2025-03-17 11:18:35,649 INFO L140 encePairwiseOnDemand]: 117/123 looper letters, 48 selfloop transitions, 5 changer transitions 0/148 dead transitions. [2025-03-17 11:18:35,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 148 transitions, 459 flow [2025-03-17 11:18:35,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:18:35,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:18:35,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions. [2025-03-17 11:18:35,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8211382113821138 [2025-03-17 11:18:35,652 INFO L175 Difference]: Start difference. First operand has 130 places, 125 transitions, 307 flow. Second operand 6 states and 606 transitions. [2025-03-17 11:18:35,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 148 transitions, 459 flow [2025-03-17 11:18:35,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 148 transitions, 449 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:18:35,660 INFO L231 Difference]: Finished difference. Result has 131 places, 124 transitions, 305 flow [2025-03-17 11:18:35,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=131, PETRI_TRANSITIONS=124} [2025-03-17 11:18:35,660 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 5 predicate places. [2025-03-17 11:18:35,660 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 124 transitions, 305 flow [2025-03-17 11:18:35,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:35,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:35,660 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] [2025-03-17 11:18:35,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:18:35,661 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-17 11:18:35,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:35,661 INFO L85 PathProgramCache]: Analyzing trace with hash -914081822, now seen corresponding path program 1 times [2025-03-17 11:18:35,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:35,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924931453] [2025-03-17 11:18:35,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:35,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:35,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 11:18:35,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 11:18:35,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:35,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:35,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:18:35,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:35,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924931453] [2025-03-17 11:18:35,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924931453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:35,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:35,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:18:35,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408087018] [2025-03-17 11:18:35,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:35,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:18:35,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:35,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:18:35,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:18:35,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 123 [2025-03-17 11:18:35,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 124 transitions, 305 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:35,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:35,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 123 [2025-03-17 11:18:35,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:36,335 INFO L124 PetriNetUnfolderBase]: 1392/6275 cut-off events. [2025-03-17 11:18:36,336 INFO L125 PetriNetUnfolderBase]: For 268/268 co-relation queries the response was YES. [2025-03-17 11:18:36,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8980 conditions, 6275 events. 1392/6275 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 63590 event pairs, 1074 based on Foata normal form. 1/5612 useless extension candidates. Maximal degree in co-relation 5639. Up to 1837 conditions per place. [2025-03-17 11:18:36,371 INFO L140 encePairwiseOnDemand]: 115/123 looper letters, 24 selfloop transitions, 2 changer transitions 5/132 dead transitions. [2025-03-17 11:18:36,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 132 transitions, 383 flow [2025-03-17 11:18:36,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:18:36,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:18:36,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 626 transitions. [2025-03-17 11:18:36,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8482384823848238 [2025-03-17 11:18:36,373 INFO L175 Difference]: Start difference. First operand has 131 places, 124 transitions, 305 flow. Second operand 6 states and 626 transitions. [2025-03-17 11:18:36,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 132 transitions, 383 flow [2025-03-17 11:18:36,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 132 transitions, 373 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:18:36,376 INFO L231 Difference]: Finished difference. Result has 135 places, 125 transitions, 317 flow [2025-03-17 11:18:36,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=317, PETRI_PLACES=135, PETRI_TRANSITIONS=125} [2025-03-17 11:18:36,377 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 9 predicate places. [2025-03-17 11:18:36,377 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 125 transitions, 317 flow [2025-03-17 11:18:36,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:36,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:36,377 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] [2025-03-17 11:18:36,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:18:36,377 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-17 11:18:36,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:36,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1525258644, now seen corresponding path program 1 times [2025-03-17 11:18:36,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:36,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504292420] [2025-03-17 11:18:36,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:36,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:36,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 11:18:36,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 11:18:36,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:36,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:36,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:18:36,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:36,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504292420] [2025-03-17 11:18:36,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504292420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:36,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:36,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:18:36,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030006471] [2025-03-17 11:18:36,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:36,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:18:36,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:36,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:18:36,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:18:36,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 123 [2025-03-17 11:18:36,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 125 transitions, 317 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:36,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:36,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 123 [2025-03-17 11:18:36,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:36,928 INFO L124 PetriNetUnfolderBase]: 1740/6509 cut-off events. [2025-03-17 11:18:36,928 INFO L125 PetriNetUnfolderBase]: For 1609/2214 co-relation queries the response was YES. [2025-03-17 11:18:36,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11100 conditions, 6509 events. 1740/6509 cut-off events. For 1609/2214 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 67782 event pairs, 967 based on Foata normal form. 10/5768 useless extension candidates. Maximal degree in co-relation 11041. Up to 2240 conditions per place. [2025-03-17 11:18:36,955 INFO L140 encePairwiseOnDemand]: 116/123 looper letters, 29 selfloop transitions, 9 changer transitions 0/140 dead transitions. [2025-03-17 11:18:36,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 140 transitions, 451 flow [2025-03-17 11:18:36,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:18:36,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:18:36,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2025-03-17 11:18:36,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9214092140921409 [2025-03-17 11:18:36,956 INFO L175 Difference]: Start difference. First operand has 135 places, 125 transitions, 317 flow. Second operand 3 states and 340 transitions. [2025-03-17 11:18:36,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 140 transitions, 451 flow [2025-03-17 11:18:36,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 140 transitions, 439 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-17 11:18:36,966 INFO L231 Difference]: Finished difference. Result has 132 places, 132 transitions, 381 flow [2025-03-17 11:18:36,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=381, PETRI_PLACES=132, PETRI_TRANSITIONS=132} [2025-03-17 11:18:36,967 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 6 predicate places. [2025-03-17 11:18:36,967 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 132 transitions, 381 flow [2025-03-17 11:18:36,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:36,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:36,967 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] [2025-03-17 11:18:36,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:18:36,968 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-17 11:18:36,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:36,968 INFO L85 PathProgramCache]: Analyzing trace with hash 934161587, now seen corresponding path program 1 times [2025-03-17 11:18:36,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:36,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426730515] [2025-03-17 11:18:36,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:36,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:36,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 11:18:36,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 11:18:36,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:36,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:37,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:18:37,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:37,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426730515] [2025-03-17 11:18:37,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426730515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:37,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:37,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:18:37,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676071322] [2025-03-17 11:18:37,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:37,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:18:37,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:37,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:18:37,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:18:37,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 123 [2025-03-17 11:18:37,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 132 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:37,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:37,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 123 [2025-03-17 11:18:37,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:38,070 INFO L124 PetriNetUnfolderBase]: 2856/10331 cut-off events. [2025-03-17 11:18:38,071 INFO L125 PetriNetUnfolderBase]: For 1730/2294 co-relation queries the response was YES. [2025-03-17 11:18:38,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17463 conditions, 10331 events. 2856/10331 cut-off events. For 1730/2294 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 114233 event pairs, 1400 based on Foata normal form. 17/9185 useless extension candidates. Maximal degree in co-relation 13963. Up to 2139 conditions per place. [2025-03-17 11:18:38,125 INFO L140 encePairwiseOnDemand]: 117/123 looper letters, 46 selfloop transitions, 5 changer transitions 0/155 dead transitions. [2025-03-17 11:18:38,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 155 transitions, 529 flow [2025-03-17 11:18:38,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:18:38,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:18:38,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions. [2025-03-17 11:18:38,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8346883468834688 [2025-03-17 11:18:38,127 INFO L175 Difference]: Start difference. First operand has 132 places, 132 transitions, 381 flow. Second operand 6 states and 616 transitions. [2025-03-17 11:18:38,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 155 transitions, 529 flow [2025-03-17 11:18:38,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 155 transitions, 511 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:18:38,136 INFO L231 Difference]: Finished difference. Result has 134 places, 131 transitions, 371 flow [2025-03-17 11:18:38,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=371, PETRI_PLACES=134, PETRI_TRANSITIONS=131} [2025-03-17 11:18:38,136 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 8 predicate places. [2025-03-17 11:18:38,136 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 131 transitions, 371 flow [2025-03-17 11:18:38,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:38,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:38,137 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] [2025-03-17 11:18:38,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:18:38,137 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-17 11:18:38,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:38,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1056588409, now seen corresponding path program 1 times [2025-03-17 11:18:38,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:38,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141972040] [2025-03-17 11:18:38,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:38,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:38,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 11:18:38,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 11:18:38,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:38,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:38,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:18:38,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:38,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141972040] [2025-03-17 11:18:38,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141972040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:38,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:38,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:18:38,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048876643] [2025-03-17 11:18:38,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:38,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:18:38,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:38,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:18:38,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:18:38,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 123 [2025-03-17 11:18:38,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 131 transitions, 371 flow. Second operand has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:38,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:38,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 123 [2025-03-17 11:18:38,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:38,827 INFO L124 PetriNetUnfolderBase]: 1305/6108 cut-off events. [2025-03-17 11:18:38,827 INFO L125 PetriNetUnfolderBase]: For 975/1236 co-relation queries the response was YES. [2025-03-17 11:18:38,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10066 conditions, 6108 events. 1305/6108 cut-off events. For 975/1236 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 63100 event pairs, 532 based on Foata normal form. 65/5601 useless extension candidates. Maximal degree in co-relation 4987. Up to 1228 conditions per place. [2025-03-17 11:18:38,861 INFO L140 encePairwiseOnDemand]: 116/123 looper letters, 38 selfloop transitions, 6 changer transitions 0/150 dead transitions. [2025-03-17 11:18:38,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 150 transitions, 508 flow [2025-03-17 11:18:38,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:18:38,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:18:38,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 633 transitions. [2025-03-17 11:18:38,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8577235772357723 [2025-03-17 11:18:38,862 INFO L175 Difference]: Start difference. First operand has 134 places, 131 transitions, 371 flow. Second operand 6 states and 633 transitions. [2025-03-17 11:18:38,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 150 transitions, 508 flow [2025-03-17 11:18:38,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 150 transitions, 496 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:18:38,867 INFO L231 Difference]: Finished difference. Result has 136 places, 133 transitions, 387 flow [2025-03-17 11:18:38,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=136, PETRI_TRANSITIONS=133} [2025-03-17 11:18:38,867 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 10 predicate places. [2025-03-17 11:18:38,867 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 133 transitions, 387 flow [2025-03-17 11:18:38,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:38,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:38,868 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-17 11:18:38,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:18:38,868 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-17 11:18:38,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:38,868 INFO L85 PathProgramCache]: Analyzing trace with hash -2073378036, now seen corresponding path program 1 times [2025-03-17 11:18:38,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:38,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226562666] [2025-03-17 11:18:38,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:38,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:38,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 11:18:38,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 11:18:38,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:38,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:38,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:18:38,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:38,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226562666] [2025-03-17 11:18:38,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226562666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:38,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:38,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:18:38,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130431648] [2025-03-17 11:18:38,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:38,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:18:38,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:38,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:18:38,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:18:38,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 123 [2025-03-17 11:18:38,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 387 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:38,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:38,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 123 [2025-03-17 11:18:38,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:39,278 INFO L124 PetriNetUnfolderBase]: 1088/4747 cut-off events. [2025-03-17 11:18:39,279 INFO L125 PetriNetUnfolderBase]: For 2465/2683 co-relation queries the response was YES. [2025-03-17 11:18:39,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8849 conditions, 4747 events. 1088/4747 cut-off events. For 2465/2683 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 49258 event pairs, 589 based on Foata normal form. 7/4393 useless extension candidates. Maximal degree in co-relation 8119. Up to 1450 conditions per place. [2025-03-17 11:18:39,301 INFO L140 encePairwiseOnDemand]: 116/123 looper letters, 31 selfloop transitions, 13 changer transitions 0/149 dead transitions. [2025-03-17 11:18:39,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 149 transitions, 548 flow [2025-03-17 11:18:39,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:18:39,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:18:39,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2025-03-17 11:18:39,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9186991869918699 [2025-03-17 11:18:39,302 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 387 flow. Second operand 3 states and 339 transitions. [2025-03-17 11:18:39,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 149 transitions, 548 flow [2025-03-17 11:18:39,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 149 transitions, 540 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 11:18:39,306 INFO L231 Difference]: Finished difference. Result has 137 places, 142 transitions, 497 flow [2025-03-17 11:18:39,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=497, PETRI_PLACES=137, PETRI_TRANSITIONS=142} [2025-03-17 11:18:39,306 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 11 predicate places. [2025-03-17 11:18:39,306 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 142 transitions, 497 flow [2025-03-17 11:18:39,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:39,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:39,307 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-17 11:18:39,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:18:39,307 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-17 11:18:39,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:39,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1156744160, now seen corresponding path program 1 times [2025-03-17 11:18:39,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:39,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080881755] [2025-03-17 11:18:39,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:39,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:39,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 11:18:39,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 11:18:39,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:39,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:39,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:18:39,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:39,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080881755] [2025-03-17 11:18:39,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080881755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:39,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:39,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:18:39,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930263484] [2025-03-17 11:18:39,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:39,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:18:39,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:39,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:18:39,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:18:39,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 123 [2025-03-17 11:18:39,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 142 transitions, 497 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:39,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:39,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 123 [2025-03-17 11:18:39,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:39,461 INFO L124 PetriNetUnfolderBase]: 124/1629 cut-off events. [2025-03-17 11:18:39,461 INFO L125 PetriNetUnfolderBase]: For 714/831 co-relation queries the response was YES. [2025-03-17 11:18:39,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2647 conditions, 1629 events. 124/1629 cut-off events. For 714/831 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 13423 event pairs, 20 based on Foata normal form. 21/1580 useless extension candidates. Maximal degree in co-relation 1069. Up to 142 conditions per place. [2025-03-17 11:18:39,467 INFO L140 encePairwiseOnDemand]: 117/123 looper letters, 12 selfloop transitions, 6 changer transitions 0/137 dead transitions. [2025-03-17 11:18:39,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 137 transitions, 470 flow [2025-03-17 11:18:39,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:18:39,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:18:39,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2025-03-17 11:18:39,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.943089430894309 [2025-03-17 11:18:39,468 INFO L175 Difference]: Start difference. First operand has 137 places, 142 transitions, 497 flow. Second operand 3 states and 348 transitions. [2025-03-17 11:18:39,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 137 transitions, 470 flow [2025-03-17 11:18:39,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 137 transitions, 456 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-17 11:18:39,473 INFO L231 Difference]: Finished difference. Result has 137 places, 132 transitions, 401 flow [2025-03-17 11:18:39,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=401, PETRI_PLACES=137, PETRI_TRANSITIONS=132} [2025-03-17 11:18:39,473 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 11 predicate places. [2025-03-17 11:18:39,474 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 132 transitions, 401 flow [2025-03-17 11:18:39,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:39,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:39,474 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-17 11:18:39,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:18:39,474 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-17 11:18:39,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:39,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1526062443, now seen corresponding path program 1 times [2025-03-17 11:18:39,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:39,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821749065] [2025-03-17 11:18:39,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:39,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:39,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 11:18:39,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 11:18:39,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:39,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:39,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:18:39,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:39,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821749065] [2025-03-17 11:18:39,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821749065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:39,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:39,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:18:39,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566345136] [2025-03-17 11:18:39,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:39,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:18:39,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:39,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:18:39,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:18:39,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 123 [2025-03-17 11:18:39,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 132 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:39,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:39,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 123 [2025-03-17 11:18:39,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:39,632 INFO L124 PetriNetUnfolderBase]: 203/1827 cut-off events. [2025-03-17 11:18:39,632 INFO L125 PetriNetUnfolderBase]: For 1305/1370 co-relation queries the response was YES. [2025-03-17 11:18:39,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3402 conditions, 1827 events. 203/1827 cut-off events. For 1305/1370 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 15998 event pairs, 134 based on Foata normal form. 3/1739 useless extension candidates. Maximal degree in co-relation 2856. Up to 435 conditions per place. [2025-03-17 11:18:39,637 INFO L140 encePairwiseOnDemand]: 118/123 looper letters, 25 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2025-03-17 11:18:39,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 137 transitions, 483 flow [2025-03-17 11:18:39,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:18:39,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:18:39,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2025-03-17 11:18:39,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8997289972899729 [2025-03-17 11:18:39,639 INFO L175 Difference]: Start difference. First operand has 137 places, 132 transitions, 401 flow. Second operand 3 states and 332 transitions. [2025-03-17 11:18:39,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 137 transitions, 483 flow [2025-03-17 11:18:39,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 137 transitions, 477 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:18:39,641 INFO L231 Difference]: Finished difference. Result has 140 places, 135 transitions, 435 flow [2025-03-17 11:18:39,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=435, PETRI_PLACES=140, PETRI_TRANSITIONS=135} [2025-03-17 11:18:39,641 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 14 predicate places. [2025-03-17 11:18:39,642 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 135 transitions, 435 flow [2025-03-17 11:18:39,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:39,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:39,642 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:18:39,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:18:39,642 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-17 11:18:39,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:39,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1407556514, now seen corresponding path program 1 times [2025-03-17 11:18:39,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:39,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339062821] [2025-03-17 11:18:39,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:39,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:39,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 11:18:39,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 11:18:39,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:39,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:18:39,659 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:18:39,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 11:18:39,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 11:18:39,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:39,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:18:39,681 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:18:39,681 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:18:39,682 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-17 11:18:39,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2025-03-17 11:18:39,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2025-03-17 11:18:39,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2025-03-17 11:18:39,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2025-03-17 11:18:39,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2025-03-17 11:18:39,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2025-03-17 11:18:39,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2025-03-17 11:18:39,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:18:39,682 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:18:39,682 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:18:39,683 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-17 11:18:39,698 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-17 11:18:39,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 141 transitions, 322 flow [2025-03-17 11:18:39,727 INFO L124 PetriNetUnfolderBase]: 22/541 cut-off events. [2025-03-17 11:18:39,727 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-17 11:18:39,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 541 events. 22/541 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1992 event pairs, 6 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 344. Up to 32 conditions per place. [2025-03-17 11:18:39,729 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 141 transitions, 322 flow [2025-03-17 11:18:39,730 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 141 transitions, 322 flow [2025-03-17 11:18:39,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:18:39,731 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;@6227c2f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:18:39,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-17 11:18:39,732 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:18:39,733 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-03-17 11:18:39,733 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:18:39,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:39,733 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] [2025-03-17 11:18:39,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:18:39,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:39,733 INFO L85 PathProgramCache]: Analyzing trace with hash -669957010, now seen corresponding path program 1 times [2025-03-17 11:18:39,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:39,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219440033] [2025-03-17 11:18:39,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:39,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:39,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 11:18:39,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 11:18:39,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:39,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:39,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:18:39,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:39,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219440033] [2025-03-17 11:18:39,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219440033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:39,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:39,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:18:39,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789126918] [2025-03-17 11:18:39,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:39,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:18:39,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:39,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:18:39,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:18:39,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 141 [2025-03-17 11:18:39,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 141 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:39,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:39,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 141 [2025-03-17 11:18:39,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:41,446 INFO L124 PetriNetUnfolderBase]: 7859/23223 cut-off events. [2025-03-17 11:18:41,446 INFO L125 PetriNetUnfolderBase]: For 2506/2857 co-relation queries the response was YES. [2025-03-17 11:18:41,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35573 conditions, 23223 events. 7859/23223 cut-off events. For 2506/2857 co-relation queries the response was YES. Maximal size of possible extension queue 790. Compared 267393 event pairs, 4292 based on Foata normal form. 1/21006 useless extension candidates. Maximal degree in co-relation 28335. Up to 7653 conditions per place. [2025-03-17 11:18:41,570 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 30 selfloop transitions, 6 changer transitions 1/153 dead transitions. [2025-03-17 11:18:41,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 153 transitions, 418 flow [2025-03-17 11:18:41,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:18:41,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:18:41,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2025-03-17 11:18:41,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9196217494089834 [2025-03-17 11:18:41,574 INFO L175 Difference]: Start difference. First operand has 145 places, 141 transitions, 322 flow. Second operand 3 states and 389 transitions. [2025-03-17 11:18:41,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 153 transitions, 418 flow [2025-03-17 11:18:41,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 153 transitions, 418 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:18:41,577 INFO L231 Difference]: Finished difference. Result has 149 places, 144 transitions, 364 flow [2025-03-17 11:18:41,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=149, PETRI_TRANSITIONS=144} [2025-03-17 11:18:41,577 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 4 predicate places. [2025-03-17 11:18:41,578 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 144 transitions, 364 flow [2025-03-17 11:18:41,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:41,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:41,578 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] [2025-03-17 11:18:41,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 11:18:41,578 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:18:41,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:41,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1359975655, now seen corresponding path program 1 times [2025-03-17 11:18:41,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:41,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669316062] [2025-03-17 11:18:41,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:41,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:41,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 11:18:41,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 11:18:41,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:41,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:41,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:18:41,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:41,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669316062] [2025-03-17 11:18:41,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669316062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:41,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:41,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:18:41,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280464424] [2025-03-17 11:18:41,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:41,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:18:41,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:41,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:18:41,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:18:41,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 141 [2025-03-17 11:18:41,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 144 transitions, 364 flow. Second operand has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 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-03-17 11:18:41,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:41,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 141 [2025-03-17 11:18:41,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:44,683 INFO L124 PetriNetUnfolderBase]: 12655/34914 cut-off events. [2025-03-17 11:18:44,683 INFO L125 PetriNetUnfolderBase]: For 3134/3134 co-relation queries the response was YES. [2025-03-17 11:18:44,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57388 conditions, 34914 events. 12655/34914 cut-off events. For 3134/3134 co-relation queries the response was YES. Maximal size of possible extension queue 1440. Compared 423100 event pairs, 6023 based on Foata normal form. 0/31081 useless extension candidates. Maximal degree in co-relation 34331. Up to 12818 conditions per place. [2025-03-17 11:18:44,903 INFO L140 encePairwiseOnDemand]: 135/141 looper letters, 60 selfloop transitions, 5 changer transitions 0/175 dead transitions. [2025-03-17 11:18:44,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 175 transitions, 556 flow [2025-03-17 11:18:44,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:18:44,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:18:44,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 702 transitions. [2025-03-17 11:18:44,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8297872340425532 [2025-03-17 11:18:44,905 INFO L175 Difference]: Start difference. First operand has 149 places, 144 transitions, 364 flow. Second operand 6 states and 702 transitions. [2025-03-17 11:18:44,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 175 transitions, 556 flow [2025-03-17 11:18:44,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 175 transitions, 544 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:18:44,959 INFO L231 Difference]: Finished difference. Result has 150 places, 143 transitions, 360 flow [2025-03-17 11:18:44,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=360, PETRI_PLACES=150, PETRI_TRANSITIONS=143} [2025-03-17 11:18:44,959 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 5 predicate places. [2025-03-17 11:18:44,959 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 143 transitions, 360 flow [2025-03-17 11:18:44,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 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-03-17 11:18:44,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:44,960 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] [2025-03-17 11:18:44,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 11:18:44,960 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:18:44,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:44,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1511666398, now seen corresponding path program 1 times [2025-03-17 11:18:44,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:44,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945887533] [2025-03-17 11:18:44,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:44,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:44,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 11:18:44,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 11:18:44,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:44,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:44,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:18:44,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:44,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945887533] [2025-03-17 11:18:44,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945887533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:44,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:44,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:18:44,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955118803] [2025-03-17 11:18:44,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:44,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:18:44,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:44,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:18:44,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:18:45,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 141 [2025-03-17 11:18:45,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 143 transitions, 360 flow. Second operand has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:45,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:45,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 141 [2025-03-17 11:18:45,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:48,049 INFO L124 PetriNetUnfolderBase]: 8788/32683 cut-off events. [2025-03-17 11:18:48,049 INFO L125 PetriNetUnfolderBase]: For 1398/1398 co-relation queries the response was YES. [2025-03-17 11:18:48,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47760 conditions, 32683 events. 8788/32683 cut-off events. For 1398/1398 co-relation queries the response was YES. Maximal size of possible extension queue 874. Compared 418692 event pairs, 5700 based on Foata normal form. 1/28182 useless extension candidates. Maximal degree in co-relation 16955. Up to 9905 conditions per place. [2025-03-17 11:18:48,208 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 28 selfloop transitions, 2 changer transitions 5/151 dead transitions. [2025-03-17 11:18:48,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 151 transitions, 446 flow [2025-03-17 11:18:48,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:18:48,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:18:48,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 714 transitions. [2025-03-17 11:18:48,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8439716312056738 [2025-03-17 11:18:48,210 INFO L175 Difference]: Start difference. First operand has 150 places, 143 transitions, 360 flow. Second operand 6 states and 714 transitions. [2025-03-17 11:18:48,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 151 transitions, 446 flow [2025-03-17 11:18:48,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 151 transitions, 436 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:18:48,212 INFO L231 Difference]: Finished difference. Result has 154 places, 144 transitions, 372 flow [2025-03-17 11:18:48,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=372, PETRI_PLACES=154, PETRI_TRANSITIONS=144} [2025-03-17 11:18:48,213 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 9 predicate places. [2025-03-17 11:18:48,213 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 144 transitions, 372 flow [2025-03-17 11:18:48,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:48,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:48,214 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] [2025-03-17 11:18:48,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 11:18:48,214 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:18:48,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:48,214 INFO L85 PathProgramCache]: Analyzing trace with hash 833277356, now seen corresponding path program 1 times [2025-03-17 11:18:48,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:48,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373677994] [2025-03-17 11:18:48,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:48,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:48,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 11:18:48,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 11:18:48,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:48,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:48,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:18:48,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:48,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373677994] [2025-03-17 11:18:48,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373677994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:48,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:48,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:18:48,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895599178] [2025-03-17 11:18:48,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:48,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:18:48,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:48,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:18:48,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:18:48,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 141 [2025-03-17 11:18:48,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 144 transitions, 372 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:48,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:48,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 141 [2025-03-17 11:18:48,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:51,529 INFO L124 PetriNetUnfolderBase]: 13629/40864 cut-off events. [2025-03-17 11:18:51,529 INFO L125 PetriNetUnfolderBase]: For 10549/13608 co-relation queries the response was YES. [2025-03-17 11:18:51,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71721 conditions, 40864 events. 13629/40864 cut-off events. For 10549/13608 co-relation queries the response was YES. Maximal size of possible extension queue 1516. Compared 523489 event pairs, 7860 based on Foata normal form. 36/36332 useless extension candidates. Maximal degree in co-relation 71661. Up to 15880 conditions per place. [2025-03-17 11:18:51,818 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 39 selfloop transitions, 11 changer transitions 0/165 dead transitions. [2025-03-17 11:18:51,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 165 transitions, 558 flow [2025-03-17 11:18:51,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:18:51,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:18:51,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2025-03-17 11:18:51,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9196217494089834 [2025-03-17 11:18:51,821 INFO L175 Difference]: Start difference. First operand has 154 places, 144 transitions, 372 flow. Second operand 3 states and 389 transitions. [2025-03-17 11:18:51,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 165 transitions, 558 flow [2025-03-17 11:18:51,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 165 transitions, 546 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-17 11:18:51,940 INFO L231 Difference]: Finished difference. Result has 151 places, 153 transitions, 456 flow [2025-03-17 11:18:51,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=151, PETRI_TRANSITIONS=153} [2025-03-17 11:18:51,940 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 6 predicate places. [2025-03-17 11:18:51,940 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 153 transitions, 456 flow [2025-03-17 11:18:51,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:51,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:51,940 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] [2025-03-17 11:18:51,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 11:18:51,940 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:18:51,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:51,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1452938000, now seen corresponding path program 1 times [2025-03-17 11:18:51,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:51,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459547473] [2025-03-17 11:18:51,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:51,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:51,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 11:18:51,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 11:18:51,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:51,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:52,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:18:52,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:52,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459547473] [2025-03-17 11:18:52,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459547473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:52,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:52,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:18:52,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585736521] [2025-03-17 11:18:52,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:52,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:18:52,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:52,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:18:52,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:18:52,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 141 [2025-03-17 11:18:52,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 153 transitions, 456 flow. Second operand has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:52,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:52,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 141 [2025-03-17 11:18:52,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:55,931 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([556] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_6| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_6|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][150], [170#true, Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 145#true, 107#L1024-3true, 91#L1022true, 43#L1023-1true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 119#L1038-1true, 140#true, Black: 150#(= |#race~data~0| 0), 175#true, 144#true, 142#true]) [2025-03-17 11:18:55,931 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2025-03-17 11:18:55,931 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-17 11:18:55,931 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-17 11:18:55,931 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-17 11:18:56,216 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([604] L1023-3-->L1023-1: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_6|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_6|} AuxVars[] AssignedVars[#race~data~0][182], [170#true, Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 56#L1023-2true, 43#L1023-1true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 119#L1038-1true, 146#true, 140#true, 74#L1023-1true, 141#true, 175#true, Black: 150#(= |#race~data~0| 0), 144#true]) [2025-03-17 11:18:56,216 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2025-03-17 11:18:56,216 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-17 11:18:56,216 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-17 11:18:56,216 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-17 11:18:56,281 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([556] L1023-3-->L1023-1: Formula: (= |v_#race~data~0_6| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_6|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][150], [170#true, 20#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 145#true, 43#L1023-1true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 119#L1038-1true, 140#true, 175#true, 67#L1023-1true, Black: 150#(= |#race~data~0| 0), 144#true, 142#true]) [2025-03-17 11:18:56,281 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2025-03-17 11:18:56,281 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-17 11:18:56,281 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-17 11:18:56,281 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-17 11:18:56,745 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([604] L1023-3-->L1023-1: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_6|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_6|} AuxVars[] AssignedVars[#race~data~0][177], [170#true, Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 107#L1024-3true, 43#L1023-1true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 119#L1038-1true, 146#true, 140#true, 74#L1023-1true, 141#true, 175#true, Black: 150#(= |#race~data~0| 0), 144#true]) [2025-03-17 11:18:56,745 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event [2025-03-17 11:18:56,745 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2025-03-17 11:18:56,745 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2025-03-17 11:18:56,745 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2025-03-17 11:18:57,213 INFO L124 PetriNetUnfolderBase]: 19867/57038 cut-off events. [2025-03-17 11:18:57,213 INFO L125 PetriNetUnfolderBase]: For 9373/13241 co-relation queries the response was YES. [2025-03-17 11:18:57,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99827 conditions, 57038 events. 19867/57038 cut-off events. For 9373/13241 co-relation queries the response was YES. Maximal size of possible extension queue 1934. Compared 746374 event pairs, 9570 based on Foata normal form. 80/49858 useless extension candidates. Maximal degree in co-relation 79001. Up to 12590 conditions per place. [2025-03-17 11:18:57,707 INFO L140 encePairwiseOnDemand]: 135/141 looper letters, 58 selfloop transitions, 5 changer transitions 0/184 dead transitions. [2025-03-17 11:18:57,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 184 transitions, 644 flow [2025-03-17 11:18:57,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:18:57,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:18:57,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 712 transitions. [2025-03-17 11:18:57,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8416075650118203 [2025-03-17 11:18:57,709 INFO L175 Difference]: Start difference. First operand has 151 places, 153 transitions, 456 flow. Second operand 6 states and 712 transitions. [2025-03-17 11:18:57,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 184 transitions, 644 flow [2025-03-17 11:18:57,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 184 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:18:57,958 INFO L231 Difference]: Finished difference. Result has 153 places, 152 transitions, 442 flow [2025-03-17 11:18:57,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=442, PETRI_PLACES=153, PETRI_TRANSITIONS=152} [2025-03-17 11:18:57,958 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 8 predicate places. [2025-03-17 11:18:57,958 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 152 transitions, 442 flow [2025-03-17 11:18:57,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:57,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:57,959 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] [2025-03-17 11:18:57,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 11:18:57,959 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:18:57,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:57,959 INFO L85 PathProgramCache]: Analyzing trace with hash 224079604, now seen corresponding path program 1 times [2025-03-17 11:18:57,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:57,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109991307] [2025-03-17 11:18:57,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:57,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:57,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 11:18:57,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 11:18:57,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:57,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:18:58,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:58,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109991307] [2025-03-17 11:18:58,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109991307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:58,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:58,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:18:58,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008408031] [2025-03-17 11:18:58,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:58,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:18:58,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:58,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:18:58,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:18:58,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 141 [2025-03-17 11:18:58,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 152 transitions, 442 flow. Second operand has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:58,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:58,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 141 [2025-03-17 11:18:58,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:19:00,132 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([604] L1023-3-->L1023-1: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_6|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_6|} AuxVars[] AssignedVars[#race~data~0][173], [Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 56#L1023-2true, 43#L1023-1true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 119#L1038-1true, 146#true, 140#true, 185#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 74#L1023-1true, 141#true, 175#true, Black: 150#(= |#race~data~0| 0), 144#true]) [2025-03-17 11:19:00,133 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2025-03-17 11:19:00,133 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-17 11:19:00,133 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-17 11:19:00,133 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-17 11:19:00,482 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([604] L1023-3-->L1023-1: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_6|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_6|} AuxVars[] AssignedVars[#race~data~0][172], [Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 107#L1024-3true, 43#L1023-1true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 119#L1038-1true, 146#true, 140#true, 74#L1023-1true, 185#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 141#true, 175#true, Black: 150#(= |#race~data~0| 0), 144#true]) [2025-03-17 11:19:00,482 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event [2025-03-17 11:19:00,482 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2025-03-17 11:19:00,482 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2025-03-17 11:19:00,482 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2025-03-17 11:19:00,758 INFO L124 PetriNetUnfolderBase]: 10063/35805 cut-off events. [2025-03-17 11:19:00,758 INFO L125 PetriNetUnfolderBase]: For 6134/8108 co-relation queries the response was YES. [2025-03-17 11:19:00,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60768 conditions, 35805 events. 10063/35805 cut-off events. For 6134/8108 co-relation queries the response was YES. Maximal size of possible extension queue 1026. Compared 466498 event pairs, 5238 based on Foata normal form. 284/31943 useless extension candidates. Maximal degree in co-relation 31242. Up to 7614 conditions per place. [2025-03-17 11:19:00,971 INFO L140 encePairwiseOnDemand]: 134/141 looper letters, 47 selfloop transitions, 6 changer transitions 0/176 dead transitions. [2025-03-17 11:19:00,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 176 transitions, 610 flow [2025-03-17 11:19:00,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:19:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:19:00,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 726 transitions. [2025-03-17 11:19:00,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8581560283687943 [2025-03-17 11:19:00,972 INFO L175 Difference]: Start difference. First operand has 153 places, 152 transitions, 442 flow. Second operand 6 states and 726 transitions. [2025-03-17 11:19:00,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 176 transitions, 610 flow [2025-03-17 11:19:00,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 176 transitions, 598 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:19:00,985 INFO L231 Difference]: Finished difference. Result has 155 places, 154 transitions, 458 flow [2025-03-17 11:19:00,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=458, PETRI_PLACES=155, PETRI_TRANSITIONS=154} [2025-03-17 11:19:00,986 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 10 predicate places. [2025-03-17 11:19:00,986 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 154 transitions, 458 flow [2025-03-17 11:19:00,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:19:00,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:19:00,986 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-17 11:19:00,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 11:19:00,986 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:19:00,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:19:00,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1016566967, now seen corresponding path program 1 times [2025-03-17 11:19:00,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:19:00,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638020951] [2025-03-17 11:19:00,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:19:00,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:19:00,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 11:19:00,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 11:19:00,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:19:00,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:19:01,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:19:01,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:19:01,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638020951] [2025-03-17 11:19:01,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638020951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:19:01,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:19:01,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:19:01,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818094124] [2025-03-17 11:19:01,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:19:01,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:19:01,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:19:01,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:19:01,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:19:01,025 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 141 [2025-03-17 11:19:01,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 154 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:19:01,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:19:01,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 141 [2025-03-17 11:19:01,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:19:04,403 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([511] L1037-->L1038: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][156], [189#true, Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 145#true, 56#L1023-2true, 118#L1024-3true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 140#true, 185#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 143#true, Black: 148#true, Black: 183#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 186#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 68#L1038true, 142#true]) [2025-03-17 11:19:04,403 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2025-03-17 11:19:04,403 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-17 11:19:04,403 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2025-03-17 11:19:04,403 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-17 11:19:04,411 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([511] L1037-->L1038: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][156], [189#true, Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 145#true, 56#L1023-2true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 34#L1024true, 140#true, 185#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 143#true, Black: 148#true, Black: 183#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 186#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 68#L1038true, 142#true]) [2025-03-17 11:19:04,411 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2025-03-17 11:19:04,411 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-03-17 11:19:04,411 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-03-17 11:19:04,411 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-03-17 11:19:04,449 INFO L124 PetriNetUnfolderBase]: 11773/38290 cut-off events. [2025-03-17 11:19:04,449 INFO L125 PetriNetUnfolderBase]: For 22127/23908 co-relation queries the response was YES. [2025-03-17 11:19:04,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74357 conditions, 38290 events. 11773/38290 cut-off events. For 22127/23908 co-relation queries the response was YES. Maximal size of possible extension queue 1515. Compared 513745 event pairs, 6499 based on Foata normal form. 24/34724 useless extension candidates. Maximal degree in co-relation 67309. Up to 13617 conditions per place. [2025-03-17 11:19:04,727 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 43 selfloop transitions, 18 changer transitions 0/179 dead transitions. [2025-03-17 11:19:04,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 179 transitions, 703 flow [2025-03-17 11:19:04,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:19:04,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:19:04,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2025-03-17 11:19:04,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.91725768321513 [2025-03-17 11:19:04,728 INFO L175 Difference]: Start difference. First operand has 155 places, 154 transitions, 458 flow. Second operand 3 states and 388 transitions. [2025-03-17 11:19:04,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 179 transitions, 703 flow [2025-03-17 11:19:04,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 179 transitions, 695 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 11:19:04,739 INFO L231 Difference]: Finished difference. Result has 156 places, 168 transitions, 628 flow [2025-03-17 11:19:04,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=156, PETRI_TRANSITIONS=168} [2025-03-17 11:19:04,739 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 11 predicate places. [2025-03-17 11:19:04,739 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 168 transitions, 628 flow [2025-03-17 11:19:04,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:19:04,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:19:04,740 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-17 11:19:04,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 11:19:04,740 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:19:04,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:19:04,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1111319997, now seen corresponding path program 1 times [2025-03-17 11:19:04,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:19:04,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104492381] [2025-03-17 11:19:04,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:19:04,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:19:04,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 11:19:04,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 11:19:04,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:19:04,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:19:04,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:19:04,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:19:04,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104492381] [2025-03-17 11:19:04,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104492381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:19:04,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:19:04,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:19:04,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565657008] [2025-03-17 11:19:04,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:19:04,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:19:04,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:19:04,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:19:04,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:19:04,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 141 [2025-03-17 11:19:04,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 168 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:19:04,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:19:04,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 141 [2025-03-17 11:19:04,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:19:05,365 INFO L124 PetriNetUnfolderBase]: 660/6291 cut-off events. [2025-03-17 11:19:05,365 INFO L125 PetriNetUnfolderBase]: For 3341/3863 co-relation queries the response was YES. [2025-03-17 11:19:05,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10688 conditions, 6291 events. 660/6291 cut-off events. For 3341/3863 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 72080 event pairs, 237 based on Foata normal form. 177/6091 useless extension candidates. Maximal degree in co-relation 8380. Up to 678 conditions per place. [2025-03-17 11:19:05,394 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 16 selfloop transitions, 8 changer transitions 0/158 dead transitions. [2025-03-17 11:19:05,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 158 transitions, 561 flow [2025-03-17 11:19:05,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:19:05,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:19:05,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2025-03-17 11:19:05,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9385342789598109 [2025-03-17 11:19:05,395 INFO L175 Difference]: Start difference. First operand has 156 places, 168 transitions, 628 flow. Second operand 3 states and 397 transitions. [2025-03-17 11:19:05,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 158 transitions, 561 flow [2025-03-17 11:19:05,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 158 transitions, 547 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-17 11:19:05,401 INFO L231 Difference]: Finished difference. Result has 156 places, 151 transitions, 468 flow [2025-03-17 11:19:05,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=156, PETRI_TRANSITIONS=151} [2025-03-17 11:19:05,402 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 11 predicate places. [2025-03-17 11:19:05,402 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 151 transitions, 468 flow [2025-03-17 11:19:05,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:19:05,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:19:05,403 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-17 11:19:05,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 11:19:05,403 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:19:05,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:19:05,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1329099355, now seen corresponding path program 1 times [2025-03-17 11:19:05,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:19:05,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705877282] [2025-03-17 11:19:05,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:19:05,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:19:05,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 11:19:05,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 11:19:05,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:19:05,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:19:05,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:19:05,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:19:05,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705877282] [2025-03-17 11:19:05,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705877282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:19:05,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:19:05,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:19:05,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697483958] [2025-03-17 11:19:05,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:19:05,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:19:05,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:19:05,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:19:05,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:19:05,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 141 [2025-03-17 11:19:05,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 151 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:19:05,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:19:05,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 141 [2025-03-17 11:19:05,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:19:06,039 INFO L124 PetriNetUnfolderBase]: 1120/7887 cut-off events. [2025-03-17 11:19:06,039 INFO L125 PetriNetUnfolderBase]: For 6402/6521 co-relation queries the response was YES. [2025-03-17 11:19:06,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15139 conditions, 7887 events. 1120/7887 cut-off events. For 6402/6521 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 94673 event pairs, 661 based on Foata normal form. 4/7384 useless extension candidates. Maximal degree in co-relation 11930. Up to 2068 conditions per place. [2025-03-17 11:19:06,076 INFO L140 encePairwiseOnDemand]: 136/141 looper letters, 33 selfloop transitions, 5 changer transitions 0/158 dead transitions. [2025-03-17 11:19:06,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 158 transitions, 582 flow [2025-03-17 11:19:06,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:19:06,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:19:06,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2025-03-17 11:19:06,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8936170212765957 [2025-03-17 11:19:06,076 INFO L175 Difference]: Start difference. First operand has 156 places, 151 transitions, 468 flow. Second operand 3 states and 378 transitions. [2025-03-17 11:19:06,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 158 transitions, 582 flow [2025-03-17 11:19:06,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 158 transitions, 574 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:19:06,080 INFO L231 Difference]: Finished difference. Result has 159 places, 154 transitions, 500 flow [2025-03-17 11:19:06,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=159, PETRI_TRANSITIONS=154} [2025-03-17 11:19:06,081 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 14 predicate places. [2025-03-17 11:19:06,081 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 154 transitions, 500 flow [2025-03-17 11:19:06,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:19:06,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:19:06,081 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:19:06,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 11:19:06,081 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:19:06,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:19:06,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1328602808, now seen corresponding path program 1 times [2025-03-17 11:19:06,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:19:06,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740425084] [2025-03-17 11:19:06,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:19:06,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:19:06,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 11:19:06,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 11:19:06,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:19:06,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:19:06,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:19:06,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:19:06,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740425084] [2025-03-17 11:19:06,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740425084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:19:06,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:19:06,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:19:06,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274204235] [2025-03-17 11:19:06,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:19:06,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:19:06,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:19:06,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:19:06,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:19:06,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 141 [2025-03-17 11:19:06,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 154 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:19:06,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:19:06,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 141 [2025-03-17 11:19:06,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:19:07,046 INFO L124 PetriNetUnfolderBase]: 1121/7928 cut-off events. [2025-03-17 11:19:07,047 INFO L125 PetriNetUnfolderBase]: For 8520/8672 co-relation queries the response was YES. [2025-03-17 11:19:07,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15851 conditions, 7928 events. 1121/7928 cut-off events. For 8520/8672 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 95295 event pairs, 707 based on Foata normal form. 4/7482 useless extension candidates. Maximal degree in co-relation 12732. Up to 2095 conditions per place. [2025-03-17 11:19:07,091 INFO L140 encePairwiseOnDemand]: 136/141 looper letters, 33 selfloop transitions, 5 changer transitions 0/160 dead transitions. [2025-03-17 11:19:07,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 160 transitions, 605 flow [2025-03-17 11:19:07,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:19:07,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:19:07,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2025-03-17 11:19:07,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8912529550827423 [2025-03-17 11:19:07,092 INFO L175 Difference]: Start difference. First operand has 159 places, 154 transitions, 500 flow. Second operand 3 states and 377 transitions. [2025-03-17 11:19:07,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 160 transitions, 605 flow [2025-03-17 11:19:07,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 160 transitions, 591 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-17 11:19:07,102 INFO L231 Difference]: Finished difference. Result has 161 places, 157 transitions, 528 flow [2025-03-17 11:19:07,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=528, PETRI_PLACES=161, PETRI_TRANSITIONS=157} [2025-03-17 11:19:07,102 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 16 predicate places. [2025-03-17 11:19:07,102 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 157 transitions, 528 flow [2025-03-17 11:19:07,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:19:07,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:19:07,102 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-17 11:19:07,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 11:19:07,103 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:19:07,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:19:07,103 INFO L85 PathProgramCache]: Analyzing trace with hash 2037546147, now seen corresponding path program 1 times [2025-03-17 11:19:07,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:19:07,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011707241] [2025-03-17 11:19:07,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:19:07,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:19:07,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 11:19:07,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 11:19:07,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:19:07,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:19:07,124 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:19:07,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 11:19:07,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 11:19:07,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:19:07,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:19:07,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:19:07,154 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:19:07,154 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2025-03-17 11:19:07,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-17 11:19:07,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-17 11:19:07,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-17 11:19:07,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2025-03-17 11:19:07,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-03-17 11:19:07,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-03-17 11:19:07,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-17 11:19:07,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-17 11:19:07,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 11:19:07,155 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:19:07,228 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances [2025-03-17 11:19:07,228 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:19:07,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:19:07 BasicIcfg [2025-03-17 11:19:07,238 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:19:07,238 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:19:07,238 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:19:07,238 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:19:07,239 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:18:30" (3/4) ... [2025-03-17 11:19:07,240 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-17 11:19:07,317 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-03-17 11:19:07,363 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:19:07,364 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:19:07,364 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:19:07,364 INFO L158 Benchmark]: Toolchain (without parser) took 37916.38ms. Allocated memory was 167.8MB in the beginning and 10.4GB in the end (delta: 10.3GB). Free memory was 127.7MB in the beginning and 7.4GB in the end (delta: -7.3GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. [2025-03-17 11:19:07,365 INFO L158 Benchmark]: CDTParser took 0.89ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:19:07,365 INFO L158 Benchmark]: CACSL2BoogieTranslator took 442.25ms. Allocated memory is still 167.8MB. Free memory was 127.7MB in the beginning and 99.8MB in the end (delta: 27.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:19:07,365 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.64ms. Allocated memory is still 167.8MB. Free memory was 99.8MB in the beginning and 98.1MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:19:07,366 INFO L158 Benchmark]: Boogie Preprocessor took 15.81ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 96.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:19:07,366 INFO L158 Benchmark]: IcfgBuilder took 334.61ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 80.8MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:19:07,366 INFO L158 Benchmark]: TraceAbstraction took 36960.70ms. Allocated memory was 167.8MB in the beginning and 10.4GB in the end (delta: 10.3GB). Free memory was 80.4MB in the beginning and 7.4GB in the end (delta: -7.3GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2025-03-17 11:19:07,366 INFO L158 Benchmark]: Witness Printer took 125.57ms. Allocated memory is still 10.4GB. Free memory was 7.4GB in the beginning and 7.4GB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 11:19:07,369 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.89ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 442.25ms. Allocated memory is still 167.8MB. Free memory was 127.7MB in the beginning and 99.8MB in the end (delta: 27.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.64ms. Allocated memory is still 167.8MB. Free memory was 99.8MB in the beginning and 98.1MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.81ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 96.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 334.61ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 80.8MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 36960.70ms. Allocated memory was 167.8MB in the beginning and 10.4GB in the end (delta: 10.3GB). Free memory was 80.4MB in the beginning and 7.4GB in the end (delta: -7.3GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. * Witness Printer took 125.57ms. Allocated memory is still 10.4GB. Free memory was 7.4GB in the beginning and 7.4GB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1023]: Data race detected Data race detected The following path leads to a data race: [L1019] 0 int data = 0; VAL [data=0] [L1020] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={1:0}] [L1028] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, data_mutex={1:0}, threads_total=2] [L1029] CALL 0 assume_abort_if_not(threads_total >= 0) [L1016] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data=0, data_mutex={1:0}] [L1029] RET 0 assume_abort_if_not(threads_total >= 0) [L1030] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [data=0, data_mutex={1:0}, threads_total=2, tids={-2:0}] [L1031] 0 int i = 0; VAL [data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1031] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={1:0}] [L1032] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1032] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1031] 0 i++ VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=2, tids={-2:0}] [L1031] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}] [L1032] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=2, tids={-2:0}] [L1032] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=2, tids={-2:0}] [L1031] 0 i++ VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=2, tids={-2:0}] [L1031] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}] [L1034] 0 int i = 0; VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1023] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L1025] 1 return ((void *)0); VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L1034] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L1035] EXPR 0 tids[i] VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1035] 0 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1035] FCALL, JOIN 1 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1034] 0 i += 2 VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=2, tids={-2:0}] [L1034] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L1023] 2 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L1038] 0 return data; VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_total=2, tids={-2:0}] [L1023] 2 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] Now there is a data race on ~data~0 between C: return data; [1038] and C: data = __VERIFIER_nondet_int() [1023] - UnprovableResult [Line: 1038]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1032]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 103 locations, 105 edges, 6 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.0s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 233 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 371 IncrementalHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 5 mSDtfsCounter, 371 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=4, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 446 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 1/1 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, 120 locations, 123 edges, 7 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.0s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 447 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 299 mSDsluCounter, 131 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 96 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 677 IncrementalHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 35 mSDtfsCounter, 677 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=350occurred in iteration=7, InterpolantAutomatonStates: 33, 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.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 398 NumberOfCodeBlocks, 398 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 320 ConstructedInterpolants, 0 QuantifiedInterpolants, 676 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 4/4 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 3 thread instances CFG has 5 procedures, 137 locations, 141 edges, 8 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: 5.4s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 568 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 361 mSDsluCounter, 189 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 941 IncrementalHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 55 mSDtfsCounter, 941 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=497occurred in iteration=7, InterpolantAutomatonStates: 39, 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.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 566 NumberOfCodeBlocks, 566 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 469 ConstructedInterpolants, 0 QuantifiedInterpolants, 863 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 4 thread instances CFG has 6 procedures, 154 locations, 159 edges, 9 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: 27.5s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 26.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 708 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 449 mSDsluCounter, 152 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 66 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1056 IncrementalHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 86 mSDtfsCounter, 1056 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=628occurred in iteration=7, InterpolantAutomatonStates: 42, 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.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 676 NumberOfCodeBlocks, 676 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 565 ConstructedInterpolants, 0 QuantifiedInterpolants, 961 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 13/13 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-03-17 11:19:07,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)