./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-inner-race-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-inner-race-5.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 9c9074e122b1777f395c954ed30ab626f529c102cb2614b7e83435b6d498a843 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 14:00:59,073 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 14:00:59,158 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-20 14:00:59,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 14:00:59,165 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 14:00:59,208 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 14:00:59,208 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 14:00:59,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 14:00:59,209 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 14:00:59,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 14:00:59,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 14:00:59,212 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 14:00:59,212 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 14:00:59,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 14:00:59,213 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 14:00:59,213 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 14:00:59,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 14:00:59,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 14:00:59,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 14:00:59,215 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 14:00:59,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 14:00:59,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 14:00:59,219 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-20 14:00:59,219 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 14:00:59,219 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 14:00:59,219 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 14:00:59,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 14:00:59,220 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 14:00:59,220 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 14:00:59,220 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 14:00:59,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 14:00:59,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:00:59,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 14:00:59,221 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 14:00:59,221 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 14:00:59,222 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 14:00:59,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 14:00:59,222 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 14:00:59,223 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 14:00:59,223 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 14:00:59,223 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 14:00:59,224 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 9c9074e122b1777f395c954ed30ab626f529c102cb2614b7e83435b6d498a843 [2024-11-20 14:00:59,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 14:00:59,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 14:00:59,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 14:00:59,501 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 14:00:59,501 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 14:00:59,502 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-inner-race-5.i [2024-11-20 14:01:00,989 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 14:01:01,270 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 14:01:01,270 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-inner-race-5.i [2024-11-20 14:01:01,282 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3d389305/f6eab17cec5c4ee4bbd30ce915086308/FLAG3b04d4e49 [2024-11-20 14:01:01,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3d389305/f6eab17cec5c4ee4bbd30ce915086308 [2024-11-20 14:01:01,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 14:01:01,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 14:01:01,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 14:01:01,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 14:01:01,572 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 14:01:01,573 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:01:01" (1/1) ... [2024-11-20 14:01:01,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7955515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:01, skipping insertion in model container [2024-11-20 14:01:01,576 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:01:01" (1/1) ... [2024-11-20 14:01:01,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:01:01,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:01:01,984 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 14:01:02,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:01:02,068 INFO L204 MainTranslator]: Completed translation [2024-11-20 14:01:02,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:02 WrapperNode [2024-11-20 14:01:02,069 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 14:01:02,070 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 14:01:02,070 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 14:01:02,070 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 14:01:02,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:02" (1/1) ... [2024-11-20 14:01:02,098 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:02" (1/1) ... [2024-11-20 14:01:02,128 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 183 [2024-11-20 14:01:02,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 14:01:02,129 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 14:01:02,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 14:01:02,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 14:01:02,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:02" (1/1) ... [2024-11-20 14:01:02,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:02" (1/1) ... [2024-11-20 14:01:02,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:02" (1/1) ... [2024-11-20 14:01:02,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:02" (1/1) ... [2024-11-20 14:01:02,149 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:02" (1/1) ... [2024-11-20 14:01:02,152 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:02" (1/1) ... [2024-11-20 14:01:02,154 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:02" (1/1) ... [2024-11-20 14:01:02,155 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:02" (1/1) ... [2024-11-20 14:01:02,158 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 14:01:02,159 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 14:01:02,159 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 14:01:02,159 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 14:01:02,160 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:02" (1/1) ... [2024-11-20 14:01:02,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:01:02,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:01:02,195 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) [2024-11-20 14:01:02,197 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 [2024-11-20 14:01:02,235 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-20 14:01:02,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 14:01:02,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-20 14:01:02,236 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-20 14:01:02,236 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-20 14:01:02,236 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-20 14:01:02,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 14:01:02,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 14:01:02,238 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 14:01:02,375 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 14:01:02,378 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 14:01:02,722 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 14:01:02,722 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 14:01:02,777 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 14:01:02,777 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-20 14:01:02,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:01:02 BoogieIcfgContainer [2024-11-20 14:01:02,778 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 14:01:02,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 14:01:02,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 14:01:02,784 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 14:01:02,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:01:01" (1/3) ... [2024-11-20 14:01:02,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@83a45b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:01:02, skipping insertion in model container [2024-11-20 14:01:02,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:02" (2/3) ... [2024-11-20 14:01:02,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@83a45b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:01:02, skipping insertion in model container [2024-11-20 14:01:02,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:01:02" (3/3) ... [2024-11-20 14:01:02,787 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-counter-inner-race-5.i [2024-11-20 14:01:02,803 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 14:01:02,804 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-20 14:01:02,804 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 14:01:02,872 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-20 14:01:02,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 234 transitions, 472 flow [2024-11-20 14:01:03,087 INFO L124 PetriNetUnfolderBase]: 7/261 cut-off events. [2024-11-20 14:01:03,088 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 14:01:03,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 261 events. 7/261 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 188 event pairs, 0 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 178. Up to 4 conditions per place. [2024-11-20 14:01:03,097 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 234 transitions, 472 flow [2024-11-20 14:01:03,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 234 transitions, 472 flow [2024-11-20 14:01:03,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:01:03,125 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;@42955c41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:01:03,126 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-20 14:01:03,171 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 14:01:03,171 INFO L124 PetriNetUnfolderBase]: 2/164 cut-off events. [2024-11-20 14:01:03,171 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 14:01:03,171 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:03,172 INFO L204 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] [2024-11-20 14:01:03,174 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-11-20 14:01:03,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:03,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1697178864, now seen corresponding path program 1 times [2024-11-20 14:01:03,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:03,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158820049] [2024-11-20 14:01:03,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:03,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:03,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:01:03,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:01:03,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158820049] [2024-11-20 14:01:03,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158820049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:01:03,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:01:03,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:01:03,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197489335] [2024-11-20 14:01:03,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:01:03,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:01:03,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:01:03,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:01:03,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:01:03,717 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 234 [2024-11-20 14:01:03,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 234 transitions, 472 flow. Second operand has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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) [2024-11-20 14:01:03,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:01:03,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 234 [2024-11-20 14:01:03,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:01:04,015 INFO L124 PetriNetUnfolderBase]: 122/754 cut-off events. [2024-11-20 14:01:04,016 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-20 14:01:04,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 754 events. 122/754 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3270 event pairs, 29 based on Foata normal form. 13/702 useless extension candidates. Maximal degree in co-relation 832. Up to 167 conditions per place. [2024-11-20 14:01:04,026 INFO L140 encePairwiseOnDemand]: 222/234 looper letters, 28 selfloop transitions, 6 changer transitions 1/243 dead transitions. [2024-11-20 14:01:04,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 243 transitions, 558 flow [2024-11-20 14:01:04,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:01:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:01:04,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2024-11-20 14:01:04,044 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9529914529914529 [2024-11-20 14:01:04,048 INFO L175 Difference]: Start difference. First operand has 233 places, 234 transitions, 472 flow. Second operand 3 states and 669 transitions. [2024-11-20 14:01:04,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 243 transitions, 558 flow [2024-11-20 14:01:04,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 243 transitions, 558 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 14:01:04,059 INFO L231 Difference]: Finished difference. Result has 235 places, 232 transitions, 502 flow [2024-11-20 14:01:04,062 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=235, PETRI_TRANSITIONS=232} [2024-11-20 14:01:04,067 INFO L277 CegarLoopForPetriNet]: 233 programPoint places, 2 predicate places. [2024-11-20 14:01:04,068 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 232 transitions, 502 flow [2024-11-20 14:01:04,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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) [2024-11-20 14:01:04,069 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:04,069 INFO L204 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] [2024-11-20 14:01:04,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 14:01:04,070 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-11-20 14:01:04,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:04,071 INFO L85 PathProgramCache]: Analyzing trace with hash -721438585, now seen corresponding path program 1 times [2024-11-20 14:01:04,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:04,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577191558] [2024-11-20 14:01:04,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:04,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:04,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:01:04,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:01:04,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577191558] [2024-11-20 14:01:04,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577191558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:01:04,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:01:04,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:01:04,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195421230] [2024-11-20 14:01:04,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:01:04,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:01:04,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:01:04,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:01:04,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:01:04,295 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 234 [2024-11-20 14:01:04,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 232 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 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) [2024-11-20 14:01:04,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:01:04,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 234 [2024-11-20 14:01:04,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:01:04,481 INFO L124 PetriNetUnfolderBase]: 122/847 cut-off events. [2024-11-20 14:01:04,482 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-11-20 14:01:04,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1203 conditions, 847 events. 122/847 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4169 event pairs, 56 based on Foata normal form. 0/777 useless extension candidates. Maximal degree in co-relation 1010. Up to 170 conditions per place. [2024-11-20 14:01:04,490 INFO L140 encePairwiseOnDemand]: 230/234 looper letters, 19 selfloop transitions, 3 changer transitions 1/240 dead transitions. [2024-11-20 14:01:04,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 240 transitions, 564 flow [2024-11-20 14:01:04,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:01:04,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:01:04,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 672 transitions. [2024-11-20 14:01:04,493 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9572649572649573 [2024-11-20 14:01:04,493 INFO L175 Difference]: Start difference. First operand has 235 places, 232 transitions, 502 flow. Second operand 3 states and 672 transitions. [2024-11-20 14:01:04,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 240 transitions, 564 flow [2024-11-20 14:01:04,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 240 transitions, 552 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:01:04,501 INFO L231 Difference]: Finished difference. Result has 236 places, 234 transitions, 512 flow [2024-11-20 14:01:04,504 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=236, PETRI_TRANSITIONS=234} [2024-11-20 14:01:04,505 INFO L277 CegarLoopForPetriNet]: 233 programPoint places, 3 predicate places. [2024-11-20 14:01:04,505 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 234 transitions, 512 flow [2024-11-20 14:01:04,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 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) [2024-11-20 14:01:04,506 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:04,506 INFO L204 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] [2024-11-20 14:01:04,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 14:01:04,507 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-11-20 14:01:04,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:04,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2096188658, now seen corresponding path program 1 times [2024-11-20 14:01:04,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:04,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054253550] [2024-11-20 14:01:04,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:04,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:04,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:01:04,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:01:04,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054253550] [2024-11-20 14:01:04,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054253550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:01:04,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:01:04,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:01:04,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194232113] [2024-11-20 14:01:04,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:01:04,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:01:04,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:01:04,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:01:04,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:01:04,674 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 234 [2024-11-20 14:01:04,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 234 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 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) [2024-11-20 14:01:04,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:01:04,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 234 [2024-11-20 14:01:04,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:01:04,853 INFO L124 PetriNetUnfolderBase]: 146/883 cut-off events. [2024-11-20 14:01:04,854 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-11-20 14:01:04,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1346 conditions, 883 events. 146/883 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4273 event pairs, 73 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 1150. Up to 267 conditions per place. [2024-11-20 14:01:04,864 INFO L140 encePairwiseOnDemand]: 229/234 looper letters, 26 selfloop transitions, 5 changer transitions 0/242 dead transitions. [2024-11-20 14:01:04,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 242 transitions, 594 flow [2024-11-20 14:01:04,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:01:04,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:01:04,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 661 transitions. [2024-11-20 14:01:04,868 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9415954415954416 [2024-11-20 14:01:04,868 INFO L175 Difference]: Start difference. First operand has 236 places, 234 transitions, 512 flow. Second operand 3 states and 661 transitions. [2024-11-20 14:01:04,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 242 transitions, 594 flow [2024-11-20 14:01:04,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 242 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:01:04,875 INFO L231 Difference]: Finished difference. Result has 238 places, 238 transitions, 548 flow [2024-11-20 14:01:04,875 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=238, PETRI_TRANSITIONS=238} [2024-11-20 14:01:04,877 INFO L277 CegarLoopForPetriNet]: 233 programPoint places, 5 predicate places. [2024-11-20 14:01:04,877 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 238 transitions, 548 flow [2024-11-20 14:01:04,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 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) [2024-11-20 14:01:04,878 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:04,878 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:01:04,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 14:01:04,879 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-11-20 14:01:04,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:04,880 INFO L85 PathProgramCache]: Analyzing trace with hash -869214518, now seen corresponding path program 1 times [2024-11-20 14:01:04,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:04,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771275685] [2024-11-20 14:01:04,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:04,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:01:04,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 14:01:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:01:05,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 14:01:05,043 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 14:01:05,044 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2024-11-20 14:01:05,047 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2024-11-20 14:01:05,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2024-11-20 14:01:05,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2024-11-20 14:01:05,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2024-11-20 14:01:05,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2024-11-20 14:01:05,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2024-11-20 14:01:05,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2024-11-20 14:01:05,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2024-11-20 14:01:05,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2024-11-20 14:01:05,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2024-11-20 14:01:05,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2024-11-20 14:01:05,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2024-11-20 14:01:05,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 14:01:05,052 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-20 14:01:05,056 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-20 14:01:05,059 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-20 14:01:05,095 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-20 14:01:05,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 282 places, 281 transitions, 572 flow [2024-11-20 14:01:05,150 INFO L124 PetriNetUnfolderBase]: 10/343 cut-off events. [2024-11-20 14:01:05,150 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-20 14:01:05,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 343 events. 10/343 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 470 event pairs, 0 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 262. Up to 6 conditions per place. [2024-11-20 14:01:05,152 INFO L82 GeneralOperation]: Start removeDead. Operand has 282 places, 281 transitions, 572 flow [2024-11-20 14:01:05,156 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 282 places, 281 transitions, 572 flow [2024-11-20 14:01:05,158 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:01:05,160 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;@42955c41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:01:05,160 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-11-20 14:01:05,179 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 14:01:05,180 INFO L124 PetriNetUnfolderBase]: 2/164 cut-off events. [2024-11-20 14:01:05,180 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 14:01:05,180 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:05,180 INFO L204 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] [2024-11-20 14:01:05,181 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2024-11-20 14:01:05,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:05,181 INFO L85 PathProgramCache]: Analyzing trace with hash -467431543, now seen corresponding path program 1 times [2024-11-20 14:01:05,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:05,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322663707] [2024-11-20 14:01:05,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:05,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:05,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:01:05,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:01:05,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322663707] [2024-11-20 14:01:05,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322663707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:01:05,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:01:05,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:01:05,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615554039] [2024-11-20 14:01:05,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:01:05,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:01:05,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:01:05,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:01:05,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:01:05,300 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 281 [2024-11-20 14:01:05,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 281 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 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) [2024-11-20 14:01:05,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:01:05,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 281 [2024-11-20 14:01:05,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:01:07,362 INFO L124 PetriNetUnfolderBase]: 4627/13176 cut-off events. [2024-11-20 14:01:07,362 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-20 14:01:07,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20586 conditions, 13176 events. 4627/13176 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 131624 event pairs, 1551 based on Foata normal form. 263/11950 useless extension candidates. Maximal degree in co-relation 19499. Up to 4243 conditions per place. [2024-11-20 14:01:07,467 INFO L140 encePairwiseOnDemand]: 259/281 looper letters, 54 selfloop transitions, 14 changer transitions 1/309 dead transitions. [2024-11-20 14:01:07,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 309 transitions, 769 flow [2024-11-20 14:01:07,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:01:07,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:01:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 801 transitions. [2024-11-20 14:01:07,470 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9501779359430605 [2024-11-20 14:01:07,470 INFO L175 Difference]: Start difference. First operand has 282 places, 281 transitions, 572 flow. Second operand 3 states and 801 transitions. [2024-11-20 14:01:07,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 309 transitions, 769 flow [2024-11-20 14:01:07,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 309 transitions, 769 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 14:01:07,475 INFO L231 Difference]: Finished difference. Result has 286 places, 291 transitions, 686 flow [2024-11-20 14:01:07,476 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=286, PETRI_TRANSITIONS=291} [2024-11-20 14:01:07,477 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, 4 predicate places. [2024-11-20 14:01:07,477 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 291 transitions, 686 flow [2024-11-20 14:01:07,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 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) [2024-11-20 14:01:07,478 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:07,478 INFO L204 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] [2024-11-20 14:01:07,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 14:01:07,478 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2024-11-20 14:01:07,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:07,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1272050311, now seen corresponding path program 1 times [2024-11-20 14:01:07,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:07,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894595426] [2024-11-20 14:01:07,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:07,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:07,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:01:07,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:01:07,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894595426] [2024-11-20 14:01:07,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894595426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:01:07,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:01:07,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:01:07,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006747962] [2024-11-20 14:01:07,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:01:07,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:01:07,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:01:07,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:01:07,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:01:07,579 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 281 [2024-11-20 14:01:07,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 291 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 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) [2024-11-20 14:01:07,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:01:07,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 281 [2024-11-20 14:01:07,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:01:10,001 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][176], [281#true, Black: 285#true, 283#true, 100#L699-1true, 290#true, 218#L699-6true, 226#L713-1true, 287#(= |#race~threads_alive~0| 0)]) [2024-11-20 14:01:10,001 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2024-11-20 14:01:10,002 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-20 14:01:10,002 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2024-11-20 14:01:10,002 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-20 14:01:10,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][176], [281#true, Black: 285#true, 25#L699-2true, 283#true, 290#true, 218#L699-6true, 226#L713-1true, 287#(= |#race~threads_alive~0| 0)]) [2024-11-20 14:01:10,029 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2024-11-20 14:01:10,030 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-20 14:01:10,030 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-20 14:01:10,030 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-20 14:01:10,106 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [281#true, Black: 285#true, 170#L699-6true, 283#true, 290#true, 218#L699-6true, 226#L713-1true, 287#(= |#race~threads_alive~0| 0)]) [2024-11-20 14:01:10,107 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2024-11-20 14:01:10,107 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2024-11-20 14:01:10,107 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-20 14:01:10,107 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2024-11-20 14:01:10,260 INFO L124 PetriNetUnfolderBase]: 4195/15297 cut-off events. [2024-11-20 14:01:10,260 INFO L125 PetriNetUnfolderBase]: For 824/865 co-relation queries the response was YES. [2024-11-20 14:01:10,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24305 conditions, 15297 events. 4195/15297 cut-off events. For 824/865 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 173391 event pairs, 2308 based on Foata normal form. 0/13689 useless extension candidates. Maximal degree in co-relation 23033. Up to 4051 conditions per place. [2024-11-20 14:01:10,354 INFO L140 encePairwiseOnDemand]: 276/281 looper letters, 34 selfloop transitions, 4 changer transitions 0/306 dead transitions. [2024-11-20 14:01:10,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 306 transitions, 792 flow [2024-11-20 14:01:10,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:01:10,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:01:10,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 804 transitions. [2024-11-20 14:01:10,357 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9537366548042705 [2024-11-20 14:01:10,357 INFO L175 Difference]: Start difference. First operand has 286 places, 291 transitions, 686 flow. Second operand 3 states and 804 transitions. [2024-11-20 14:01:10,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 306 transitions, 792 flow [2024-11-20 14:01:10,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 306 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:01:10,375 INFO L231 Difference]: Finished difference. Result has 287 places, 294 transitions, 688 flow [2024-11-20 14:01:10,376 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=287, PETRI_TRANSITIONS=294} [2024-11-20 14:01:10,377 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, 5 predicate places. [2024-11-20 14:01:10,377 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 294 transitions, 688 flow [2024-11-20 14:01:10,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 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) [2024-11-20 14:01:10,378 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:10,378 INFO L204 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] [2024-11-20 14:01:10,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 14:01:10,379 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2024-11-20 14:01:10,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:10,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1235526293, now seen corresponding path program 1 times [2024-11-20 14:01:10,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:10,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815403112] [2024-11-20 14:01:10,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:10,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:10,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:01:10,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:01:10,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815403112] [2024-11-20 14:01:10,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815403112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:01:10,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:01:10,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:01:10,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285776027] [2024-11-20 14:01:10,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:01:10,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:01:10,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:01:10,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:01:10,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:01:10,482 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 281 [2024-11-20 14:01:10,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 294 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 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) [2024-11-20 14:01:10,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:01:10,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 281 [2024-11-20 14:01:10,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:01:10,969 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][239], [260#L692-2true, Black: 285#true, 281#true, Black: 292#(= |#race~data~0| 0), 283#true, 290#true, 71#L692-7true, 226#L713-1true, 295#true]) [2024-11-20 14:01:10,969 INFO L294 olderBase$Statistics]: this new event has 202 ancestors and is cut-off event [2024-11-20 14:01:10,970 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2024-11-20 14:01:10,970 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2024-11-20 14:01:10,970 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2024-11-20 14:01:11,038 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][176], [281#true, 260#L692-2true, Black: 285#true, 227#L694true, Black: 292#(= |#race~data~0| 0), 283#true, 290#true, 226#L713-1true, 295#true]) [2024-11-20 14:01:11,039 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2024-11-20 14:01:11,039 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2024-11-20 14:01:11,039 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2024-11-20 14:01:11,039 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-11-20 14:01:11,063 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][176], [281#true, Black: 285#true, 260#L692-2true, Black: 292#(= |#race~data~0| 0), 283#true, 122#L694-3true, 290#true, 226#L713-1true, 295#true]) [2024-11-20 14:01:11,064 INFO L294 olderBase$Statistics]: this new event has 205 ancestors and is cut-off event [2024-11-20 14:01:11,064 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2024-11-20 14:01:11,064 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-11-20 14:01:11,064 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2024-11-20 14:01:11,115 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][176], [260#L692-2true, 281#true, Black: 285#true, 240#L695-3true, Black: 292#(= |#race~data~0| 0), 283#true, 290#true, 226#L713-1true, 295#true]) [2024-11-20 14:01:11,115 INFO L294 olderBase$Statistics]: this new event has 207 ancestors and is cut-off event [2024-11-20 14:01:11,116 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2024-11-20 14:01:11,116 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2024-11-20 14:01:11,116 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-11-20 14:01:11,543 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][176], [281#true, 260#L692-2true, Black: 285#true, Black: 292#(= |#race~data~0| 0), 283#true, 290#true, 226#L713-1true, 279#L697-3true, 295#true]) [2024-11-20 14:01:11,543 INFO L294 olderBase$Statistics]: this new event has 217 ancestors and is cut-off event [2024-11-20 14:01:11,544 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2024-11-20 14:01:11,544 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2024-11-20 14:01:11,544 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2024-11-20 14:01:11,601 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][176], [Black: 285#true, 281#true, 260#L692-2true, Black: 292#(= |#race~data~0| 0), 283#true, 67#L698-3true, 290#true, 226#L713-1true, 295#true]) [2024-11-20 14:01:11,601 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2024-11-20 14:01:11,601 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-11-20 14:01:11,601 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2024-11-20 14:01:11,601 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-11-20 14:01:12,066 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][239], [281#true, 253#L699-2true, Black: 285#true, Black: 292#(= |#race~data~0| 0), 283#true, 290#true, 71#L692-7true, 226#L713-1true, 295#true]) [2024-11-20 14:01:12,066 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2024-11-20 14:01:12,066 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2024-11-20 14:01:12,066 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-11-20 14:01:12,066 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2024-11-20 14:01:12,221 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][176], [253#L699-2true, 281#true, Black: 285#true, 227#L694true, Black: 292#(= |#race~data~0| 0), 283#true, 290#true, 226#L713-1true, 295#true]) [2024-11-20 14:01:12,222 INFO L294 olderBase$Statistics]: this new event has 229 ancestors and is cut-off event [2024-11-20 14:01:12,222 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2024-11-20 14:01:12,222 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2024-11-20 14:01:12,222 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2024-11-20 14:01:12,282 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][176], [281#true, 253#L699-2true, Black: 285#true, Black: 292#(= |#race~data~0| 0), 283#true, 122#L694-3true, 290#true, 226#L713-1true, 295#true]) [2024-11-20 14:01:12,282 INFO L294 olderBase$Statistics]: this new event has 230 ancestors and is cut-off event [2024-11-20 14:01:12,282 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2024-11-20 14:01:12,282 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2024-11-20 14:01:12,283 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2024-11-20 14:01:12,373 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][176], [281#true, 253#L699-2true, Black: 285#true, 240#L695-3true, Black: 292#(= |#race~data~0| 0), 283#true, 290#true, 226#L713-1true, 295#true]) [2024-11-20 14:01:12,373 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is cut-off event [2024-11-20 14:01:12,373 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2024-11-20 14:01:12,374 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-11-20 14:01:12,374 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-11-20 14:01:12,766 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][176], [253#L699-2true, 281#true, Black: 285#true, Black: 292#(= |#race~data~0| 0), 283#true, 290#true, 226#L713-1true, 279#L697-3true, 295#true]) [2024-11-20 14:01:12,766 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2024-11-20 14:01:12,766 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2024-11-20 14:01:12,766 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2024-11-20 14:01:12,766 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-11-20 14:01:12,803 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][176], [281#true, Black: 285#true, 253#L699-2true, Black: 292#(= |#race~data~0| 0), 283#true, 67#L698-3true, 290#true, 226#L713-1true, 295#true]) [2024-11-20 14:01:12,804 INFO L294 olderBase$Statistics]: this new event has 244 ancestors and is cut-off event [2024-11-20 14:01:12,804 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2024-11-20 14:01:12,804 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2024-11-20 14:01:12,804 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2024-11-20 14:01:13,076 INFO L124 PetriNetUnfolderBase]: 5628/18178 cut-off events. [2024-11-20 14:01:13,076 INFO L125 PetriNetUnfolderBase]: For 2763/3030 co-relation queries the response was YES. [2024-11-20 14:01:13,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31893 conditions, 18178 events. 5628/18178 cut-off events. For 2763/3030 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 201285 event pairs, 2940 based on Foata normal form. 94/16426 useless extension candidates. Maximal degree in co-relation 25904. Up to 7546 conditions per place. [2024-11-20 14:01:13,190 INFO L140 encePairwiseOnDemand]: 272/281 looper letters, 49 selfloop transitions, 14 changer transitions 0/317 dead transitions. [2024-11-20 14:01:13,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 317 transitions, 885 flow [2024-11-20 14:01:13,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:01:13,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:01:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 791 transitions. [2024-11-20 14:01:13,193 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9383155397390273 [2024-11-20 14:01:13,193 INFO L175 Difference]: Start difference. First operand has 287 places, 294 transitions, 688 flow. Second operand 3 states and 791 transitions. [2024-11-20 14:01:13,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 317 transitions, 885 flow [2024-11-20 14:01:13,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 317 transitions, 877 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:01:13,212 INFO L231 Difference]: Finished difference. Result has 289 places, 306 transitions, 806 flow [2024-11-20 14:01:13,213 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=806, PETRI_PLACES=289, PETRI_TRANSITIONS=306} [2024-11-20 14:01:13,214 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, 7 predicate places. [2024-11-20 14:01:13,214 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 306 transitions, 806 flow [2024-11-20 14:01:13,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 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) [2024-11-20 14:01:13,215 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:13,215 INFO L204 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] [2024-11-20 14:01:13,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 14:01:13,215 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2024-11-20 14:01:13,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:13,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1557606692, now seen corresponding path program 1 times [2024-11-20 14:01:13,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:13,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816855738] [2024-11-20 14:01:13,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:13,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:13,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:01:13,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:01:13,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816855738] [2024-11-20 14:01:13,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816855738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:01:13,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:01:13,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:01:13,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116643189] [2024-11-20 14:01:13,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:01:13,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:01:13,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:01:13,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:01:13,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:01:13,307 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 281 [2024-11-20 14:01:13,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 306 transitions, 806 flow. Second operand has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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) [2024-11-20 14:01:13,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:01:13,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 281 [2024-11-20 14:01:13,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:01:13,617 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][234], [Black: 285#true, 260#L692-2true, 281#true, Black: 292#(= |#race~data~0| 0), 283#true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 300#true, 71#L692-7true, 226#L713-1true, 295#true]) [2024-11-20 14:01:13,617 INFO L294 olderBase$Statistics]: this new event has 202 ancestors and is cut-off event [2024-11-20 14:01:13,618 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2024-11-20 14:01:13,618 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2024-11-20 14:01:13,618 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2024-11-20 14:01:13,858 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][176], [Black: 285#true, 260#L692-2true, 281#true, 227#L694true, Black: 292#(= |#race~data~0| 0), 283#true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 300#true, 226#L713-1true, 295#true]) [2024-11-20 14:01:13,858 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2024-11-20 14:01:13,859 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2024-11-20 14:01:13,859 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2024-11-20 14:01:13,859 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-11-20 14:01:14,818 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([888] L699-->L699-1: Formula: (= 0 |v_#race~threads_alive~0_4|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][318], [281#true, Black: 285#true, Black: 292#(= |#race~data~0| 0), 16#L713-2true, 283#true, 80#L699-1true, 300#true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 71#L692-7true, 295#true]) [2024-11-20 14:01:14,819 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2024-11-20 14:01:14,819 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2024-11-20 14:01:14,819 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-11-20 14:01:14,819 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2024-11-20 14:01:14,896 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][234], [Black: 285#true, 281#true, Black: 292#(= |#race~data~0| 0), 283#true, 80#L699-1true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 300#true, 71#L692-7true, 226#L713-1true, 295#true]) [2024-11-20 14:01:14,897 INFO L294 olderBase$Statistics]: this new event has 226 ancestors and is cut-off event [2024-11-20 14:01:14,897 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2024-11-20 14:01:14,897 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2024-11-20 14:01:14,897 INFO L297 olderBase$Statistics]: existing Event has 221 ancestors and is cut-off event [2024-11-20 14:01:14,898 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][234], [Black: 285#true, 253#L699-2true, 281#true, Black: 292#(= |#race~data~0| 0), 283#true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 300#true, 71#L692-7true, 226#L713-1true, 295#true]) [2024-11-20 14:01:14,898 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2024-11-20 14:01:14,898 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2024-11-20 14:01:14,898 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2024-11-20 14:01:14,899 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-11-20 14:01:14,899 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([748] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][234], [253#L699-2true, Black: 285#true, 281#true, Black: 292#(= |#race~data~0| 0), 283#true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 300#true, 71#L692-7true, 226#L713-1true, 295#true]) [2024-11-20 14:01:14,899 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2024-11-20 14:01:14,899 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2024-11-20 14:01:14,899 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2024-11-20 14:01:14,900 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-11-20 14:01:14,900 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-11-20 14:01:14,997 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][176], [281#true, Black: 285#true, 253#L699-2true, Black: 292#(= |#race~data~0| 0), 14#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 283#true, 300#true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 226#L713-1true, 295#true]) [2024-11-20 14:01:14,997 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2024-11-20 14:01:14,997 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-11-20 14:01:14,997 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-11-20 14:01:14,997 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2024-11-20 14:01:15,047 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][176], [253#L699-2true, Black: 285#true, 281#true, 227#L694true, Black: 292#(= |#race~data~0| 0), 283#true, 300#true, Black: 297#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 226#L713-1true, 295#true]) [2024-11-20 14:01:15,047 INFO L294 olderBase$Statistics]: this new event has 229 ancestors and is cut-off event [2024-11-20 14:01:15,047 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2024-11-20 14:01:15,047 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2024-11-20 14:01:15,048 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2024-11-20 14:01:16,095 INFO L124 PetriNetUnfolderBase]: 5599/20226 cut-off events. [2024-11-20 14:01:16,096 INFO L125 PetriNetUnfolderBase]: For 3183/3543 co-relation queries the response was YES. [2024-11-20 14:01:16,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34706 conditions, 20226 events. 5599/20226 cut-off events. For 3183/3543 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 239451 event pairs, 3099 based on Foata normal form. 21/18179 useless extension candidates. Maximal degree in co-relation 33125. Up to 6066 conditions per place. [2024-11-20 14:01:16,211 INFO L140 encePairwiseOnDemand]: 275/281 looper letters, 36 selfloop transitions, 7 changer transitions 0/322 dead transitions. [2024-11-20 14:01:16,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 322 transitions, 935 flow [2024-11-20 14:01:16,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:01:16,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:01:16,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 800 transitions. [2024-11-20 14:01:16,213 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9489916963226572 [2024-11-20 14:01:16,213 INFO L175 Difference]: Start difference. First operand has 289 places, 306 transitions, 806 flow. Second operand 3 states and 800 transitions. [2024-11-20 14:01:16,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 322 transitions, 935 flow [2024-11-20 14:01:16,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 322 transitions, 907 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:01:16,230 INFO L231 Difference]: Finished difference. Result has 291 places, 311 transitions, 834 flow [2024-11-20 14:01:16,231 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=291, PETRI_TRANSITIONS=311} [2024-11-20 14:01:16,232 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, 9 predicate places. [2024-11-20 14:01:16,233 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 311 transitions, 834 flow [2024-11-20 14:01:16,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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) [2024-11-20 14:01:16,234 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:16,234 INFO L204 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] [2024-11-20 14:01:16,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 14:01:16,235 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2024-11-20 14:01:16,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:16,236 INFO L85 PathProgramCache]: Analyzing trace with hash 577156445, now seen corresponding path program 1 times [2024-11-20 14:01:16,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:16,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395463028] [2024-11-20 14:01:16,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:16,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:16,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:01:16,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:01:16,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395463028] [2024-11-20 14:01:16,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395463028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:01:16,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:01:16,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:01:16,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143805231] [2024-11-20 14:01:16,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:01:16,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:01:16,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:01:16,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:01:16,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:01:16,418 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 281 [2024-11-20 14:01:16,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 311 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 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) [2024-11-20 14:01:16,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:01:16,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 281 [2024-11-20 14:01:16,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:01:17,758 INFO L124 PetriNetUnfolderBase]: 1939/10763 cut-off events. [2024-11-20 14:01:17,758 INFO L125 PetriNetUnfolderBase]: For 1679/1960 co-relation queries the response was YES. [2024-11-20 14:01:17,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17785 conditions, 10763 events. 1939/10763 cut-off events. For 1679/1960 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 127566 event pairs, 546 based on Foata normal form. 260/10107 useless extension candidates. Maximal degree in co-relation 16781. Up to 1517 conditions per place. [2024-11-20 14:01:17,824 INFO L140 encePairwiseOnDemand]: 267/281 looper letters, 16 selfloop transitions, 14 changer transitions 0/318 dead transitions. [2024-11-20 14:01:17,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 318 transitions, 897 flow [2024-11-20 14:01:17,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:01:17,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:01:17,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 813 transitions. [2024-11-20 14:01:17,827 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9644128113879004 [2024-11-20 14:01:17,828 INFO L175 Difference]: Start difference. First operand has 291 places, 311 transitions, 834 flow. Second operand 3 states and 813 transitions. [2024-11-20 14:01:17,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 318 transitions, 897 flow [2024-11-20 14:01:17,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 318 transitions, 883 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:01:17,840 INFO L231 Difference]: Finished difference. Result has 292 places, 315 transitions, 870 flow [2024-11-20 14:01:17,841 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=870, PETRI_PLACES=292, PETRI_TRANSITIONS=315} [2024-11-20 14:01:17,842 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, 10 predicate places. [2024-11-20 14:01:17,842 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 315 transitions, 870 flow [2024-11-20 14:01:17,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 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) [2024-11-20 14:01:17,843 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:17,843 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:01:17,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 14:01:17,844 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2024-11-20 14:01:17,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:17,844 INFO L85 PathProgramCache]: Analyzing trace with hash -969104378, now seen corresponding path program 1 times [2024-11-20 14:01:17,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:17,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360871690] [2024-11-20 14:01:17,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:17,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:17,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-20 14:01:17,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:01:17,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360871690] [2024-11-20 14:01:17,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360871690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:01:17,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:01:17,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:01:17,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563637179] [2024-11-20 14:01:17,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:01:17,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:01:17,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:01:17,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:01:17,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:01:17,969 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 281 [2024-11-20 14:01:17,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 315 transitions, 870 flow. Second operand has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 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) [2024-11-20 14:01:17,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:01:17,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 281 [2024-11-20 14:01:17,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:01:19,753 INFO L124 PetriNetUnfolderBase]: 3011/13203 cut-off events. [2024-11-20 14:01:19,753 INFO L125 PetriNetUnfolderBase]: For 6976/7613 co-relation queries the response was YES. [2024-11-20 14:01:19,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27760 conditions, 13203 events. 3011/13203 cut-off events. For 6976/7613 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 155007 event pairs, 1192 based on Foata normal form. 50/12222 useless extension candidates. Maximal degree in co-relation 26513. Up to 4906 conditions per place. [2024-11-20 14:01:19,834 INFO L140 encePairwiseOnDemand]: 274/281 looper letters, 60 selfloop transitions, 10 changer transitions 0/331 dead transitions. [2024-11-20 14:01:19,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 331 transitions, 1079 flow [2024-11-20 14:01:19,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:01:19,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:01:19,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 786 transitions. [2024-11-20 14:01:19,838 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9323843416370107 [2024-11-20 14:01:19,838 INFO L175 Difference]: Start difference. First operand has 292 places, 315 transitions, 870 flow. Second operand 3 states and 786 transitions. [2024-11-20 14:01:19,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 331 transitions, 1079 flow [2024-11-20 14:01:19,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 331 transitions, 1058 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 14:01:19,854 INFO L231 Difference]: Finished difference. Result has 295 places, 323 transitions, 946 flow [2024-11-20 14:01:19,854 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=946, PETRI_PLACES=295, PETRI_TRANSITIONS=323} [2024-11-20 14:01:19,856 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, 13 predicate places. [2024-11-20 14:01:19,856 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 323 transitions, 946 flow [2024-11-20 14:01:19,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 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) [2024-11-20 14:01:19,857 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:19,857 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:01:19,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 14:01:19,858 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2024-11-20 14:01:19,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:19,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1515072880, now seen corresponding path program 1 times [2024-11-20 14:01:19,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:19,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18616929] [2024-11-20 14:01:19,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:19,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:01:19,896 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 14:01:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:01:19,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 14:01:19,968 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 14:01:19,968 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2024-11-20 14:01:19,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2024-11-20 14:01:19,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2024-11-20 14:01:19,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2024-11-20 14:01:19,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2024-11-20 14:01:19,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2024-11-20 14:01:19,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2024-11-20 14:01:19,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2024-11-20 14:01:19,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2024-11-20 14:01:19,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2024-11-20 14:01:19,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2024-11-20 14:01:19,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2024-11-20 14:01:19,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2024-11-20 14:01:19,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2024-11-20 14:01:19,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2024-11-20 14:01:19,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2024-11-20 14:01:19,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2024-11-20 14:01:19,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2024-11-20 14:01:19,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 14:01:19,970 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:01:19,971 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-20 14:01:19,971 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-20 14:01:20,018 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-20 14:01:20,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 331 places, 328 transitions, 674 flow [2024-11-20 14:01:20,283 INFO L124 PetriNetUnfolderBase]: 13/425 cut-off events. [2024-11-20 14:01:20,283 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-20 14:01:20,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 425 events. 13/425 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 814 event pairs, 0 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 347. Up to 8 conditions per place. [2024-11-20 14:01:20,285 INFO L82 GeneralOperation]: Start removeDead. Operand has 331 places, 328 transitions, 674 flow [2024-11-20 14:01:20,291 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 331 places, 328 transitions, 674 flow [2024-11-20 14:01:20,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:01:20,293 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;@42955c41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:01:20,294 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-11-20 14:01:20,302 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 14:01:20,302 INFO L124 PetriNetUnfolderBase]: 2/164 cut-off events. [2024-11-20 14:01:20,302 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 14:01:20,302 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:20,302 INFO L204 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] [2024-11-20 14:01:20,303 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2024-11-20 14:01:20,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:20,303 INFO L85 PathProgramCache]: Analyzing trace with hash -545170479, now seen corresponding path program 1 times [2024-11-20 14:01:20,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:20,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349535669] [2024-11-20 14:01:20,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:20,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:20,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:01:20,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:01:20,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349535669] [2024-11-20 14:01:20,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349535669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:01:20,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:01:20,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:01:20,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471663213] [2024-11-20 14:01:20,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:01:20,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:01:20,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:01:20,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:01:20,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:01:20,424 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 328 [2024-11-20 14:01:20,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 328 transitions, 674 flow. Second operand has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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) [2024-11-20 14:01:20,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:01:20,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 328 [2024-11-20 14:01:20,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand