./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/stack_longest-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/stack_longest-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5773bc320dd9dee5d943610df8c4ec3040864edddf388dd42a51d37167245e47 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:42:40,417 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:42:40,469 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 10:42:40,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:42:40,474 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:42:40,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:42:40,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:42:40,493 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:42:40,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:42:40,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:42:40,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:42:40,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:42:40,494 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:42:40,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:42:40,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:42:40,494 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:42:40,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:42:40,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:42:40,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:42:40,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:42:40,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:42:40,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:42:40,495 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 10:42:40,495 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 10:42:40,495 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:42:40,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:42:40,495 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:42:40,495 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:42:40,495 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:42:40,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:42:40,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:42:40,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:42:40,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:42:40,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:42:40,497 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:42:40,497 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:42:40,497 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:42:40,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:42:40,497 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:42:40,497 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:42:40,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:42:40,497 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:42:40,497 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5773bc320dd9dee5d943610df8c4ec3040864edddf388dd42a51d37167245e47 [2025-03-17 10:42:40,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:42:40,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:42:40,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:42:40,710 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:42:40,711 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:42:40,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack_longest-2.i [2025-03-17 10:42:41,862 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a92bb98c0/8509f0611bd347fda92501fdc75282fb/FLAGf7d2530c4 [2025-03-17 10:42:42,156 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:42:42,156 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longest-2.i [2025-03-17 10:42:42,168 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a92bb98c0/8509f0611bd347fda92501fdc75282fb/FLAGf7d2530c4 [2025-03-17 10:42:42,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a92bb98c0/8509f0611bd347fda92501fdc75282fb [2025-03-17 10:42:42,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:42:42,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:42:42,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:42:42,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:42:42,438 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:42:42,438 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:42:42" (1/1) ... [2025-03-17 10:42:42,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58686f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:42, skipping insertion in model container [2025-03-17 10:42:42,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:42:42" (1/1) ... [2025-03-17 10:42:42,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:42:42,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:42:42,826 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:42:42,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:42:42,964 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:42:42,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:42 WrapperNode [2025-03-17 10:42:42,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:42:42,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:42:42,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:42:42,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:42:42,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:42" (1/1) ... [2025-03-17 10:42:42,990 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:42" (1/1) ... [2025-03-17 10:42:43,045 INFO L138 Inliner]: procedures = 277, calls = 831, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 977 [2025-03-17 10:42:43,046 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:42:43,046 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:42:43,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:42:43,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:42:43,052 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:42" (1/1) ... [2025-03-17 10:42:43,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:42" (1/1) ... [2025-03-17 10:42:43,064 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:42" (1/1) ... [2025-03-17 10:42:43,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:42" (1/1) ... [2025-03-17 10:42:43,090 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:42" (1/1) ... [2025-03-17 10:42:43,092 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:42" (1/1) ... [2025-03-17 10:42:43,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:42" (1/1) ... [2025-03-17 10:42:43,095 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:42" (1/1) ... [2025-03-17 10:42:43,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:42:43,099 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:42:43,099 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:42:43,099 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:42:43,100 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:42" (1/1) ... [2025-03-17 10:42:43,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:42:43,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:42:43,129 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 10:42:43,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 10:42:43,148 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-17 10:42:43,148 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-17 10:42:43,148 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-17 10:42:43,148 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-17 10:42:43,148 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 10:42:43,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 10:42:43,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 10:42:43,148 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 10:42:43,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:42:43,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 10:42:43,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:42:43,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:42:43,151 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 10:42:43,247 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:42:43,248 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:42:44,146 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L985-1: pop_#res#1 := 0; [2025-03-17 10:42:44,146 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L983: havoc pop_#t~mem40#1; [2025-03-17 10:42:44,146 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L983-1: havoc pop_#t~ret39#1; [2025-03-17 10:42:44,147 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 10:42:44,147 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:42:44,186 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:42:44,186 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 10:42:44,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:42:44 BoogieIcfgContainer [2025-03-17 10:42:44,190 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:42:44,192 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:42:44,192 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:42:44,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:42:44,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:42:42" (1/3) ... [2025-03-17 10:42:44,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf040b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:42:44, skipping insertion in model container [2025-03-17 10:42:44,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:42" (2/3) ... [2025-03-17 10:42:44,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf040b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:42:44, skipping insertion in model container [2025-03-17 10:42:44,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:42:44" (3/3) ... [2025-03-17 10:42:44,197 INFO L128 eAbstractionObserver]: Analyzing ICFG stack_longest-2.i [2025-03-17 10:42:44,208 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:42:44,209 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack_longest-2.i that has 3 procedures, 992 locations, 1 initial locations, 2 loop locations, and 11 error locations. [2025-03-17 10:42:44,209 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 10:42:44,335 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 10:42:44,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 998 places, 1001 transitions, 2016 flow [2025-03-17 10:42:44,693 INFO L124 PetriNetUnfolderBase]: 10/999 cut-off events. [2025-03-17 10:42:44,694 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 10:42:44,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 999 events. 10/999 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 492 event pairs, 0 based on Foata normal form. 0/978 useless extension candidates. Maximal degree in co-relation 917. Up to 3 conditions per place. [2025-03-17 10:42:44,702 INFO L82 GeneralOperation]: Start removeDead. Operand has 998 places, 1001 transitions, 2016 flow [2025-03-17 10:42:44,711 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 991 places, 994 transitions, 1997 flow [2025-03-17 10:42:44,718 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:42:44,726 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;@6e3e507e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:42:44,727 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-17 10:42:44,844 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:42:44,845 INFO L124 PetriNetUnfolderBase]: 1/864 cut-off events. [2025-03-17 10:42:44,845 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 10:42:44,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:44,846 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:42:44,846 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-17 10:42:44,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:44,854 INFO L85 PathProgramCache]: Analyzing trace with hash 532058853, now seen corresponding path program 1 times [2025-03-17 10:42:44,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:44,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398946243] [2025-03-17 10:42:44,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:44,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:44,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 840 statements into 1 equivalence classes. [2025-03-17 10:42:45,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 840 of 840 statements. [2025-03-17 10:42:45,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:45,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:45,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:45,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:45,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398946243] [2025-03-17 10:42:45,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398946243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:45,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:45,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:42:45,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192392576] [2025-03-17 10:42:45,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:45,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:45,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:45,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:45,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:45,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 963 out of 1001 [2025-03-17 10:42:45,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 991 places, 994 transitions, 1997 flow. Second operand has 3 states, 3 states have (on average 964.6666666666666) internal successors, (2894), 3 states have internal predecessors, (2894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:45,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:45,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 963 of 1001 [2025-03-17 10:42:45,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:46,476 INFO L124 PetriNetUnfolderBase]: 274/3168 cut-off events. [2025-03-17 10:42:46,476 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2025-03-17 10:42:46,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3782 conditions, 3168 events. 274/3168 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 17034 event pairs, 76 based on Foata normal form. 138/3062 useless extension candidates. Maximal degree in co-relation 2779. Up to 405 conditions per place. [2025-03-17 10:42:46,494 INFO L140 encePairwiseOnDemand]: 973/1001 looper letters, 36 selfloop transitions, 16 changer transitions 0/1007 dead transitions. [2025-03-17 10:42:46,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 989 places, 1007 transitions, 2133 flow [2025-03-17 10:42:46,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:46,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:46,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2958 transitions. [2025-03-17 10:42:46,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.985014985014985 [2025-03-17 10:42:46,516 INFO L175 Difference]: Start difference. First operand has 991 places, 994 transitions, 1997 flow. Second operand 3 states and 2958 transitions. [2025-03-17 10:42:46,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 989 places, 1007 transitions, 2133 flow [2025-03-17 10:42:46,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 986 places, 1007 transitions, 2125 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 10:42:46,537 INFO L231 Difference]: Finished difference. Result has 988 places, 1001 transitions, 2116 flow [2025-03-17 10:42:46,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=1974, PETRI_DIFFERENCE_MINUEND_PLACES=984, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=985, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=969, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2116, PETRI_PLACES=988, PETRI_TRANSITIONS=1001} [2025-03-17 10:42:46,546 INFO L279 CegarLoopForPetriNet]: 991 programPoint places, -3 predicate places. [2025-03-17 10:42:46,546 INFO L471 AbstractCegarLoop]: Abstraction has has 988 places, 1001 transitions, 2116 flow [2025-03-17 10:42:46,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 964.6666666666666) internal successors, (2894), 3 states have internal predecessors, (2894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:46,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:46,549 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:42:46,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:42:46,549 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-17 10:42:46,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:46,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1296695352, now seen corresponding path program 1 times [2025-03-17 10:42:46,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:46,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206522014] [2025-03-17 10:42:46,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:46,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:46,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 856 statements into 1 equivalence classes. [2025-03-17 10:42:46,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 856 of 856 statements. [2025-03-17 10:42:46,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:46,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:47,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:47,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:47,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206522014] [2025-03-17 10:42:47,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206522014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:47,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:47,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:42:47,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307664059] [2025-03-17 10:42:47,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:47,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:47,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:47,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:47,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:47,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 979 out of 1001 [2025-03-17 10:42:47,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 988 places, 1001 transitions, 2116 flow. Second operand has 3 states, 3 states have (on average 981.3333333333334) internal successors, (2944), 3 states have internal predecessors, (2944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:47,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:47,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 979 of 1001 [2025-03-17 10:42:47,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:48,271 INFO L124 PetriNetUnfolderBase]: 277/3819 cut-off events. [2025-03-17 10:42:48,272 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2025-03-17 10:42:48,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4673 conditions, 3819 events. 277/3819 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22759 event pairs, 91 based on Foata normal form. 22/3589 useless extension candidates. Maximal degree in co-relation 3628. Up to 350 conditions per place. [2025-03-17 10:42:48,291 INFO L140 encePairwiseOnDemand]: 996/1001 looper letters, 18 selfloop transitions, 3 changer transitions 0/1008 dead transitions. [2025-03-17 10:42:48,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 990 places, 1008 transitions, 2175 flow [2025-03-17 10:42:48,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:48,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:48,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2960 transitions. [2025-03-17 10:42:48,296 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9856809856809857 [2025-03-17 10:42:48,296 INFO L175 Difference]: Start difference. First operand has 988 places, 1001 transitions, 2116 flow. Second operand 3 states and 2960 transitions. [2025-03-17 10:42:48,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 990 places, 1008 transitions, 2175 flow [2025-03-17 10:42:48,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 988 places, 1008 transitions, 2143 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:42:48,309 INFO L231 Difference]: Finished difference. Result has 989 places, 1002 transitions, 2101 flow [2025-03-17 10:42:48,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2084, PETRI_DIFFERENCE_MINUEND_PLACES=986, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1001, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=998, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2101, PETRI_PLACES=989, PETRI_TRANSITIONS=1002} [2025-03-17 10:42:48,311 INFO L279 CegarLoopForPetriNet]: 991 programPoint places, -2 predicate places. [2025-03-17 10:42:48,311 INFO L471 AbstractCegarLoop]: Abstraction has has 989 places, 1002 transitions, 2101 flow [2025-03-17 10:42:48,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 981.3333333333334) internal successors, (2944), 3 states have internal predecessors, (2944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:48,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:48,313 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:42:48,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:42:48,313 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-17 10:42:48,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:48,315 INFO L85 PathProgramCache]: Analyzing trace with hash 149946871, now seen corresponding path program 1 times [2025-03-17 10:42:48,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:48,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263510803] [2025-03-17 10:42:48,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:48,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:48,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 863 statements into 1 equivalence classes. [2025-03-17 10:42:48,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 863 of 863 statements. [2025-03-17 10:42:48,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:48,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:50,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:50,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263510803] [2025-03-17 10:42:50,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263510803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:50,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:50,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:42:50,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851558869] [2025-03-17 10:42:50,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:50,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:42:50,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:50,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:42:50,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:42:50,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 969 out of 1001 [2025-03-17 10:42:50,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 989 places, 1002 transitions, 2101 flow. Second operand has 6 states, 6 states have (on average 970.8333333333334) internal successors, (5825), 6 states have internal predecessors, (5825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:50,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:50,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 969 of 1001 [2025-03-17 10:42:50,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:51,436 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2121] L1013-3-->L1013: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret48#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret48#1=|v_t2Thread1of1ForFork0_#t~ret48#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret48#1][866], [Black: 1008#(= ~top~0 0), 323#L1022-1true, 1006#true, 195#L1013true, 165#L959true, 1010#true, 997#true, Black: 1001#true]) [2025-03-17 10:42:51,437 INFO L294 olderBase$Statistics]: this new event has 1028 ancestors and is cut-off event [2025-03-17 10:42:51,437 INFO L297 olderBase$Statistics]: existing Event has 920 ancestors and is cut-off event [2025-03-17 10:42:51,437 INFO L297 olderBase$Statistics]: existing Event has 931 ancestors and is cut-off event [2025-03-17 10:42:51,437 INFO L297 olderBase$Statistics]: existing Event has 959 ancestors and is cut-off event [2025-03-17 10:42:51,437 INFO L124 PetriNetUnfolderBase]: 556/4945 cut-off events. [2025-03-17 10:42:51,437 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-17 10:42:51,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6520 conditions, 4945 events. 556/4945 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 33455 event pairs, 211 based on Foata normal form. 0/4606 useless extension candidates. Maximal degree in co-relation 5356. Up to 771 conditions per place. [2025-03-17 10:42:51,457 INFO L140 encePairwiseOnDemand]: 990/1001 looper letters, 35 selfloop transitions, 22 changer transitions 0/1035 dead transitions. [2025-03-17 10:42:51,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 994 places, 1035 transitions, 2289 flow [2025-03-17 10:42:51,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:42:51,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:42:51,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5872 transitions. [2025-03-17 10:42:51,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9776889776889777 [2025-03-17 10:42:51,465 INFO L175 Difference]: Start difference. First operand has 989 places, 1002 transitions, 2101 flow. Second operand 6 states and 5872 transitions. [2025-03-17 10:42:51,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 994 places, 1035 transitions, 2289 flow [2025-03-17 10:42:51,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 993 places, 1035 transitions, 2286 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:42:51,482 INFO L231 Difference]: Finished difference. Result has 998 places, 1023 transitions, 2248 flow [2025-03-17 10:42:51,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2098, PETRI_DIFFERENCE_MINUEND_PLACES=988, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1002, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=992, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2248, PETRI_PLACES=998, PETRI_TRANSITIONS=1023} [2025-03-17 10:42:51,484 INFO L279 CegarLoopForPetriNet]: 991 programPoint places, 7 predicate places. [2025-03-17 10:42:51,484 INFO L471 AbstractCegarLoop]: Abstraction has has 998 places, 1023 transitions, 2248 flow [2025-03-17 10:42:51,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 970.8333333333334) internal successors, (5825), 6 states have internal predecessors, (5825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:51,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:51,489 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:42:51,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:42:51,489 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-17 10:42:51,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:51,490 INFO L85 PathProgramCache]: Analyzing trace with hash -824362883, now seen corresponding path program 1 times [2025-03-17 10:42:51,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:51,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718809841] [2025-03-17 10:42:51,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:51,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:51,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 873 statements into 1 equivalence classes. [2025-03-17 10:42:51,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 873 of 873 statements. [2025-03-17 10:42:51,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:51,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:51,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:51,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:51,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718809841] [2025-03-17 10:42:51,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718809841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:51,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:51,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:42:51,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799512509] [2025-03-17 10:42:51,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:51,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:51,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:51,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:51,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:51,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 971 out of 1001 [2025-03-17 10:42:51,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 998 places, 1023 transitions, 2248 flow. Second operand has 3 states, 3 states have (on average 974.0) internal successors, (2922), 3 states have internal predecessors, (2922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:51,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:51,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 971 of 1001 [2025-03-17 10:42:51,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:52,523 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2121] L1013-3-->L1013: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret48#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret48#1=|v_t2Thread1of1ForFork0_#t~ret48#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret48#1][866], [1021#true, Black: 1008#(= ~top~0 0), 323#L1022-1true, 195#L1013true, 835#L998true, Black: 1015#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1014#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 1010#true, Black: 1012#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), 997#true, Black: 1013#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1001#true]) [2025-03-17 10:42:52,524 INFO L294 olderBase$Statistics]: this new event has 1008 ancestors and is cut-off event [2025-03-17 10:42:52,524 INFO L297 olderBase$Statistics]: existing Event has 900 ancestors and is cut-off event [2025-03-17 10:42:52,524 INFO L297 olderBase$Statistics]: existing Event has 934 ancestors and is cut-off event [2025-03-17 10:42:52,524 INFO L297 olderBase$Statistics]: existing Event has 900 ancestors and is cut-off event [2025-03-17 10:42:52,545 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2121] L1013-3-->L1013: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret48#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret48#1=|v_t2Thread1of1ForFork0_#t~ret48#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret48#1][866], [Black: 1008#(= ~top~0 0), 1021#true, 111#L993true, 323#L1022-1true, 195#L1013true, Black: 1015#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1014#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 1010#true, Black: 1012#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), 997#true, Black: 1013#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1001#true]) [2025-03-17 10:42:52,545 INFO L294 olderBase$Statistics]: this new event has 1014 ancestors and is cut-off event [2025-03-17 10:42:52,545 INFO L297 olderBase$Statistics]: existing Event has 940 ancestors and is cut-off event [2025-03-17 10:42:52,545 INFO L297 olderBase$Statistics]: existing Event has 906 ancestors and is cut-off event [2025-03-17 10:42:52,545 INFO L297 olderBase$Statistics]: existing Event has 906 ancestors and is cut-off event [2025-03-17 10:42:52,558 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2121] L1013-3-->L1013: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret48#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret48#1=|v_t2Thread1of1ForFork0_#t~ret48#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret48#1][866], [Black: 1008#(= ~top~0 0), 1021#true, 195#L1013true, Black: 1015#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1014#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 1010#true, Black: 1012#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), 619#L1024true, 997#true, Black: 1013#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1001#true]) [2025-03-17 10:42:52,558 INFO L294 olderBase$Statistics]: this new event has 1018 ancestors and is cut-off event [2025-03-17 10:42:52,558 INFO L297 olderBase$Statistics]: existing Event has 910 ancestors and is cut-off event [2025-03-17 10:42:52,559 INFO L297 olderBase$Statistics]: existing Event has 910 ancestors and is cut-off event [2025-03-17 10:42:52,559 INFO L297 olderBase$Statistics]: existing Event has 944 ancestors and is cut-off event [2025-03-17 10:42:52,568 INFO L124 PetriNetUnfolderBase]: 521/5004 cut-off events. [2025-03-17 10:42:52,569 INFO L125 PetriNetUnfolderBase]: For 383/434 co-relation queries the response was YES. [2025-03-17 10:42:52,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6947 conditions, 5004 events. 521/5004 cut-off events. For 383/434 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 33208 event pairs, 173 based on Foata normal form. 15/4700 useless extension candidates. Maximal degree in co-relation 5823. Up to 786 conditions per place. [2025-03-17 10:42:52,592 INFO L140 encePairwiseOnDemand]: 992/1001 looper letters, 32 selfloop transitions, 13 changer transitions 0/1037 dead transitions. [2025-03-17 10:42:52,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1000 places, 1037 transitions, 2386 flow [2025-03-17 10:42:52,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:52,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2946 transitions. [2025-03-17 10:42:52,596 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.981018981018981 [2025-03-17 10:42:52,596 INFO L175 Difference]: Start difference. First operand has 998 places, 1023 transitions, 2248 flow. Second operand 3 states and 2946 transitions. [2025-03-17 10:42:52,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1000 places, 1037 transitions, 2386 flow [2025-03-17 10:42:52,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1000 places, 1037 transitions, 2386 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:42:52,609 INFO L231 Difference]: Finished difference. Result has 1002 places, 1034 transitions, 2364 flow [2025-03-17 10:42:52,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2248, PETRI_DIFFERENCE_MINUEND_PLACES=998, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1023, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1010, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2364, PETRI_PLACES=1002, PETRI_TRANSITIONS=1034} [2025-03-17 10:42:52,610 INFO L279 CegarLoopForPetriNet]: 991 programPoint places, 11 predicate places. [2025-03-17 10:42:52,610 INFO L471 AbstractCegarLoop]: Abstraction has has 1002 places, 1034 transitions, 2364 flow [2025-03-17 10:42:52,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 974.0) internal successors, (2922), 3 states have internal predecessors, (2922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:52,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:52,612 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:42:52,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:42:52,613 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-17 10:42:52,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:52,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1008378852, now seen corresponding path program 1 times [2025-03-17 10:42:52,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:52,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167160395] [2025-03-17 10:42:52,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:52,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:52,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 886 statements into 1 equivalence classes. [2025-03-17 10:42:52,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 886 of 886 statements. [2025-03-17 10:42:52,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:52,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:53,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:53,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167160395] [2025-03-17 10:42:53,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167160395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:53,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:53,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:42:53,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496814613] [2025-03-17 10:42:53,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:53,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:53,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:53,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:53,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:53,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 984 out of 1001 [2025-03-17 10:42:53,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1002 places, 1034 transitions, 2364 flow. Second operand has 3 states, 3 states have (on average 986.0) internal successors, (2958), 3 states have internal predecessors, (2958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:53,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:53,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 984 of 1001 [2025-03-17 10:42:53,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:53,253 INFO L124 PetriNetUnfolderBase]: 33/1498 cut-off events. [2025-03-17 10:42:53,253 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-17 10:42:53,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1767 conditions, 1498 events. 33/1498 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3056 event pairs, 5 based on Foata normal form. 11/1475 useless extension candidates. Maximal degree in co-relation 1091. Up to 65 conditions per place. [2025-03-17 10:42:53,259 INFO L140 encePairwiseOnDemand]: 997/1001 looper letters, 7 selfloop transitions, 4 changer transitions 0/981 dead transitions. [2025-03-17 10:42:53,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 995 places, 981 transitions, 2091 flow [2025-03-17 10:42:53,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:53,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:53,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2965 transitions. [2025-03-17 10:42:53,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9873459873459873 [2025-03-17 10:42:53,263 INFO L175 Difference]: Start difference. First operand has 1002 places, 1034 transitions, 2364 flow. Second operand 3 states and 2965 transitions. [2025-03-17 10:42:53,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 995 places, 981 transitions, 2091 flow [2025-03-17 10:42:53,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 981 places, 981 transitions, 2017 flow, removed 23 selfloop flow, removed 14 redundant places. [2025-03-17 10:42:53,276 INFO L231 Difference]: Finished difference. Result has 981 places, 979 transitions, 1996 flow [2025-03-17 10:42:53,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=1988, PETRI_DIFFERENCE_MINUEND_PLACES=979, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=979, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=975, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1996, PETRI_PLACES=981, PETRI_TRANSITIONS=979} [2025-03-17 10:42:53,279 INFO L279 CegarLoopForPetriNet]: 991 programPoint places, -10 predicate places. [2025-03-17 10:42:53,279 INFO L471 AbstractCegarLoop]: Abstraction has has 981 places, 979 transitions, 1996 flow [2025-03-17 10:42:53,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 986.0) internal successors, (2958), 3 states have internal predecessors, (2958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:53,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:53,281 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:42:53,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:42:53,282 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-17 10:42:53,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:53,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1884310753, now seen corresponding path program 1 times [2025-03-17 10:42:53,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:53,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524817885] [2025-03-17 10:42:53,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:53,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:53,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 914 statements into 1 equivalence classes. [2025-03-17 10:42:53,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 914 of 914 statements. [2025-03-17 10:42:53,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:53,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:53,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:53,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:53,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524817885] [2025-03-17 10:42:53,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524817885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:53,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:53,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:42:53,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210349004] [2025-03-17 10:42:53,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:53,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:53,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:53,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:53,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:53,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 971 out of 1001 [2025-03-17 10:42:53,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 981 places, 979 transitions, 1996 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:53,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:53,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 971 of 1001 [2025-03-17 10:42:53,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:53,800 INFO L124 PetriNetUnfolderBase]: 52/1512 cut-off events. [2025-03-17 10:42:53,800 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-17 10:42:53,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1742 conditions, 1512 events. 52/1512 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3350 event pairs, 28 based on Foata normal form. 0/1479 useless extension candidates. Maximal degree in co-relation 1050. Up to 119 conditions per place. [2025-03-17 10:42:53,806 INFO L140 encePairwiseOnDemand]: 998/1001 looper letters, 22 selfloop transitions, 2 changer transitions 0/979 dead transitions. [2025-03-17 10:42:53,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 982 places, 979 transitions, 2045 flow [2025-03-17 10:42:53,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:53,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:53,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2936 transitions. [2025-03-17 10:42:53,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9776889776889777 [2025-03-17 10:42:53,813 INFO L175 Difference]: Start difference. First operand has 981 places, 979 transitions, 1996 flow. Second operand 3 states and 2936 transitions. [2025-03-17 10:42:53,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 982 places, 979 transitions, 2045 flow [2025-03-17 10:42:53,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 981 places, 979 transitions, 2041 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:42:53,828 INFO L231 Difference]: Finished difference. Result has 981 places, 978 transitions, 1994 flow [2025-03-17 10:42:53,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=1990, PETRI_DIFFERENCE_MINUEND_PLACES=979, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=978, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=976, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1994, PETRI_PLACES=981, PETRI_TRANSITIONS=978} [2025-03-17 10:42:53,831 INFO L279 CegarLoopForPetriNet]: 991 programPoint places, -10 predicate places. [2025-03-17 10:42:53,831 INFO L471 AbstractCegarLoop]: Abstraction has has 981 places, 978 transitions, 1994 flow [2025-03-17 10:42:53,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:53,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:53,834 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:42:53,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:42:53,834 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-17 10:42:53,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:53,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1464505607, now seen corresponding path program 1 times [2025-03-17 10:42:53,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:53,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579262798] [2025-03-17 10:42:53,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:53,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:53,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 929 statements into 1 equivalence classes. [2025-03-17 10:42:53,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 929 of 929 statements. [2025-03-17 10:42:53,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:53,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:55,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:55,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:55,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579262798] [2025-03-17 10:42:55,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579262798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:55,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:55,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:42:55,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547770215] [2025-03-17 10:42:55,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:55,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:42:55,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:55,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:42:55,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:42:55,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 971 out of 1001 [2025-03-17 10:42:55,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 981 places, 978 transitions, 1994 flow. Second operand has 6 states, 6 states have (on average 973.8333333333334) internal successors, (5843), 6 states have internal predecessors, (5843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:55,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:55,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 971 of 1001 [2025-03-17 10:42:55,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:55,452 INFO L124 PetriNetUnfolderBase]: 51/1508 cut-off events. [2025-03-17 10:42:55,452 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-17 10:42:55,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1715 conditions, 1508 events. 51/1508 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3322 event pairs, 26 based on Foata normal form. 0/1477 useless extension candidates. Maximal degree in co-relation 1609. Up to 105 conditions per place. [2025-03-17 10:42:55,456 INFO L140 encePairwiseOnDemand]: 995/1001 looper letters, 0 selfloop transitions, 0 changer transitions 981/981 dead transitions. [2025-03-17 10:42:55,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 985 places, 981 transitions, 2054 flow [2025-03-17 10:42:55,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:42:55,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:42:55,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5852 transitions. [2025-03-17 10:42:55,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9743589743589743 [2025-03-17 10:42:55,464 INFO L175 Difference]: Start difference. First operand has 981 places, 978 transitions, 1994 flow. Second operand 6 states and 5852 transitions. [2025-03-17 10:42:55,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 985 places, 981 transitions, 2054 flow [2025-03-17 10:42:55,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 983 places, 981 transitions, 2050 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:42:55,472 INFO L231 Difference]: Finished difference. Result has 983 places, 0 transitions, 0 flow [2025-03-17 10:42:55,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=1988, PETRI_DIFFERENCE_MINUEND_PLACES=978, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=977, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=977, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=983, PETRI_TRANSITIONS=0} [2025-03-17 10:42:55,474 INFO L279 CegarLoopForPetriNet]: 991 programPoint places, -8 predicate places. [2025-03-17 10:42:55,475 INFO L471 AbstractCegarLoop]: Abstraction has has 983 places, 0 transitions, 0 flow [2025-03-17 10:42:55,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 973.8333333333334) internal successors, (5843), 6 states have internal predecessors, (5843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:55,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 24 remaining) [2025-03-17 10:42:55,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 24 remaining) [2025-03-17 10:42:55,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (21 of 24 remaining) [2025-03-17 10:42:55,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (20 of 24 remaining) [2025-03-17 10:42:55,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (19 of 24 remaining) [2025-03-17 10:42:55,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (18 of 24 remaining) [2025-03-17 10:42:55,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (17 of 24 remaining) [2025-03-17 10:42:55,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (16 of 24 remaining) [2025-03-17 10:42:55,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (15 of 24 remaining) [2025-03-17 10:42:55,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (14 of 24 remaining) [2025-03-17 10:42:55,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (13 of 24 remaining) [2025-03-17 10:42:55,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (12 of 24 remaining) [2025-03-17 10:42:55,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (11 of 24 remaining) [2025-03-17 10:42:55,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (10 of 24 remaining) [2025-03-17 10:42:55,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (9 of 24 remaining) [2025-03-17 10:42:55,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (8 of 24 remaining) [2025-03-17 10:42:55,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (7 of 24 remaining) [2025-03-17 10:42:55,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (6 of 24 remaining) [2025-03-17 10:42:55,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (5 of 24 remaining) [2025-03-17 10:42:55,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (4 of 24 remaining) [2025-03-17 10:42:55,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 24 remaining) [2025-03-17 10:42:55,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (2 of 24 remaining) [2025-03-17 10:42:55,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (1 of 24 remaining) [2025-03-17 10:42:55,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (0 of 24 remaining) [2025-03-17 10:42:55,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:42:55,486 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:42:55,492 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 10:42:55,492 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 10:42:55,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 10:42:55 BasicIcfg [2025-03-17 10:42:55,498 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 10:42:55,498 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 10:42:55,498 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 10:42:55,498 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 10:42:55,499 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:42:44" (3/4) ... [2025-03-17 10:42:55,500 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 10:42:55,502 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2025-03-17 10:42:55,502 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2025-03-17 10:42:55,519 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-17 10:42:55,520 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 10:42:55,521 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 10:42:55,521 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 10:42:55,618 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 10:42:55,618 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 10:42:55,618 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 10:42:55,619 INFO L158 Benchmark]: Toolchain (without parser) took 13184.94ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 931.1MB). Free memory was 120.6MB in the beginning and 572.8MB in the end (delta: -452.2MB). Peak memory consumption was 480.8MB. Max. memory is 16.1GB. [2025-03-17 10:42:55,620 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 209.7MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 10:42:55,620 INFO L158 Benchmark]: CACSL2BoogieTranslator took 531.20ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 83.2MB in the end (delta: 37.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-17 10:42:55,620 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.29ms. Allocated memory is still 167.8MB. Free memory was 83.2MB in the beginning and 74.1MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 10:42:55,620 INFO L158 Benchmark]: Boogie Preprocessor took 52.18ms. Allocated memory is still 167.8MB. Free memory was 74.1MB in the beginning and 68.0MB in the end (delta: 6.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 10:42:55,621 INFO L158 Benchmark]: IcfgBuilder took 1091.06ms. Allocated memory is still 167.8MB. Free memory was 68.0MB in the beginning and 73.9MB in the end (delta: -5.9MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. [2025-03-17 10:42:55,621 INFO L158 Benchmark]: TraceAbstraction took 11306.14ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 931.1MB). Free memory was 73.2MB in the beginning and 585.4MB in the end (delta: -512.1MB). Peak memory consumption was 419.0MB. Max. memory is 16.1GB. [2025-03-17 10:42:55,621 INFO L158 Benchmark]: Witness Printer took 120.26ms. Allocated memory is still 1.1GB. Free memory was 585.4MB in the beginning and 572.8MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 10:42:55,622 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 209.7MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 531.20ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 83.2MB in the end (delta: 37.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.29ms. Allocated memory is still 167.8MB. Free memory was 83.2MB in the beginning and 74.1MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.18ms. Allocated memory is still 167.8MB. Free memory was 74.1MB in the beginning and 68.0MB in the end (delta: 6.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1091.06ms. Allocated memory is still 167.8MB. Free memory was 68.0MB in the beginning and 73.9MB in the end (delta: -5.9MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. * TraceAbstraction took 11306.14ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 931.1MB). Free memory was 73.2MB in the beginning and 585.4MB in the end (delta: -512.1MB). Peak memory consumption was 419.0MB. Max. memory is 16.1GB. * Witness Printer took 120.26ms. Allocated memory is still 1.1GB. Free memory was 585.4MB in the beginning and 572.8MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 961]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 953]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 968]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 945]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 945]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1008]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 975]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 949]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 949]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 953]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 983]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 1145 locations, 1164 edges, 24 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 306 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 91 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 492 IncrementalHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 91 mSDtfsCounter, 492 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2364occurred in iteration=4, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 6161 NumberOfCodeBlocks, 6161 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 6154 ConstructedInterpolants, 0 QuantifiedInterpolants, 8106 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 10:42:55,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE