./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-atomic/lamport-b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-atomic/lamport-b.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9bb446a7af732154870b2839e66288d9133e28dfbbe8fe81423789728796a44c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:09:31,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:09:31,848 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:09:31,856 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:09:31,857 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:09:31,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:09:31,885 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:09:31,886 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:09:31,886 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:09:31,886 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:09:31,886 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:09:31,886 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:09:31,887 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:09:31,887 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:09:31,887 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:09:31,887 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:09:31,887 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:09:31,887 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:09:31,887 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:09:31,887 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:09:31,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:09:31,888 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:09:31,888 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:09:31,888 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:09:31,888 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:09:31,888 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:09:31,888 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:09:31,888 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:09:31,889 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:09:31,889 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:09:31,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:09:31,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:09:31,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:09:31,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:09:31,889 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:09:31,889 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:09:31,889 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:09:31,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:09:31,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:09:31,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:09:31,889 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:09:31,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:09:31,890 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9bb446a7af732154870b2839e66288d9133e28dfbbe8fe81423789728796a44c [2025-02-08 05:09:32,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:09:32,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:09:32,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:09:32,158 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:09:32,159 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:09:32,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/lamport-b.i [2025-02-08 05:09:33,527 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/505ecb1d7/95f4127a4f844d3a8c2699f014be8508/FLAG3984bb76f [2025-02-08 05:09:33,813 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:09:33,814 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-atomic/lamport-b.i [2025-02-08 05:09:33,824 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/505ecb1d7/95f4127a4f844d3a8c2699f014be8508/FLAG3984bb76f [2025-02-08 05:09:33,842 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/505ecb1d7/95f4127a4f844d3a8c2699f014be8508 [2025-02-08 05:09:33,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:09:33,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:09:33,847 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:09:33,847 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:09:33,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:09:33,852 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:09:33" (1/1) ... [2025-02-08 05:09:33,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@603255be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:33, skipping insertion in model container [2025-02-08 05:09:33,853 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:09:33" (1/1) ... [2025-02-08 05:09:33,883 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:09:34,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:09:34,143 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:09:34,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:09:34,230 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:09:34,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:34 WrapperNode [2025-02-08 05:09:34,230 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:09:34,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:09:34,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:09:34,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:09:34,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:34" (1/1) ... [2025-02-08 05:09:34,256 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:34" (1/1) ... [2025-02-08 05:09:34,282 INFO L138 Inliner]: procedures = 160, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 189 [2025-02-08 05:09:34,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:09:34,284 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:09:34,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:09:34,285 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:09:34,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:34" (1/1) ... [2025-02-08 05:09:34,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:34" (1/1) ... [2025-02-08 05:09:34,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:34" (1/1) ... [2025-02-08 05:09:34,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:34" (1/1) ... [2025-02-08 05:09:34,305 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:34" (1/1) ... [2025-02-08 05:09:34,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:34" (1/1) ... [2025-02-08 05:09:34,312 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:34" (1/1) ... [2025-02-08 05:09:34,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:34" (1/1) ... [2025-02-08 05:09:34,314 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:09:34,319 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:09:34,319 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:09:34,319 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:09:34,320 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:34" (1/1) ... [2025-02-08 05:09:34,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:09:34,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:09:34,363 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:09:34,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:09:34,389 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-02-08 05:09:34,389 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-02-08 05:09:34,389 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 05:09:34,389 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 05:09:34,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:09:34,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:09:34,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:09:34,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:09:34,390 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:09:34,523 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:09:34,525 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:09:34,824 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:09:34,825 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:09:34,841 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:09:34,841 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:09:34,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:09:34 BoogieIcfgContainer [2025-02-08 05:09:34,842 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:09:34,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:09:34,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:09:34,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:09:34,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:09:33" (1/3) ... [2025-02-08 05:09:34,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f06f73d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:09:34, skipping insertion in model container [2025-02-08 05:09:34,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:34" (2/3) ... [2025-02-08 05:09:34,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f06f73d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:09:34, skipping insertion in model container [2025-02-08 05:09:34,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:09:34" (3/3) ... [2025-02-08 05:09:34,851 INFO L128 eAbstractionObserver]: Analyzing ICFG lamport-b.i [2025-02-08 05:09:34,862 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:09:34,863 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG lamport-b.i that has 3 procedures, 204 locations, 1 initial locations, 8 loop locations, and 30 error locations. [2025-02-08 05:09:34,863 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:09:34,978 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:09:35,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 225 transitions, 464 flow [2025-02-08 05:09:35,099 INFO L124 PetriNetUnfolderBase]: 22/223 cut-off events. [2025-02-08 05:09:35,102 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:09:35,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 223 events. 22/223 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 715 event pairs, 0 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 200. Up to 4 conditions per place. [2025-02-08 05:09:35,109 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 225 transitions, 464 flow [2025-02-08 05:09:35,114 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 218 transitions, 445 flow [2025-02-08 05:09:35,120 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:09:35,130 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;@13e1fbb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:09:35,131 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2025-02-08 05:09:35,144 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:09:35,144 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-02-08 05:09:35,144 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:09:35,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:35,145 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-02-08 05:09:35,145 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err14ASSERT_VIOLATIONDATA_RACE === [thr2Err14ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err13ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-08 05:09:35,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:35,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1073669354, now seen corresponding path program 1 times [2025-02-08 05:09:35,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:35,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885558331] [2025-02-08 05:09:35,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:35,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:35,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 05:09:35,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 05:09:35,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:35,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:35,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:35,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:35,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885558331] [2025-02-08 05:09:35,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885558331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:35,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:35,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:35,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676428091] [2025-02-08 05:09:35,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:35,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:35,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:35,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:35,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:35,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 225 [2025-02-08 05:09:35,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 218 transitions, 445 flow. Second operand has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:35,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:35,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 225 [2025-02-08 05:09:35,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:35,610 INFO L124 PetriNetUnfolderBase]: 40/477 cut-off events. [2025-02-08 05:09:35,613 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-08 05:09:35,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 477 events. 40/477 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2234 event pairs, 11 based on Foata normal form. 53/414 useless extension candidates. Maximal degree in co-relation 514. Up to 39 conditions per place. [2025-02-08 05:09:35,624 INFO L140 encePairwiseOnDemand]: 208/225 looper letters, 12 selfloop transitions, 4 changer transitions 0/208 dead transitions. [2025-02-08 05:09:35,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 208 transitions, 460 flow [2025-02-08 05:09:35,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:35,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:35,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 635 transitions. [2025-02-08 05:09:35,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9407407407407408 [2025-02-08 05:09:35,644 INFO L175 Difference]: Start difference. First operand has 203 places, 218 transitions, 445 flow. Second operand 3 states and 635 transitions. [2025-02-08 05:09:35,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 208 transitions, 460 flow [2025-02-08 05:09:35,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 208 transitions, 454 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:09:35,655 INFO L231 Difference]: Finished difference. Result has 202 places, 207 transitions, 442 flow [2025-02-08 05:09:35,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=442, PETRI_PLACES=202, PETRI_TRANSITIONS=207} [2025-02-08 05:09:35,662 INFO L279 CegarLoopForPetriNet]: 203 programPoint places, -1 predicate places. [2025-02-08 05:09:35,664 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 207 transitions, 442 flow [2025-02-08 05:09:35,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:35,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:35,665 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] [2025-02-08 05:09:35,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:09:35,666 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err13ASSERT_VIOLATIONDATA_RACE === [thr2Err14ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err13ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-08 05:09:35,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:35,667 INFO L85 PathProgramCache]: Analyzing trace with hash -858006296, now seen corresponding path program 1 times [2025-02-08 05:09:35,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:35,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967744759] [2025-02-08 05:09:35,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:35,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:35,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 05:09:35,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 05:09:35,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:35,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:35,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:35,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:35,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967744759] [2025-02-08 05:09:35,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967744759] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:35,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:35,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:35,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698548541] [2025-02-08 05:09:35,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:35,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:35,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:35,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:35,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:35,782 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 225 [2025-02-08 05:09:35,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 207 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:35,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:35,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 225 [2025-02-08 05:09:35,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:35,930 INFO L124 PetriNetUnfolderBase]: 70/870 cut-off events. [2025-02-08 05:09:35,930 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 05:09:35,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 870 events. 70/870 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5546 event pairs, 13 based on Foata normal form. 0/657 useless extension candidates. Maximal degree in co-relation 724. Up to 46 conditions per place. [2025-02-08 05:09:35,939 INFO L140 encePairwiseOnDemand]: 219/225 looper letters, 11 selfloop transitions, 5 changer transitions 0/212 dead transitions. [2025-02-08 05:09:35,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 212 transitions, 486 flow [2025-02-08 05:09:35,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:35,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:35,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 620 transitions. [2025-02-08 05:09:35,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9185185185185185 [2025-02-08 05:09:35,945 INFO L175 Difference]: Start difference. First operand has 202 places, 207 transitions, 442 flow. Second operand 3 states and 620 transitions. [2025-02-08 05:09:35,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 212 transitions, 486 flow [2025-02-08 05:09:35,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 212 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:09:35,954 INFO L231 Difference]: Finished difference. Result has 204 places, 211 transitions, 472 flow [2025-02-08 05:09:35,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=472, PETRI_PLACES=204, PETRI_TRANSITIONS=211} [2025-02-08 05:09:35,957 INFO L279 CegarLoopForPetriNet]: 203 programPoint places, 1 predicate places. [2025-02-08 05:09:35,957 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 211 transitions, 472 flow [2025-02-08 05:09:35,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:35,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:35,958 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] [2025-02-08 05:09:35,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:09:35,959 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err14ASSERT_VIOLATIONDATA_RACE === [thr2Err14ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err13ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-08 05:09:35,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:35,960 INFO L85 PathProgramCache]: Analyzing trace with hash 837246498, now seen corresponding path program 1 times [2025-02-08 05:09:35,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:35,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880921797] [2025-02-08 05:09:35,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:35,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:35,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:09:35,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:09:35,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:35,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:36,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:36,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:36,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880921797] [2025-02-08 05:09:36,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880921797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:36,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:36,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:36,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787675573] [2025-02-08 05:09:36,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:36,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:36,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:36,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:36,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:36,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 225 [2025-02-08 05:09:36,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 211 transitions, 472 flow. Second operand has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:36,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:36,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 225 [2025-02-08 05:09:36,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:36,221 INFO L124 PetriNetUnfolderBase]: 79/945 cut-off events. [2025-02-08 05:09:36,222 INFO L125 PetriNetUnfolderBase]: For 22/23 co-relation queries the response was YES. [2025-02-08 05:09:36,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 945 events. 79/945 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 6154 event pairs, 15 based on Foata normal form. 0/709 useless extension candidates. Maximal degree in co-relation 949. Up to 58 conditions per place. [2025-02-08 05:09:36,234 INFO L140 encePairwiseOnDemand]: 220/225 looper letters, 12 selfloop transitions, 4 changer transitions 0/215 dead transitions. [2025-02-08 05:09:36,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 215 transitions, 513 flow [2025-02-08 05:09:36,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:36,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:36,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 617 transitions. [2025-02-08 05:09:36,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.914074074074074 [2025-02-08 05:09:36,238 INFO L175 Difference]: Start difference. First operand has 204 places, 211 transitions, 472 flow. Second operand 3 states and 617 transitions. [2025-02-08 05:09:36,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 215 transitions, 513 flow [2025-02-08 05:09:36,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 215 transitions, 503 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:09:36,246 INFO L231 Difference]: Finished difference. Result has 206 places, 214 transitions, 492 flow [2025-02-08 05:09:36,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=206, PETRI_TRANSITIONS=214} [2025-02-08 05:09:36,248 INFO L279 CegarLoopForPetriNet]: 203 programPoint places, 3 predicate places. [2025-02-08 05:09:36,248 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 214 transitions, 492 flow [2025-02-08 05:09:36,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:36,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:36,249 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] [2025-02-08 05:09:36,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:09:36,249 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err12ASSERT_VIOLATIONDATA_RACE === [thr2Err14ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err13ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-08 05:09:36,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:36,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1514650313, now seen corresponding path program 1 times [2025-02-08 05:09:36,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:36,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452224501] [2025-02-08 05:09:36,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:36,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:36,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 05:09:36,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 05:09:36,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:36,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:36,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:36,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:36,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452224501] [2025-02-08 05:09:36,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452224501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:36,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:36,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:36,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374986878] [2025-02-08 05:09:36,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:36,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:36,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:36,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:36,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:36,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 225 [2025-02-08 05:09:36,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 214 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:36,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:36,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 225 [2025-02-08 05:09:36,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:36,709 INFO L124 PetriNetUnfolderBase]: 322/2656 cut-off events. [2025-02-08 05:09:36,710 INFO L125 PetriNetUnfolderBase]: For 32/33 co-relation queries the response was YES. [2025-02-08 05:09:36,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3310 conditions, 2656 events. 322/2656 cut-off events. For 32/33 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 24312 event pairs, 75 based on Foata normal form. 0/2062 useless extension candidates. Maximal degree in co-relation 2093. Up to 338 conditions per place. [2025-02-08 05:09:36,725 INFO L140 encePairwiseOnDemand]: 197/225 looper letters, 33 selfloop transitions, 20 changer transitions 0/236 dead transitions. [2025-02-08 05:09:36,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 236 transitions, 645 flow [2025-02-08 05:09:36,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:36,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:36,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 604 transitions. [2025-02-08 05:09:36,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8948148148148148 [2025-02-08 05:09:36,728 INFO L175 Difference]: Start difference. First operand has 206 places, 214 transitions, 492 flow. Second operand 3 states and 604 transitions. [2025-02-08 05:09:36,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 236 transitions, 645 flow [2025-02-08 05:09:36,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 236 transitions, 637 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:09:36,737 INFO L231 Difference]: Finished difference. Result has 208 places, 234 transitions, 660 flow [2025-02-08 05:09:36,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=660, PETRI_PLACES=208, PETRI_TRANSITIONS=234} [2025-02-08 05:09:36,739 INFO L279 CegarLoopForPetriNet]: 203 programPoint places, 5 predicate places. [2025-02-08 05:09:36,740 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 234 transitions, 660 flow [2025-02-08 05:09:36,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:36,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:36,741 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-02-08 05:09:36,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:09:36,742 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err13ASSERT_VIOLATIONDATA_RACE === [thr2Err14ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err13ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-08 05:09:36,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:36,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1602286063, now seen corresponding path program 1 times [2025-02-08 05:09:36,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:36,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725387726] [2025-02-08 05:09:36,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:36,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:36,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 05:09:36,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 05:09:36,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:36,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:36,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:36,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:36,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725387726] [2025-02-08 05:09:36,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725387726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:36,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:36,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:36,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57269871] [2025-02-08 05:09:36,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:36,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:36,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:36,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:36,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:36,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 225 [2025-02-08 05:09:36,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 234 transitions, 660 flow. Second operand has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:36,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:36,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 225 [2025-02-08 05:09:36,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:37,094 INFO L124 PetriNetUnfolderBase]: 331/2876 cut-off events. [2025-02-08 05:09:37,096 INFO L125 PetriNetUnfolderBase]: For 189/192 co-relation queries the response was YES. [2025-02-08 05:09:37,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3763 conditions, 2876 events. 331/2876 cut-off events. For 189/192 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 26758 event pairs, 76 based on Foata normal form. 0/2247 useless extension candidates. Maximal degree in co-relation 2431. Up to 329 conditions per place. [2025-02-08 05:09:37,117 INFO L140 encePairwiseOnDemand]: 219/225 looper letters, 12 selfloop transitions, 6 changer transitions 0/239 dead transitions. [2025-02-08 05:09:37,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 239 transitions, 709 flow [2025-02-08 05:09:37,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:37,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:37,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 620 transitions. [2025-02-08 05:09:37,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9185185185185185 [2025-02-08 05:09:37,120 INFO L175 Difference]: Start difference. First operand has 208 places, 234 transitions, 660 flow. Second operand 3 states and 620 transitions. [2025-02-08 05:09:37,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 239 transitions, 709 flow [2025-02-08 05:09:37,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 239 transitions, 669 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:09:37,131 INFO L231 Difference]: Finished difference. Result has 210 places, 238 transitions, 664 flow [2025-02-08 05:09:37,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=210, PETRI_TRANSITIONS=238} [2025-02-08 05:09:37,134 INFO L279 CegarLoopForPetriNet]: 203 programPoint places, 7 predicate places. [2025-02-08 05:09:37,134 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 238 transitions, 664 flow [2025-02-08 05:09:37,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:37,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:37,135 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-02-08 05:09:37,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:09:37,135 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err11ASSERT_VIOLATIONDATA_RACE === [thr2Err14ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err13ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-08 05:09:37,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:37,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1759427222, now seen corresponding path program 1 times [2025-02-08 05:09:37,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:37,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749611149] [2025-02-08 05:09:37,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:37,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:37,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 05:09:37,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 05:09:37,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:37,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:37,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:37,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:37,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749611149] [2025-02-08 05:09:37,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749611149] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:37,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:37,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:09:37,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211828615] [2025-02-08 05:09:37,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:37,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:37,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:37,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:37,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:37,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 225 [2025-02-08 05:09:37,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 238 transitions, 664 flow. Second operand has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:37,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:37,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 225 [2025-02-08 05:09:37,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:37,607 INFO L124 PetriNetUnfolderBase]: 452/3732 cut-off events. [2025-02-08 05:09:37,608 INFO L125 PetriNetUnfolderBase]: For 65/69 co-relation queries the response was YES. [2025-02-08 05:09:37,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4974 conditions, 3732 events. 452/3732 cut-off events. For 65/69 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 37162 event pairs, 70 based on Foata normal form. 15/2969 useless extension candidates. Maximal degree in co-relation 3216. Up to 352 conditions per place. [2025-02-08 05:09:37,639 INFO L140 encePairwiseOnDemand]: 206/225 looper letters, 23 selfloop transitions, 11 changer transitions 0/250 dead transitions. [2025-02-08 05:09:37,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 250 transitions, 759 flow [2025-02-08 05:09:37,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:37,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:37,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 612 transitions. [2025-02-08 05:09:37,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9066666666666666 [2025-02-08 05:09:37,642 INFO L175 Difference]: Start difference. First operand has 210 places, 238 transitions, 664 flow. Second operand 3 states and 612 transitions. [2025-02-08 05:09:37,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 250 transitions, 759 flow [2025-02-08 05:09:37,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 250 transitions, 747 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:09:37,649 INFO L231 Difference]: Finished difference. Result has 212 places, 248 transitions, 752 flow [2025-02-08 05:09:37,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=212, PETRI_TRANSITIONS=248} [2025-02-08 05:09:37,651 INFO L279 CegarLoopForPetriNet]: 203 programPoint places, 9 predicate places. [2025-02-08 05:09:37,652 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 248 transitions, 752 flow [2025-02-08 05:09:37,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:37,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:37,652 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-02-08 05:09:37,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:09:37,653 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err9ASSERT_VIOLATIONDATA_RACE === [thr2Err14ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err13ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-08 05:09:37,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:37,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1760381528, now seen corresponding path program 1 times [2025-02-08 05:09:37,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:37,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476117104] [2025-02-08 05:09:37,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:37,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:37,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 05:09:37,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 05:09:37,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:37,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:37,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:37,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:37,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476117104] [2025-02-08 05:09:37,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476117104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:37,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:37,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:37,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004679479] [2025-02-08 05:09:37,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:37,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:37,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:37,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:37,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:37,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 225 [2025-02-08 05:09:37,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 248 transitions, 752 flow. Second operand has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:37,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:37,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 225 [2025-02-08 05:09:37,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:38,168 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] L717-1-->L710: Formula: (= v_~y~0_3 0) InVars {~y~0=v_~y~0_3} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[][251], [146#L732-1true, 113#L710true, Black: 238#true, Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), 240#(= ~y~0 0), 243#true, Black: 228#true, Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|), 203#L699-3true, 209#true]) [2025-02-08 05:09:38,168 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2025-02-08 05:09:38,168 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-02-08 05:09:38,168 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-02-08 05:09:38,168 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-02-08 05:09:38,171 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([580] L699-2-->L699: Formula: (= |v_#race~y~0_21| |v_thr1Thread1of1ForFork1_#t~nondet7#1_3|) InVars {thr1Thread1of1ForFork1_#t~nondet7#1=|v_thr1Thread1of1ForFork1_#t~nondet7#1_3|} OutVars{#race~y~0=|v_#race~y~0_21|, thr1Thread1of1ForFork1_#t~nondet7#1=|v_thr1Thread1of1ForFork1_#t~nondet7#1_3|} AuxVars[] AssignedVars[#race~y~0][231], [146#L732-1true, 34#L717-1true, Black: 238#true, Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), 240#(= ~y~0 0), Black: 230#(= |#race~y~0| 0), 243#true, Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), 166#L699true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|), 209#true]) [2025-02-08 05:09:38,173 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2025-02-08 05:09:38,173 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-02-08 05:09:38,174 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-02-08 05:09:38,174 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-02-08 05:09:38,177 INFO L124 PetriNetUnfolderBase]: 536/3998 cut-off events. [2025-02-08 05:09:38,178 INFO L125 PetriNetUnfolderBase]: For 615/739 co-relation queries the response was YES. [2025-02-08 05:09:38,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6093 conditions, 3998 events. 536/3998 cut-off events. For 615/739 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 40105 event pairs, 84 based on Foata normal form. 6/3259 useless extension candidates. Maximal degree in co-relation 3823. Up to 520 conditions per place. [2025-02-08 05:09:38,210 INFO L140 encePairwiseOnDemand]: 215/225 looper letters, 30 selfloop transitions, 14 changer transitions 0/261 dead transitions. [2025-02-08 05:09:38,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 261 transitions, 888 flow [2025-02-08 05:09:38,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:38,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:38,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 608 transitions. [2025-02-08 05:09:38,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9007407407407407 [2025-02-08 05:09:38,214 INFO L175 Difference]: Start difference. First operand has 212 places, 248 transitions, 752 flow. Second operand 3 states and 608 transitions. [2025-02-08 05:09:38,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 261 transitions, 888 flow [2025-02-08 05:09:38,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 261 transitions, 866 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:09:38,222 INFO L231 Difference]: Finished difference. Result has 214 places, 260 transitions, 856 flow [2025-02-08 05:09:38,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=214, PETRI_TRANSITIONS=260} [2025-02-08 05:09:38,224 INFO L279 CegarLoopForPetriNet]: 203 programPoint places, 11 predicate places. [2025-02-08 05:09:38,224 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 260 transitions, 856 flow [2025-02-08 05:09:38,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:38,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:38,225 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] [2025-02-08 05:09:38,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:09:38,226 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err8ASSERT_VIOLATIONDATA_RACE === [thr2Err14ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err13ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-08 05:09:38,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:38,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1975982662, now seen corresponding path program 1 times [2025-02-08 05:09:38,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:38,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566145536] [2025-02-08 05:09:38,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:38,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:38,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 05:09:38,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 05:09:38,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:38,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:38,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:38,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:38,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566145536] [2025-02-08 05:09:38,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566145536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:38,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:38,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:38,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697020228] [2025-02-08 05:09:38,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:38,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:38,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:38,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:38,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:38,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 225 [2025-02-08 05:09:38,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 260 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:38,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:38,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 225 [2025-02-08 05:09:38,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:38,584 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L699-4-->L699-3: Formula: (= v_~y~0_11 0) InVars {} OutVars{~y~0=v_~y~0_11} AuxVars[] AssignedVars[~y~0][220], [Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), 205#L712-4true, Black: 228#true, 243#true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 209#true, 203#L699-3true, 146#L732-1true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|)]) [2025-02-08 05:09:38,584 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-02-08 05:09:38,584 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2025-02-08 05:09:38,585 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2025-02-08 05:09:38,586 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2025-02-08 05:09:38,586 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L699-4-->L699-3: Formula: (= v_~y~0_11 0) InVars {} OutVars{~y~0=v_~y~0_11} AuxVars[] AssignedVars[~y~0][118], [Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), Black: 228#true, 243#true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 209#true, 203#L699-3true, 69#L712-3true, 146#L732-1true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|)]) [2025-02-08 05:09:38,586 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-02-08 05:09:38,586 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-02-08 05:09:38,586 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-02-08 05:09:38,586 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-02-08 05:09:38,586 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L699-4-->L699-3: Formula: (= v_~y~0_11 0) InVars {} OutVars{~y~0=v_~y~0_11} AuxVars[] AssignedVars[~y~0][118], [111#L708-4true, Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), Black: 228#true, 243#true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 209#true, 203#L699-3true, 146#L732-1true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|)]) [2025-02-08 05:09:38,586 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-02-08 05:09:38,586 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2025-02-08 05:09:38,586 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2025-02-08 05:09:38,586 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2025-02-08 05:09:38,601 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([487] L707-->L712-4: Formula: (= v_~y~0_10 0) InVars {~y~0=v_~y~0_10} OutVars{~y~0=v_~y~0_10} AuxVars[] AssignedVars[][61], [Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), 205#L712-4true, Black: 228#true, 243#true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 209#true, 203#L699-3true, 146#L732-1true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|)]) [2025-02-08 05:09:38,602 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-02-08 05:09:38,602 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2025-02-08 05:09:38,602 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2025-02-08 05:09:38,602 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2025-02-08 05:09:38,603 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L699-4-->L699-3: Formula: (= v_~y~0_11 0) InVars {} OutVars{~y~0=v_~y~0_11} AuxVars[] AssignedVars[~y~0][220], [113#L710true, Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), Black: 228#true, 243#true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 209#true, 203#L699-3true, 146#L732-1true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|)]) [2025-02-08 05:09:38,603 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2025-02-08 05:09:38,603 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:38,603 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:38,603 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:38,616 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([580] L699-2-->L699: Formula: (= |v_#race~y~0_21| |v_thr1Thread1of1ForFork1_#t~nondet7#1_3|) InVars {thr1Thread1of1ForFork1_#t~nondet7#1=|v_thr1Thread1of1ForFork1_#t~nondet7#1_3|} OutVars{#race~y~0=|v_#race~y~0_21|, thr1Thread1of1ForFork1_#t~nondet7#1=|v_thr1Thread1of1ForFork1_#t~nondet7#1_3|} AuxVars[] AssignedVars[#race~y~0][202], [Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), 132#L707true, Black: 230#(= |#race~y~0| 0), 243#true, 166#L699true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 209#true, 146#L732-1true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|)]) [2025-02-08 05:09:38,616 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-02-08 05:09:38,616 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-02-08 05:09:38,616 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-02-08 05:09:38,616 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-02-08 05:09:38,628 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([571] L699-4-->L699-3: Formula: (= v_~y~0_11 0) InVars {} OutVars{~y~0=v_~y~0_11} AuxVars[] AssignedVars[~y~0][220], [113#L710true, Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), Black: 228#true, 243#true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 209#true, 203#L699-3true, 146#L732-1true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|)]) [2025-02-08 05:09:38,628 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2025-02-08 05:09:38,628 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:38,628 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-02-08 05:09:38,628 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:38,628 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:38,665 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([476] L725-4-->L725-3: Formula: (= v_~y~0_1 0) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][222], [Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), 243#true, Black: 228#true, 109#L725-3true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 209#true, 94#L684true, 146#L732-1true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|)]) [2025-02-08 05:09:38,666 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2025-02-08 05:09:38,666 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:38,666 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:38,666 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-02-08 05:09:38,714 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([571] L699-4-->L699-3: Formula: (= v_~y~0_11 0) InVars {} OutVars{~y~0=v_~y~0_11} AuxVars[] AssignedVars[~y~0][220], [113#L710true, Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), 243#true, Black: 228#true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 209#true, 203#L699-3true, 146#L732-1true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|)]) [2025-02-08 05:09:38,715 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2025-02-08 05:09:38,715 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:38,715 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-02-08 05:09:38,715 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-02-08 05:09:38,715 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:38,715 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:38,776 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] L717-1-->L710: Formula: (= v_~y~0_3 0) InVars {~y~0=v_~y~0_3} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[][258], [113#L710true, Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), Black: 228#true, 243#true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 209#true, 203#L699-3true, 146#L732-1true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|)]) [2025-02-08 05:09:38,777 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2025-02-08 05:09:38,777 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-02-08 05:09:38,777 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-02-08 05:09:38,777 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-02-08 05:09:38,779 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([580] L699-2-->L699: Formula: (= |v_#race~y~0_21| |v_thr1Thread1of1ForFork1_#t~nondet7#1_3|) InVars {thr1Thread1of1ForFork1_#t~nondet7#1=|v_thr1Thread1of1ForFork1_#t~nondet7#1_3|} OutVars{#race~y~0=|v_#race~y~0_21|, thr1Thread1of1ForFork1_#t~nondet7#1=|v_thr1Thread1of1ForFork1_#t~nondet7#1_3|} AuxVars[] AssignedVars[#race~y~0][202], [Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), Black: 230#(= |#race~y~0| 0), 243#true, 166#L699true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 209#true, 146#L732-1true, 34#L717-1true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|)]) [2025-02-08 05:09:38,779 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2025-02-08 05:09:38,779 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-02-08 05:09:38,779 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-02-08 05:09:38,779 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-02-08 05:09:38,782 INFO L124 PetriNetUnfolderBase]: 740/5351 cut-off events. [2025-02-08 05:09:38,783 INFO L125 PetriNetUnfolderBase]: For 634/656 co-relation queries the response was YES. [2025-02-08 05:09:38,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7919 conditions, 5351 events. 740/5351 cut-off events. For 634/656 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 58877 event pairs, 95 based on Foata normal form. 4/4305 useless extension candidates. Maximal degree in co-relation 6109. Up to 587 conditions per place. [2025-02-08 05:09:38,812 INFO L140 encePairwiseOnDemand]: 217/225 looper letters, 15 selfloop transitions, 8 changer transitions 0/268 dead transitions. [2025-02-08 05:09:38,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 268 transitions, 933 flow [2025-02-08 05:09:38,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:38,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:38,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 624 transitions. [2025-02-08 05:09:38,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9244444444444444 [2025-02-08 05:09:38,815 INFO L175 Difference]: Start difference. First operand has 214 places, 260 transitions, 856 flow. Second operand 3 states and 624 transitions. [2025-02-08 05:09:38,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 268 transitions, 933 flow [2025-02-08 05:09:38,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 268 transitions, 905 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:09:38,826 INFO L231 Difference]: Finished difference. Result has 216 places, 266 transitions, 900 flow [2025-02-08 05:09:38,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=900, PETRI_PLACES=216, PETRI_TRANSITIONS=266} [2025-02-08 05:09:38,827 INFO L279 CegarLoopForPetriNet]: 203 programPoint places, 13 predicate places. [2025-02-08 05:09:38,827 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 266 transitions, 900 flow [2025-02-08 05:09:38,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:38,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:38,828 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] [2025-02-08 05:09:38,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:09:38,828 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr2Err9ASSERT_VIOLATIONDATA_RACE === [thr2Err14ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err13ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-08 05:09:38,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:38,830 INFO L85 PathProgramCache]: Analyzing trace with hash -331226367, now seen corresponding path program 1 times [2025-02-08 05:09:38,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:38,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012810661] [2025-02-08 05:09:38,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:38,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:38,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 05:09:38,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 05:09:38,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:38,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:38,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:38,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012810661] [2025-02-08 05:09:38,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012810661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:38,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:38,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:38,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158529291] [2025-02-08 05:09:38,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:38,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:38,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:38,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:38,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:38,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 225 [2025-02-08 05:09:38,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 266 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:38,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:38,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 225 [2025-02-08 05:09:38,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:39,303 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L699-4-->L699-3: Formula: (= v_~y~0_11 0) InVars {} OutVars{~y~0=v_~y~0_11} AuxVars[] AssignedVars[~y~0][225], [Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), 205#L712-4true, Black: 228#true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 203#L699-3true, 209#true, 253#true, 146#L732-1true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 248#true, Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|)]) [2025-02-08 05:09:39,304 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-02-08 05:09:39,304 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2025-02-08 05:09:39,304 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2025-02-08 05:09:39,304 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2025-02-08 05:09:39,304 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L699-4-->L699-3: Formula: (= v_~y~0_11 0) InVars {} OutVars{~y~0=v_~y~0_11} AuxVars[] AssignedVars[~y~0][115], [Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), Black: 228#true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 203#L699-3true, 209#true, 253#true, 146#L732-1true, 69#L712-3true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 248#true, Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|)]) [2025-02-08 05:09:39,304 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-02-08 05:09:39,304 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-02-08 05:09:39,304 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-02-08 05:09:39,304 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-02-08 05:09:39,304 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L699-4-->L699-3: Formula: (= v_~y~0_11 0) InVars {} OutVars{~y~0=v_~y~0_11} AuxVars[] AssignedVars[~y~0][115], [111#L708-4true, Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), Black: 228#true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 203#L699-3true, 209#true, 253#true, 146#L732-1true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 248#true, Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|)]) [2025-02-08 05:09:39,304 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-02-08 05:09:39,305 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2025-02-08 05:09:39,305 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2025-02-08 05:09:39,305 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2025-02-08 05:09:39,316 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([476] L725-4-->L725-3: Formula: (= v_~y~0_1 0) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][227], [Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), Black: 228#true, 109#L725-3true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 209#true, 146#L732-1true, 253#true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 248#true, Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|), 89#L686-4true]) [2025-02-08 05:09:39,316 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-02-08 05:09:39,316 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2025-02-08 05:09:39,317 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2025-02-08 05:09:39,317 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2025-02-08 05:09:39,317 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([476] L725-4-->L725-3: Formula: (= v_~y~0_1 0) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][179], [Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), Black: 228#true, 131#L682-4true, 109#L725-3true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 209#true, 146#L732-1true, 253#true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 248#true, Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|)]) [2025-02-08 05:09:39,317 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-02-08 05:09:39,317 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2025-02-08 05:09:39,317 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2025-02-08 05:09:39,317 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2025-02-08 05:09:39,326 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([487] L707-->L712-4: Formula: (= v_~y~0_10 0) InVars {~y~0=v_~y~0_10} OutVars{~y~0=v_~y~0_10} AuxVars[] AssignedVars[][62], [Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), 205#L712-4true, Black: 228#true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 203#L699-3true, 209#true, 253#true, 146#L732-1true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 248#true, Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|)]) [2025-02-08 05:09:39,326 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-02-08 05:09:39,326 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2025-02-08 05:09:39,326 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2025-02-08 05:09:39,326 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2025-02-08 05:09:39,327 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L699-4-->L699-3: Formula: (= v_~y~0_11 0) InVars {} OutVars{~y~0=v_~y~0_11} AuxVars[] AssignedVars[~y~0][225], [113#L710true, Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), Black: 228#true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 203#L699-3true, 209#true, 253#true, 146#L732-1true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 248#true, Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|)]) [2025-02-08 05:09:39,327 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2025-02-08 05:09:39,327 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:39,327 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:39,327 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:39,333 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([582] L681-->L686-4: Formula: (= v_~y~0_20 0) InVars {~y~0=v_~y~0_20} OutVars{~y~0=v_~y~0_20} AuxVars[] AssignedVars[][47], [Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), Black: 228#true, 109#L725-3true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 209#true, 146#L732-1true, 253#true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 248#true, Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|), 89#L686-4true]) [2025-02-08 05:09:39,333 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-02-08 05:09:39,333 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2025-02-08 05:09:39,333 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2025-02-08 05:09:39,333 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2025-02-08 05:09:39,339 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([476] L725-4-->L725-3: Formula: (= v_~y~0_1 0) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][227], [Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), Black: 228#true, 109#L725-3true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 209#true, 94#L684true, 253#true, 146#L732-1true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 248#true, Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|)]) [2025-02-08 05:09:39,339 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2025-02-08 05:09:39,339 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:39,339 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:39,339 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:39,340 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([580] L699-2-->L699: Formula: (= |v_#race~y~0_21| |v_thr1Thread1of1ForFork1_#t~nondet7#1_3|) InVars {thr1Thread1of1ForFork1_#t~nondet7#1=|v_thr1Thread1of1ForFork1_#t~nondet7#1_3|} OutVars{#race~y~0=|v_#race~y~0_21|, thr1Thread1of1ForFork1_#t~nondet7#1=|v_thr1Thread1of1ForFork1_#t~nondet7#1_3|} AuxVars[] AssignedVars[#race~y~0][204], [Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), 132#L707true, Black: 230#(= |#race~y~0| 0), 166#L699true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 209#true, 146#L732-1true, 253#true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 248#true, Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|)]) [2025-02-08 05:09:39,341 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-02-08 05:09:39,341 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-02-08 05:09:39,341 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-02-08 05:09:39,341 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-02-08 05:09:39,344 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([476] L725-4-->L725-3: Formula: (= v_~y~0_1 0) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][179], [Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), Black: 228#true, 109#L725-3true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 155#L686-3true, 209#true, 146#L732-1true, 253#true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 248#true, Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|)]) [2025-02-08 05:09:39,345 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-02-08 05:09:39,345 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-02-08 05:09:39,345 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-02-08 05:09:39,345 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-02-08 05:09:39,347 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([485] L725-2-->L725: Formula: (= |v_thr2Thread1of1ForFork0_#t~nondet15#1_3| |v_#race~y~0_3|) InVars {thr2Thread1of1ForFork0_#t~nondet15#1=|v_thr2Thread1of1ForFork0_#t~nondet15#1_3|} OutVars{#race~y~0=|v_#race~y~0_3|, thr2Thread1of1ForFork0_#t~nondet15#1=|v_thr2Thread1of1ForFork0_#t~nondet15#1_3|} AuxVars[] AssignedVars[#race~y~0][208], [139#L681true, Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), 162#L725true, Black: 230#(= |#race~y~0| 0), Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 209#true, 253#true, 146#L732-1true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 248#true, Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|)]) [2025-02-08 05:09:39,347 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-02-08 05:09:39,347 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-02-08 05:09:39,347 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-02-08 05:09:39,347 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-02-08 05:09:39,354 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([571] L699-4-->L699-3: Formula: (= v_~y~0_11 0) InVars {} OutVars{~y~0=v_~y~0_11} AuxVars[] AssignedVars[~y~0][225], [113#L710true, Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), Black: 228#true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 203#L699-3true, 209#true, 146#L732-1true, 253#true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 248#true, Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|)]) [2025-02-08 05:09:39,354 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2025-02-08 05:09:39,354 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:39,354 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:39,354 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:39,354 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-02-08 05:09:39,452 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([476] L725-4-->L725-3: Formula: (= v_~y~0_1 0) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][227], [Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), Black: 228#true, 109#L725-3true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 209#true, 94#L684true, 146#L732-1true, 253#true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 248#true, Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|)]) [2025-02-08 05:09:39,453 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2025-02-08 05:09:39,453 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:39,453 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-02-08 05:09:39,453 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:39,453 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:39,473 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([476] L725-4-->L725-3: Formula: (= v_~y~0_1 0) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][227], [Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), Black: 228#true, 109#L725-3true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 209#true, 94#L684true, 253#true, 146#L732-1true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 248#true, Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|)]) [2025-02-08 05:09:39,473 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2025-02-08 05:09:39,473 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:39,473 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-02-08 05:09:39,473 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-02-08 05:09:39,473 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:39,473 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:39,476 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([571] L699-4-->L699-3: Formula: (= v_~y~0_11 0) InVars {} OutVars{~y~0=v_~y~0_11} AuxVars[] AssignedVars[~y~0][225], [113#L710true, Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), Black: 228#true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 203#L699-3true, 209#true, 253#true, 146#L732-1true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 248#true, Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|)]) [2025-02-08 05:09:39,477 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2025-02-08 05:09:39,477 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:39,477 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:39,477 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-02-08 05:09:39,477 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:09:39,477 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-02-08 05:09:39,537 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] L717-1-->L710: Formula: (= v_~y~0_3 0) InVars {~y~0=v_~y~0_3} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[][265], [113#L710true, Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), Black: 228#true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 209#true, 203#L699-3true, 146#L732-1true, 253#true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 248#true, Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|)]) [2025-02-08 05:09:39,537 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2025-02-08 05:09:39,537 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-02-08 05:09:39,537 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-02-08 05:09:39,537 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-02-08 05:09:39,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([580] L699-2-->L699: Formula: (= |v_#race~y~0_21| |v_thr1Thread1of1ForFork1_#t~nondet7#1_3|) InVars {thr1Thread1of1ForFork1_#t~nondet7#1=|v_thr1Thread1of1ForFork1_#t~nondet7#1_3|} OutVars{#race~y~0=|v_#race~y~0_21|, thr1Thread1of1ForFork1_#t~nondet7#1=|v_thr1Thread1of1ForFork1_#t~nondet7#1_3|} AuxVars[] AssignedVars[#race~y~0][204], [Black: 225#(= |thr2Thread1of1ForFork0_#t~nondet9#1| |#race~b2~0|), Black: 230#(= |#race~y~0| 0), 166#L699true, Black: 235#(= |#race~x~0| |thr2Thread1of1ForFork0_#t~nondet10#1|), 209#true, 253#true, 146#L732-1true, 34#L717-1true, Black: 238#true, Black: 245#(= |#race~y~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 250#(= |#race~x~0| 0), Black: 215#(= |#race~b1~0| |thr1Thread1of1ForFork1_#t~nondet1#1|), Black: 248#true, Black: 220#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet2#1|)]) [2025-02-08 05:09:39,539 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2025-02-08 05:09:39,539 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-02-08 05:09:39,539 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-02-08 05:09:39,539 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-02-08 05:09:39,542 INFO L124 PetriNetUnfolderBase]: 900/5880 cut-off events. [2025-02-08 05:09:39,543 INFO L125 PetriNetUnfolderBase]: For 1604/1838 co-relation queries the response was YES. [2025-02-08 05:09:39,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9554 conditions, 5880 events. 900/5880 cut-off events. For 1604/1838 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 65730 event pairs, 131 based on Foata normal form. 13/4751 useless extension candidates. Maximal degree in co-relation 6413. Up to 871 conditions per place. [2025-02-08 05:09:39,579 INFO L140 encePairwiseOnDemand]: 215/225 looper letters, 38 selfloop transitions, 16 changer transitions 0/279 dead transitions. [2025-02-08 05:09:39,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 279 transitions, 1059 flow [2025-02-08 05:09:39,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:39,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:39,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 608 transitions. [2025-02-08 05:09:39,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9007407407407407 [2025-02-08 05:09:39,583 INFO L175 Difference]: Start difference. First operand has 216 places, 266 transitions, 900 flow. Second operand 3 states and 608 transitions. [2025-02-08 05:09:39,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 279 transitions, 1059 flow [2025-02-08 05:09:39,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 279 transitions, 1043 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:09:39,592 INFO L231 Difference]: Finished difference. Result has 218 places, 278 transitions, 1022 flow [2025-02-08 05:09:39,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1022, PETRI_PLACES=218, PETRI_TRANSITIONS=278} [2025-02-08 05:09:39,594 INFO L279 CegarLoopForPetriNet]: 203 programPoint places, 15 predicate places. [2025-02-08 05:09:39,594 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 278 transitions, 1022 flow [2025-02-08 05:09:39,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:39,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:39,595 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] [2025-02-08 05:09:39,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:09:39,595 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err13ASSERT_VIOLATIONDATA_RACE === [thr2Err14ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err13ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-02-08 05:09:39,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:39,596 INFO L85 PathProgramCache]: Analyzing trace with hash -466078014, now seen corresponding path program 1 times [2025-02-08 05:09:39,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:39,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883709325] [2025-02-08 05:09:39,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:39,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:39,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:09:39,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:09:39,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:39,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:09:39,608 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:09:39,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:09:39,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:09:39,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:39,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:09:39,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:09:39,643 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:09:39,644 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err13ASSERT_VIOLATIONDATA_RACE (61 of 62 remaining) [2025-02-08 05:09:39,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err14ASSERT_VIOLATIONDATA_RACE (60 of 62 remaining) [2025-02-08 05:09:39,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (59 of 62 remaining) [2025-02-08 05:09:39,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (58 of 62 remaining) [2025-02-08 05:09:39,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err13ASSERT_VIOLATIONDATA_RACE (57 of 62 remaining) [2025-02-08 05:09:39,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err12ASSERT_VIOLATIONDATA_RACE (56 of 62 remaining) [2025-02-08 05:09:39,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (55 of 62 remaining) [2025-02-08 05:09:39,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err11ASSERT_VIOLATIONDATA_RACE (54 of 62 remaining) [2025-02-08 05:09:39,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err9ASSERT_VIOLATIONDATA_RACE (53 of 62 remaining) [2025-02-08 05:09:39,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (52 of 62 remaining) [2025-02-08 05:09:39,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err10ASSERT_VIOLATIONDATA_RACE (51 of 62 remaining) [2025-02-08 05:09:39,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err8ASSERT_VIOLATIONDATA_RACE (50 of 62 remaining) [2025-02-08 05:09:39,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (49 of 62 remaining) [2025-02-08 05:09:39,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (48 of 62 remaining) [2025-02-08 05:09:39,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (47 of 62 remaining) [2025-02-08 05:09:39,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (46 of 62 remaining) [2025-02-08 05:09:39,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (45 of 62 remaining) [2025-02-08 05:09:39,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (44 of 62 remaining) [2025-02-08 05:09:39,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (43 of 62 remaining) [2025-02-08 05:09:39,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (42 of 62 remaining) [2025-02-08 05:09:39,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (41 of 62 remaining) [2025-02-08 05:09:39,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (40 of 62 remaining) [2025-02-08 05:09:39,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (39 of 62 remaining) [2025-02-08 05:09:39,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (38 of 62 remaining) [2025-02-08 05:09:39,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (37 of 62 remaining) [2025-02-08 05:09:39,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (36 of 62 remaining) [2025-02-08 05:09:39,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (35 of 62 remaining) [2025-02-08 05:09:39,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (34 of 62 remaining) [2025-02-08 05:09:39,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (33 of 62 remaining) [2025-02-08 05:09:39,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (32 of 62 remaining) [2025-02-08 05:09:39,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (31 of 62 remaining) [2025-02-08 05:09:39,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 62 remaining) [2025-02-08 05:09:39,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 62 remaining) [2025-02-08 05:09:39,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err14ASSERT_VIOLATIONDATA_RACE (28 of 62 remaining) [2025-02-08 05:09:39,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (27 of 62 remaining) [2025-02-08 05:09:39,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (26 of 62 remaining) [2025-02-08 05:09:39,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err13ASSERT_VIOLATIONDATA_RACE (25 of 62 remaining) [2025-02-08 05:09:39,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err12ASSERT_VIOLATIONDATA_RACE (24 of 62 remaining) [2025-02-08 05:09:39,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (23 of 62 remaining) [2025-02-08 05:09:39,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err11ASSERT_VIOLATIONDATA_RACE (22 of 62 remaining) [2025-02-08 05:09:39,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err9ASSERT_VIOLATIONDATA_RACE (21 of 62 remaining) [2025-02-08 05:09:39,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (20 of 62 remaining) [2025-02-08 05:09:39,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err10ASSERT_VIOLATIONDATA_RACE (19 of 62 remaining) [2025-02-08 05:09:39,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err8ASSERT_VIOLATIONDATA_RACE (18 of 62 remaining) [2025-02-08 05:09:39,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (17 of 62 remaining) [2025-02-08 05:09:39,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (16 of 62 remaining) [2025-02-08 05:09:39,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (15 of 62 remaining) [2025-02-08 05:09:39,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (14 of 62 remaining) [2025-02-08 05:09:39,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (13 of 62 remaining) [2025-02-08 05:09:39,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (12 of 62 remaining) [2025-02-08 05:09:39,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 62 remaining) [2025-02-08 05:09:39,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (10 of 62 remaining) [2025-02-08 05:09:39,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 62 remaining) [2025-02-08 05:09:39,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (8 of 62 remaining) [2025-02-08 05:09:39,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (7 of 62 remaining) [2025-02-08 05:09:39,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 62 remaining) [2025-02-08 05:09:39,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (5 of 62 remaining) [2025-02-08 05:09:39,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (4 of 62 remaining) [2025-02-08 05:09:39,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (3 of 62 remaining) [2025-02-08 05:09:39,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (2 of 62 remaining) [2025-02-08 05:09:39,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 62 remaining) [2025-02-08 05:09:39,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 62 remaining) [2025-02-08 05:09:39,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:09:39,651 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:09:39,690 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:09:39,690 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:09:39,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:09:39 BasicIcfg [2025-02-08 05:09:39,697 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:09:39,697 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:09:39,697 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:09:39,697 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:09:39,698 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:09:34" (3/4) ... [2025-02-08 05:09:39,699 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 05:09:39,759 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 3. [2025-02-08 05:09:39,794 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:09:39,795 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:09:39,795 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:09:39,796 INFO L158 Benchmark]: Toolchain (without parser) took 5949.71ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 110.5MB in the beginning and 156.1MB in the end (delta: -45.6MB). Peak memory consumption was 143.6MB. Max. memory is 16.1GB. [2025-02-08 05:09:39,796 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:09:39,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.43ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 91.0MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:09:39,797 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.39ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 89.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:09:39,797 INFO L158 Benchmark]: Boogie Preprocessor took 30.08ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 88.0MB in the end (delta: 964.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:09:39,798 INFO L158 Benchmark]: IcfgBuilder took 523.19ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 69.3MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:09:39,798 INFO L158 Benchmark]: TraceAbstraction took 4852.55ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 68.4MB in the beginning and 165.8MB in the end (delta: -97.4MB). Peak memory consumption was 93.3MB. Max. memory is 16.1GB. [2025-02-08 05:09:39,798 INFO L158 Benchmark]: Witness Printer took 97.89ms. Allocated memory is still 335.5MB. Free memory was 165.8MB in the beginning and 156.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:09:39,800 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.27ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.43ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 91.0MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.39ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 89.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.08ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 88.0MB in the end (delta: 964.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 523.19ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 69.3MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4852.55ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 68.4MB in the beginning and 165.8MB in the end (delta: -97.4MB). Peak memory consumption was 93.3MB. Max. memory is 16.1GB. * Witness Printer took 97.89ms. Allocated memory is still 335.5MB. Free memory was 165.8MB in the beginning and 156.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 680]: Data race detected Data race detected The following path leads to a data race: [L674] 0 int x, y; VAL [x=0, y=0] [L675] 0 int b1, b2; VAL [b1=0, b2=0, x=0, y=0] [L676] 0 int X; VAL [X=0, b1=0, b2=0, x=0, y=0] [L730] 0 pthread_t t1, t2; VAL [X=0, b1=0, b2=0, x=0, y=0] [L731] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [X=0, b1=0, b2=0, t1=-1, x=0, y=0] [L678] COND TRUE 1 1 [L679] 1 b1 = 1 VAL [X=0, \old(_)={0:0}, _={0:0}, b1=1, b2=0, x=0, y=0] [L680] 1 x = 1 VAL [X=0, \old(_)={0:0}, _={0:0}, b1=1, b2=0, x=1, y=0] [L732] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [X=0, b1=1, b2=0, t1=-1, t2=0, x=1, y=0] [L704] COND TRUE 2 1 [L705] 2 b2 = 1 VAL [X=0, \old(_)={0:0}, _={0:0}, b1=1, b2=1, x=1, y=0] [L706] 2 x = 2 VAL [X=0, \old(_)={0:0}, _={0:0}, b1=1, b2=1, x=2, y=0] [L680] 1 x = 1 VAL [X=0, \old(_)={0:0}, _={0:0}, b1=1, b2=1, x=2, y=0] Now there is a data race on ~x~0 between C: x = 2 [706] and C: x = 1 [680] - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 723]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 726]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 679]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 681]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 682]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 683]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 689]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 732]: 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: 731]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 376 locations, 62 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: 4.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 414 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 372 IncrementalHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 90 mSDtfsCounter, 372 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1022occurred in iteration=9, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 351 NumberOfCodeBlocks, 351 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 364 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-02-08 05:09:39,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)