./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c -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 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:31:14,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:31:14,263 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:31:14,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:31:14,269 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:31:14,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:31:14,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:31:14,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:31:14,299 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:31:14,300 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:31:14,300 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:31:14,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:31:14,301 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:31:14,301 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:31:14,301 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:31:14,301 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:31:14,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:31:14,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:31:14,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:31:14,302 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:31:14,302 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:31:14,302 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:31:14,302 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:31:14,302 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:31:14,302 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:31:14,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:31:14,303 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:31:14,303 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:31:14,303 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:31:14,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:31:14,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:31:14,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:31:14,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:31:14,304 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:31:14,304 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:31:14,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:31:14,304 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:31:14,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:31:14,304 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:31:14,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:31:14,305 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:31:14,305 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:31:14,305 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 -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 [2025-02-06 09:31:14,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:31:14,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:31:14,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:31:14,616 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:31:14,616 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:31:14,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-02-06 09:31:15,924 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4bba9bdeb/9e07c9293b8e43c48274565b05b3356f/FLAGff60e9d67 [2025-02-06 09:31:16,170 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:31:16,171 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-02-06 09:31:16,178 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4bba9bdeb/9e07c9293b8e43c48274565b05b3356f/FLAGff60e9d67 [2025-02-06 09:31:16,499 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4bba9bdeb/9e07c9293b8e43c48274565b05b3356f [2025-02-06 09:31:16,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:31:16,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:31:16,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:31:16,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:31:16,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:31:16,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:31:16" (1/1) ... [2025-02-06 09:31:16,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ba7297a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:16, skipping insertion in model container [2025-02-06 09:31:16,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:31:16" (1/1) ... [2025-02-06 09:31:16,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:31:16,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:31:16,747 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:31:16,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:31:16,806 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:31:16,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:16 WrapperNode [2025-02-06 09:31:16,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:31:16,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:31:16,809 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:31:16,809 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:31:16,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:16" (1/1) ... [2025-02-06 09:31:16,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:16" (1/1) ... [2025-02-06 09:31:16,875 INFO L138 Inliner]: procedures = 25, calls = 31, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 372 [2025-02-06 09:31:16,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:31:16,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:31:16,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:31:16,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:31:16,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:16" (1/1) ... [2025-02-06 09:31:16,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:16" (1/1) ... [2025-02-06 09:31:16,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:16" (1/1) ... [2025-02-06 09:31:16,893 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:16" (1/1) ... [2025-02-06 09:31:16,906 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:16" (1/1) ... [2025-02-06 09:31:16,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:16" (1/1) ... [2025-02-06 09:31:16,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:16" (1/1) ... [2025-02-06 09:31:16,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:16" (1/1) ... [2025-02-06 09:31:16,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:31:16,919 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:31:16,919 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:31:16,919 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:31:16,920 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:16" (1/1) ... [2025-02-06 09:31:16,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:31:16,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:31:16,966 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:31:16,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:31:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:31:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 09:31:16,994 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 09:31:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 09:31:16,994 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 09:31:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 09:31:16,994 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 09:31:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:31:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:31:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:31:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:31:16,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:31:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:31:16,996 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:31:17,094 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:31:17,096 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:31:17,661 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:31:17,662 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:31:17,700 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:31:17,700 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:31:17,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:31:17 BoogieIcfgContainer [2025-02-06 09:31:17,700 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:31:17,703 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:31:17,703 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:31:17,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:31:17,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:31:16" (1/3) ... [2025-02-06 09:31:17,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28135179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:31:17, skipping insertion in model container [2025-02-06 09:31:17,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:16" (2/3) ... [2025-02-06 09:31:17,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28135179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:31:17, skipping insertion in model container [2025-02-06 09:31:17,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:31:17" (3/3) ... [2025-02-06 09:31:17,710 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2025-02-06 09:31:17,726 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:31:17,727 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 490 locations, 1 initial locations, 6 loop locations, and 34 error locations. [2025-02-06 09:31:17,728 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:31:17,881 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 09:31:17,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 499 places, 515 transitions, 1051 flow [2025-02-06 09:31:18,161 INFO L124 PetriNetUnfolderBase]: 26/512 cut-off events. [2025-02-06 09:31:18,163 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 09:31:18,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 512 events. 26/512 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 902 event pairs, 0 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 336. Up to 2 conditions per place. [2025-02-06 09:31:18,179 INFO L82 GeneralOperation]: Start removeDead. Operand has 499 places, 515 transitions, 1051 flow [2025-02-06 09:31:18,189 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 455 places, 468 transitions, 954 flow [2025-02-06 09:31:18,199 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:31:18,219 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;@7b44a6c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:31:18,219 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2025-02-06 09:31:18,227 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:31:18,228 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-02-06 09:31:18,228 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:31:18,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:18,229 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-06 09:31:18,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-02-06 09:31:18,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:18,237 INFO L85 PathProgramCache]: Analyzing trace with hash 38306877, now seen corresponding path program 1 times [2025-02-06 09:31:18,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:18,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318191459] [2025-02-06 09:31:18,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:18,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:18,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 09:31:18,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 09:31:18,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:18,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:18,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:18,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:18,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318191459] [2025-02-06 09:31:18,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318191459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:18,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:18,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:18,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297935021] [2025-02-06 09:31:18,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:18,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:18,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:18,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:18,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:18,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 515 [2025-02-06 09:31:18,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 468 transitions, 954 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:18,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:18,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 515 [2025-02-06 09:31:18,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:18,799 INFO L124 PetriNetUnfolderBase]: 33/1039 cut-off events. [2025-02-06 09:31:18,800 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-06 09:31:18,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 1039 events. 33/1039 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5191 event pairs, 15 based on Foata normal form. 34/934 useless extension candidates. Maximal degree in co-relation 824. Up to 55 conditions per place. [2025-02-06 09:31:18,819 INFO L140 encePairwiseOnDemand]: 495/515 looper letters, 15 selfloop transitions, 2 changer transitions 6/450 dead transitions. [2025-02-06 09:31:18,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 450 transitions, 952 flow [2025-02-06 09:31:18,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:18,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:18,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1460 transitions. [2025-02-06 09:31:18,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9449838187702265 [2025-02-06 09:31:18,843 INFO L175 Difference]: Start difference. First operand has 455 places, 468 transitions, 954 flow. Second operand 3 states and 1460 transitions. [2025-02-06 09:31:18,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 450 transitions, 952 flow [2025-02-06 09:31:18,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 450 transitions, 940 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 09:31:18,867 INFO L231 Difference]: Finished difference. Result has 450 places, 444 transitions, 898 flow [2025-02-06 09:31:18,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=898, PETRI_PLACES=450, PETRI_TRANSITIONS=444} [2025-02-06 09:31:18,873 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2025-02-06 09:31:18,875 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 444 transitions, 898 flow [2025-02-06 09:31:18,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:18,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:18,876 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] [2025-02-06 09:31:18,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:31:18,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-02-06 09:31:18,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:18,878 INFO L85 PathProgramCache]: Analyzing trace with hash -419822197, now seen corresponding path program 1 times [2025-02-06 09:31:18,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:18,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614261949] [2025-02-06 09:31:18,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:18,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:18,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 09:31:18,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 09:31:18,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:18,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:18,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:18,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:18,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614261949] [2025-02-06 09:31:18,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614261949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:18,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:18,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:18,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625505099] [2025-02-06 09:31:18,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:18,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:18,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:18,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:18,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:18,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 469 out of 515 [2025-02-06 09:31:18,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 444 transitions, 898 flow. Second operand has 3 states, 3 states have (on average 470.0) internal successors, (1410), 3 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:18,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:18,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 469 of 515 [2025-02-06 09:31:18,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:19,484 INFO L124 PetriNetUnfolderBase]: 100/2658 cut-off events. [2025-02-06 09:31:19,484 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-06 09:31:19,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2829 conditions, 2658 events. 100/2658 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 19710 event pairs, 56 based on Foata normal form. 0/2318 useless extension candidates. Maximal degree in co-relation 2797. Up to 152 conditions per place. [2025-02-06 09:31:19,509 INFO L140 encePairwiseOnDemand]: 508/515 looper letters, 18 selfloop transitions, 1 changer transitions 0/438 dead transitions. [2025-02-06 09:31:19,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 438 transitions, 924 flow [2025-02-06 09:31:19,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:19,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:19,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1432 transitions. [2025-02-06 09:31:19,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9268608414239482 [2025-02-06 09:31:19,516 INFO L175 Difference]: Start difference. First operand has 450 places, 444 transitions, 898 flow. Second operand 3 states and 1432 transitions. [2025-02-06 09:31:19,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 438 transitions, 924 flow [2025-02-06 09:31:19,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 438 transitions, 920 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:19,524 INFO L231 Difference]: Finished difference. Result has 438 places, 438 transitions, 884 flow [2025-02-06 09:31:19,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=438, PETRI_TRANSITIONS=438} [2025-02-06 09:31:19,526 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -17 predicate places. [2025-02-06 09:31:19,526 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 438 transitions, 884 flow [2025-02-06 09:31:19,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 470.0) internal successors, (1410), 3 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:19,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:19,528 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:19,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:31:19,528 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-02-06 09:31:19,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:19,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1632594325, now seen corresponding path program 1 times [2025-02-06 09:31:19,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:19,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244962656] [2025-02-06 09:31:19,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:19,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:19,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:31:19,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:31:19,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:19,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:20,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:20,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:20,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244962656] [2025-02-06 09:31:20,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244962656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:20,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:20,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:31:20,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141006218] [2025-02-06 09:31:20,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:20,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:31:20,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:20,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:31:20,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:31:20,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 515 [2025-02-06 09:31:20,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 438 transitions, 884 flow. Second operand has 6 states, 6 states have (on average 423.5) internal successors, (2541), 6 states have internal predecessors, (2541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:20,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:20,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 515 [2025-02-06 09:31:20,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:21,782 INFO L124 PetriNetUnfolderBase]: 1199/6236 cut-off events. [2025-02-06 09:31:21,783 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2025-02-06 09:31:21,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8056 conditions, 6236 events. 1199/6236 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 54480 event pairs, 864 based on Foata normal form. 0/5383 useless extension candidates. Maximal degree in co-relation 8025. Up to 1771 conditions per place. [2025-02-06 09:31:21,841 INFO L140 encePairwiseOnDemand]: 497/515 looper letters, 54 selfloop transitions, 15 changer transitions 0/435 dead transitions. [2025-02-06 09:31:21,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 435 transitions, 1016 flow [2025-02-06 09:31:21,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:31:21,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:31:21,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2604 transitions. [2025-02-06 09:31:21,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8427184466019417 [2025-02-06 09:31:21,848 INFO L175 Difference]: Start difference. First operand has 438 places, 438 transitions, 884 flow. Second operand 6 states and 2604 transitions. [2025-02-06 09:31:21,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 435 transitions, 1016 flow [2025-02-06 09:31:21,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 435 transitions, 1015 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:31:21,855 INFO L231 Difference]: Finished difference. Result has 439 places, 435 transitions, 907 flow [2025-02-06 09:31:21,856 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=907, PETRI_PLACES=439, PETRI_TRANSITIONS=435} [2025-02-06 09:31:21,856 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -16 predicate places. [2025-02-06 09:31:21,857 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 435 transitions, 907 flow [2025-02-06 09:31:21,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 423.5) internal successors, (2541), 6 states have internal predecessors, (2541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:21,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:21,859 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:21,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:31:21,859 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-02-06 09:31:21,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:21,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1422463777, now seen corresponding path program 1 times [2025-02-06 09:31:21,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:21,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872257230] [2025-02-06 09:31:21,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:21,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:21,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:31:21,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:31:21,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:21,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:21,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:21,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872257230] [2025-02-06 09:31:21,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872257230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:21,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:21,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:21,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475987634] [2025-02-06 09:31:21,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:21,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:21,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:21,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:21,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:21,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 515 [2025-02-06 09:31:21,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 435 transitions, 907 flow. Second operand has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:21,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:21,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 515 [2025-02-06 09:31:21,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:22,026 INFO L124 PetriNetUnfolderBase]: 13/623 cut-off events. [2025-02-06 09:31:22,027 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:31:22,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 623 events. 13/623 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1670 event pairs, 5 based on Foata normal form. 0/564 useless extension candidates. Maximal degree in co-relation 638. Up to 22 conditions per place. [2025-02-06 09:31:22,039 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 11 selfloop transitions, 2 changer transitions 0/434 dead transitions. [2025-02-06 09:31:22,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 434 transitions, 931 flow [2025-02-06 09:31:22,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:22,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:22,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2025-02-06 09:31:22,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9391585760517799 [2025-02-06 09:31:22,045 INFO L175 Difference]: Start difference. First operand has 439 places, 435 transitions, 907 flow. Second operand 3 states and 1451 transitions. [2025-02-06 09:31:22,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 434 transitions, 931 flow [2025-02-06 09:31:22,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 434 transitions, 901 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:31:22,052 INFO L231 Difference]: Finished difference. Result has 435 places, 434 transitions, 879 flow [2025-02-06 09:31:22,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=879, PETRI_PLACES=435, PETRI_TRANSITIONS=434} [2025-02-06 09:31:22,054 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -20 predicate places. [2025-02-06 09:31:22,054 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 434 transitions, 879 flow [2025-02-06 09:31:22,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:22,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:22,056 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:22,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:31:22,056 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-02-06 09:31:22,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:22,058 INFO L85 PathProgramCache]: Analyzing trace with hash 863857740, now seen corresponding path program 1 times [2025-02-06 09:31:22,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:22,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796527898] [2025-02-06 09:31:22,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:22,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:22,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 09:31:22,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 09:31:22,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:22,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:22,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:22,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:22,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796527898] [2025-02-06 09:31:22,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796527898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:22,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:22,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:22,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180717887] [2025-02-06 09:31:22,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:22,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:22,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:22,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:22,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:22,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 515 [2025-02-06 09:31:22,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 434 transitions, 879 flow. Second operand has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:22,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:22,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 515 [2025-02-06 09:31:22,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:22,222 INFO L124 PetriNetUnfolderBase]: 14/563 cut-off events. [2025-02-06 09:31:22,223 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:31:22,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 563 events. 14/563 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1305 event pairs, 7 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 567. Up to 25 conditions per place. [2025-02-06 09:31:22,235 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 11 selfloop transitions, 2 changer transitions 0/433 dead transitions. [2025-02-06 09:31:22,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 433 transitions, 903 flow [2025-02-06 09:31:22,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:22,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:22,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2025-02-06 09:31:22,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9391585760517799 [2025-02-06 09:31:22,240 INFO L175 Difference]: Start difference. First operand has 435 places, 434 transitions, 879 flow. Second operand 3 states and 1451 transitions. [2025-02-06 09:31:22,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 433 transitions, 903 flow [2025-02-06 09:31:22,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 433 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:22,251 INFO L231 Difference]: Finished difference. Result has 434 places, 433 transitions, 877 flow [2025-02-06 09:31:22,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=877, PETRI_PLACES=434, PETRI_TRANSITIONS=433} [2025-02-06 09:31:22,252 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -21 predicate places. [2025-02-06 09:31:22,254 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 433 transitions, 877 flow [2025-02-06 09:31:22,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:22,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:22,256 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:22,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:31:22,256 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-02-06 09:31:22,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:22,257 INFO L85 PathProgramCache]: Analyzing trace with hash -2004418844, now seen corresponding path program 1 times [2025-02-06 09:31:22,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:22,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024324530] [2025-02-06 09:31:22,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:22,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:22,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 09:31:22,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 09:31:22,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:22,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:22,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:22,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:22,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024324530] [2025-02-06 09:31:22,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024324530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:22,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:22,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:22,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122883880] [2025-02-06 09:31:22,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:22,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:22,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:22,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:22,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:22,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 515 [2025-02-06 09:31:22,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 433 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:22,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:22,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 515 [2025-02-06 09:31:22,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:22,476 INFO L124 PetriNetUnfolderBase]: 10/440 cut-off events. [2025-02-06 09:31:22,476 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 09:31:22,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 440 events. 10/440 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 797 event pairs, 4 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 438. Up to 20 conditions per place. [2025-02-06 09:31:22,484 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 11 selfloop transitions, 2 changer transitions 0/432 dead transitions. [2025-02-06 09:31:22,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 432 transitions, 901 flow [2025-02-06 09:31:22,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:22,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:22,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2025-02-06 09:31:22,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9391585760517799 [2025-02-06 09:31:22,488 INFO L175 Difference]: Start difference. First operand has 434 places, 433 transitions, 877 flow. Second operand 3 states and 1451 transitions. [2025-02-06 09:31:22,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 432 transitions, 901 flow [2025-02-06 09:31:22,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 432 transitions, 897 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:22,501 INFO L231 Difference]: Finished difference. Result has 433 places, 432 transitions, 875 flow [2025-02-06 09:31:22,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=871, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=875, PETRI_PLACES=433, PETRI_TRANSITIONS=432} [2025-02-06 09:31:22,502 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -22 predicate places. [2025-02-06 09:31:22,504 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 432 transitions, 875 flow [2025-02-06 09:31:22,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:22,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:22,505 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:22,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:31:22,505 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-02-06 09:31:22,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:22,506 INFO L85 PathProgramCache]: Analyzing trace with hash 566168262, now seen corresponding path program 1 times [2025-02-06 09:31:22,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:22,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883358404] [2025-02-06 09:31:22,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:22,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:22,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 09:31:22,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 09:31:22,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:22,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:22,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:22,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883358404] [2025-02-06 09:31:22,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883358404] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:22,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:22,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:22,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944946155] [2025-02-06 09:31:22,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:22,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:22,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:22,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:22,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:22,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-02-06 09:31:22,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 432 transitions, 875 flow. Second operand has 3 states, 3 states have (on average 482.0) internal successors, (1446), 3 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:22,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:22,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-02-06 09:31:22,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:22,738 INFO L124 PetriNetUnfolderBase]: 14/694 cut-off events. [2025-02-06 09:31:22,739 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:31:22,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 694 events. 14/694 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1802 event pairs, 2 based on Foata normal form. 0/632 useless extension candidates. Maximal degree in co-relation 701. Up to 12 conditions per place. [2025-02-06 09:31:22,748 INFO L140 encePairwiseOnDemand]: 510/515 looper letters, 10 selfloop transitions, 3 changer transitions 0/432 dead transitions. [2025-02-06 09:31:22,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 432 transitions, 903 flow [2025-02-06 09:31:22,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:22,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:22,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1458 transitions. [2025-02-06 09:31:22,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9436893203883495 [2025-02-06 09:31:22,752 INFO L175 Difference]: Start difference. First operand has 433 places, 432 transitions, 875 flow. Second operand 3 states and 1458 transitions. [2025-02-06 09:31:22,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 432 transitions, 903 flow [2025-02-06 09:31:22,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 432 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:22,761 INFO L231 Difference]: Finished difference. Result has 431 places, 430 transitions, 873 flow [2025-02-06 09:31:22,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=873, PETRI_PLACES=431, PETRI_TRANSITIONS=430} [2025-02-06 09:31:22,762 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -24 predicate places. [2025-02-06 09:31:22,762 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 430 transitions, 873 flow [2025-02-06 09:31:22,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.0) internal successors, (1446), 3 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:22,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:22,763 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:22,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:31:22,764 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-02-06 09:31:22,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:22,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1373114265, now seen corresponding path program 1 times [2025-02-06 09:31:22,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:22,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171715896] [2025-02-06 09:31:22,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:22,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:22,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 09:31:22,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 09:31:22,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:22,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:22,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:22,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:22,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171715896] [2025-02-06 09:31:22,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171715896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:22,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:22,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:22,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889382153] [2025-02-06 09:31:22,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:22,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:22,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:22,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:22,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:22,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-02-06 09:31:22,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 430 transitions, 873 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:22,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:22,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-02-06 09:31:22,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:23,048 INFO L124 PetriNetUnfolderBase]: 31/1093 cut-off events. [2025-02-06 09:31:23,048 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-06 09:31:23,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1168 conditions, 1093 events. 31/1093 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4660 event pairs, 2 based on Foata normal form. 0/985 useless extension candidates. Maximal degree in co-relation 1137. Up to 46 conditions per place. [2025-02-06 09:31:23,067 INFO L140 encePairwiseOnDemand]: 511/515 looper letters, 16 selfloop transitions, 2 changer transitions 0/435 dead transitions. [2025-02-06 09:31:23,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 435 transitions, 924 flow [2025-02-06 09:31:23,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:23,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:23,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1463 transitions. [2025-02-06 09:31:23,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.946925566343042 [2025-02-06 09:31:23,073 INFO L175 Difference]: Start difference. First operand has 431 places, 430 transitions, 873 flow. Second operand 3 states and 1463 transitions. [2025-02-06 09:31:23,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 435 transitions, 924 flow [2025-02-06 09:31:23,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 435 transitions, 918 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:23,086 INFO L231 Difference]: Finished difference. Result has 430 places, 430 transitions, 877 flow [2025-02-06 09:31:23,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=863, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=877, PETRI_PLACES=430, PETRI_TRANSITIONS=430} [2025-02-06 09:31:23,090 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -25 predicate places. [2025-02-06 09:31:23,090 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 430 transitions, 877 flow [2025-02-06 09:31:23,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:23,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:23,091 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:23,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:31:23,092 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-02-06 09:31:23,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:23,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1669764731, now seen corresponding path program 1 times [2025-02-06 09:31:23,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:23,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008954802] [2025-02-06 09:31:23,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:23,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:23,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 09:31:23,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 09:31:23,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:23,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:23,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:23,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:23,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008954802] [2025-02-06 09:31:23,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008954802] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:23,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:23,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:23,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569548551] [2025-02-06 09:31:23,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:23,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:23,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:23,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:23,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:23,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-02-06 09:31:23,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 430 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:23,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:23,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-02-06 09:31:23,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:23,363 INFO L124 PetriNetUnfolderBase]: 24/944 cut-off events. [2025-02-06 09:31:23,363 INFO L125 PetriNetUnfolderBase]: For 10/28 co-relation queries the response was YES. [2025-02-06 09:31:23,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 944 events. 24/944 cut-off events. For 10/28 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3329 event pairs, 3 based on Foata normal form. 4/856 useless extension candidates. Maximal degree in co-relation 974. Up to 19 conditions per place. [2025-02-06 09:31:23,378 INFO L140 encePairwiseOnDemand]: 510/515 looper letters, 9 selfloop transitions, 2 changer transitions 4/430 dead transitions. [2025-02-06 09:31:23,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 430 transitions, 903 flow [2025-02-06 09:31:23,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:23,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:23,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1457 transitions. [2025-02-06 09:31:23,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.943042071197411 [2025-02-06 09:31:23,385 INFO L175 Difference]: Start difference. First operand has 430 places, 430 transitions, 877 flow. Second operand 3 states and 1457 transitions. [2025-02-06 09:31:23,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 430 transitions, 903 flow [2025-02-06 09:31:23,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 430 transitions, 903 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:31:23,391 INFO L231 Difference]: Finished difference. Result has 430 places, 424 transitions, 869 flow [2025-02-06 09:31:23,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=869, PETRI_PLACES=430, PETRI_TRANSITIONS=424} [2025-02-06 09:31:23,394 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -25 predicate places. [2025-02-06 09:31:23,394 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 424 transitions, 869 flow [2025-02-06 09:31:23,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:23,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:23,396 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:23,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:31:23,396 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-02-06 09:31:23,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:23,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1538830762, now seen corresponding path program 1 times [2025-02-06 09:31:23,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:23,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680387611] [2025-02-06 09:31:23,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:23,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:23,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 09:31:23,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 09:31:23,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:23,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:23,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:23,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:23,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680387611] [2025-02-06 09:31:23,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680387611] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:23,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:23,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 09:31:23,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999772456] [2025-02-06 09:31:23,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:23,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 09:31:23,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:23,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 09:31:23,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 09:31:23,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 515 [2025-02-06 09:31:23,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 424 transitions, 869 flow. Second operand has 7 states, 7 states have (on average 459.14285714285717) internal successors, (3214), 7 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:23,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:23,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 515 [2025-02-06 09:31:23,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:24,157 INFO L124 PetriNetUnfolderBase]: 37/1068 cut-off events. [2025-02-06 09:31:24,157 INFO L125 PetriNetUnfolderBase]: For 7/31 co-relation queries the response was YES. [2025-02-06 09:31:24,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1243 conditions, 1068 events. 37/1068 cut-off events. For 7/31 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3874 event pairs, 14 based on Foata normal form. 4/1006 useless extension candidates. Maximal degree in co-relation 1209. Up to 51 conditions per place. [2025-02-06 09:31:24,170 INFO L140 encePairwiseOnDemand]: 486/515 looper letters, 40 selfloop transitions, 42 changer transitions 0/467 dead transitions. [2025-02-06 09:31:24,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 467 transitions, 1127 flow [2025-02-06 09:31:24,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 09:31:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 09:31:24,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2025-02-06 09:31:24,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8996116504854369 [2025-02-06 09:31:24,181 INFO L175 Difference]: Start difference. First operand has 430 places, 424 transitions, 869 flow. Second operand 10 states and 4633 transitions. [2025-02-06 09:31:24,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 467 transitions, 1127 flow [2025-02-06 09:31:24,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 467 transitions, 1123 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:24,189 INFO L231 Difference]: Finished difference. Result has 437 places, 449 transitions, 1057 flow [2025-02-06 09:31:24,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1057, PETRI_PLACES=437, PETRI_TRANSITIONS=449} [2025-02-06 09:31:24,191 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -18 predicate places. [2025-02-06 09:31:24,191 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 449 transitions, 1057 flow [2025-02-06 09:31:24,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 459.14285714285717) internal successors, (3214), 7 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:24,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:24,194 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:24,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:31:24,194 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-02-06 09:31:24,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:24,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1673896710, now seen corresponding path program 1 times [2025-02-06 09:31:24,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:24,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671626688] [2025-02-06 09:31:24,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:24,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:24,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 09:31:24,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 09:31:24,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:24,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:24,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:24,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:24,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671626688] [2025-02-06 09:31:24,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671626688] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:24,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:24,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:24,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980183451] [2025-02-06 09:31:24,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:24,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:24,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:24,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:24,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:24,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-02-06 09:31:24,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 449 transitions, 1057 flow. Second operand has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:24,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:24,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-02-06 09:31:24,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:24,700 INFO L124 PetriNetUnfolderBase]: 113/3049 cut-off events. [2025-02-06 09:31:24,700 INFO L125 PetriNetUnfolderBase]: For 59/63 co-relation queries the response was YES. [2025-02-06 09:31:24,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3356 conditions, 3049 events. 113/3049 cut-off events. For 59/63 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 19832 event pairs, 11 based on Foata normal form. 0/2759 useless extension candidates. Maximal degree in co-relation 3317. Up to 144 conditions per place. [2025-02-06 09:31:24,739 INFO L140 encePairwiseOnDemand]: 511/515 looper letters, 15 selfloop transitions, 2 changer transitions 0/453 dead transitions. [2025-02-06 09:31:24,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 453 transitions, 1103 flow [2025-02-06 09:31:24,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:24,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:24,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1462 transitions. [2025-02-06 09:31:24,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9462783171521035 [2025-02-06 09:31:24,744 INFO L175 Difference]: Start difference. First operand has 437 places, 449 transitions, 1057 flow. Second operand 3 states and 1462 transitions. [2025-02-06 09:31:24,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 453 transitions, 1103 flow [2025-02-06 09:31:24,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 453 transitions, 1103 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:31:24,751 INFO L231 Difference]: Finished difference. Result has 438 places, 449 transitions, 1067 flow [2025-02-06 09:31:24,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1053, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1067, PETRI_PLACES=438, PETRI_TRANSITIONS=449} [2025-02-06 09:31:24,753 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -17 predicate places. [2025-02-06 09:31:24,753 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 449 transitions, 1067 flow [2025-02-06 09:31:24,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:24,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:24,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:24,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:31:24,755 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-02-06 09:31:24,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:24,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1507872942, now seen corresponding path program 1 times [2025-02-06 09:31:24,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:24,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552176574] [2025-02-06 09:31:24,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:24,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:24,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 09:31:24,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 09:31:24,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:24,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:24,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:24,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:24,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552176574] [2025-02-06 09:31:24,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552176574] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:24,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:24,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:24,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282428003] [2025-02-06 09:31:24,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:24,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:24,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:24,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:24,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:24,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-02-06 09:31:24,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 449 transitions, 1067 flow. Second operand has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:24,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:24,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-02-06 09:31:24,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:25,160 INFO L124 PetriNetUnfolderBase]: 102/2072 cut-off events. [2025-02-06 09:31:25,161 INFO L125 PetriNetUnfolderBase]: For 80/90 co-relation queries the response was YES. [2025-02-06 09:31:25,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2405 conditions, 2072 events. 102/2072 cut-off events. For 80/90 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 11411 event pairs, 2 based on Foata normal form. 0/1906 useless extension candidates. Maximal degree in co-relation 2365. Up to 124 conditions per place. [2025-02-06 09:31:25,182 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 14 selfloop transitions, 1 changer transitions 0/451 dead transitions. [2025-02-06 09:31:25,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 451 transitions, 1104 flow [2025-02-06 09:31:25,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:25,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:25,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1460 transitions. [2025-02-06 09:31:25,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9449838187702265 [2025-02-06 09:31:25,185 INFO L175 Difference]: Start difference. First operand has 438 places, 449 transitions, 1067 flow. Second operand 3 states and 1460 transitions. [2025-02-06 09:31:25,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 451 transitions, 1104 flow [2025-02-06 09:31:25,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 451 transitions, 1104 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:31:25,196 INFO L231 Difference]: Finished difference. Result has 439 places, 448 transitions, 1070 flow [2025-02-06 09:31:25,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1063, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1070, PETRI_PLACES=439, PETRI_TRANSITIONS=448} [2025-02-06 09:31:25,198 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -16 predicate places. [2025-02-06 09:31:25,199 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 448 transitions, 1070 flow [2025-02-06 09:31:25,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:25,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:25,200 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:25,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:31:25,200 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-02-06 09:31:25,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:25,201 INFO L85 PathProgramCache]: Analyzing trace with hash 56070121, now seen corresponding path program 1 times [2025-02-06 09:31:25,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:25,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960967326] [2025-02-06 09:31:25,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:25,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:25,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 09:31:25,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 09:31:25,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:25,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:25,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:25,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:25,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960967326] [2025-02-06 09:31:25,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960967326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:25,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:25,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 09:31:25,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645514666] [2025-02-06 09:31:25,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:25,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 09:31:25,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:25,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 09:31:25,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 09:31:25,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 515 [2025-02-06 09:31:25,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 448 transitions, 1070 flow. Second operand has 7 states, 7 states have (on average 459.2857142857143) internal successors, (3215), 7 states have internal predecessors, (3215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:25,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:25,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 515 [2025-02-06 09:31:25,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:25,993 INFO L124 PetriNetUnfolderBase]: 73/1499 cut-off events. [2025-02-06 09:31:25,994 INFO L125 PetriNetUnfolderBase]: For 103/173 co-relation queries the response was YES. [2025-02-06 09:31:26,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1846 conditions, 1499 events. 73/1499 cut-off events. For 103/173 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7106 event pairs, 28 based on Foata normal form. 4/1395 useless extension candidates. Maximal degree in co-relation 1803. Up to 99 conditions per place. [2025-02-06 09:31:26,014 INFO L140 encePairwiseOnDemand]: 486/515 looper letters, 40 selfloop transitions, 42 changer transitions 0/468 dead transitions. [2025-02-06 09:31:26,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 468 transitions, 1302 flow [2025-02-06 09:31:26,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 09:31:26,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 09:31:26,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2025-02-06 09:31:26,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8996116504854369 [2025-02-06 09:31:26,024 INFO L175 Difference]: Start difference. First operand has 439 places, 448 transitions, 1070 flow. Second operand 10 states and 4633 transitions. [2025-02-06 09:31:26,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 468 transitions, 1302 flow [2025-02-06 09:31:26,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 468 transitions, 1302 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:31:26,034 INFO L231 Difference]: Finished difference. Result has 450 places, 450 transitions, 1175 flow [2025-02-06 09:31:26,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1175, PETRI_PLACES=450, PETRI_TRANSITIONS=450} [2025-02-06 09:31:26,036 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2025-02-06 09:31:26,036 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 450 transitions, 1175 flow [2025-02-06 09:31:26,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 459.2857142857143) internal successors, (3215), 7 states have internal predecessors, (3215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:26,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:26,038 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:26,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:31:26,038 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-02-06 09:31:26,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:26,039 INFO L85 PathProgramCache]: Analyzing trace with hash -87464138, now seen corresponding path program 1 times [2025-02-06 09:31:26,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:26,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135332934] [2025-02-06 09:31:26,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:26,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:26,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-06 09:31:26,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 09:31:26,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:26,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:26,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:26,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:26,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135332934] [2025-02-06 09:31:26,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135332934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:26,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:26,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 09:31:26,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318288370] [2025-02-06 09:31:26,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:26,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 09:31:26,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:26,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 09:31:26,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 09:31:26,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 515 [2025-02-06 09:31:26,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 450 transitions, 1175 flow. Second operand has 7 states, 7 states have (on average 459.42857142857144) internal successors, (3216), 7 states have internal predecessors, (3216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:26,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:26,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 515 [2025-02-06 09:31:26,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:26,979 INFO L124 PetriNetUnfolderBase]: 72/1494 cut-off events. [2025-02-06 09:31:26,980 INFO L125 PetriNetUnfolderBase]: For 169/176 co-relation queries the response was YES. [2025-02-06 09:31:26,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1886 conditions, 1494 events. 72/1494 cut-off events. For 169/176 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6873 event pairs, 29 based on Foata normal form. 3/1400 useless extension candidates. Maximal degree in co-relation 1837. Up to 98 conditions per place. [2025-02-06 09:31:26,998 INFO L140 encePairwiseOnDemand]: 486/515 looper letters, 40 selfloop transitions, 42 changer transitions 0/470 dead transitions. [2025-02-06 09:31:26,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 470 transitions, 1407 flow [2025-02-06 09:31:26,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 09:31:26,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 09:31:27,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2025-02-06 09:31:27,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8996116504854369 [2025-02-06 09:31:27,009 INFO L175 Difference]: Start difference. First operand has 450 places, 450 transitions, 1175 flow. Second operand 10 states and 4633 transitions. [2025-02-06 09:31:27,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 470 transitions, 1407 flow [2025-02-06 09:31:27,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 470 transitions, 1334 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-06 09:31:27,018 INFO L231 Difference]: Finished difference. Result has 454 places, 452 transitions, 1207 flow [2025-02-06 09:31:27,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1207, PETRI_PLACES=454, PETRI_TRANSITIONS=452} [2025-02-06 09:31:27,020 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -1 predicate places. [2025-02-06 09:31:27,021 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 452 transitions, 1207 flow [2025-02-06 09:31:27,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 459.42857142857144) internal successors, (3216), 7 states have internal predecessors, (3216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:27,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:27,022 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:27,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:31:27,022 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-02-06 09:31:27,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:27,024 INFO L85 PathProgramCache]: Analyzing trace with hash -915325476, now seen corresponding path program 1 times [2025-02-06 09:31:27,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:27,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391316483] [2025-02-06 09:31:27,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:27,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:27,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 09:31:27,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 09:31:27,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:27,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:27,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:27,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391316483] [2025-02-06 09:31:27,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391316483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:27,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:27,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:27,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738902875] [2025-02-06 09:31:27,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:27,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:27,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:27,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:27,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:27,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-02-06 09:31:27,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 452 transitions, 1207 flow. Second operand has 3 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:27,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:27,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-02-06 09:31:27,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:27,291 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1227] L68-22-->L68-20: Formula: (= |v_#race~csum~0_6| 0) InVars {} OutVars{#race~csum~0=|v_#race~csum~0_6|} AuxVars[] AssignedVars[#race~csum~0][403], [560#(= |#race~C~0| 0), Black: 568#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 567#(<= ~N~0 0), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 545#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 73#L68-20true, Black: 538#(<= ~N~0 0), Black: 539#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), 602#(= |#race~csum~0| 0), Black: 554#true, Black: 558#true, Black: 526#true, 556#(= |#race~B~0| 0), 90#L88true, Black: 586#(<= ~N~0 0), Black: 587#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~N~0 0)), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 581#true, 562#true]) [2025-02-06 09:31:27,292 INFO L294 olderBase$Statistics]: this new event has 356 ancestors and is cut-off event [2025-02-06 09:31:27,292 INFO L297 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2025-02-06 09:31:27,292 INFO L297 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2025-02-06 09:31:27,292 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2025-02-06 09:31:27,314 INFO L124 PetriNetUnfolderBase]: 48/1185 cut-off events. [2025-02-06 09:31:27,314 INFO L125 PetriNetUnfolderBase]: For 94/98 co-relation queries the response was YES. [2025-02-06 09:31:27,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 1185 events. 48/1185 cut-off events. For 94/98 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4395 event pairs, 3 based on Foata normal form. 6/1127 useless extension candidates. Maximal degree in co-relation 1423. Up to 37 conditions per place. [2025-02-06 09:31:27,324 INFO L140 encePairwiseOnDemand]: 510/515 looper letters, 8 selfloop transitions, 2 changer transitions 28/452 dead transitions. [2025-02-06 09:31:27,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 452 transitions, 1233 flow [2025-02-06 09:31:27,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:27,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:27,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1457 transitions. [2025-02-06 09:31:27,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.943042071197411 [2025-02-06 09:31:27,329 INFO L175 Difference]: Start difference. First operand has 454 places, 452 transitions, 1207 flow. Second operand 3 states and 1457 transitions. [2025-02-06 09:31:27,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 452 transitions, 1233 flow [2025-02-06 09:31:27,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 452 transitions, 1160 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-06 09:31:27,338 INFO L231 Difference]: Finished difference. Result has 447 places, 422 transitions, 975 flow [2025-02-06 09:31:27,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=975, PETRI_PLACES=447, PETRI_TRANSITIONS=422} [2025-02-06 09:31:27,340 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -8 predicate places. [2025-02-06 09:31:27,340 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 422 transitions, 975 flow [2025-02-06 09:31:27,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:27,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:27,341 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:27,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:31:27,341 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-02-06 09:31:27,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:27,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1013055407, now seen corresponding path program 1 times [2025-02-06 09:31:27,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:27,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059902435] [2025-02-06 09:31:27,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:27,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:27,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-06 09:31:27,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-06 09:31:27,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:27,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:28,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:31:28,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:28,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059902435] [2025-02-06 09:31:28,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059902435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:28,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:28,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:31:28,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003128665] [2025-02-06 09:31:28,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:28,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:31:28,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:28,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:31:28,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:31:28,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 515 [2025-02-06 09:31:28,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 422 transitions, 975 flow. Second operand has 6 states, 6 states have (on average 464.5) internal successors, (2787), 6 states have internal predecessors, (2787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:28,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:28,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 515 [2025-02-06 09:31:28,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:28,832 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][372], [560#(= |#race~C~0| 0), Black: 568#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 567#(<= ~N~0 0), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 545#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 538#(<= ~N~0 0), Black: 539#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), 600#true, Black: 554#true, Black: 558#true, Black: 526#true, 556#(= |#race~B~0| 0), 90#L88true, 603#true, Black: 586#(<= ~N~0 0), 507#(= |#race~N~0| 0), Black: 587#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~N~0 0)), 528#(= |#race~A~0| 0), 430#L67-7true, 562#true]) [2025-02-06 09:31:28,832 INFO L294 olderBase$Statistics]: this new event has 347 ancestors and is cut-off event [2025-02-06 09:31:28,832 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-02-06 09:31:28,832 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-02-06 09:31:28,832 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-02-06 09:31:29,003 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1217] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][372], [560#(= |#race~C~0| 0), Black: 568#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 567#(<= ~N~0 0), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 545#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 538#(<= ~N~0 0), Black: 539#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), 600#true, Black: 554#true, Black: 526#true, Black: 558#true, 556#(= |#race~B~0| 0), 603#true, 90#L88true, Black: 586#(<= ~N~0 0), Black: 587#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~N~0 0)), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 430#L67-7true, 562#true]) [2025-02-06 09:31:29,003 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2025-02-06 09:31:29,003 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-02-06 09:31:29,003 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2025-02-06 09:31:29,003 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-02-06 09:31:29,003 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-02-06 09:31:29,012 INFO L124 PetriNetUnfolderBase]: 203/3554 cut-off events. [2025-02-06 09:31:29,012 INFO L125 PetriNetUnfolderBase]: For 56/77 co-relation queries the response was YES. [2025-02-06 09:31:29,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4247 conditions, 3554 events. 203/3554 cut-off events. For 56/77 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 25962 event pairs, 44 based on Foata normal form. 4/3276 useless extension candidates. Maximal degree in co-relation 4196. Up to 292 conditions per place. [2025-02-06 09:31:29,066 INFO L140 encePairwiseOnDemand]: 504/515 looper letters, 39 selfloop transitions, 22 changer transitions 0/451 dead transitions. [2025-02-06 09:31:29,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 451 transitions, 1163 flow [2025-02-06 09:31:29,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:31:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:31:29,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2828 transitions. [2025-02-06 09:31:29,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.915210355987055 [2025-02-06 09:31:29,073 INFO L175 Difference]: Start difference. First operand has 447 places, 422 transitions, 975 flow. Second operand 6 states and 2828 transitions. [2025-02-06 09:31:29,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 451 transitions, 1163 flow [2025-02-06 09:31:29,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 451 transitions, 1087 flow, removed 14 selfloop flow, removed 15 redundant places. [2025-02-06 09:31:29,086 INFO L231 Difference]: Finished difference. Result has 434 places, 443 transitions, 1049 flow [2025-02-06 09:31:29,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1049, PETRI_PLACES=434, PETRI_TRANSITIONS=443} [2025-02-06 09:31:29,087 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -21 predicate places. [2025-02-06 09:31:29,087 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 443 transitions, 1049 flow [2025-02-06 09:31:29,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.5) internal successors, (2787), 6 states have internal predecessors, (2787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:29,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:29,092 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:29,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:31:29,092 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-02-06 09:31:29,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:29,093 INFO L85 PathProgramCache]: Analyzing trace with hash 801998382, now seen corresponding path program 1 times [2025-02-06 09:31:29,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:29,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398941588] [2025-02-06 09:31:29,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:29,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:29,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-06 09:31:29,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-06 09:31:29,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:29,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:31:29,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:29,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398941588] [2025-02-06 09:31:29,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398941588] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:29,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:29,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:31:29,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713783281] [2025-02-06 09:31:29,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:29,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:31:29,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:29,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:31:29,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:31:30,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 515 [2025-02-06 09:31:30,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 443 transitions, 1049 flow. Second operand has 6 states, 6 states have (on average 464.6666666666667) internal successors, (2788), 6 states have internal predecessors, (2788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:30,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:30,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 515 [2025-02-06 09:31:30,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:31,501 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1108] L59-21-->L59-19: Formula: (= |v_#race~B~0_3| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_3|} AuxVars[] AssignedVars[#race~B~0][288], [Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, 560#(= |#race~C~0| 0), 289#L87true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 50#L59-19true, Black: 554#true, Black: 558#true, Black: 526#true, 556#(= |#race~B~0| 0), 74#L67-23true, 603#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-02-06 09:31:31,501 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2025-02-06 09:31:31,501 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-02-06 09:31:31,501 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2025-02-06 09:31:31,501 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-02-06 09:31:32,072 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][371], [Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 560#(= |#race~C~0| 0), 614#true, 289#L87true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 554#true, 155#L62true, Black: 526#true, Black: 558#true, 556#(= |#race~B~0| 0), 603#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 430#L67-7true]) [2025-02-06 09:31:32,072 INFO L294 olderBase$Statistics]: this new event has 350 ancestors and is cut-off event [2025-02-06 09:31:32,072 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-02-06 09:31:32,072 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-06 09:31:32,072 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-06 09:31:32,106 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][371], [Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 560#(= |#race~C~0| 0), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 554#true, Black: 558#true, Black: 526#true, 556#(= |#race~B~0| 0), 90#L88true, 603#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 430#L67-7true]) [2025-02-06 09:31:32,106 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2025-02-06 09:31:32,106 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-02-06 09:31:32,106 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-02-06 09:31:32,106 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-02-06 09:31:32,235 INFO L124 PetriNetUnfolderBase]: 1328/14868 cut-off events. [2025-02-06 09:31:32,235 INFO L125 PetriNetUnfolderBase]: For 1655/1737 co-relation queries the response was YES. [2025-02-06 09:31:32,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18895 conditions, 14868 events. 1328/14868 cut-off events. For 1655/1737 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 172083 event pairs, 205 based on Foata normal form. 0/13463 useless extension candidates. Maximal degree in co-relation 18855. Up to 1392 conditions per place. [2025-02-06 09:31:32,351 INFO L140 encePairwiseOnDemand]: 504/515 looper letters, 55 selfloop transitions, 86 changer transitions 0/536 dead transitions. [2025-02-06 09:31:32,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 536 transitions, 1813 flow [2025-02-06 09:31:32,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:31:32,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:31:32,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2828 transitions. [2025-02-06 09:31:32,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.915210355987055 [2025-02-06 09:31:32,356 INFO L175 Difference]: Start difference. First operand has 434 places, 443 transitions, 1049 flow. Second operand 6 states and 2828 transitions. [2025-02-06 09:31:32,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 536 transitions, 1813 flow [2025-02-06 09:31:32,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 536 transitions, 1813 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:31:32,376 INFO L231 Difference]: Finished difference. Result has 444 places, 528 transitions, 1903 flow [2025-02-06 09:31:32,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1903, PETRI_PLACES=444, PETRI_TRANSITIONS=528} [2025-02-06 09:31:32,378 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -11 predicate places. [2025-02-06 09:31:32,379 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 528 transitions, 1903 flow [2025-02-06 09:31:32,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.6666666666667) internal successors, (2788), 6 states have internal predecessors, (2788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:32,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:32,381 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:32,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:31:32,381 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-02-06 09:31:32,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:32,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1166223941, now seen corresponding path program 1 times [2025-02-06 09:31:32,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:32,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238420786] [2025-02-06 09:31:32,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:32,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:32,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-06 09:31:32,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-06 09:31:32,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:32,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:32,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:31:32,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:32,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238420786] [2025-02-06 09:31:32,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238420786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:32,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:32,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:31:32,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453445260] [2025-02-06 09:31:32,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:32,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:31:32,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:32,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:31:32,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:31:33,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 515 [2025-02-06 09:31:33,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 528 transitions, 1903 flow. Second operand has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:33,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:33,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 515 [2025-02-06 09:31:33,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:35,258 INFO L124 PetriNetUnfolderBase]: 1151/12311 cut-off events. [2025-02-06 09:31:35,258 INFO L125 PetriNetUnfolderBase]: For 3743/3853 co-relation queries the response was YES. [2025-02-06 09:31:35,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17463 conditions, 12311 events. 1151/12311 cut-off events. For 3743/3853 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 136245 event pairs, 132 based on Foata normal form. 0/11311 useless extension candidates. Maximal degree in co-relation 17418. Up to 1063 conditions per place. [2025-02-06 09:31:35,414 INFO L140 encePairwiseOnDemand]: 509/515 looper letters, 106 selfloop transitions, 29 changer transitions 0/535 dead transitions. [2025-02-06 09:31:35,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 535 transitions, 2195 flow [2025-02-06 09:31:35,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:31:35,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:31:35,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2806 transitions. [2025-02-06 09:31:35,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9080906148867314 [2025-02-06 09:31:35,421 INFO L175 Difference]: Start difference. First operand has 444 places, 528 transitions, 1903 flow. Second operand 6 states and 2806 transitions. [2025-02-06 09:31:35,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 535 transitions, 2195 flow [2025-02-06 09:31:35,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 535 transitions, 2195 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:31:35,440 INFO L231 Difference]: Finished difference. Result has 448 places, 527 transitions, 1959 flow [2025-02-06 09:31:35,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1901, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1959, PETRI_PLACES=448, PETRI_TRANSITIONS=527} [2025-02-06 09:31:35,441 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -7 predicate places. [2025-02-06 09:31:35,442 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 527 transitions, 1959 flow [2025-02-06 09:31:35,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:35,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:35,443 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:35,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 09:31:35,443 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-02-06 09:31:35,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:35,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1944176225, now seen corresponding path program 1 times [2025-02-06 09:31:35,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:35,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28661294] [2025-02-06 09:31:35,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:35,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:35,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-06 09:31:35,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-06 09:31:35,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:35,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:36,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:31:36,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:36,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28661294] [2025-02-06 09:31:36,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28661294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:36,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:36,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:31:36,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49526037] [2025-02-06 09:31:36,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:36,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:31:36,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:36,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:31:36,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:31:36,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 515 [2025-02-06 09:31:36,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 527 transitions, 1959 flow. Second operand has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:36,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:36,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 515 [2025-02-06 09:31:36,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:38,356 INFO L124 PetriNetUnfolderBase]: 1146/12228 cut-off events. [2025-02-06 09:31:38,356 INFO L125 PetriNetUnfolderBase]: For 4434/4544 co-relation queries the response was YES. [2025-02-06 09:31:38,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17858 conditions, 12228 events. 1146/12228 cut-off events. For 4434/4544 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 135258 event pairs, 132 based on Foata normal form. 0/11295 useless extension candidates. Maximal degree in co-relation 17812. Up to 1063 conditions per place. [2025-02-06 09:31:38,439 INFO L140 encePairwiseOnDemand]: 509/515 looper letters, 106 selfloop transitions, 29 changer transitions 0/534 dead transitions. [2025-02-06 09:31:38,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 534 transitions, 2251 flow [2025-02-06 09:31:38,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:31:38,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:31:38,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2806 transitions. [2025-02-06 09:31:38,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9080906148867314 [2025-02-06 09:31:38,444 INFO L175 Difference]: Start difference. First operand has 448 places, 527 transitions, 1959 flow. Second operand 6 states and 2806 transitions. [2025-02-06 09:31:38,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 534 transitions, 2251 flow [2025-02-06 09:31:38,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 534 transitions, 2193 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:31:38,461 INFO L231 Difference]: Finished difference. Result has 447 places, 526 transitions, 1957 flow [2025-02-06 09:31:38,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1899, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1957, PETRI_PLACES=447, PETRI_TRANSITIONS=526} [2025-02-06 09:31:38,462 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -8 predicate places. [2025-02-06 09:31:38,462 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 526 transitions, 1957 flow [2025-02-06 09:31:38,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:38,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:38,464 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:38,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 09:31:38,464 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-02-06 09:31:38,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:38,465 INFO L85 PathProgramCache]: Analyzing trace with hash 833842206, now seen corresponding path program 1 times [2025-02-06 09:31:38,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:38,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755177271] [2025-02-06 09:31:38,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:38,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:38,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-06 09:31:38,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-06 09:31:38,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:38,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:38,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:31:38,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:38,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755177271] [2025-02-06 09:31:38,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755177271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:38,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:38,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:38,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165973717] [2025-02-06 09:31:38,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:38,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:38,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:38,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:38,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:38,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-02-06 09:31:38,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 526 transitions, 1957 flow. Second operand has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:38,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:38,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-02-06 09:31:38,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:40,782 INFO L124 PetriNetUnfolderBase]: 980/13163 cut-off events. [2025-02-06 09:31:40,782 INFO L125 PetriNetUnfolderBase]: For 2584/2700 co-relation queries the response was YES. [2025-02-06 09:31:40,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17772 conditions, 13163 events. 980/13163 cut-off events. For 2584/2700 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 146360 event pairs, 79 based on Foata normal form. 1/12214 useless extension candidates. Maximal degree in co-relation 17727. Up to 848 conditions per place. [2025-02-06 09:31:40,882 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 10 selfloop transitions, 2 changer transitions 0/527 dead transitions. [2025-02-06 09:31:40,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 527 transitions, 1985 flow [2025-02-06 09:31:40,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:40,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1456 transitions. [2025-02-06 09:31:40,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423948220064725 [2025-02-06 09:31:40,885 INFO L175 Difference]: Start difference. First operand has 447 places, 526 transitions, 1957 flow. Second operand 3 states and 1456 transitions. [2025-02-06 09:31:40,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 527 transitions, 1985 flow [2025-02-06 09:31:40,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 527 transitions, 1927 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:31:40,899 INFO L231 Difference]: Finished difference. Result has 443 places, 525 transitions, 1901 flow [2025-02-06 09:31:40,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1901, PETRI_PLACES=443, PETRI_TRANSITIONS=525} [2025-02-06 09:31:40,900 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -12 predicate places. [2025-02-06 09:31:40,900 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 525 transitions, 1901 flow [2025-02-06 09:31:40,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:40,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:40,901 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:40,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 09:31:40,902 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-02-06 09:31:40,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:40,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1352829699, now seen corresponding path program 1 times [2025-02-06 09:31:40,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:40,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133951632] [2025-02-06 09:31:40,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:40,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:40,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-06 09:31:40,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-06 09:31:40,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:40,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:40,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:31:40,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:40,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133951632] [2025-02-06 09:31:40,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133951632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:40,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:40,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:40,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046524666] [2025-02-06 09:31:40,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:40,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:40,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:40,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:40,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:41,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-02-06 09:31:41,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 525 transitions, 1901 flow. Second operand has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:41,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:41,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-02-06 09:31:41,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:43,174 INFO L124 PetriNetUnfolderBase]: 1055/13325 cut-off events. [2025-02-06 09:31:43,174 INFO L125 PetriNetUnfolderBase]: For 2010/2135 co-relation queries the response was YES. [2025-02-06 09:31:43,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17599 conditions, 13325 events. 1055/13325 cut-off events. For 2010/2135 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 149986 event pairs, 101 based on Foata normal form. 1/12389 useless extension candidates. Maximal degree in co-relation 17554. Up to 858 conditions per place. [2025-02-06 09:31:43,299 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 10 selfloop transitions, 2 changer transitions 0/526 dead transitions. [2025-02-06 09:31:43,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 526 transitions, 1929 flow [2025-02-06 09:31:43,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:43,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:43,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1456 transitions. [2025-02-06 09:31:43,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423948220064725 [2025-02-06 09:31:43,301 INFO L175 Difference]: Start difference. First operand has 443 places, 525 transitions, 1901 flow. Second operand 3 states and 1456 transitions. [2025-02-06 09:31:43,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 526 transitions, 1929 flow [2025-02-06 09:31:43,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 526 transitions, 1925 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:43,316 INFO L231 Difference]: Finished difference. Result has 442 places, 524 transitions, 1899 flow [2025-02-06 09:31:43,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1899, PETRI_PLACES=442, PETRI_TRANSITIONS=524} [2025-02-06 09:31:43,317 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -13 predicate places. [2025-02-06 09:31:43,317 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 524 transitions, 1899 flow [2025-02-06 09:31:43,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:43,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:43,318 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:43,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 09:31:43,318 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-02-06 09:31:43,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:43,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1995480872, now seen corresponding path program 1 times [2025-02-06 09:31:43,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:43,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180181491] [2025-02-06 09:31:43,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:43,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:43,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-02-06 09:31:43,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-02-06 09:31:43,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:43,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:43,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:31:43,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:43,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180181491] [2025-02-06 09:31:43,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180181491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:43,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:43,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:31:43,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662798246] [2025-02-06 09:31:43,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:43,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:31:43,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:43,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:31:43,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:31:44,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 515 [2025-02-06 09:31:44,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 524 transitions, 1899 flow. Second operand has 6 states, 6 states have (on average 447.3333333333333) internal successors, (2684), 6 states have internal predecessors, (2684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:44,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:44,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 515 [2025-02-06 09:31:44,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:49,547 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][535], [614#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 560#(= |#race~C~0| 0), Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#true, Black: 554#true, Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 526#true, Black: 558#true, 556#(= |#race~B~0| 0), 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 603#true, 507#(= |#race~N~0| 0), 282#L85-1true, 528#(= |#race~A~0| 0), 430#L67-7true, 93#L59-13true, 202#L51-13true]) [2025-02-06 09:31:49,547 INFO L294 olderBase$Statistics]: this new event has 363 ancestors and is cut-off event [2025-02-06 09:31:49,547 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-02-06 09:31:49,547 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-02-06 09:31:49,547 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-02-06 09:31:49,684 INFO L124 PetriNetUnfolderBase]: 6087/33196 cut-off events. [2025-02-06 09:31:49,685 INFO L125 PetriNetUnfolderBase]: For 11989/12104 co-relation queries the response was YES. [2025-02-06 09:31:49,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55272 conditions, 33196 events. 6087/33196 cut-off events. For 11989/12104 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 407210 event pairs, 2256 based on Foata normal form. 0/31183 useless extension candidates. Maximal degree in co-relation 55226. Up to 8926 conditions per place. [2025-02-06 09:31:50,037 INFO L140 encePairwiseOnDemand]: 500/515 looper letters, 136 selfloop transitions, 77 changer transitions 0/584 dead transitions. [2025-02-06 09:31:50,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 584 transitions, 2629 flow [2025-02-06 09:31:50,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:31:50,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:31:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2749 transitions. [2025-02-06 09:31:50,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8896440129449839 [2025-02-06 09:31:50,042 INFO L175 Difference]: Start difference. First operand has 442 places, 524 transitions, 1899 flow. Second operand 6 states and 2749 transitions. [2025-02-06 09:31:50,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 584 transitions, 2629 flow [2025-02-06 09:31:50,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 584 transitions, 2625 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:50,104 INFO L231 Difference]: Finished difference. Result has 450 places, 576 transitions, 2541 flow [2025-02-06 09:31:50,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2541, PETRI_PLACES=450, PETRI_TRANSITIONS=576} [2025-02-06 09:31:50,105 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2025-02-06 09:31:50,105 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 576 transitions, 2541 flow [2025-02-06 09:31:50,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.3333333333333) internal successors, (2684), 6 states have internal predecessors, (2684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:50,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:50,106 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:50,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 09:31:50,106 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-02-06 09:31:50,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:50,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1258043841, now seen corresponding path program 1 times [2025-02-06 09:31:50,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:50,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333888020] [2025-02-06 09:31:50,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:50,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:50,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-06 09:31:50,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-06 09:31:50,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:50,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:52,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:31:52,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:52,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333888020] [2025-02-06 09:31:52,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333888020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:52,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:52,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-02-06 09:31:52,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773539078] [2025-02-06 09:31:52,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:52,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 09:31:52,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:52,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 09:31:52,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2025-02-06 09:31:55,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 515 [2025-02-06 09:31:55,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 576 transitions, 2541 flow. Second operand has 22 states, 22 states have (on average 429.5) internal successors, (9449), 22 states have internal predecessors, (9449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:55,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:55,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 515 [2025-02-06 09:31:55,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:01,861 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1284] thread2EXIT-->L88: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][268], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, 90#L88true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 253#L67-25true, Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 556#(= |#race~B~0| 0), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-02-06 09:32:01,862 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2025-02-06 09:32:01,862 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2025-02-06 09:32:01,862 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-02-06 09:32:01,862 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2025-02-06 09:32:02,449 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1284] thread2EXIT-->L88: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][268], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 90#L88true, 603#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 253#L67-25true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 556#(= |#race~B~0| 0), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-02-06 09:32:02,449 INFO L294 olderBase$Statistics]: this new event has 365 ancestors and is cut-off event [2025-02-06 09:32:02,449 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2025-02-06 09:32:02,449 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-02-06 09:32:02,449 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-02-06 09:32:02,449 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2025-02-06 09:32:04,592 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][407], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, 430#L67-7true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 554#true, Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 115#L54true, 556#(= |#race~B~0| 0), 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 507#(= |#race~N~0| 0), 282#L85-1true, 528#(= |#race~A~0| 0), 93#L59-13true]) [2025-02-06 09:32:04,593 INFO L294 olderBase$Statistics]: this new event has 354 ancestors and is cut-off event [2025-02-06 09:32:04,593 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-02-06 09:32:04,593 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-02-06 09:32:04,593 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2025-02-06 09:32:04,663 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1179] L67-25-->L67-23: Formula: (= |v_#race~B~0_6| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_6|} AuxVars[] AssignedVars[#race~B~0][287], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 50#L59-19true, 66#L50-2true, Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 556#(= |#race~B~0| 0), 74#L67-23true, 507#(= |#race~N~0| 0), 282#L85-1true, 528#(= |#race~A~0| 0)]) [2025-02-06 09:32:04,664 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is cut-off event [2025-02-06 09:32:04,664 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2025-02-06 09:32:04,664 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2025-02-06 09:32:04,664 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2025-02-06 09:32:04,827 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][407], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, 430#L67-7true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, 289#L87true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 556#(= |#race~B~0| 0), 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 93#L59-13true]) [2025-02-06 09:32:04,827 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is cut-off event [2025-02-06 09:32:04,828 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2025-02-06 09:32:04,828 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2025-02-06 09:32:04,828 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2025-02-06 09:32:06,920 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1219] L67-6-->L67-5: Formula: (= (store |v_#race_36| v_~C~0.base_11 (store (select |v_#race_36| v_~C~0.base_11) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_43| 4) 2 v_~C~0.offset_11) |v_thread3Thread1of1ForFork0_#t~nondet12#1_7|)) |v_#race_35|) InVars {#race=|v_#race_36|, ~C~0.offset=v_~C~0.offset_11, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_43|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_7|, ~C~0.base=v_~C~0.base_11} OutVars{#race=|v_#race_35|, ~C~0.offset=v_~C~0.offset_11, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_43|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_7|, ~C~0.base=v_~C~0.base_11} AuxVars[] AssignedVars[#race][579], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, 165#L58-2true, 202#L51-13true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), 311#L67-5true, Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 556#(= |#race~B~0| 0), 507#(= |#race~N~0| 0), 282#L85-1true, 528#(= |#race~A~0| 0), 725#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0))]) [2025-02-06 09:32:06,920 INFO L294 olderBase$Statistics]: this new event has 396 ancestors and is cut-off event [2025-02-06 09:32:06,920 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-06 09:32:06,920 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-06 09:32:06,920 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-06 09:32:06,949 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1220] L67-5-->L67-3: Formula: (= (store |v_#race_34| v_~C~0.base_10 (store (select |v_#race_34| v_~C~0.base_10) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_45| 4) 3 v_~C~0.offset_10) |v_thread3Thread1of1ForFork0_#t~nondet12#1_9|)) |v_#race_33|) InVars {#race=|v_#race_34|, ~C~0.offset=v_~C~0.offset_10, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_45|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_9|, ~C~0.base=v_~C~0.base_10} OutVars{#race=|v_#race_33|, ~C~0.offset=v_~C~0.offset_10, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_45|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_9|, ~C~0.base=v_~C~0.base_10} AuxVars[] AssignedVars[#race][597], [560#(= |#race~C~0| 0), 493#L67-3true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, 165#L58-2true, 202#L51-13true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 556#(= |#race~B~0| 0), 507#(= |#race~N~0| 0), 282#L85-1true, 528#(= |#race~A~0| 0), 725#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0))]) [2025-02-06 09:32:06,949 INFO L294 olderBase$Statistics]: this new event has 397 ancestors and is cut-off event [2025-02-06 09:32:06,949 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-06 09:32:06,949 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-06 09:32:06,949 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-06 09:32:06,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][405], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, 430#L67-7true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 115#L54true, 556#(= |#race~B~0| 0), 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 507#(= |#race~N~0| 0), 282#L85-1true, 528#(= |#race~A~0| 0), 207#L59-14true]) [2025-02-06 09:32:06,962 INFO L294 olderBase$Statistics]: this new event has 397 ancestors and is cut-off event [2025-02-06 09:32:06,962 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-02-06 09:32:06,962 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-06 09:32:06,962 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-06 09:32:06,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][405], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, 430#L67-7true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, 289#L87true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 556#(= |#race~B~0| 0), 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 207#L59-14true]) [2025-02-06 09:32:06,962 INFO L294 olderBase$Statistics]: this new event has 402 ancestors and is cut-off event [2025-02-06 09:32:06,962 INFO L297 olderBase$Statistics]: existing Event has 261 ancestors and is cut-off event [2025-02-06 09:32:06,962 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2025-02-06 09:32:06,962 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2025-02-06 09:32:06,987 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][407], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 218#L59-12true, Black: 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, 430#L67-7true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, 289#L87true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 554#true, Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 556#(= |#race~B~0| 0), 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-02-06 09:32:06,987 INFO L294 olderBase$Statistics]: this new event has 403 ancestors and is cut-off event [2025-02-06 09:32:06,987 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2025-02-06 09:32:06,987 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2025-02-06 09:32:06,987 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is cut-off event [2025-02-06 09:32:06,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][407], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 218#L59-12true, Black: 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, 430#L67-7true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 554#true, Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 115#L54true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 556#(= |#race~B~0| 0), 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 507#(= |#race~N~0| 0), 282#L85-1true, 528#(= |#race~A~0| 0)]) [2025-02-06 09:32:06,988 INFO L294 olderBase$Statistics]: this new event has 398 ancestors and is cut-off event [2025-02-06 09:32:06,988 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-02-06 09:32:06,988 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-02-06 09:32:06,988 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-02-06 09:32:07,160 INFO L124 PetriNetUnfolderBase]: 8434/64624 cut-off events. [2025-02-06 09:32:07,160 INFO L125 PetriNetUnfolderBase]: For 49205/54887 co-relation queries the response was YES. [2025-02-06 09:32:07,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109651 conditions, 64624 events. 8434/64624 cut-off events. For 49205/54887 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 930989 event pairs, 1041 based on Foata normal form. 501/61130 useless extension candidates. Maximal degree in co-relation 109598. Up to 4505 conditions per place. [2025-02-06 09:32:07,958 INFO L140 encePairwiseOnDemand]: 480/515 looper letters, 493 selfloop transitions, 44 changer transitions 0/939 dead transitions. [2025-02-06 09:32:07,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 939 transitions, 7205 flow [2025-02-06 09:32:07,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-06 09:32:07,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-02-06 09:32:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 13770 transitions. [2025-02-06 09:32:07,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8355582524271845 [2025-02-06 09:32:07,965 INFO L175 Difference]: Start difference. First operand has 450 places, 576 transitions, 2541 flow. Second operand 32 states and 13770 transitions. [2025-02-06 09:32:07,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 939 transitions, 7205 flow [2025-02-06 09:32:08,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 939 transitions, 7169 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-02-06 09:32:08,177 INFO L231 Difference]: Finished difference. Result has 485 places, 593 transitions, 2700 flow [2025-02-06 09:32:08,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=2505, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=2700, PETRI_PLACES=485, PETRI_TRANSITIONS=593} [2025-02-06 09:32:08,178 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, 30 predicate places. [2025-02-06 09:32:08,178 INFO L471 AbstractCegarLoop]: Abstraction has has 485 places, 593 transitions, 2700 flow [2025-02-06 09:32:08,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 429.5) internal successors, (9449), 22 states have internal predecessors, (9449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:08,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:08,181 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:32:08,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 09:32:08,181 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-02-06 09:32:08,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:08,182 INFO L85 PathProgramCache]: Analyzing trace with hash 438196735, now seen corresponding path program 2 times [2025-02-06 09:32:08,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:08,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514110255] [2025-02-06 09:32:08,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:32:08,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:08,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 252 statements into 2 equivalence classes. [2025-02-06 09:32:08,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 207 of 252 statements. [2025-02-06 09:32:08,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:32:08,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:09,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:32:09,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:09,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514110255] [2025-02-06 09:32:09,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514110255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:09,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:09,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-02-06 09:32:09,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98674607] [2025-02-06 09:32:09,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:09,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 09:32:09,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:09,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 09:32:09,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2025-02-06 09:32:13,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 515 [2025-02-06 09:32:13,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 593 transitions, 2700 flow. Second operand has 22 states, 22 states have (on average 429.5) internal successors, (9449), 22 states have internal predecessors, (9449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:13,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:13,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 515 [2025-02-06 09:32:13,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:15,732 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1108] L59-21-->L59-19: Formula: (= |v_#race~B~0_3| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_3|} AuxVars[] AssignedVars[#race~B~0][294], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 50#L59-19true, Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 799#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 721#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 727#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 725#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 115#L54true, 556#(= |#race~B~0| 0), 74#L67-23true, 282#L85-1true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-02-06 09:32:15,732 INFO L294 olderBase$Statistics]: this new event has 309 ancestors and is cut-off event [2025-02-06 09:32:15,732 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-02-06 09:32:15,732 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2025-02-06 09:32:15,732 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2025-02-06 09:32:16,366 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1108] L59-21-->L59-19: Formula: (= |v_#race~B~0_3| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_3|} AuxVars[] AssignedVars[#race~B~0][294], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 50#L59-19true, Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 799#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 721#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 727#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 725#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, 289#L87true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 556#(= |#race~B~0| 0), 74#L67-23true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-02-06 09:32:16,366 INFO L294 olderBase$Statistics]: this new event has 314 ancestors and is cut-off event [2025-02-06 09:32:16,366 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-02-06 09:32:16,366 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2025-02-06 09:32:16,366 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event