./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 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/per-thread-index-inc-race.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 dcbcb8208024116480c974e9f1bc8db6725056562df0982447c3fb673ff0c0ec --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:48:48,645 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:48:48,707 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:48:48,713 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:48:48,713 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:48:48,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:48:48,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:48:48,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:48:48,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:48:48,737 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:48:48,738 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:48:48,738 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:48:48,738 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:48:48,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:48:48,739 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:48:48,739 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:48:48,739 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:48:48,739 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:48:48,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:48:48,739 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:48:48,739 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:48:48,739 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:48:48,739 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:48:48,739 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:48:48,739 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:48:48,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:48:48,739 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:48:48,739 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:48:48,740 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:48:48,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:48:48,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:48:48,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:48:48,740 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:48:48,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:48:48,740 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:48:48,740 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:48:48,740 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:48:48,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:48:48,740 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:48:48,740 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:48:48,740 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:48:48,740 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:48:48,740 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 -> dcbcb8208024116480c974e9f1bc8db6725056562df0982447c3fb673ff0c0ec [2025-03-14 01:48:48,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:48:48,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:48:48,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:48:48,996 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:48:48,996 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:48:48,997 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race.i [2025-03-14 01:48:50,232 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9193e61/79ac6ea0d0ff4917bd7cfc67fb971a74/FLAG54df6d9e1 [2025-03-14 01:48:50,588 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:48:50,589 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race.i [2025-03-14 01:48:50,610 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9193e61/79ac6ea0d0ff4917bd7cfc67fb971a74/FLAG54df6d9e1 [2025-03-14 01:48:50,832 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9193e61/79ac6ea0d0ff4917bd7cfc67fb971a74 [2025-03-14 01:48:50,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:48:50,836 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:48:50,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:48:50,842 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:48:50,846 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:48:50,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:48:50" (1/1) ... [2025-03-14 01:48:50,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43866657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:50, skipping insertion in model container [2025-03-14 01:48:50,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:48:50" (1/1) ... [2025-03-14 01:48:50,883 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:48:51,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:48:51,159 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:48:51,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:48:51,249 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:48:51,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:51 WrapperNode [2025-03-14 01:48:51,251 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:48:51,252 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:48:51,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:48:51,252 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:48:51,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:51" (1/1) ... [2025-03-14 01:48:51,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:51" (1/1) ... [2025-03-14 01:48:51,288 INFO L138 Inliner]: procedures = 273, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2025-03-14 01:48:51,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:48:51,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:48:51,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:48:51,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:48:51,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:51" (1/1) ... [2025-03-14 01:48:51,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:51" (1/1) ... [2025-03-14 01:48:51,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:51" (1/1) ... [2025-03-14 01:48:51,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:51" (1/1) ... [2025-03-14 01:48:51,301 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:51" (1/1) ... [2025-03-14 01:48:51,302 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:51" (1/1) ... [2025-03-14 01:48:51,302 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:51" (1/1) ... [2025-03-14 01:48:51,303 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:51" (1/1) ... [2025-03-14 01:48:51,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:48:51,305 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:48:51,305 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:48:51,305 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:48:51,306 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:51" (1/1) ... [2025-03-14 01:48:51,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:48:51,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:48:51,333 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-14 01:48:51,335 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-14 01:48:51,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-14 01:48:51,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:48:51,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:48:51,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:48:51,350 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-14 01:48:51,350 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-14 01:48:51,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:48:51,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:48:51,351 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:48:51,447 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:48:51,449 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:48:51,677 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:48:51,678 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:48:51,679 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:48:51,691 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:48:51,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:48:51 BoogieIcfgContainer [2025-03-14 01:48:51,693 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:48:51,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:48:51,695 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:48:51,699 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:48:51,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:48:50" (1/3) ... [2025-03-14 01:48:51,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1f2862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:48:51, skipping insertion in model container [2025-03-14 01:48:51,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:51" (2/3) ... [2025-03-14 01:48:51,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1f2862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:48:51, skipping insertion in model container [2025-03-14 01:48:51,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:48:51" (3/3) ... [2025-03-14 01:48:51,702 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-index-inc-race.i [2025-03-14 01:48:51,715 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:48:51,717 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-index-inc-race.i that has 2 procedures, 108 locations, 1 initial locations, 2 loop locations, and 9 error locations. [2025-03-14 01:48:51,718 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:48:51,781 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-14 01:48:51,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 110 transitions, 227 flow [2025-03-14 01:48:51,871 INFO L124 PetriNetUnfolderBase]: 2/143 cut-off events. [2025-03-14 01:48:51,873 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:48:51,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 143 events. 2/143 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 254 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 63. Up to 3 conditions per place. [2025-03-14 01:48:51,876 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 110 transitions, 227 flow [2025-03-14 01:48:51,882 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 110 transitions, 227 flow [2025-03-14 01:48:51,890 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:48:51,903 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;@1db86d60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:48:51,904 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-14 01:48:51,911 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:48:51,912 INFO L124 PetriNetUnfolderBase]: 1/26 cut-off events. [2025-03-14 01:48:51,912 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:48:51,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:51,912 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] [2025-03-14 01:48:51,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:48:51,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:51,919 INFO L85 PathProgramCache]: Analyzing trace with hash 434216876, now seen corresponding path program 1 times [2025-03-14 01:48:51,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:51,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790655827] [2025-03-14 01:48:51,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:51,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:51,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-14 01:48:52,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-14 01:48:52,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:52,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:52,101 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-14 01:48:52,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:52,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790655827] [2025-03-14 01:48:52,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790655827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:52,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:52,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:48:52,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251789589] [2025-03-14 01:48:52,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:52,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:48:52,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:52,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:48:52,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:48:52,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 110 [2025-03-14 01:48:52,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 110 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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-14 01:48:52,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:52,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 110 [2025-03-14 01:48:52,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:52,215 INFO L124 PetriNetUnfolderBase]: 3/151 cut-off events. [2025-03-14 01:48:52,215 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-14 01:48:52,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 151 events. 3/151 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 304 event pairs, 2 based on Foata normal form. 1/134 useless extension candidates. Maximal degree in co-relation 90. Up to 15 conditions per place. [2025-03-14 01:48:52,218 INFO L140 encePairwiseOnDemand]: 106/110 looper letters, 8 selfloop transitions, 2 changer transitions 1/108 dead transitions. [2025-03-14 01:48:52,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 108 transitions, 243 flow [2025-03-14 01:48:52,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:48:52,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:48:52,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2025-03-14 01:48:52,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9272727272727272 [2025-03-14 01:48:52,233 INFO L175 Difference]: Start difference. First operand has 111 places, 110 transitions, 227 flow. Second operand 3 states and 306 transitions. [2025-03-14 01:48:52,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 108 transitions, 243 flow [2025-03-14 01:48:52,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 108 transitions, 243 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:48:52,257 INFO L231 Difference]: Finished difference. Result has 112 places, 107 transitions, 225 flow [2025-03-14 01:48:52,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=112, PETRI_TRANSITIONS=107} [2025-03-14 01:48:52,264 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 1 predicate places. [2025-03-14 01:48:52,264 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 107 transitions, 225 flow [2025-03-14 01:48:52,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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-14 01:48:52,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:52,265 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] [2025-03-14 01:48:52,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:48:52,266 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:48:52,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:52,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1216201434, now seen corresponding path program 1 times [2025-03-14 01:48:52,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:52,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467714608] [2025-03-14 01:48:52,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:52,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:52,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:48:52,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:48:52,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:52,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:52,333 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-14 01:48:52,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:52,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467714608] [2025-03-14 01:48:52,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467714608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:52,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:52,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:48:52,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467374213] [2025-03-14 01:48:52,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:52,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:48:52,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:52,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:48:52,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:48:52,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 110 [2025-03-14 01:48:52,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 107 transitions, 225 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-14 01:48:52,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:52,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 110 [2025-03-14 01:48:52,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:52,404 INFO L124 PetriNetUnfolderBase]: 5/190 cut-off events. [2025-03-14 01:48:52,404 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-14 01:48:52,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 190 events. 5/190 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 412 event pairs, 2 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 184. Up to 16 conditions per place. [2025-03-14 01:48:52,405 INFO L140 encePairwiseOnDemand]: 106/110 looper letters, 7 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2025-03-14 01:48:52,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 107 transitions, 243 flow [2025-03-14 01:48:52,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:48:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:48:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2025-03-14 01:48:52,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9424242424242424 [2025-03-14 01:48:52,411 INFO L175 Difference]: Start difference. First operand has 112 places, 107 transitions, 225 flow. Second operand 3 states and 311 transitions. [2025-03-14 01:48:52,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 107 transitions, 243 flow [2025-03-14 01:48:52,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 107 transitions, 239 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:48:52,413 INFO L231 Difference]: Finished difference. Result has 110 places, 107 transitions, 231 flow [2025-03-14 01:48:52,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=231, PETRI_PLACES=110, PETRI_TRANSITIONS=107} [2025-03-14 01:48:52,414 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -1 predicate places. [2025-03-14 01:48:52,414 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 107 transitions, 231 flow [2025-03-14 01:48:52,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-14 01:48:52,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:52,415 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] [2025-03-14 01:48:52,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:48:52,416 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:48:52,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:52,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1384466598, now seen corresponding path program 1 times [2025-03-14 01:48:52,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:52,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269764176] [2025-03-14 01:48:52,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:52,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:52,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-14 01:48:52,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-14 01:48:52,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:52,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:52,960 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-14 01:48:52,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:52,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269764176] [2025-03-14 01:48:52,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269764176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:52,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:52,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:48:52,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343760319] [2025-03-14 01:48:52,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:52,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:48:52,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:52,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:48:52,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:48:53,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 110 [2025-03-14 01:48:53,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 107 transitions, 231 flow. Second operand has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 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-14 01:48:53,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:53,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 110 [2025-03-14 01:48:53,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:53,235 INFO L124 PetriNetUnfolderBase]: 73/418 cut-off events. [2025-03-14 01:48:53,235 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:48:53,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 418 events. 73/418 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1953 event pairs, 35 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 516. Up to 159 conditions per place. [2025-03-14 01:48:53,237 INFO L140 encePairwiseOnDemand]: 99/110 looper letters, 23 selfloop transitions, 22 changer transitions 0/128 dead transitions. [2025-03-14 01:48:53,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 128 transitions, 363 flow [2025-03-14 01:48:53,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:48:53,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:48:53,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 556 transitions. [2025-03-14 01:48:53,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8424242424242424 [2025-03-14 01:48:53,239 INFO L175 Difference]: Start difference. First operand has 110 places, 107 transitions, 231 flow. Second operand 6 states and 556 transitions. [2025-03-14 01:48:53,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 128 transitions, 363 flow [2025-03-14 01:48:53,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 128 transitions, 363 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:48:53,241 INFO L231 Difference]: Finished difference. Result has 120 places, 128 transitions, 381 flow [2025-03-14 01:48:53,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=381, PETRI_PLACES=120, PETRI_TRANSITIONS=128} [2025-03-14 01:48:53,242 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 9 predicate places. [2025-03-14 01:48:53,242 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 128 transitions, 381 flow [2025-03-14 01:48:53,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 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-14 01:48:53,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:53,242 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] [2025-03-14 01:48:53,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:48:53,242 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:48:53,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:53,243 INFO L85 PathProgramCache]: Analyzing trace with hash 156539574, now seen corresponding path program 1 times [2025-03-14 01:48:53,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:53,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698199381] [2025-03-14 01:48:53,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:53,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:53,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-14 01:48:53,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-14 01:48:53,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:53,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:53,321 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-14 01:48:53,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:53,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698199381] [2025-03-14 01:48:53,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698199381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:53,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:53,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:48:53,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227843240] [2025-03-14 01:48:53,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:53,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:48:53,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:53,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:48:53,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:48:53,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2025-03-14 01:48:53,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 128 transitions, 381 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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-14 01:48:53,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:53,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2025-03-14 01:48:53,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:53,446 INFO L124 PetriNetUnfolderBase]: 34/281 cut-off events. [2025-03-14 01:48:53,447 INFO L125 PetriNetUnfolderBase]: For 35/50 co-relation queries the response was YES. [2025-03-14 01:48:53,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 281 events. 34/281 cut-off events. For 35/50 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 926 event pairs, 0 based on Foata normal form. 2/268 useless extension candidates. Maximal degree in co-relation 356. Up to 49 conditions per place. [2025-03-14 01:48:53,450 INFO L140 encePairwiseOnDemand]: 102/110 looper letters, 11 selfloop transitions, 2 changer transitions 5/133 dead transitions. [2025-03-14 01:48:53,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 133 transitions, 427 flow [2025-03-14 01:48:53,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:48:53,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:48:53,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 595 transitions. [2025-03-14 01:48:53,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9015151515151515 [2025-03-14 01:48:53,453 INFO L175 Difference]: Start difference. First operand has 120 places, 128 transitions, 381 flow. Second operand 6 states and 595 transitions. [2025-03-14 01:48:53,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 133 transitions, 427 flow [2025-03-14 01:48:53,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 133 transitions, 427 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:48:53,458 INFO L231 Difference]: Finished difference. Result has 129 places, 128 transitions, 399 flow [2025-03-14 01:48:53,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=399, PETRI_PLACES=129, PETRI_TRANSITIONS=128} [2025-03-14 01:48:53,460 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 18 predicate places. [2025-03-14 01:48:53,460 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 128 transitions, 399 flow [2025-03-14 01:48:53,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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-14 01:48:53,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:53,461 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] [2025-03-14 01:48:53,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:48:53,461 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:48:53,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:53,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1679741688, now seen corresponding path program 1 times [2025-03-14 01:48:53,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:53,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691116606] [2025-03-14 01:48:53,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:53,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:53,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-14 01:48:53,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-14 01:48:53,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:53,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:53,502 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-14 01:48:53,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:53,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691116606] [2025-03-14 01:48:53,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691116606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:53,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:53,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:48:53,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61583393] [2025-03-14 01:48:53,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:53,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:48:53,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:53,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:48:53,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:48:53,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 110 [2025-03-14 01:48:53,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 128 transitions, 399 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-14 01:48:53,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:53,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 110 [2025-03-14 01:48:53,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:53,580 INFO L124 PetriNetUnfolderBase]: 33/267 cut-off events. [2025-03-14 01:48:53,580 INFO L125 PetriNetUnfolderBase]: For 30/39 co-relation queries the response was YES. [2025-03-14 01:48:53,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 267 events. 33/267 cut-off events. For 30/39 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 884 event pairs, 0 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 371. Up to 49 conditions per place. [2025-03-14 01:48:53,582 INFO L140 encePairwiseOnDemand]: 106/110 looper letters, 5 selfloop transitions, 2 changer transitions 0/126 dead transitions. [2025-03-14 01:48:53,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 126 transitions, 409 flow [2025-03-14 01:48:53,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:48:53,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:48:53,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2025-03-14 01:48:53,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9363636363636364 [2025-03-14 01:48:53,586 INFO L175 Difference]: Start difference. First operand has 129 places, 128 transitions, 399 flow. Second operand 3 states and 309 transitions. [2025-03-14 01:48:53,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 126 transitions, 409 flow [2025-03-14 01:48:53,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 126 transitions, 395 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-14 01:48:53,590 INFO L231 Difference]: Finished difference. Result has 121 places, 126 transitions, 385 flow [2025-03-14 01:48:53,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=385, PETRI_PLACES=121, PETRI_TRANSITIONS=126} [2025-03-14 01:48:53,592 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 10 predicate places. [2025-03-14 01:48:53,592 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 126 transitions, 385 flow [2025-03-14 01:48:53,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-14 01:48:53,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:53,593 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] [2025-03-14 01:48:53,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:48:53,593 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:48:53,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:53,595 INFO L85 PathProgramCache]: Analyzing trace with hash 843337165, now seen corresponding path program 1 times [2025-03-14 01:48:53,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:53,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54928746] [2025-03-14 01:48:53,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:53,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:53,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-14 01:48:53,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-14 01:48:53,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:53,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:53,639 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-14 01:48:53,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:53,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54928746] [2025-03-14 01:48:53,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54928746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:53,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:53,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:48:53,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626510862] [2025-03-14 01:48:53,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:53,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:48:53,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:53,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:48:53,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:48:53,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 110 [2025-03-14 01:48:53,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 126 transitions, 385 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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-14 01:48:53,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:53,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 110 [2025-03-14 01:48:53,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:53,764 INFO L124 PetriNetUnfolderBase]: 33/266 cut-off events. [2025-03-14 01:48:53,765 INFO L125 PetriNetUnfolderBase]: For 30/39 co-relation queries the response was YES. [2025-03-14 01:48:53,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 266 events. 33/266 cut-off events. For 30/39 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 881 event pairs, 0 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 370. Up to 49 conditions per place. [2025-03-14 01:48:53,766 INFO L140 encePairwiseOnDemand]: 107/110 looper letters, 6 selfloop transitions, 2 changer transitions 0/125 dead transitions. [2025-03-14 01:48:53,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 125 transitions, 399 flow [2025-03-14 01:48:53,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:48:53,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:48:53,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2025-03-14 01:48:53,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9363636363636364 [2025-03-14 01:48:53,768 INFO L175 Difference]: Start difference. First operand has 121 places, 126 transitions, 385 flow. Second operand 3 states and 309 transitions. [2025-03-14 01:48:53,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 125 transitions, 399 flow [2025-03-14 01:48:53,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 125 transitions, 395 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:48:53,774 INFO L231 Difference]: Finished difference. Result has 120 places, 125 transitions, 383 flow [2025-03-14 01:48:53,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=120, PETRI_TRANSITIONS=125} [2025-03-14 01:48:53,774 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 9 predicate places. [2025-03-14 01:48:53,774 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 125 transitions, 383 flow [2025-03-14 01:48:53,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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-14 01:48:53,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:53,776 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] [2025-03-14 01:48:53,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:48:53,776 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:48:53,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:53,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1299208684, now seen corresponding path program 1 times [2025-03-14 01:48:53,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:53,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403946493] [2025-03-14 01:48:53,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:53,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:53,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-14 01:48:53,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-14 01:48:53,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:53,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:54,059 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-14 01:48:54,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:54,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403946493] [2025-03-14 01:48:54,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403946493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:54,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:54,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:48:54,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350322369] [2025-03-14 01:48:54,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:54,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:48:54,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:54,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:48:54,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:48:54,163 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 110 [2025-03-14 01:48:54,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 125 transitions, 383 flow. Second operand has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 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-14 01:48:54,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:54,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 110 [2025-03-14 01:48:54,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:54,248 INFO L124 PetriNetUnfolderBase]: 81/424 cut-off events. [2025-03-14 01:48:54,248 INFO L125 PetriNetUnfolderBase]: For 87/177 co-relation queries the response was YES. [2025-03-14 01:48:54,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 424 events. 81/424 cut-off events. For 87/177 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2063 event pairs, 15 based on Foata normal form. 16/410 useless extension candidates. Maximal degree in co-relation 774. Up to 173 conditions per place. [2025-03-14 01:48:54,250 INFO L140 encePairwiseOnDemand]: 99/110 looper letters, 38 selfloop transitions, 21 changer transitions 7/147 dead transitions. [2025-03-14 01:48:54,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 147 transitions, 588 flow [2025-03-14 01:48:54,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:48:54,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:48:54,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 567 transitions. [2025-03-14 01:48:54,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8590909090909091 [2025-03-14 01:48:54,254 INFO L175 Difference]: Start difference. First operand has 120 places, 125 transitions, 383 flow. Second operand 6 states and 567 transitions. [2025-03-14 01:48:54,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 147 transitions, 588 flow [2025-03-14 01:48:54,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 147 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:48:54,257 INFO L231 Difference]: Finished difference. Result has 128 places, 140 transitions, 540 flow [2025-03-14 01:48:54,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=540, PETRI_PLACES=128, PETRI_TRANSITIONS=140} [2025-03-14 01:48:54,258 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 17 predicate places. [2025-03-14 01:48:54,259 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 140 transitions, 540 flow [2025-03-14 01:48:54,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 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-14 01:48:54,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:54,259 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] [2025-03-14 01:48:54,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:48:54,260 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:48:54,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:54,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1094212686, now seen corresponding path program 1 times [2025-03-14 01:48:54,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:54,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707805267] [2025-03-14 01:48:54,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:54,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:54,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-14 01:48:54,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-14 01:48:54,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:54,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:48:54,288 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:48:54,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-14 01:48:54,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-14 01:48:54,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:54,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:48:54,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:48:54,321 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:48:54,322 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-03-14 01:48:54,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-03-14 01:48:54,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-03-14 01:48:54,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-03-14 01:48:54,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-03-14 01:48:54,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-03-14 01:48:54,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2025-03-14 01:48:54,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-03-14 01:48:54,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-03-14 01:48:54,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-03-14 01:48:54,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-03-14 01:48:54,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-03-14 01:48:54,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-03-14 01:48:54,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-03-14 01:48:54,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-03-14 01:48:54,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:48:54,327 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:48:54,329 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:48:54,331 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 01:48:54,375 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:48:54,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 146 transitions, 308 flow [2025-03-14 01:48:54,404 INFO L124 PetriNetUnfolderBase]: 4/247 cut-off events. [2025-03-14 01:48:54,404 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-03-14 01:48:54,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 247 events. 4/247 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 589 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 145. Up to 6 conditions per place. [2025-03-14 01:48:54,405 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 146 transitions, 308 flow [2025-03-14 01:48:54,407 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 146 transitions, 308 flow [2025-03-14 01:48:54,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:48:54,408 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;@1db86d60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:48:54,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-14 01:48:54,410 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:48:54,411 INFO L124 PetriNetUnfolderBase]: 1/26 cut-off events. [2025-03-14 01:48:54,411 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:48:54,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:54,411 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] [2025-03-14 01:48:54,411 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-14 01:48:54,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:54,411 INFO L85 PathProgramCache]: Analyzing trace with hash -512271700, now seen corresponding path program 1 times [2025-03-14 01:48:54,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:54,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926942454] [2025-03-14 01:48:54,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:54,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:54,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-14 01:48:54,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-14 01:48:54,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:54,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:54,434 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-14 01:48:54,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:54,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926942454] [2025-03-14 01:48:54,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926942454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:54,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:54,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:48:54,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143027661] [2025-03-14 01:48:54,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:54,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:48:54,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:54,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:48:54,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:48:54,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 146 [2025-03-14 01:48:54,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 146 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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-14 01:48:54,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:54,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 146 [2025-03-14 01:48:54,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:54,496 INFO L124 PetriNetUnfolderBase]: 19/420 cut-off events. [2025-03-14 01:48:54,496 INFO L125 PetriNetUnfolderBase]: For 28/30 co-relation queries the response was YES. [2025-03-14 01:48:54,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 420 events. 19/420 cut-off events. For 28/30 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1727 event pairs, 16 based on Foata normal form. 1/370 useless extension candidates. Maximal degree in co-relation 291. Up to 50 conditions per place. [2025-03-14 01:48:54,499 INFO L140 encePairwiseOnDemand]: 142/146 looper letters, 11 selfloop transitions, 2 changer transitions 1/144 dead transitions. [2025-03-14 01:48:54,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 144 transitions, 330 flow [2025-03-14 01:48:54,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:48:54,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:48:54,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2025-03-14 01:48:54,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9315068493150684 [2025-03-14 01:48:54,501 INFO L175 Difference]: Start difference. First operand has 148 places, 146 transitions, 308 flow. Second operand 3 states and 408 transitions. [2025-03-14 01:48:54,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 144 transitions, 330 flow [2025-03-14 01:48:54,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 144 transitions, 330 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:48:54,507 INFO L231 Difference]: Finished difference. Result has 149 places, 143 transitions, 306 flow [2025-03-14 01:48:54,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=304, 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=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=149, PETRI_TRANSITIONS=143} [2025-03-14 01:48:54,508 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 1 predicate places. [2025-03-14 01:48:54,508 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 143 transitions, 306 flow [2025-03-14 01:48:54,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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-14 01:48:54,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:54,508 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] [2025-03-14 01:48:54,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:48:54,508 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-14 01:48:54,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:54,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1545065772, now seen corresponding path program 1 times [2025-03-14 01:48:54,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:54,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462826320] [2025-03-14 01:48:54,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:54,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:54,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:48:54,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:48:54,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:54,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:54,534 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-14 01:48:54,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:54,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462826320] [2025-03-14 01:48:54,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462826320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:54,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:54,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:48:54,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478206874] [2025-03-14 01:48:54,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:54,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:48:54,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:54,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:48:54,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:48:54,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 146 [2025-03-14 01:48:54,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 143 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 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-14 01:48:54,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:54,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 146 [2025-03-14 01:48:54,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:54,602 INFO L124 PetriNetUnfolderBase]: 48/667 cut-off events. [2025-03-14 01:48:54,602 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-14 01:48:54,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 667 events. 48/667 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3466 event pairs, 27 based on Foata normal form. 0/612 useless extension candidates. Maximal degree in co-relation 760. Up to 97 conditions per place. [2025-03-14 01:48:54,606 INFO L140 encePairwiseOnDemand]: 140/146 looper letters, 12 selfloop transitions, 3 changer transitions 0/144 dead transitions. [2025-03-14 01:48:54,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 144 transitions, 343 flow [2025-03-14 01:48:54,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:48:54,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:48:54,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2025-03-14 01:48:54,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9383561643835616 [2025-03-14 01:48:54,608 INFO L175 Difference]: Start difference. First operand has 149 places, 143 transitions, 306 flow. Second operand 3 states and 411 transitions. [2025-03-14 01:48:54,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 144 transitions, 343 flow [2025-03-14 01:48:54,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 144 transitions, 339 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:48:54,610 INFO L231 Difference]: Finished difference. Result has 146 places, 143 transitions, 317 flow [2025-03-14 01:48:54,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=317, PETRI_PLACES=146, PETRI_TRANSITIONS=143} [2025-03-14 01:48:54,612 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, -2 predicate places. [2025-03-14 01:48:54,612 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 143 transitions, 317 flow [2025-03-14 01:48:54,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 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-14 01:48:54,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:54,612 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] [2025-03-14 01:48:54,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:48:54,613 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-14 01:48:54,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:54,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1121554284, now seen corresponding path program 1 times [2025-03-14 01:48:54,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:54,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262500604] [2025-03-14 01:48:54,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:54,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:54,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-14 01:48:54,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-14 01:48:54,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:54,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:54,854 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-14 01:48:54,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:54,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262500604] [2025-03-14 01:48:54,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262500604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:54,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:54,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:48:54,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382835900] [2025-03-14 01:48:54,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:54,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:48:54,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:54,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:48:54,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:48:54,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 146 [2025-03-14 01:48:54,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 143 transitions, 317 flow. Second operand has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:54,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:54,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 146 [2025-03-14 01:48:54,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:55,369 INFO L124 PetriNetUnfolderBase]: 1071/3192 cut-off events. [2025-03-14 01:48:55,370 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-14 01:48:55,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5138 conditions, 3192 events. 1071/3192 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 25122 event pairs, 585 based on Foata normal form. 0/2802 useless extension candidates. Maximal degree in co-relation 3852. Up to 1646 conditions per place. [2025-03-14 01:48:55,385 INFO L140 encePairwiseOnDemand]: 131/146 looper letters, 30 selfloop transitions, 38 changer transitions 0/181 dead transitions. [2025-03-14 01:48:55,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 181 transitions, 534 flow [2025-03-14 01:48:55,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:48:55,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:48:55,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 759 transitions. [2025-03-14 01:48:55,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8664383561643836 [2025-03-14 01:48:55,391 INFO L175 Difference]: Start difference. First operand has 146 places, 143 transitions, 317 flow. Second operand 6 states and 759 transitions. [2025-03-14 01:48:55,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 181 transitions, 534 flow [2025-03-14 01:48:55,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 181 transitions, 534 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:48:55,397 INFO L231 Difference]: Finished difference. Result has 156 places, 180 transitions, 571 flow [2025-03-14 01:48:55,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=571, PETRI_PLACES=156, PETRI_TRANSITIONS=180} [2025-03-14 01:48:55,397 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 8 predicate places. [2025-03-14 01:48:55,397 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 180 transitions, 571 flow [2025-03-14 01:48:55,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:55,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:55,398 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] [2025-03-14 01:48:55,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:48:55,398 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-14 01:48:55,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:55,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1632406840, now seen corresponding path program 1 times [2025-03-14 01:48:55,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:55,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116047088] [2025-03-14 01:48:55,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:55,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:55,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-14 01:48:55,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-14 01:48:55,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:55,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:55,472 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-14 01:48:55,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:55,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116047088] [2025-03-14 01:48:55,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116047088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:55,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:55,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:48:55,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357435345] [2025-03-14 01:48:55,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:55,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:48:55,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:55,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:48:55,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:48:55,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 146 [2025-03-14 01:48:55,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 180 transitions, 571 flow. Second operand has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 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-14 01:48:55,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:55,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 146 [2025-03-14 01:48:55,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:55,736 INFO L124 PetriNetUnfolderBase]: 462/1818 cut-off events. [2025-03-14 01:48:55,736 INFO L125 PetriNetUnfolderBase]: For 374/622 co-relation queries the response was YES. [2025-03-14 01:48:55,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3310 conditions, 1818 events. 462/1818 cut-off events. For 374/622 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 12954 event pairs, 130 based on Foata normal form. 2/1658 useless extension candidates. Maximal degree in co-relation 2369. Up to 644 conditions per place. [2025-03-14 01:48:55,750 INFO L140 encePairwiseOnDemand]: 138/146 looper letters, 14 selfloop transitions, 2 changer transitions 5/186 dead transitions. [2025-03-14 01:48:55,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 186 transitions, 625 flow [2025-03-14 01:48:55,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:48:55,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:48:55,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 802 transitions. [2025-03-14 01:48:55,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9155251141552512 [2025-03-14 01:48:55,753 INFO L175 Difference]: Start difference. First operand has 156 places, 180 transitions, 571 flow. Second operand 6 states and 802 transitions. [2025-03-14 01:48:55,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 186 transitions, 625 flow [2025-03-14 01:48:55,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 186 transitions, 625 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:48:55,758 INFO L231 Difference]: Finished difference. Result has 165 places, 181 transitions, 593 flow [2025-03-14 01:48:55,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=593, PETRI_PLACES=165, PETRI_TRANSITIONS=181} [2025-03-14 01:48:55,759 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 17 predicate places. [2025-03-14 01:48:55,759 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 181 transitions, 593 flow [2025-03-14 01:48:55,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 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-14 01:48:55,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:55,760 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] [2025-03-14 01:48:55,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:48:55,760 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-14 01:48:55,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:55,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1894624106, now seen corresponding path program 1 times [2025-03-14 01:48:55,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:55,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417861584] [2025-03-14 01:48:55,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:55,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:55,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-14 01:48:55,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-14 01:48:55,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:55,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:55,785 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-14 01:48:55,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:55,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417861584] [2025-03-14 01:48:55,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417861584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:55,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:55,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:48:55,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657118340] [2025-03-14 01:48:55,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:55,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:48:55,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:55,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:48:55,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:48:55,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 146 [2025-03-14 01:48:55,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 181 transitions, 593 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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-14 01:48:55,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:55,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 146 [2025-03-14 01:48:55,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:56,147 INFO L124 PetriNetUnfolderBase]: 698/3512 cut-off events. [2025-03-14 01:48:56,147 INFO L125 PetriNetUnfolderBase]: For 642/761 co-relation queries the response was YES. [2025-03-14 01:48:56,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6302 conditions, 3512 events. 698/3512 cut-off events. For 642/761 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 33052 event pairs, 148 based on Foata normal form. 0/3270 useless extension candidates. Maximal degree in co-relation 6210. Up to 1042 conditions per place. [2025-03-14 01:48:56,175 INFO L140 encePairwiseOnDemand]: 132/146 looper letters, 21 selfloop transitions, 10 changer transitions 0/194 dead transitions. [2025-03-14 01:48:56,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 194 transitions, 692 flow [2025-03-14 01:48:56,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:48:56,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:48:56,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2025-03-14 01:48:56,177 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9497716894977168 [2025-03-14 01:48:56,177 INFO L175 Difference]: Start difference. First operand has 165 places, 181 transitions, 593 flow. Second operand 3 states and 416 transitions. [2025-03-14 01:48:56,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 194 transitions, 692 flow [2025-03-14 01:48:56,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 194 transitions, 680 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-14 01:48:56,189 INFO L231 Difference]: Finished difference. Result has 162 places, 191 transitions, 669 flow [2025-03-14 01:48:56,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=669, PETRI_PLACES=162, PETRI_TRANSITIONS=191} [2025-03-14 01:48:56,190 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 14 predicate places. [2025-03-14 01:48:56,190 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 191 transitions, 669 flow [2025-03-14 01:48:56,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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-14 01:48:56,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:56,190 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] [2025-03-14 01:48:56,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:48:56,190 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-14 01:48:56,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:56,191 INFO L85 PathProgramCache]: Analyzing trace with hash 391131951, now seen corresponding path program 1 times [2025-03-14 01:48:56,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:56,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707864279] [2025-03-14 01:48:56,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:56,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:56,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-14 01:48:56,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-14 01:48:56,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:56,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:56,232 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-14 01:48:56,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:56,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707864279] [2025-03-14 01:48:56,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707864279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:56,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:56,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:48:56,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679731426] [2025-03-14 01:48:56,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:56,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:48:56,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:56,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:48:56,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:48:56,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 146 [2025-03-14 01:48:56,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 191 transitions, 669 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 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-14 01:48:56,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:56,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 146 [2025-03-14 01:48:56,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:56,631 INFO L124 PetriNetUnfolderBase]: 789/4053 cut-off events. [2025-03-14 01:48:56,632 INFO L125 PetriNetUnfolderBase]: For 875/1033 co-relation queries the response was YES. [2025-03-14 01:48:56,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7340 conditions, 4053 events. 789/4053 cut-off events. For 875/1033 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 40089 event pairs, 164 based on Foata normal form. 5/3762 useless extension candidates. Maximal degree in co-relation 6365. Up to 1186 conditions per place. [2025-03-14 01:48:56,666 INFO L140 encePairwiseOnDemand]: 139/146 looper letters, 20 selfloop transitions, 9 changer transitions 0/200 dead transitions. [2025-03-14 01:48:56,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 200 transitions, 769 flow [2025-03-14 01:48:56,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:48:56,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:48:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2025-03-14 01:48:56,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9474885844748858 [2025-03-14 01:48:56,668 INFO L175 Difference]: Start difference. First operand has 162 places, 191 transitions, 669 flow. Second operand 3 states and 415 transitions. [2025-03-14 01:48:56,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 200 transitions, 769 flow [2025-03-14 01:48:56,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 200 transitions, 743 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:48:56,677 INFO L231 Difference]: Finished difference. Result has 164 places, 198 transitions, 725 flow [2025-03-14 01:48:56,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=725, PETRI_PLACES=164, PETRI_TRANSITIONS=198} [2025-03-14 01:48:56,678 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 16 predicate places. [2025-03-14 01:48:56,678 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 198 transitions, 725 flow [2025-03-14 01:48:56,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 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-14 01:48:56,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:56,679 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] [2025-03-14 01:48:56,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:48:56,679 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-14 01:48:56,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:56,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1437291214, now seen corresponding path program 1 times [2025-03-14 01:48:56,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:56,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282446926] [2025-03-14 01:48:56,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:56,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:56,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-14 01:48:56,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-14 01:48:56,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:56,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:57,004 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-14 01:48:57,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:57,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282446926] [2025-03-14 01:48:57,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282446926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:57,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:57,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:48:57,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830576076] [2025-03-14 01:48:57,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:57,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:48:57,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:57,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:48:57,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:48:57,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 146 [2025-03-14 01:48:57,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 198 transitions, 725 flow. Second operand has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 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-14 01:48:57,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:57,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 146 [2025-03-14 01:48:57,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:58,083 INFO L124 PetriNetUnfolderBase]: 2223/7591 cut-off events. [2025-03-14 01:48:58,084 INFO L125 PetriNetUnfolderBase]: For 2347/7454 co-relation queries the response was YES. [2025-03-14 01:48:58,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16479 conditions, 7591 events. 2223/7591 cut-off events. For 2347/7454 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 77826 event pairs, 601 based on Foata normal form. 241/7173 useless extension candidates. Maximal degree in co-relation 14300. Up to 3696 conditions per place. [2025-03-14 01:48:58,136 INFO L140 encePairwiseOnDemand]: 131/146 looper letters, 64 selfloop transitions, 38 changer transitions 0/237 dead transitions. [2025-03-14 01:48:58,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 237 transitions, 1077 flow [2025-03-14 01:48:58,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:48:58,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:48:58,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 770 transitions. [2025-03-14 01:48:58,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8789954337899544 [2025-03-14 01:48:58,138 INFO L175 Difference]: Start difference. First operand has 164 places, 198 transitions, 725 flow. Second operand 6 states and 770 transitions. [2025-03-14 01:48:58,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 237 transitions, 1077 flow [2025-03-14 01:48:58,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 237 transitions, 1059 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:48:58,150 INFO L231 Difference]: Finished difference. Result has 172 places, 235 transitions, 1025 flow [2025-03-14 01:48:58,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1025, PETRI_PLACES=172, PETRI_TRANSITIONS=235} [2025-03-14 01:48:58,151 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 24 predicate places. [2025-03-14 01:48:58,151 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 235 transitions, 1025 flow [2025-03-14 01:48:58,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 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-14 01:48:58,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:58,152 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:48:58,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:48:58,152 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-14 01:48:58,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:58,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1970147414, now seen corresponding path program 1 times [2025-03-14 01:48:58,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:58,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224136622] [2025-03-14 01:48:58,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:58,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:58,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-14 01:48:58,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-14 01:48:58,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:58,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:58,373 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-14 01:48:58,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:58,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224136622] [2025-03-14 01:48:58,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224136622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:58,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:58,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:48:58,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281784086] [2025-03-14 01:48:58,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:58,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:48:58,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:58,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:48:58,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:48:58,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 146 [2025-03-14 01:48:58,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 235 transitions, 1025 flow. Second operand has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 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-14 01:48:58,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:58,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 146 [2025-03-14 01:48:58,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:59,952 INFO L124 PetriNetUnfolderBase]: 5000/15367 cut-off events. [2025-03-14 01:48:59,952 INFO L125 PetriNetUnfolderBase]: For 8810/10301 co-relation queries the response was YES. [2025-03-14 01:49:00,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39450 conditions, 15367 events. 5000/15367 cut-off events. For 8810/10301 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 163379 event pairs, 781 based on Foata normal form. 8/14296 useless extension candidates. Maximal degree in co-relation 35421. Up to 6564 conditions per place. [2025-03-14 01:49:00,165 INFO L140 encePairwiseOnDemand]: 127/146 looper letters, 127 selfloop transitions, 118 changer transitions 0/382 dead transitions. [2025-03-14 01:49:00,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 382 transitions, 2373 flow [2025-03-14 01:49:00,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:49:00,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:49:00,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 804 transitions. [2025-03-14 01:49:00,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9178082191780822 [2025-03-14 01:49:00,171 INFO L175 Difference]: Start difference. First operand has 172 places, 235 transitions, 1025 flow. Second operand 6 states and 804 transitions. [2025-03-14 01:49:00,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 382 transitions, 2373 flow [2025-03-14 01:49:00,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 382 transitions, 2241 flow, removed 66 selfloop flow, removed 0 redundant places. [2025-03-14 01:49:00,261 INFO L231 Difference]: Finished difference. Result has 181 places, 347 transitions, 2091 flow [2025-03-14 01:49:00,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2091, PETRI_PLACES=181, PETRI_TRANSITIONS=347} [2025-03-14 01:49:00,262 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 33 predicate places. [2025-03-14 01:49:00,262 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 347 transitions, 2091 flow [2025-03-14 01:49:00,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 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-14 01:49:00,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:00,263 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] [2025-03-14 01:49:00,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:49:00,263 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-14 01:49:00,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:00,263 INFO L85 PathProgramCache]: Analyzing trace with hash -250004246, now seen corresponding path program 1 times [2025-03-14 01:49:00,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:00,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641847068] [2025-03-14 01:49:00,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:00,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:00,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-14 01:49:00,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-14 01:49:00,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:00,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:00,341 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-14 01:49:00,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:00,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641847068] [2025-03-14 01:49:00,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641847068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:00,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:00,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:49:00,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315950760] [2025-03-14 01:49:00,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:00,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:49:00,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:00,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:49:00,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:49:00,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 146 [2025-03-14 01:49:00,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 347 transitions, 2091 flow. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 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-14 01:49:00,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:00,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 146 [2025-03-14 01:49:00,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:01,498 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] threadEXIT-->L1061: Formula: (= v_threadThread1of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem15#1_8|) InVars {threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_8|} OutVars{threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_8|} AuxVars[] AssignedVars[][258], [201#true, Black: 194#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 193#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 190#true, Black: 192#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 205#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 158#true, Black: 206#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 211#true, Black: 203#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 204#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 124#L1061true, 156#(= |#race~datas~0| 0), 45#L1048-3true, Black: 154#true, Black: 161#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), Black: 162#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), Black: 160#(= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 163#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet12#1|) (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), 149#true, 146#true, Black: 171#(= |ULTIMATE.start_main_~i~0#1| 0), 195#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 180#true, Black: 187#(= |threadThread1of2ForFork0_#t~nondet4| |#race~next_j~0|)]) [2025-03-14 01:49:01,498 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-03-14 01:49:01,498 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-14 01:49:01,498 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-14 01:49:01,498 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-14 01:49:01,550 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] threadEXIT-->L1061: Formula: (= v_threadThread1of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem15#1_8|) InVars {threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_8|} OutVars{threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_8|} AuxVars[] AssignedVars[][298], [201#true, Black: 194#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 193#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 190#true, Black: 192#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), 213#(= |threadThread2of2ForFork0_#t~nondet4| |#race~next_j~0|), 95#L1048-2true, Black: 205#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 158#true, Black: 206#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 203#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 204#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 124#L1061true, 156#(= |#race~datas~0| 0), Black: 154#true, Black: 161#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), Black: 162#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), Black: 160#(= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 163#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet12#1|) (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), 149#true, Black: 171#(= |ULTIMATE.start_main_~i~0#1| 0), 146#true, 195#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 182#(= |#race~next_j~0| 0), Black: 187#(= |threadThread1of2ForFork0_#t~nondet4| |#race~next_j~0|)]) [2025-03-14 01:49:01,550 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-03-14 01:49:01,550 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-14 01:49:01,550 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-14 01:49:01,550 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-14 01:49:02,009 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([273] L1061-6-->L1061-5: Formula: (= (store |v_#race_10| |v_ULTIMATE.start_main_~tids~0#1.base_8| (store (select |v_#race_10| |v_ULTIMATE.start_main_~tids~0#1.base_8|) (+ (* |v_ULTIMATE.start_main_~i~1#1_10| 4) |v_ULTIMATE.start_main_~tids~0#1.offset_8|) 0)) |v_#race_9|) InVars {#race=|v_#race_10|, ULTIMATE.start_main_~tids~0#1.offset=|v_ULTIMATE.start_main_~tids~0#1.offset_8|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_10|, ULTIMATE.start_main_~tids~0#1.base=|v_ULTIMATE.start_main_~tids~0#1.base_8|} OutVars{#race=|v_#race_9|, ULTIMATE.start_main_~tids~0#1.offset=|v_ULTIMATE.start_main_~tids~0#1.offset_8|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_10|, ULTIMATE.start_main_~tids~0#1.base=|v_ULTIMATE.start_main_~tids~0#1.base_8|} AuxVars[] AssignedVars[#race][121], [201#true, Black: 194#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 193#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 195#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 190#true, 192#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 205#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 158#true, Black: 206#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 211#true, Black: 203#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 204#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 147#true, 156#(= |#race~datas~0| 0), 67#L1049-2true, Black: 154#true, Black: 161#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), Black: 162#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), Black: 160#(= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 163#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet12#1|) (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), 148#true, Black: 171#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 182#(= |#race~next_j~0| 0), 64#L1061-5true, Black: 187#(= |threadThread1of2ForFork0_#t~nondet4| |#race~next_j~0|)]) [2025-03-14 01:49:02,009 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2025-03-14 01:49:02,009 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2025-03-14 01:49:02,009 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-03-14 01:49:02,009 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2025-03-14 01:49:02,031 INFO L124 PetriNetUnfolderBase]: 3984/13367 cut-off events. [2025-03-14 01:49:02,031 INFO L125 PetriNetUnfolderBase]: For 10451/12276 co-relation queries the response was YES. [2025-03-14 01:49:02,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37043 conditions, 13367 events. 3984/13367 cut-off events. For 10451/12276 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 146970 event pairs, 314 based on Foata normal form. 9/12769 useless extension candidates. Maximal degree in co-relation 33094. Up to 3191 conditions per place. [2025-03-14 01:49:02,157 INFO L140 encePairwiseOnDemand]: 139/146 looper letters, 22 selfloop transitions, 11 changer transitions 0/355 dead transitions. [2025-03-14 01:49:02,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 355 transitions, 2190 flow [2025-03-14 01:49:02,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:49:02,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:49:02,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2025-03-14 01:49:02,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9452054794520548 [2025-03-14 01:49:02,158 INFO L175 Difference]: Start difference. First operand has 181 places, 347 transitions, 2091 flow. Second operand 3 states and 414 transitions. [2025-03-14 01:49:02,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 355 transitions, 2190 flow [2025-03-14 01:49:02,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 355 transitions, 2154 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-03-14 01:49:02,358 INFO L231 Difference]: Finished difference. Result has 185 places, 354 transitions, 2143 flow [2025-03-14 01:49:02,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=2055, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2143, PETRI_PLACES=185, PETRI_TRANSITIONS=354} [2025-03-14 01:49:02,358 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 37 predicate places. [2025-03-14 01:49:02,358 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 354 transitions, 2143 flow [2025-03-14 01:49:02,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 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-14 01:49:02,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:02,359 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] [2025-03-14 01:49:02,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:49:02,359 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-14 01:49:02,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:02,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1148023404, now seen corresponding path program 1 times [2025-03-14 01:49:02,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:02,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330040723] [2025-03-14 01:49:02,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:02,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:02,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-14 01:49:02,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-14 01:49:02,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:02,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:49:02,380 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:49:02,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-14 01:49:02,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-14 01:49:02,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:02,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:49:02,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:49:02,398 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:49:02,399 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr4ASSERT_VIOLATIONDATA_RACE (19 of 20 remaining) [2025-03-14 01:49:02,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2025-03-14 01:49:02,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2025-03-14 01:49:02,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2025-03-14 01:49:02,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2025-03-14 01:49:02,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 20 remaining) [2025-03-14 01:49:02,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2025-03-14 01:49:02,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2025-03-14 01:49:02,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2025-03-14 01:49:02,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2025-03-14 01:49:02,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2025-03-14 01:49:02,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2025-03-14 01:49:02,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2025-03-14 01:49:02,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2025-03-14 01:49:02,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2025-03-14 01:49:02,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2025-03-14 01:49:02,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2025-03-14 01:49:02,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2025-03-14 01:49:02,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2025-03-14 01:49:02,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2025-03-14 01:49:02,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:49:02,400 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:49:02,436 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-03-14 01:49:02,436 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:49:02,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:49:02 BasicIcfg [2025-03-14 01:49:02,442 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:49:02,443 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:49:02,443 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:49:02,443 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:49:02,443 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:48:51" (3/4) ... [2025-03-14 01:49:02,444 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-14 01:49:02,500 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 6. [2025-03-14 01:49:02,536 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:49:02,536 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:49:02,536 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:49:02,537 INFO L158 Benchmark]: Toolchain (without parser) took 11700.88ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 989.9MB). Free memory was 131.1MB in the beginning and 334.1MB in the end (delta: -203.0MB). Peak memory consumption was 784.2MB. Max. memory is 16.1GB. [2025-03-14 01:49:02,537 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 146.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:49:02,537 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.06ms. Allocated memory is still 167.8MB. Free memory was 130.5MB in the beginning and 102.7MB in the end (delta: 27.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-14 01:49:02,537 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.81ms. Allocated memory is still 167.8MB. Free memory was 102.7MB in the beginning and 100.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:49:02,537 INFO L158 Benchmark]: Boogie Preprocessor took 14.87ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 99.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:49:02,538 INFO L158 Benchmark]: IcfgBuilder took 388.47ms. Allocated memory is still 167.8MB. Free memory was 99.4MB in the beginning and 82.2MB in the end (delta: 17.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:49:02,538 INFO L158 Benchmark]: TraceAbstraction took 10747.13ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 989.9MB). Free memory was 81.7MB in the beginning and 350.8MB in the end (delta: -269.2MB). Peak memory consumption was 733.9MB. Max. memory is 16.1GB. [2025-03-14 01:49:02,538 INFO L158 Benchmark]: Witness Printer took 93.57ms. Allocated memory is still 1.2GB. Free memory was 350.8MB in the beginning and 334.1MB in the end (delta: 16.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:49:02,539 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.20ms. Allocated memory is still 226.5MB. Free memory is still 146.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 413.06ms. Allocated memory is still 167.8MB. Free memory was 130.5MB in the beginning and 102.7MB in the end (delta: 27.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.81ms. Allocated memory is still 167.8MB. Free memory was 102.7MB in the beginning and 100.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.87ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 99.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 388.47ms. Allocated memory is still 167.8MB. Free memory was 99.4MB in the beginning and 82.2MB in the end (delta: 17.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10747.13ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 989.9MB). Free memory was 81.7MB in the beginning and 350.8MB in the end (delta: -269.2MB). Peak memory consumption was 733.9MB. Max. memory is 16.1GB. * Witness Printer took 93.57ms. Allocated memory is still 1.2GB. Free memory was 350.8MB in the beginning and 334.1MB in the end (delta: 16.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1047]: Data race detected Data race detected The following path leads to a data race: [L1043] 0 int *datas; VAL [datas={0:0}] [L1044] 0 int next_j = 0; VAL [datas={0:0}, next_j=0] [L1053] 0 int threads_total = __VERIFIER_nondet_int(); VAL [datas={0:0}, next_j=0, threads_total=2] [L1054] CALL 0 assume_abort_if_not(threads_total >= 0) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, next_j=0] [L1054] RET 0 assume_abort_if_not(threads_total >= 0) [L1055] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [datas={0:0}, next_j=0, threads_total=2, tids={-2:0}] [L1056] 0 datas = malloc(threads_total * sizeof(int)) VAL [datas={-3:0}, next_j=0, threads_total=2, tids={-2:0}] [L1057] 0 int i = 0; VAL [datas={-3:0}, i=0, next_j=0, threads_total=2, tids={-2:0}] [L1057] COND TRUE 0 i < threads_total VAL [datas={-3:0}, next_j=0] [L1058] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [datas={-3:0}, i=0, next_j=0, threads_total=2, tids={-2:0}] [L1058] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, datas={-3:0}, i=0, next_j=0, threads_total=2, tids={-2:0}] [L1046] 1 int j; VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, next_j=0] [L1057] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, i=1, next_j=0, threads_total=2, tids={-2:0}] [L1057] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, next_j=0] [L1058] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, i=1, next_j=0, threads_total=2, tids={-2:0}] [L1058] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, i=1, next_j=0, threads_total=2, tids={-2:0}] [L1047] 1 j = next_j VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, next_j=0] [L1046] 2 int j; VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, next_j=0] [L1047] 2 j = next_j VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, j=0, next_j=0] [L1048] 1 next_j++ VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, j=0, next_j=1] [L1047] 2 j = next_j VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, j=0, next_j=1] Now there is a data race on ~next_j~0 between C: next_j++ [1048] and C: j = next_j [1047] - UnprovableResult [Line: 1056]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 144 locations, 15 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.5s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 300 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 175 mSDsluCounter, 88 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 505 IncrementalHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 29 mSDtfsCounter, 505 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=540occurred in iteration=7, InterpolantAutomatonStates: 30, 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, 1.0s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 179 locations, 20 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: 8.0s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 512 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 95 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 964 IncrementalHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 59 mSDtfsCounter, 964 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2143occurred in iteration=9, 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.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 400 ConstructedInterpolants, 0 QuantifiedInterpolants, 767 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 RESULT: Ultimate proved your program to be incorrect! [2025-03-14 01:49:02,553 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)