./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur-race.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d76df1bfaca9781352b9c7afbe4683f5e649e880008edad8122f422eebb0dbe8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:12:23,074 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:12:23,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:12:23,111 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:12:23,111 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:12:23,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:12:23,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:12:23,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:12:23,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:12:23,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:12:23,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:12:23,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:12:23,125 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:12:23,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:12:23,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:12:23,125 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:12:23,126 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:12:23,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:12:23,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:12:23,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:12:23,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:12:23,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:12:23,126 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:12:23,126 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:12:23,126 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:12:23,126 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:12:23,126 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:12:23,126 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:12:23,127 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:12:23,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:12:23,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:12:23,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:12:23,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:12:23,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:12:23,127 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:12:23,127 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:12:23,127 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:12:23,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:12:23,128 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:12:23,128 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:12:23,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:12:23,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:12:23,128 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 -> d76df1bfaca9781352b9c7afbe4683f5e649e880008edad8122f422eebb0dbe8 [2025-02-08 05:12:23,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:12:23,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:12:23,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:12:23,338 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:12:23,339 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:12:23,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur-race.i [2025-02-08 05:12:24,476 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/772bdf4d7/47c1d6df900d46e78440579eff5819f3/FLAG79b71370a [2025-02-08 05:12:24,842 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:12:24,842 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur-race.i [2025-02-08 05:12:24,864 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/772bdf4d7/47c1d6df900d46e78440579eff5819f3/FLAG79b71370a [2025-02-08 05:12:24,880 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/772bdf4d7/47c1d6df900d46e78440579eff5819f3 [2025-02-08 05:12:24,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:12:24,885 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:12:24,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:12:24,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:12:24,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:12:24,899 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:12:24" (1/1) ... [2025-02-08 05:12:24,900 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58c17987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:24, skipping insertion in model container [2025-02-08 05:12:24,900 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:12:24" (1/1) ... [2025-02-08 05:12:24,924 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:12:25,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:12:25,146 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:12:25,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:12:25,230 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:12:25,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:25 WrapperNode [2025-02-08 05:12:25,230 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:12:25,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:12:25,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:12:25,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:12:25,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:25" (1/1) ... [2025-02-08 05:12:25,242 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:25" (1/1) ... [2025-02-08 05:12:25,256 INFO L138 Inliner]: procedures = 165, calls = 28, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 195 [2025-02-08 05:12:25,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:12:25,257 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:12:25,257 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:12:25,257 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:12:25,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:25" (1/1) ... [2025-02-08 05:12:25,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:25" (1/1) ... [2025-02-08 05:12:25,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:25" (1/1) ... [2025-02-08 05:12:25,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:25" (1/1) ... [2025-02-08 05:12:25,270 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:25" (1/1) ... [2025-02-08 05:12:25,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:25" (1/1) ... [2025-02-08 05:12:25,271 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:25" (1/1) ... [2025-02-08 05:12:25,272 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:25" (1/1) ... [2025-02-08 05:12:25,273 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:12:25,274 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:12:25,274 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:12:25,274 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:12:25,275 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:25" (1/1) ... [2025-02-08 05:12:25,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:12:25,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:12:25,314 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:12:25,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:12:25,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:12:25,334 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 05:12:25,334 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 05:12:25,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:12:25,334 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:12:25,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:12:25,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:12:25,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:12:25,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:12:25,335 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:12:25,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:12:25,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:12:25,336 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:12:25,412 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:12:25,414 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:12:25,624 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:12:25,624 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:12:25,707 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:12:25,707 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:12:25,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:12:25 BoogieIcfgContainer [2025-02-08 05:12:25,710 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:12:25,711 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:12:25,711 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:12:25,716 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:12:25,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:12:24" (1/3) ... [2025-02-08 05:12:25,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392812ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:12:25, skipping insertion in model container [2025-02-08 05:12:25,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:12:25" (2/3) ... [2025-02-08 05:12:25,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392812ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:12:25, skipping insertion in model container [2025-02-08 05:12:25,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:12:25" (3/3) ... [2025-02-08 05:12:25,718 INFO L128 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur-race.i [2025-02-08 05:12:25,732 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:12:25,733 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 37_stack_lock_p0_vs_concur-race.i that has 2 procedures, 190 locations, 1 initial locations, 2 loop locations, and 15 error locations. [2025-02-08 05:12:25,734 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:12:25,829 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:12:25,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 195 transitions, 394 flow [2025-02-08 05:12:25,937 INFO L124 PetriNetUnfolderBase]: 5/202 cut-off events. [2025-02-08 05:12:25,940 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:12:25,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 202 events. 5/202 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 144 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 110. Up to 3 conditions per place. [2025-02-08 05:12:25,943 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 195 transitions, 394 flow [2025-02-08 05:12:25,946 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 193 places, 195 transitions, 394 flow [2025-02-08 05:12:25,956 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:12:25,967 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;@8ca6463, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:12:25,967 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-02-08 05:12:25,988 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:12:25,988 INFO L124 PetriNetUnfolderBase]: 0/107 cut-off events. [2025-02-08 05:12:25,988 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:12:25,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:25,989 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:12:25,989 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:12:25,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:25,993 INFO L85 PathProgramCache]: Analyzing trace with hash 102400128, now seen corresponding path program 1 times [2025-02-08 05:12:25,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:25,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438046205] [2025-02-08 05:12:25,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:26,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:26,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 05:12:26,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 05:12:26,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:26,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:26,137 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:12:26,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 05:12:26,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 05:12:26,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:26,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:26,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:12:26,219 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:12:26,220 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 31 remaining) [2025-02-08 05:12:26,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (29 of 31 remaining) [2025-02-08 05:12:26,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (28 of 31 remaining) [2025-02-08 05:12:26,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (27 of 31 remaining) [2025-02-08 05:12:26,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (26 of 31 remaining) [2025-02-08 05:12:26,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (25 of 31 remaining) [2025-02-08 05:12:26,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (24 of 31 remaining) [2025-02-08 05:12:26,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (23 of 31 remaining) [2025-02-08 05:12:26,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (22 of 31 remaining) [2025-02-08 05:12:26,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 31 remaining) [2025-02-08 05:12:26,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (20 of 31 remaining) [2025-02-08 05:12:26,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (19 of 31 remaining) [2025-02-08 05:12:26,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (18 of 31 remaining) [2025-02-08 05:12:26,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (17 of 31 remaining) [2025-02-08 05:12:26,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (16 of 31 remaining) [2025-02-08 05:12:26,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (15 of 31 remaining) [2025-02-08 05:12:26,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (14 of 31 remaining) [2025-02-08 05:12:26,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (13 of 31 remaining) [2025-02-08 05:12:26,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (12 of 31 remaining) [2025-02-08 05:12:26,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (11 of 31 remaining) [2025-02-08 05:12:26,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (10 of 31 remaining) [2025-02-08 05:12:26,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (9 of 31 remaining) [2025-02-08 05:12:26,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 31 remaining) [2025-02-08 05:12:26,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 31 remaining) [2025-02-08 05:12:26,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 31 remaining) [2025-02-08 05:12:26,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 31 remaining) [2025-02-08 05:12:26,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 31 remaining) [2025-02-08 05:12:26,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 31 remaining) [2025-02-08 05:12:26,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 31 remaining) [2025-02-08 05:12:26,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (1 of 31 remaining) [2025-02-08 05:12:26,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 31 remaining) [2025-02-08 05:12:26,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:12:26,228 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-02-08 05:12:26,230 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:12:26,230 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:12:26,290 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:12:26,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 292 places, 297 transitions, 604 flow [2025-02-08 05:12:26,375 INFO L124 PetriNetUnfolderBase]: 10/313 cut-off events. [2025-02-08 05:12:26,375 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:12:26,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 313 events. 10/313 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 597 event pairs, 0 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 211. Up to 3 conditions per place. [2025-02-08 05:12:26,379 INFO L82 GeneralOperation]: Start removeDead. Operand has 292 places, 297 transitions, 604 flow [2025-02-08 05:12:26,382 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 292 places, 297 transitions, 604 flow [2025-02-08 05:12:26,384 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:12:26,385 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;@8ca6463, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:12:26,385 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-02-08 05:12:26,400 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:12:26,400 INFO L124 PetriNetUnfolderBase]: 0/116 cut-off events. [2025-02-08 05:12:26,400 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:12:26,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:26,400 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] [2025-02-08 05:12:26,400 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err14ASSERT_VIOLATIONDATA_RACE === [thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err12ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-02-08 05:12:26,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:26,402 INFO L85 PathProgramCache]: Analyzing trace with hash 765248241, now seen corresponding path program 1 times [2025-02-08 05:12:26,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:26,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391316483] [2025-02-08 05:12:26,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:26,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:26,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 05:12:26,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 05:12:26,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:26,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:12:26,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:12:26,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:12:26,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391316483] [2025-02-08 05:12:26,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391316483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:12:26,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:12:26,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:12:26,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304056268] [2025-02-08 05:12:26,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:12:26,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:12:26,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:12:26,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:12:26,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:12:26,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 297 [2025-02-08 05:12:26,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 297 transitions, 604 flow. Second operand has 2 states, 2 states have (on average 267.0) internal successors, (534), 2 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:26,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:12:26,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 297 [2025-02-08 05:12:26,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:12:26,702 INFO L124 PetriNetUnfolderBase]: 22/567 cut-off events. [2025-02-08 05:12:26,702 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-08 05:12:26,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 567 events. 22/567 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1958 event pairs, 12 based on Foata normal form. 52/554 useless extension candidates. Maximal degree in co-relation 185. Up to 33 conditions per place. [2025-02-08 05:12:26,710 INFO L140 encePairwiseOnDemand]: 276/297 looper letters, 8 selfloop transitions, 0 changer transitions 0/265 dead transitions. [2025-02-08 05:12:26,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 265 transitions, 556 flow [2025-02-08 05:12:26,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:12:26,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:12:26,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 561 transitions. [2025-02-08 05:12:26,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2025-02-08 05:12:26,725 INFO L175 Difference]: Start difference. First operand has 292 places, 297 transitions, 604 flow. Second operand 2 states and 561 transitions. [2025-02-08 05:12:26,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 265 transitions, 556 flow [2025-02-08 05:12:26,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 265 transitions, 556 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:12:26,739 INFO L231 Difference]: Finished difference. Result has 267 places, 265 transitions, 540 flow [2025-02-08 05:12:26,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=540, PETRI_PLACES=267, PETRI_TRANSITIONS=265} [2025-02-08 05:12:26,744 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -25 predicate places. [2025-02-08 05:12:26,745 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 265 transitions, 540 flow [2025-02-08 05:12:26,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 267.0) internal successors, (534), 2 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:26,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:26,746 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:12:26,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:12:26,746 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err12ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-02-08 05:12:26,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:26,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1044261348, now seen corresponding path program 1 times [2025-02-08 05:12:26,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:26,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438969946] [2025-02-08 05:12:26,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:26,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:26,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 05:12:26,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 05:12:26,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:26,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:26,819 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:12:26,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 05:12:26,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 05:12:26,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:26,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:26,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:12:26,839 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:12:26,840 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 46 remaining) [2025-02-08 05:12:26,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2025-02-08 05:12:26,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2025-02-08 05:12:26,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2025-02-08 05:12:26,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2025-02-08 05:12:26,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2025-02-08 05:12:26,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2025-02-08 05:12:26,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2025-02-08 05:12:26,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2025-02-08 05:12:26,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2025-02-08 05:12:26,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2025-02-08 05:12:26,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2025-02-08 05:12:26,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2025-02-08 05:12:26,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2025-02-08 05:12:26,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2025-02-08 05:12:26,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2025-02-08 05:12:26,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (29 of 46 remaining) [2025-02-08 05:12:26,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (28 of 46 remaining) [2025-02-08 05:12:26,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2025-02-08 05:12:26,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2025-02-08 05:12:26,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2025-02-08 05:12:26,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2025-02-08 05:12:26,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2025-02-08 05:12:26,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2025-02-08 05:12:26,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2025-02-08 05:12:26,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2025-02-08 05:12:26,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2025-02-08 05:12:26,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2025-02-08 05:12:26,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2025-02-08 05:12:26,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2025-02-08 05:12:26,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2025-02-08 05:12:26,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2025-02-08 05:12:26,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2025-02-08 05:12:26,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2025-02-08 05:12:26,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2025-02-08 05:12:26,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2025-02-08 05:12:26,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2025-02-08 05:12:26,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2025-02-08 05:12:26,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2025-02-08 05:12:26,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2025-02-08 05:12:26,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2025-02-08 05:12:26,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2025-02-08 05:12:26,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2025-02-08 05:12:26,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2025-02-08 05:12:26,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2025-02-08 05:12:26,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2025-02-08 05:12:26,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:12:26,842 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 05:12:26,842 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:12:26,842 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:12:26,896 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:12:26,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 391 places, 399 transitions, 816 flow [2025-02-08 05:12:26,950 INFO L124 PetriNetUnfolderBase]: 15/424 cut-off events. [2025-02-08 05:12:26,950 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:12:26,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 424 events. 15/424 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1188 event pairs, 0 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 317. Up to 4 conditions per place. [2025-02-08 05:12:26,954 INFO L82 GeneralOperation]: Start removeDead. Operand has 391 places, 399 transitions, 816 flow [2025-02-08 05:12:26,958 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 391 places, 399 transitions, 816 flow [2025-02-08 05:12:26,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:12:26,959 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;@8ca6463, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:12:26,959 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-02-08 05:12:26,978 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:12:26,979 INFO L124 PetriNetUnfolderBase]: 0/116 cut-off events. [2025-02-08 05:12:26,979 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:12:26,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:26,979 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] [2025-02-08 05:12:26,979 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err14ASSERT_VIOLATIONDATA_RACE === [thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err12ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-02-08 05:12:26,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:26,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1554340923, now seen corresponding path program 1 times [2025-02-08 05:12:26,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:26,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995425872] [2025-02-08 05:12:26,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:26,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:26,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 05:12:27,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 05:12:27,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:27,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:12:27,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:12:27,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:12:27,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995425872] [2025-02-08 05:12:27,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995425872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:12:27,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:12:27,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:12:27,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970699042] [2025-02-08 05:12:27,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:12:27,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:12:27,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:12:27,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:12:27,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:12:27,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 353 out of 399 [2025-02-08 05:12:27,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 399 transitions, 816 flow. Second operand has 2 states, 2 states have (on average 354.0) internal successors, (708), 2 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:27,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:12:27,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 353 of 399 [2025-02-08 05:12:27,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:12:27,494 INFO L124 PetriNetUnfolderBase]: 150/2163 cut-off events. [2025-02-08 05:12:27,495 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2025-02-08 05:12:27,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2438 conditions, 2163 events. 150/2163 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 15618 event pairs, 108 based on Foata normal form. 281/2160 useless extension candidates. Maximal degree in co-relation 609. Up to 193 conditions per place. [2025-02-08 05:12:27,540 INFO L140 encePairwiseOnDemand]: 368/399 looper letters, 12 selfloop transitions, 0 changer transitions 0/353 dead transitions. [2025-02-08 05:12:27,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 353 transitions, 748 flow [2025-02-08 05:12:27,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:12:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:12:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 749 transitions. [2025-02-08 05:12:27,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9385964912280702 [2025-02-08 05:12:27,547 INFO L175 Difference]: Start difference. First operand has 391 places, 399 transitions, 816 flow. Second operand 2 states and 749 transitions. [2025-02-08 05:12:27,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 353 transitions, 748 flow [2025-02-08 05:12:27,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 353 transitions, 746 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 05:12:27,557 INFO L231 Difference]: Finished difference. Result has 355 places, 353 transitions, 722 flow [2025-02-08 05:12:27,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=722, PETRI_PLACES=355, PETRI_TRANSITIONS=353} [2025-02-08 05:12:27,560 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -36 predicate places. [2025-02-08 05:12:27,560 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 353 transitions, 722 flow [2025-02-08 05:12:27,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 354.0) internal successors, (708), 2 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:27,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:27,561 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] [2025-02-08 05:12:27,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:12:27,561 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err8ASSERT_VIOLATIONDATA_RACE === [thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err12ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-02-08 05:12:27,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:27,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1735883601, now seen corresponding path program 1 times [2025-02-08 05:12:27,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:27,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766632866] [2025-02-08 05:12:27,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:27,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:27,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 05:12:27,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 05:12:27,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:27,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:12:28,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:12:28,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:12:28,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766632866] [2025-02-08 05:12:28,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766632866] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:12:28,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:12:28,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:12:28,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229692835] [2025-02-08 05:12:28,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:12:28,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:12:28,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:12:28,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:12:28,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:12:28,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 399 [2025-02-08 05:12:28,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 353 transitions, 722 flow. Second operand has 6 states, 6 states have (on average 326.5) internal successors, (1959), 6 states have internal predecessors, (1959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:28,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:12:28,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 399 [2025-02-08 05:12:28,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:12:30,777 INFO L124 PetriNetUnfolderBase]: 2536/18112 cut-off events. [2025-02-08 05:12:30,777 INFO L125 PetriNetUnfolderBase]: For 784/784 co-relation queries the response was YES. [2025-02-08 05:12:30,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22441 conditions, 18112 events. 2536/18112 cut-off events. For 784/784 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 233414 event pairs, 432 based on Foata normal form. 0/15722 useless extension candidates. Maximal degree in co-relation 22435. Up to 2142 conditions per place. [2025-02-08 05:12:30,918 INFO L140 encePairwiseOnDemand]: 372/399 looper letters, 74 selfloop transitions, 29 changer transitions 0/416 dead transitions. [2025-02-08 05:12:30,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 416 transitions, 1094 flow [2025-02-08 05:12:30,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:12:30,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:12:30,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2057 transitions. [2025-02-08 05:12:30,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8592314118629908 [2025-02-08 05:12:30,922 INFO L175 Difference]: Start difference. First operand has 355 places, 353 transitions, 722 flow. Second operand 6 states and 2057 transitions. [2025-02-08 05:12:30,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 416 transitions, 1094 flow [2025-02-08 05:12:30,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 416 transitions, 1094 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:12:30,929 INFO L231 Difference]: Finished difference. Result has 365 places, 381 transitions, 946 flow [2025-02-08 05:12:30,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=946, PETRI_PLACES=365, PETRI_TRANSITIONS=381} [2025-02-08 05:12:30,930 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -26 predicate places. [2025-02-08 05:12:30,930 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 381 transitions, 946 flow [2025-02-08 05:12:30,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 326.5) internal successors, (1959), 6 states have internal predecessors, (1959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:30,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:30,931 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:12:30,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:12:30,931 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err12ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-02-08 05:12:30,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:30,932 INFO L85 PathProgramCache]: Analyzing trace with hash 913703145, now seen corresponding path program 1 times [2025-02-08 05:12:30,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:30,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598167298] [2025-02-08 05:12:30,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:30,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:30,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 05:12:31,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 05:12:31,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:31,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:31,015 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:12:31,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 05:12:31,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 05:12:31,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:31,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:31,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:12:31,047 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:12:31,047 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (60 of 61 remaining) [2025-02-08 05:12:31,047 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (59 of 61 remaining) [2025-02-08 05:12:31,047 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (58 of 61 remaining) [2025-02-08 05:12:31,047 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (57 of 61 remaining) [2025-02-08 05:12:31,047 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (56 of 61 remaining) [2025-02-08 05:12:31,047 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (55 of 61 remaining) [2025-02-08 05:12:31,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (54 of 61 remaining) [2025-02-08 05:12:31,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (53 of 61 remaining) [2025-02-08 05:12:31,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (52 of 61 remaining) [2025-02-08 05:12:31,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (51 of 61 remaining) [2025-02-08 05:12:31,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (50 of 61 remaining) [2025-02-08 05:12:31,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (49 of 61 remaining) [2025-02-08 05:12:31,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (48 of 61 remaining) [2025-02-08 05:12:31,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (47 of 61 remaining) [2025-02-08 05:12:31,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (46 of 61 remaining) [2025-02-08 05:12:31,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (45 of 61 remaining) [2025-02-08 05:12:31,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (44 of 61 remaining) [2025-02-08 05:12:31,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (43 of 61 remaining) [2025-02-08 05:12:31,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (42 of 61 remaining) [2025-02-08 05:12:31,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (41 of 61 remaining) [2025-02-08 05:12:31,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (40 of 61 remaining) [2025-02-08 05:12:31,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (39 of 61 remaining) [2025-02-08 05:12:31,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (38 of 61 remaining) [2025-02-08 05:12:31,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (37 of 61 remaining) [2025-02-08 05:12:31,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (36 of 61 remaining) [2025-02-08 05:12:31,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (35 of 61 remaining) [2025-02-08 05:12:31,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (34 of 61 remaining) [2025-02-08 05:12:31,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (33 of 61 remaining) [2025-02-08 05:12:31,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (32 of 61 remaining) [2025-02-08 05:12:31,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (31 of 61 remaining) [2025-02-08 05:12:31,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (30 of 61 remaining) [2025-02-08 05:12:31,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (29 of 61 remaining) [2025-02-08 05:12:31,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (28 of 61 remaining) [2025-02-08 05:12:31,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (27 of 61 remaining) [2025-02-08 05:12:31,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (26 of 61 remaining) [2025-02-08 05:12:31,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (25 of 61 remaining) [2025-02-08 05:12:31,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (24 of 61 remaining) [2025-02-08 05:12:31,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (23 of 61 remaining) [2025-02-08 05:12:31,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (22 of 61 remaining) [2025-02-08 05:12:31,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 61 remaining) [2025-02-08 05:12:31,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (20 of 61 remaining) [2025-02-08 05:12:31,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (19 of 61 remaining) [2025-02-08 05:12:31,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (18 of 61 remaining) [2025-02-08 05:12:31,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (17 of 61 remaining) [2025-02-08 05:12:31,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (16 of 61 remaining) [2025-02-08 05:12:31,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (15 of 61 remaining) [2025-02-08 05:12:31,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (14 of 61 remaining) [2025-02-08 05:12:31,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (13 of 61 remaining) [2025-02-08 05:12:31,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (12 of 61 remaining) [2025-02-08 05:12:31,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (11 of 61 remaining) [2025-02-08 05:12:31,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (10 of 61 remaining) [2025-02-08 05:12:31,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (9 of 61 remaining) [2025-02-08 05:12:31,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 61 remaining) [2025-02-08 05:12:31,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 61 remaining) [2025-02-08 05:12:31,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 61 remaining) [2025-02-08 05:12:31,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 61 remaining) [2025-02-08 05:12:31,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 61 remaining) [2025-02-08 05:12:31,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 61 remaining) [2025-02-08 05:12:31,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 61 remaining) [2025-02-08 05:12:31,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (1 of 61 remaining) [2025-02-08 05:12:31,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 61 remaining) [2025-02-08 05:12:31,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:12:31,050 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 05:12:31,051 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:12:31,051 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 05:12:31,119 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:12:31,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 490 places, 501 transitions, 1030 flow [2025-02-08 05:12:31,172 INFO L124 PetriNetUnfolderBase]: 20/535 cut-off events. [2025-02-08 05:12:31,173 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 05:12:31,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 535 events. 20/535 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1865 event pairs, 0 based on Foata normal form. 0/450 useless extension candidates. Maximal degree in co-relation 432. Up to 5 conditions per place. [2025-02-08 05:12:31,182 INFO L82 GeneralOperation]: Start removeDead. Operand has 490 places, 501 transitions, 1030 flow [2025-02-08 05:12:31,187 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 490 places, 501 transitions, 1030 flow [2025-02-08 05:12:31,188 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:12:31,188 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;@8ca6463, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:12:31,189 INFO L334 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2025-02-08 05:12:31,193 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:12:31,194 INFO L124 PetriNetUnfolderBase]: 0/113 cut-off events. [2025-02-08 05:12:31,194 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:12:31,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:31,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] [2025-02-08 05:12:31,194 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err14ASSERT_VIOLATIONDATA_RACE === [thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err12ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-02-08 05:12:31,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:31,194 INFO L85 PathProgramCache]: Analyzing trace with hash 127273023, now seen corresponding path program 1 times [2025-02-08 05:12:31,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:31,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383659168] [2025-02-08 05:12:31,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:31,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:31,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 05:12:31,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 05:12:31,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:31,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:12:31,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:12:31,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:12:31,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383659168] [2025-02-08 05:12:31,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383659168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:12:31,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:12:31,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:12:31,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605952715] [2025-02-08 05:12:31,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:12:31,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:12:31,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:12:31,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:12:31,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:12:31,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 501 [2025-02-08 05:12:31,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 501 transitions, 1030 flow. Second operand has 2 states, 2 states have (on average 441.0) internal successors, (882), 2 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:31,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:12:31,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 501 [2025-02-08 05:12:31,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:12:32,816 INFO L124 PetriNetUnfolderBase]: 854/8739 cut-off events. [2025-02-08 05:12:32,817 INFO L125 PetriNetUnfolderBase]: For 1133/1133 co-relation queries the response was YES. [2025-02-08 05:12:32,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10167 conditions, 8739 events. 854/8739 cut-off events. For 1133/1133 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 93228 event pairs, 684 based on Foata normal form. 1451/9025 useless extension candidates. Maximal degree in co-relation 2417. Up to 1025 conditions per place. [2025-02-08 05:12:32,943 INFO L140 encePairwiseOnDemand]: 460/501 looper letters, 16 selfloop transitions, 0 changer transitions 0/441 dead transitions. [2025-02-08 05:12:32,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 441 transitions, 942 flow [2025-02-08 05:12:32,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:12:32,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:12:32,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 937 transitions. [2025-02-08 05:12:32,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.935129740518962 [2025-02-08 05:12:32,949 INFO L175 Difference]: Start difference. First operand has 490 places, 501 transitions, 1030 flow. Second operand 2 states and 937 transitions. [2025-02-08 05:12:32,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 441 transitions, 942 flow [2025-02-08 05:12:32,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 441 transitions, 936 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-08 05:12:32,954 INFO L231 Difference]: Finished difference. Result has 443 places, 441 transitions, 904 flow [2025-02-08 05:12:32,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=904, PETRI_PLACES=443, PETRI_TRANSITIONS=441} [2025-02-08 05:12:32,955 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -47 predicate places. [2025-02-08 05:12:32,956 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 441 transitions, 904 flow [2025-02-08 05:12:32,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 441.0) internal successors, (882), 2 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:32,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:32,956 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] [2025-02-08 05:12:32,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:12:32,956 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err8ASSERT_VIOLATIONDATA_RACE === [thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err12ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-02-08 05:12:32,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:32,957 INFO L85 PathProgramCache]: Analyzing trace with hash -287008919, now seen corresponding path program 1 times [2025-02-08 05:12:32,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:32,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826684702] [2025-02-08 05:12:32,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:32,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:32,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 05:12:32,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 05:12:32,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:32,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:12:33,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:12:33,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:12:33,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826684702] [2025-02-08 05:12:33,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826684702] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:12:33,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:12:33,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:12:33,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569278284] [2025-02-08 05:12:33,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:12:33,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:12:33,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:12:33,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:12:33,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:12:33,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 501 [2025-02-08 05:12:33,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 441 transitions, 904 flow. Second operand has 6 states, 6 states have (on average 413.5) internal successors, (2481), 6 states have internal predecessors, (2481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:33,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:12:33,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 501 [2025-02-08 05:12:33,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:12:45,890 INFO L124 PetriNetUnfolderBase]: 16072/85008 cut-off events. [2025-02-08 05:12:45,891 INFO L125 PetriNetUnfolderBase]: For 4105/4105 co-relation queries the response was YES. [2025-02-08 05:12:46,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109292 conditions, 85008 events. 16072/85008 cut-off events. For 4105/4105 co-relation queries the response was YES. Maximal size of possible extension queue 1662. Compared 1316103 event pairs, 3109 based on Foata normal form. 0/74533 useless extension candidates. Maximal degree in co-relation 109285. Up to 13298 conditions per place. [2025-02-08 05:12:47,143 INFO L140 encePairwiseOnDemand]: 473/501 looper letters, 90 selfloop transitions, 33 changer transitions 0/520 dead transitions. [2025-02-08 05:12:47,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 520 transitions, 1368 flow [2025-02-08 05:12:47,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:12:47,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:12:47,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2599 transitions. [2025-02-08 05:12:47,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.864604125083167 [2025-02-08 05:12:47,148 INFO L175 Difference]: Start difference. First operand has 443 places, 441 transitions, 904 flow. Second operand 6 states and 2599 transitions. [2025-02-08 05:12:47,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 520 transitions, 1368 flow [2025-02-08 05:12:47,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 520 transitions, 1368 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:12:47,159 INFO L231 Difference]: Finished difference. Result has 453 places, 473 transitions, 1154 flow [2025-02-08 05:12:47,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1154, PETRI_PLACES=453, PETRI_TRANSITIONS=473} [2025-02-08 05:12:47,161 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -37 predicate places. [2025-02-08 05:12:47,162 INFO L471 AbstractCegarLoop]: Abstraction has has 453 places, 473 transitions, 1154 flow [2025-02-08 05:12:47,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 413.5) internal successors, (2481), 6 states have internal predecessors, (2481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:47,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:47,164 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:12:47,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:12:47,164 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err8ASSERT_VIOLATIONDATA_RACE === [thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err12ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-02-08 05:12:47,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:47,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1846987716, now seen corresponding path program 1 times [2025-02-08 05:12:47,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:47,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621869188] [2025-02-08 05:12:47,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:47,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:47,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 05:12:47,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 05:12:47,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:47,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:12:47,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:12:47,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:12:47,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621869188] [2025-02-08 05:12:47,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621869188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:12:47,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:12:47,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:12:47,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729907450] [2025-02-08 05:12:47,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:12:47,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:12:47,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:12:47,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:12:47,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:12:48,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 501 [2025-02-08 05:12:48,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 473 transitions, 1154 flow. Second operand has 6 states, 6 states have (on average 413.6666666666667) internal successors, (2482), 6 states have internal predecessors, (2482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:48,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:12:48,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 501 [2025-02-08 05:12:48,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:12:57,404 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1783] L700-4-->L701-8: Formula: (let ((.cse1 (+ |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11| 1)) (.cse2 (+ 2 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11|)) (.cse3 (+ 3 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11|)) (.cse9 (select |v_#race_175| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11|))) (let ((.cse6 (select .cse9 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11|)) (.cse7 (select |v_#memory_int_86| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11|)) (.cse4 (select .cse9 .cse3)) (.cse5 (select .cse9 .cse2)) (.cse8 (select .cse9 .cse1)) (.cse0 (select |v_#race_176| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11|))) (or (and (= v_~next_alloc_idx~0_59 (+ v_~next_alloc_idx~0_60 2)) (= |v_#race_175| (store |v_#race_176| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11| (store (store (store (store .cse0 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11| |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) .cse1 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) .cse2 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) .cse3 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|))) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet3#1_101| |v_#race~next_alloc_idx~0_75|) (= .cse4 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124| .cse5) (= .cse6 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) (= (store |v_#memory_int_86| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11| (store .cse7 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11| v_~next_alloc_idx~0_60)) |v_#memory_int_85|) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124| .cse8) (<= v_~next_alloc_idx~0_60 64) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_109| |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|)) (and (= |v_#race~next_alloc_idx~0_75| 0) (= v_~next_alloc_idx~0_60 v_~next_alloc_idx~0_59) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108| .cse6) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet3#1_102| |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet3#1_101|) (= (store |v_#memory_int_86| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11| (store .cse7 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11| 0)) |v_#memory_int_85|) (= .cse4 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108| .cse5) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_125| |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108| .cse8) (< 64 v_~next_alloc_idx~0_60) (= (store |v_#race_176| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11| (store (store (store (store .cse0 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11| |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|) .cse1 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|) .cse2 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|) .cse3 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|)) |v_#race_175|))))) InVars {#race=|v_#race_176|, thr1Thread4of4ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11|, #memory_int=|v_#memory_int_86|, ~next_alloc_idx~0=v_~next_alloc_idx~0_60, thr1Thread4of4ForFork0_push_~#newTop~0#1.base=|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11|} OutVars{#race=|v_#race_175|, thr1Thread4of4ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet3#1=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet3#1_13|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet1#1=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet1#1_13|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset_13|, ~next_alloc_idx~0=v_~next_alloc_idx~0_59, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset_13|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base_13|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet2#1=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet2#1_13|, thr1Thread4of4ForFork0_push_~#newTop~0#1.base=|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11|, #memory_int=|v_#memory_int_85|, #race~next_alloc_idx~0=|v_#race~next_alloc_idx~0_75|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_13|} AuxVars[|v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|, |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet3#1_102|, |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_109|, |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet3#1_101|, |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|, |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_125|] AssignedVars[#race, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet2#1, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet3#1, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet1#1, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset, ~next_alloc_idx~0, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset, #memory_int, #race~next_alloc_idx~0, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base][194], [493#true, 436#L701-8true, 248#L713-8true, 485#true, 29#thr1Err8ASSERT_VIOLATIONDATA_RACEtrue, 491#true, 106#L701-8true, 487#true, 489#true, 506#true, Black: 497#(= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset|) 0), 495#true, Black: 500#(and (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 3)) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 2)) 0)), Black: 498#(and (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset|) 0)), Black: 499#(and (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 2)) 0)), 256#L719-2true]) [2025-02-08 05:12:57,405 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2025-02-08 05:12:57,405 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-02-08 05:12:57,405 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-02-08 05:12:57,405 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-02-08 05:13:01,432 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1783] L700-4-->L701-8: Formula: (let ((.cse1 (+ |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11| 1)) (.cse2 (+ 2 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11|)) (.cse3 (+ 3 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11|)) (.cse9 (select |v_#race_175| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11|))) (let ((.cse6 (select .cse9 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11|)) (.cse7 (select |v_#memory_int_86| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11|)) (.cse4 (select .cse9 .cse3)) (.cse5 (select .cse9 .cse2)) (.cse8 (select .cse9 .cse1)) (.cse0 (select |v_#race_176| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11|))) (or (and (= v_~next_alloc_idx~0_59 (+ v_~next_alloc_idx~0_60 2)) (= |v_#race_175| (store |v_#race_176| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11| (store (store (store (store .cse0 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11| |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) .cse1 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) .cse2 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) .cse3 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|))) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet3#1_101| |v_#race~next_alloc_idx~0_75|) (= .cse4 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124| .cse5) (= .cse6 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) (= (store |v_#memory_int_86| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11| (store .cse7 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11| v_~next_alloc_idx~0_60)) |v_#memory_int_85|) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124| .cse8) (<= v_~next_alloc_idx~0_60 64) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_109| |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|)) (and (= |v_#race~next_alloc_idx~0_75| 0) (= v_~next_alloc_idx~0_60 v_~next_alloc_idx~0_59) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108| .cse6) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet3#1_102| |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet3#1_101|) (= (store |v_#memory_int_86| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11| (store .cse7 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11| 0)) |v_#memory_int_85|) (= .cse4 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108| .cse5) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_125| |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108| .cse8) (< 64 v_~next_alloc_idx~0_60) (= (store |v_#race_176| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11| (store (store (store (store .cse0 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11| |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|) .cse1 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|) .cse2 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|) .cse3 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|)) |v_#race_175|))))) InVars {#race=|v_#race_176|, thr1Thread4of4ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11|, #memory_int=|v_#memory_int_86|, ~next_alloc_idx~0=v_~next_alloc_idx~0_60, thr1Thread4of4ForFork0_push_~#newTop~0#1.base=|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11|} OutVars{#race=|v_#race_175|, thr1Thread4of4ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet3#1=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet3#1_13|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet1#1=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet1#1_13|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset_13|, ~next_alloc_idx~0=v_~next_alloc_idx~0_59, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset_13|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base_13|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet2#1=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet2#1_13|, thr1Thread4of4ForFork0_push_~#newTop~0#1.base=|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11|, #memory_int=|v_#memory_int_85|, #race~next_alloc_idx~0=|v_#race~next_alloc_idx~0_75|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_13|} AuxVars[|v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|, |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet3#1_102|, |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_109|, |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet3#1_101|, |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|, |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_125|] AssignedVars[#race, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet2#1, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet3#1, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet1#1, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset, ~next_alloc_idx~0, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset, #memory_int, #race~next_alloc_idx~0, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base][295], [493#true, 436#L701-8true, 485#true, 99#L704-6true, 29#thr1Err8ASSERT_VIOLATIONDATA_RACEtrue, 491#true, 106#L701-8true, 487#true, 489#true, 506#true, Black: 497#(= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset|) 0), 495#true, Black: 500#(and (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 3)) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 2)) 0)), Black: 498#(and (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset|) 0)), Black: 499#(and (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 2)) 0)), 256#L719-2true]) [2025-02-08 05:13:01,433 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2025-02-08 05:13:01,433 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-02-08 05:13:01,433 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-02-08 05:13:01,433 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-02-08 05:13:01,686 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1783] L700-4-->L701-8: Formula: (let ((.cse1 (+ |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11| 1)) (.cse2 (+ 2 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11|)) (.cse3 (+ 3 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11|)) (.cse9 (select |v_#race_175| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11|))) (let ((.cse6 (select .cse9 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11|)) (.cse7 (select |v_#memory_int_86| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11|)) (.cse4 (select .cse9 .cse3)) (.cse5 (select .cse9 .cse2)) (.cse8 (select .cse9 .cse1)) (.cse0 (select |v_#race_176| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11|))) (or (and (= v_~next_alloc_idx~0_59 (+ v_~next_alloc_idx~0_60 2)) (= |v_#race_175| (store |v_#race_176| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11| (store (store (store (store .cse0 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11| |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) .cse1 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) .cse2 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) .cse3 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|))) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet3#1_101| |v_#race~next_alloc_idx~0_75|) (= .cse4 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124| .cse5) (= .cse6 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) (= (store |v_#memory_int_86| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11| (store .cse7 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11| v_~next_alloc_idx~0_60)) |v_#memory_int_85|) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124| .cse8) (<= v_~next_alloc_idx~0_60 64) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_109| |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|)) (and (= |v_#race~next_alloc_idx~0_75| 0) (= v_~next_alloc_idx~0_60 v_~next_alloc_idx~0_59) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108| .cse6) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet3#1_102| |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet3#1_101|) (= (store |v_#memory_int_86| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11| (store .cse7 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11| 0)) |v_#memory_int_85|) (= .cse4 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108| .cse5) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_125| |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108| .cse8) (< 64 v_~next_alloc_idx~0_60) (= (store |v_#race_176| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11| (store (store (store (store .cse0 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11| |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|) .cse1 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|) .cse2 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|) .cse3 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|)) |v_#race_175|))))) InVars {#race=|v_#race_176|, thr1Thread4of4ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11|, #memory_int=|v_#memory_int_86|, ~next_alloc_idx~0=v_~next_alloc_idx~0_60, thr1Thread4of4ForFork0_push_~#newTop~0#1.base=|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11|} OutVars{#race=|v_#race_175|, thr1Thread4of4ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet3#1=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet3#1_13|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet1#1=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet1#1_13|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset_13|, ~next_alloc_idx~0=v_~next_alloc_idx~0_59, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset_13|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base_13|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet2#1=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet2#1_13|, thr1Thread4of4ForFork0_push_~#newTop~0#1.base=|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11|, #memory_int=|v_#memory_int_85|, #race~next_alloc_idx~0=|v_#race~next_alloc_idx~0_75|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_13|} AuxVars[|v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|, |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet3#1_102|, |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_109|, |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet3#1_101|, |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|, |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_125|] AssignedVars[#race, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet2#1, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet3#1, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet1#1, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset, ~next_alloc_idx~0, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset, #memory_int, #race~next_alloc_idx~0, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base][194], [493#true, 248#L713-8true, 9#thr1Err7ASSERT_VIOLATIONDATA_RACEtrue, 436#L701-8true, 485#true, 491#true, 106#L701-8true, 487#true, 489#true, Black: 497#(= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset|) 0), 506#true, 495#true, Black: 500#(and (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 3)) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 2)) 0)), Black: 498#(and (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset|) 0)), Black: 499#(and (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 2)) 0)), 256#L719-2true]) [2025-02-08 05:13:01,687 INFO L294 olderBase$Statistics]: this new event has 195 ancestors and is cut-off event [2025-02-08 05:13:01,687 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-02-08 05:13:01,687 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-02-08 05:13:01,687 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-02-08 05:13:06,492 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1783] L700-4-->L701-8: Formula: (let ((.cse1 (+ |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11| 1)) (.cse2 (+ 2 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11|)) (.cse3 (+ 3 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11|)) (.cse9 (select |v_#race_175| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11|))) (let ((.cse6 (select .cse9 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11|)) (.cse7 (select |v_#memory_int_86| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11|)) (.cse4 (select .cse9 .cse3)) (.cse5 (select .cse9 .cse2)) (.cse8 (select .cse9 .cse1)) (.cse0 (select |v_#race_176| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11|))) (or (and (= v_~next_alloc_idx~0_59 (+ v_~next_alloc_idx~0_60 2)) (= |v_#race_175| (store |v_#race_176| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11| (store (store (store (store .cse0 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11| |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) .cse1 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) .cse2 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) .cse3 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|))) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet3#1_101| |v_#race~next_alloc_idx~0_75|) (= .cse4 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124| .cse5) (= .cse6 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) (= (store |v_#memory_int_86| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11| (store .cse7 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11| v_~next_alloc_idx~0_60)) |v_#memory_int_85|) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124| .cse8) (<= v_~next_alloc_idx~0_60 64) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_109| |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|)) (and (= |v_#race~next_alloc_idx~0_75| 0) (= v_~next_alloc_idx~0_60 v_~next_alloc_idx~0_59) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108| .cse6) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet3#1_102| |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet3#1_101|) (= (store |v_#memory_int_86| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11| (store .cse7 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11| 0)) |v_#memory_int_85|) (= .cse4 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108| .cse5) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_125| |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108| .cse8) (< 64 v_~next_alloc_idx~0_60) (= (store |v_#race_176| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11| (store (store (store (store .cse0 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11| |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|) .cse1 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|) .cse2 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|) .cse3 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|)) |v_#race_175|))))) InVars {#race=|v_#race_176|, thr1Thread4of4ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11|, #memory_int=|v_#memory_int_86|, ~next_alloc_idx~0=v_~next_alloc_idx~0_60, thr1Thread4of4ForFork0_push_~#newTop~0#1.base=|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11|} OutVars{#race=|v_#race_175|, thr1Thread4of4ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet3#1=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet3#1_13|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet1#1=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet1#1_13|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset_13|, ~next_alloc_idx~0=v_~next_alloc_idx~0_59, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset_13|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base_13|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet2#1=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet2#1_13|, thr1Thread4of4ForFork0_push_~#newTop~0#1.base=|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11|, #memory_int=|v_#memory_int_85|, #race~next_alloc_idx~0=|v_#race~next_alloc_idx~0_75|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_13|} AuxVars[|v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|, |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet3#1_102|, |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_109|, |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet3#1_101|, |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|, |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_125|] AssignedVars[#race, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet2#1, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet3#1, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet1#1, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset, ~next_alloc_idx~0, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset, #memory_int, #race~next_alloc_idx~0, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base][295], [493#true, 436#L701-8true, 9#thr1Err7ASSERT_VIOLATIONDATA_RACEtrue, 485#true, 99#L704-6true, 491#true, 106#L701-8true, 487#true, 489#true, 506#true, Black: 497#(= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset|) 0), Black: 500#(and (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 3)) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 2)) 0)), 495#true, Black: 498#(and (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset|) 0)), Black: 499#(and (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 2)) 0)), 256#L719-2true]) [2025-02-08 05:13:06,492 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2025-02-08 05:13:06,492 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-02-08 05:13:06,493 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-02-08 05:13:06,493 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2025-02-08 05:13:08,456 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1783] L700-4-->L701-8: Formula: (let ((.cse1 (+ |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11| 1)) (.cse2 (+ 2 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11|)) (.cse3 (+ 3 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11|)) (.cse9 (select |v_#race_175| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11|))) (let ((.cse6 (select .cse9 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11|)) (.cse7 (select |v_#memory_int_86| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11|)) (.cse4 (select .cse9 .cse3)) (.cse5 (select .cse9 .cse2)) (.cse8 (select .cse9 .cse1)) (.cse0 (select |v_#race_176| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11|))) (or (and (= v_~next_alloc_idx~0_59 (+ v_~next_alloc_idx~0_60 2)) (= |v_#race_175| (store |v_#race_176| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11| (store (store (store (store .cse0 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11| |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) .cse1 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) .cse2 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) .cse3 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|))) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet3#1_101| |v_#race~next_alloc_idx~0_75|) (= .cse4 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124| .cse5) (= .cse6 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) (= (store |v_#memory_int_86| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11| (store .cse7 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11| v_~next_alloc_idx~0_60)) |v_#memory_int_85|) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124| .cse8) (<= v_~next_alloc_idx~0_60 64) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_109| |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|)) (and (= |v_#race~next_alloc_idx~0_75| 0) (= v_~next_alloc_idx~0_60 v_~next_alloc_idx~0_59) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108| .cse6) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet3#1_102| |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet3#1_101|) (= (store |v_#memory_int_86| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11| (store .cse7 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11| 0)) |v_#memory_int_85|) (= .cse4 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108| .cse5) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_125| |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|) (= |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108| .cse8) (< 64 v_~next_alloc_idx~0_60) (= (store |v_#race_176| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11| (store (store (store (store .cse0 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11| |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|) .cse1 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|) .cse2 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|) .cse3 |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|)) |v_#race_175|))))) InVars {#race=|v_#race_176|, thr1Thread4of4ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11|, #memory_int=|v_#memory_int_86|, ~next_alloc_idx~0=v_~next_alloc_idx~0_60, thr1Thread4of4ForFork0_push_~#newTop~0#1.base=|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11|} OutVars{#race=|v_#race_175|, thr1Thread4of4ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset_11|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet3#1=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet3#1_13|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet1#1=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet1#1_13|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset_13|, ~next_alloc_idx~0=v_~next_alloc_idx~0_59, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset_13|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base_13|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet2#1=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet2#1_13|, thr1Thread4of4ForFork0_push_~#newTop~0#1.base=|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_11|, #memory_int=|v_#memory_int_85|, #race~next_alloc_idx~0=|v_#race~next_alloc_idx~0_75|, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base=|v_thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base_13|} AuxVars[|v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_108|, |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet3#1_102|, |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet1#1_109|, |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet3#1_101|, |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_124|, |v_thr1___VERIFIER_atomic_index_malloc_#t~nondet2#1_125|] AssignedVars[#race, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet2#1, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet3#1, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#t~nondet1#1, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset, ~next_alloc_idx~0, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset, #memory_int, #race~next_alloc_idx~0, thr1Thread4of4ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base][295], [493#true, 436#L701-8true, 485#true, 99#L704-6true, 491#true, 106#L701-8true, 487#true, 489#true, Black: 497#(= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset|) 0), 506#true, Black: 500#(and (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 3)) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 2)) 0)), 495#true, Black: 498#(and (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset|) 0)), Black: 499#(and (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of4ForFork0_push_~#newTop~0#1.base|) (+ |thr1Thread1of4ForFork0_push_~#newTop~0#1.offset| 2)) 0)), 216#L713-7true, 256#L719-2true]) [2025-02-08 05:13:08,457 INFO L294 olderBase$Statistics]: this new event has 196 ancestors and is cut-off event [2025-02-08 05:13:08,457 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-02-08 05:13:08,457 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-02-08 05:13:08,457 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event