./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/14_spin2003.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/pthread-ext/14_spin2003.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 83bca07672f78100877a79a1440d2a8107bad3ebb200d176bee629abfa2ef706 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:07:04,536 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:07:04,617 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:07:04,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:07:04,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:07:04,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:07:04,665 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:07:04,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:07:04,666 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:07:04,667 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:07:04,667 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:07:04,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:07:04,668 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:07:04,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:07:04,670 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:07:04,671 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:07:04,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:07:04,674 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:07:04,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:07:04,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:07:04,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:07:04,676 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:07:04,676 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:07:04,676 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:07:04,676 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:07:04,680 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:07:04,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:07:04,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:07:04,681 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:07:04,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:07:04,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:07:04,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:07:04,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:07:04,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:07:04,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:07:04,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:07:04,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:07:04,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:07:04,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:07:04,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:07:04,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:07:04,686 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 -> 83bca07672f78100877a79a1440d2a8107bad3ebb200d176bee629abfa2ef706 [2024-11-10 14:07:04,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:07:04,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:07:04,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:07:04,945 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:07:04,946 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:07:04,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/14_spin2003.i [2024-11-10 14:07:06,329 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:07:06,574 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:07:06,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/14_spin2003.i [2024-11-10 14:07:06,589 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76dbbabef/8fce0da2bf8641b7940915afffaea860/FLAG44cb091ca [2024-11-10 14:07:06,605 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76dbbabef/8fce0da2bf8641b7940915afffaea860 [2024-11-10 14:07:06,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:07:06,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:07:06,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:07:06,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:07:06,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:07:06,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:07:06" (1/1) ... [2024-11-10 14:07:06,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bfce6b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:06, skipping insertion in model container [2024-11-10 14:07:06,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:07:06" (1/1) ... [2024-11-10 14:07:06,649 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:07:06,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:07:06,986 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:07:07,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:07:07,063 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:07:07,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:07 WrapperNode [2024-11-10 14:07:07,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:07:07,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:07:07,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:07:07,065 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:07:07,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:07" (1/1) ... [2024-11-10 14:07:07,101 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:07" (1/1) ... [2024-11-10 14:07:07,117 INFO L138 Inliner]: procedures = 161, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 51 [2024-11-10 14:07:07,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:07:07,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:07:07,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:07:07,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:07:07,138 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:07" (1/1) ... [2024-11-10 14:07:07,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:07" (1/1) ... [2024-11-10 14:07:07,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:07" (1/1) ... [2024-11-10 14:07:07,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:07" (1/1) ... [2024-11-10 14:07:07,145 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:07" (1/1) ... [2024-11-10 14:07:07,145 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:07" (1/1) ... [2024-11-10 14:07:07,146 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:07" (1/1) ... [2024-11-10 14:07:07,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:07" (1/1) ... [2024-11-10 14:07:07,149 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:07:07,150 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:07:07,150 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:07:07,150 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:07:07,151 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:07" (1/1) ... [2024-11-10 14:07:07,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:07:07,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:07:07,189 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-10 14:07:07,193 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-10 14:07:07,240 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-10 14:07:07,241 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-10 14:07:07,241 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 14:07:07,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:07:07,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:07:07,242 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 14:07:07,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:07:07,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:07:07,243 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:07:07,391 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:07:07,393 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:07:07,509 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:07:07,510 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:07:07,541 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:07:07,543 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:07:07,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:07:07 BoogieIcfgContainer [2024-11-10 14:07:07,544 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:07:07,547 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:07:07,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:07:07,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:07:07,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:07:06" (1/3) ... [2024-11-10 14:07:07,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36dce05d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:07:07, skipping insertion in model container [2024-11-10 14:07:07,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:07:07" (2/3) ... [2024-11-10 14:07:07,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36dce05d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:07:07, skipping insertion in model container [2024-11-10 14:07:07,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:07:07" (3/3) ... [2024-11-10 14:07:07,555 INFO L112 eAbstractionObserver]: Analyzing ICFG 14_spin2003.i [2024-11-10 14:07:07,572 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:07:07,572 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-10 14:07:07,572 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:07:07,622 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 14:07:07,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 59 transitions, 122 flow [2024-11-10 14:07:07,690 INFO L124 PetriNetUnfolderBase]: 4/69 cut-off events. [2024-11-10 14:07:07,691 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:07:07,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 69 events. 4/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 40. Up to 4 conditions per place. [2024-11-10 14:07:07,696 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 59 transitions, 122 flow [2024-11-10 14:07:07,700 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 59 transitions, 122 flow [2024-11-10 14:07:07,708 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:07:07,715 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;@48a69791, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:07:07,716 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-10 14:07:07,730 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:07:07,730 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events. [2024-11-10 14:07:07,731 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:07:07,732 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:07:07,733 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] [2024-11-10 14:07:07,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 14:07:07,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:07:07,738 INFO L85 PathProgramCache]: Analyzing trace with hash 905489224, now seen corresponding path program 1 times [2024-11-10 14:07:07,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:07:07,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962638378] [2024-11-10 14:07:07,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:07:07,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:07:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:07:07,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:07:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:07:07,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:07:07,925 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:07:07,926 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-10 14:07:07,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-10 14:07:07,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-10 14:07:07,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-10 14:07:07,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-10 14:07:07,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-10 14:07:07,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2024-11-10 14:07:07,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:07:07,930 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-10 14:07:07,933 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:07:07,933 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 14:07:07,960 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 14:07:07,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 90 transitions, 190 flow [2024-11-10 14:07:08,005 INFO L124 PetriNetUnfolderBase]: 7/110 cut-off events. [2024-11-10 14:07:08,006 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 14:07:08,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 110 events. 7/110 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 183 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 70. Up to 6 conditions per place. [2024-11-10 14:07:08,008 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 90 transitions, 190 flow [2024-11-10 14:07:08,010 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 90 transitions, 190 flow [2024-11-10 14:07:08,012 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:07:08,013 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;@48a69791, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:07:08,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-10 14:07:08,026 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:07:08,026 INFO L124 PetriNetUnfolderBase]: 2/46 cut-off events. [2024-11-10 14:07:08,026 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:07:08,027 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:07:08,027 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] [2024-11-10 14:07:08,027 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-11-10 14:07:08,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:07:08,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1146196410, now seen corresponding path program 1 times [2024-11-10 14:07:08,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:07:08,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65112948] [2024-11-10 14:07:08,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:07:08,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:07:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:07:08,177 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-10 14:07:08,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:07:08,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65112948] [2024-11-10 14:07:08,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65112948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:07:08,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:07:08,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:07:08,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860500807] [2024-11-10 14:07:08,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:07:08,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:07:08,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:07:08,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:07:08,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:07:08,281 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 90 [2024-11-10 14:07:08,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 90 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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-10 14:07:08,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:07:08,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 90 [2024-11-10 14:07:08,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:07:08,388 INFO L124 PetriNetUnfolderBase]: 57/333 cut-off events. [2024-11-10 14:07:08,389 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-11-10 14:07:08,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498 conditions, 333 events. 57/333 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1656 event pairs, 37 based on Foata normal form. 186/474 useless extension candidates. Maximal degree in co-relation 385. Up to 109 conditions per place. [2024-11-10 14:07:08,397 INFO L140 encePairwiseOnDemand]: 77/90 looper letters, 18 selfloop transitions, 6 changer transitions 0/85 dead transitions. [2024-11-10 14:07:08,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 85 transitions, 233 flow [2024-11-10 14:07:08,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:07:08,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:07:08,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2024-11-10 14:07:08,412 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8629629629629629 [2024-11-10 14:07:08,414 INFO L175 Difference]: Start difference. First operand has 90 places, 90 transitions, 190 flow. Second operand 3 states and 233 transitions. [2024-11-10 14:07:08,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 85 transitions, 233 flow [2024-11-10 14:07:08,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 85 transitions, 233 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:07:08,424 INFO L231 Difference]: Finished difference. Result has 86 places, 82 transitions, 210 flow [2024-11-10 14:07:08,427 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=86, PETRI_TRANSITIONS=82} [2024-11-10 14:07:08,431 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -4 predicate places. [2024-11-10 14:07:08,432 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 82 transitions, 210 flow [2024-11-10 14:07:08,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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-10 14:07:08,433 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:07:08,433 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:07:08,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:07:08,434 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-11-10 14:07:08,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:07:08,435 INFO L85 PathProgramCache]: Analyzing trace with hash 349733856, now seen corresponding path program 1 times [2024-11-10 14:07:08,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:07:08,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196500758] [2024-11-10 14:07:08,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:07:08,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:07:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:07:08,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:07:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:07:08,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:07:08,491 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:07:08,492 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2024-11-10 14:07:08,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2024-11-10 14:07:08,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2024-11-10 14:07:08,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2024-11-10 14:07:08,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2024-11-10 14:07:08,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2024-11-10 14:07:08,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2024-11-10 14:07:08,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2024-11-10 14:07:08,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2024-11-10 14:07:08,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2024-11-10 14:07:08,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:07:08,494 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 14:07:08,495 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:07:08,495 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-10 14:07:08,549 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 14:07:08,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 121 transitions, 260 flow [2024-11-10 14:07:08,574 INFO L124 PetriNetUnfolderBase]: 10/151 cut-off events. [2024-11-10 14:07:08,574 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-10 14:07:08,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 151 events. 10/151 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 362 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 114. Up to 8 conditions per place. [2024-11-10 14:07:08,575 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 121 transitions, 260 flow [2024-11-10 14:07:08,577 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 121 transitions, 260 flow [2024-11-10 14:07:08,578 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:07:08,580 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;@48a69791, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:07:08,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-10 14:07:08,589 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:07:08,589 INFO L124 PetriNetUnfolderBase]: 2/46 cut-off events. [2024-11-10 14:07:08,589 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:07:08,589 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:07:08,590 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] [2024-11-10 14:07:08,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-11-10 14:07:08,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:07:08,591 INFO L85 PathProgramCache]: Analyzing trace with hash 299314876, now seen corresponding path program 1 times [2024-11-10 14:07:08,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:07:08,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670902066] [2024-11-10 14:07:08,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:07:08,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:07:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:07:08,674 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-10 14:07:08,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:07:08,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670902066] [2024-11-10 14:07:08,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670902066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:07:08,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:07:08,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:07:08,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181549251] [2024-11-10 14:07:08,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:07:08,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:07:08,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:07:08,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:07:08,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:07:08,751 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 121 [2024-11-10 14:07:08,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 121 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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-10 14:07:08,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:07:08,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 121 [2024-11-10 14:07:08,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:07:09,126 INFO L124 PetriNetUnfolderBase]: 783/2703 cut-off events. [2024-11-10 14:07:09,127 INFO L125 PetriNetUnfolderBase]: For 427/427 co-relation queries the response was YES. [2024-11-10 14:07:09,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4279 conditions, 2703 events. 783/2703 cut-off events. For 427/427 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 23645 event pairs, 556 based on Foata normal form. 1337/3631 useless extension candidates. Maximal degree in co-relation 3386. Up to 1091 conditions per place. [2024-11-10 14:07:09,149 INFO L140 encePairwiseOnDemand]: 103/121 looper letters, 27 selfloop transitions, 9 changer transitions 0/118 dead transitions. [2024-11-10 14:07:09,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 118 transitions, 338 flow [2024-11-10 14:07:09,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:07:09,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:07:09,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2024-11-10 14:07:09,155 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8677685950413223 [2024-11-10 14:07:09,156 INFO L175 Difference]: Start difference. First operand has 121 places, 121 transitions, 260 flow. Second operand 3 states and 315 transitions. [2024-11-10 14:07:09,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 118 transitions, 338 flow [2024-11-10 14:07:09,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 118 transitions, 334 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-11-10 14:07:09,161 INFO L231 Difference]: Finished difference. Result has 115 places, 112 transitions, 294 flow [2024-11-10 14:07:09,162 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=294, PETRI_PLACES=115, PETRI_TRANSITIONS=112} [2024-11-10 14:07:09,163 INFO L277 CegarLoopForPetriNet]: 121 programPoint places, -6 predicate places. [2024-11-10 14:07:09,163 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 294 flow [2024-11-10 14:07:09,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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-10 14:07:09,164 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:07:09,164 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] [2024-11-10 14:07:09,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:07:09,164 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-11-10 14:07:09,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:07:09,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1338490525, now seen corresponding path program 1 times [2024-11-10 14:07:09,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:07:09,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599081666] [2024-11-10 14:07:09,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:07:09,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:07:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:07:09,217 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-10 14:07:09,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:07:09,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599081666] [2024-11-10 14:07:09,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599081666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:07:09,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:07:09,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:07:09,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847827675] [2024-11-10 14:07:09,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:07:09,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:07:09,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:07:09,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:07:09,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:07:09,282 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 121 [2024-11-10 14:07:09,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 112 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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-10 14:07:09,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:07:09,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 121 [2024-11-10 14:07:09,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:07:09,752 INFO L124 PetriNetUnfolderBase]: 1015/3342 cut-off events. [2024-11-10 14:07:09,753 INFO L125 PetriNetUnfolderBase]: For 1009/1031 co-relation queries the response was YES. [2024-11-10 14:07:09,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6177 conditions, 3342 events. 1015/3342 cut-off events. For 1009/1031 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 30335 event pairs, 645 based on Foata normal form. 0/2837 useless extension candidates. Maximal degree in co-relation 6057. Up to 1358 conditions per place. [2024-11-10 14:07:09,784 INFO L140 encePairwiseOnDemand]: 111/121 looper letters, 33 selfloop transitions, 9 changer transitions 0/126 dead transitions. [2024-11-10 14:07:09,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 126 transitions, 428 flow [2024-11-10 14:07:09,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:07:09,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:07:09,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2024-11-10 14:07:09,787 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8292011019283747 [2024-11-10 14:07:09,787 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 294 flow. Second operand 3 states and 301 transitions. [2024-11-10 14:07:09,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 126 transitions, 428 flow [2024-11-10 14:07:09,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 126 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:07:09,799 INFO L231 Difference]: Finished difference. Result has 117 places, 120 transitions, 358 flow [2024-11-10 14:07:09,800 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=117, PETRI_TRANSITIONS=120} [2024-11-10 14:07:09,801 INFO L277 CegarLoopForPetriNet]: 121 programPoint places, -4 predicate places. [2024-11-10 14:07:09,802 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 120 transitions, 358 flow [2024-11-10 14:07:09,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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-10 14:07:09,803 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:07:09,803 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] [2024-11-10 14:07:09,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:07:09,804 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-11-10 14:07:09,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:07:09,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1311226406, now seen corresponding path program 1 times [2024-11-10 14:07:09,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:07:09,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806196320] [2024-11-10 14:07:09,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:07:09,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:07:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:07:09,865 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-10 14:07:09,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:07:09,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806196320] [2024-11-10 14:07:09,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806196320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:07:09,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:07:09,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:07:09,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663330257] [2024-11-10 14:07:09,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:07:09,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:07:09,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:07:09,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:07:09,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:07:09,913 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 121 [2024-11-10 14:07:09,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 120 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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-10 14:07:09,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:07:09,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 121 [2024-11-10 14:07:09,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:07:10,477 INFO L124 PetriNetUnfolderBase]: 1566/4676 cut-off events. [2024-11-10 14:07:10,477 INFO L125 PetriNetUnfolderBase]: For 2811/2905 co-relation queries the response was YES. [2024-11-10 14:07:10,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9913 conditions, 4676 events. 1566/4676 cut-off events. For 2811/2905 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 43999 event pairs, 800 based on Foata normal form. 1/3955 useless extension candidates. Maximal degree in co-relation 9807. Up to 1918 conditions per place. [2024-11-10 14:07:10,522 INFO L140 encePairwiseOnDemand]: 111/121 looper letters, 36 selfloop transitions, 17 changer transitions 0/139 dead transitions. [2024-11-10 14:07:10,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 139 transitions, 549 flow [2024-11-10 14:07:10,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:07:10,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:07:10,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2024-11-10 14:07:10,525 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8264462809917356 [2024-11-10 14:07:10,525 INFO L175 Difference]: Start difference. First operand has 117 places, 120 transitions, 358 flow. Second operand 3 states and 300 transitions. [2024-11-10 14:07:10,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 139 transitions, 549 flow [2024-11-10 14:07:10,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 139 transitions, 505 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-11-10 14:07:10,538 INFO L231 Difference]: Finished difference. Result has 119 places, 134 transitions, 482 flow [2024-11-10 14:07:10,538 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=119, PETRI_TRANSITIONS=134} [2024-11-10 14:07:10,539 INFO L277 CegarLoopForPetriNet]: 121 programPoint places, -2 predicate places. [2024-11-10 14:07:10,539 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 134 transitions, 482 flow [2024-11-10 14:07:10,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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-10 14:07:10,540 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:07:10,540 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] [2024-11-10 14:07:10,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:07:10,541 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-11-10 14:07:10,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:07:10,541 INFO L85 PathProgramCache]: Analyzing trace with hash 495200801, now seen corresponding path program 1 times [2024-11-10 14:07:10,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:07:10,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095857421] [2024-11-10 14:07:10,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:07:10,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:07:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:07:10,589 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-10 14:07:10,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:07:10,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095857421] [2024-11-10 14:07:10,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095857421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:07:10,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:07:10,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:07:10,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555777045] [2024-11-10 14:07:10,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:07:10,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:07:10,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:07:10,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:07:10,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:07:10,632 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 121 [2024-11-10 14:07:10,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 134 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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-10 14:07:10,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:07:10,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 121 [2024-11-10 14:07:10,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:07:11,576 INFO L124 PetriNetUnfolderBase]: 2598/8185 cut-off events. [2024-11-10 14:07:11,577 INFO L125 PetriNetUnfolderBase]: For 8458/8593 co-relation queries the response was YES. [2024-11-10 14:07:11,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18640 conditions, 8185 events. 2598/8185 cut-off events. For 8458/8593 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 86570 event pairs, 572 based on Foata normal form. 6/6930 useless extension candidates. Maximal degree in co-relation 18527. Up to 1919 conditions per place. [2024-11-10 14:07:11,719 INFO L140 encePairwiseOnDemand]: 106/121 looper letters, 54 selfloop transitions, 32 changer transitions 0/172 dead transitions. [2024-11-10 14:07:11,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 172 transitions, 868 flow [2024-11-10 14:07:11,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:07:11,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:07:11,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions. [2024-11-10 14:07:11,721 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8402203856749312 [2024-11-10 14:07:11,722 INFO L175 Difference]: Start difference. First operand has 119 places, 134 transitions, 482 flow. Second operand 3 states and 305 transitions. [2024-11-10 14:07:11,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 172 transitions, 868 flow [2024-11-10 14:07:11,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 172 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:07:11,735 INFO L231 Difference]: Finished difference. Result has 121 places, 164 transitions, 812 flow [2024-11-10 14:07:11,735 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=121, PETRI_TRANSITIONS=164} [2024-11-10 14:07:11,737 INFO L277 CegarLoopForPetriNet]: 121 programPoint places, 0 predicate places. [2024-11-10 14:07:11,737 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 164 transitions, 812 flow [2024-11-10 14:07:11,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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-10 14:07:11,738 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:07:11,738 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:07:11,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:07:11,738 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-11-10 14:07:11,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:07:11,739 INFO L85 PathProgramCache]: Analyzing trace with hash 200430868, now seen corresponding path program 1 times [2024-11-10 14:07:11,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:07:11,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097453397] [2024-11-10 14:07:11,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:07:11,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:07:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:07:11,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:07:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:07:11,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:07:11,776 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:07:11,777 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2024-11-10 14:07:11,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2024-11-10 14:07:11,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2024-11-10 14:07:11,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2024-11-10 14:07:11,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2024-11-10 14:07:11,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2024-11-10 14:07:11,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2024-11-10 14:07:11,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2024-11-10 14:07:11,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2024-11-10 14:07:11,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2024-11-10 14:07:11,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2024-11-10 14:07:11,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2024-11-10 14:07:11,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2024-11-10 14:07:11,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:07:11,780 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-10 14:07:11,781 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:07:11,781 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-10 14:07:11,810 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 14:07:11,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 152 transitions, 332 flow [2024-11-10 14:07:11,837 INFO L124 PetriNetUnfolderBase]: 13/192 cut-off events. [2024-11-10 14:07:11,837 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-10 14:07:11,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 192 events. 13/192 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 522 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 159. Up to 10 conditions per place. [2024-11-10 14:07:11,839 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 152 transitions, 332 flow [2024-11-10 14:07:11,841 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 152 transitions, 332 flow [2024-11-10 14:07:11,842 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:07:11,847 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;@48a69791, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:07:11,847 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-10 14:07:11,850 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:07:11,850 INFO L124 PetriNetUnfolderBase]: 2/46 cut-off events. [2024-11-10 14:07:11,850 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:07:11,850 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:07:11,850 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] [2024-11-10 14:07:11,851 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-10 14:07:11,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:07:11,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1448740164, now seen corresponding path program 1 times [2024-11-10 14:07:11,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:07:11,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191021810] [2024-11-10 14:07:11,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:07:11,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:07:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:07:11,890 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-10 14:07:11,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:07:11,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191021810] [2024-11-10 14:07:11,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191021810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:07:11,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:07:11,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:07:11,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145506450] [2024-11-10 14:07:11,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:07:11,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:07:11,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:07:11,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:07:11,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:07:11,957 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 152 [2024-11-10 14:07:11,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 152 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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-10 14:07:11,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:07:11,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 152 [2024-11-10 14:07:11,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:07:14,298 INFO L124 PetriNetUnfolderBase]: 7395/19563 cut-off events. [2024-11-10 14:07:14,299 INFO L125 PetriNetUnfolderBase]: For 4630/4630 co-relation queries the response was YES. [2024-11-10 14:07:14,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32420 conditions, 19563 events. 7395/19563 cut-off events. For 4630/4630 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 217258 event pairs, 5488 based on Foata normal form. 9136/25910 useless extension candidates. Maximal degree in co-relation 25203. Up to 9127 conditions per place. [2024-11-10 14:07:14,467 INFO L140 encePairwiseOnDemand]: 129/152 looper letters, 36 selfloop transitions, 12 changer transitions 0/151 dead transitions. [2024-11-10 14:07:14,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 151 transitions, 447 flow [2024-11-10 14:07:14,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:07:14,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:07:14,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2024-11-10 14:07:14,470 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8706140350877193 [2024-11-10 14:07:14,470 INFO L175 Difference]: Start difference. First operand has 152 places, 152 transitions, 332 flow. Second operand 3 states and 397 transitions. [2024-11-10 14:07:14,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 151 transitions, 447 flow [2024-11-10 14:07:14,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 151 transitions, 435 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-11-10 14:07:14,474 INFO L231 Difference]: Finished difference. Result has 144 places, 142 transitions, 378 flow [2024-11-10 14:07:14,474 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=378, PETRI_PLACES=144, PETRI_TRANSITIONS=142} [2024-11-10 14:07:14,476 INFO L277 CegarLoopForPetriNet]: 152 programPoint places, -8 predicate places. [2024-11-10 14:07:14,476 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 142 transitions, 378 flow [2024-11-10 14:07:14,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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-10 14:07:14,477 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:07:14,477 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] [2024-11-10 14:07:14,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:07:14,477 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-10 14:07:14,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:07:14,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1884117549, now seen corresponding path program 1 times [2024-11-10 14:07:14,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:07:14,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391115227] [2024-11-10 14:07:14,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:07:14,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:07:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:07:14,519 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-10 14:07:14,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:07:14,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391115227] [2024-11-10 14:07:14,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391115227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:07:14,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:07:14,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:07:14,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501840771] [2024-11-10 14:07:14,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:07:14,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:07:14,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:07:14,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:07:14,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:07:14,576 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 152 [2024-11-10 14:07:14,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 142 transitions, 378 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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-10 14:07:14,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:07:14,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 152 [2024-11-10 14:07:14,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:07:17,129 INFO L124 PetriNetUnfolderBase]: 9861/25620 cut-off events. [2024-11-10 14:07:17,129 INFO L125 PetriNetUnfolderBase]: For 8274/8433 co-relation queries the response was YES. [2024-11-10 14:07:17,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49490 conditions, 25620 events. 9861/25620 cut-off events. For 8274/8433 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 294238 event pairs, 6724 based on Foata normal form. 0/21825 useless extension candidates. Maximal degree in co-relation 49369. Up to 11893 conditions per place. [2024-11-10 14:07:17,367 INFO L140 encePairwiseOnDemand]: 139/152 looper letters, 45 selfloop transitions, 12 changer transitions 0/162 dead transitions. [2024-11-10 14:07:17,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 162 transitions, 565 flow [2024-11-10 14:07:17,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:07:17,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:07:17,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2024-11-10 14:07:17,370 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.831140350877193 [2024-11-10 14:07:17,370 INFO L175 Difference]: Start difference. First operand has 144 places, 142 transitions, 378 flow. Second operand 3 states and 379 transitions. [2024-11-10 14:07:17,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 162 transitions, 565 flow [2024-11-10 14:07:17,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 162 transitions, 541 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:07:17,404 INFO L231 Difference]: Finished difference. Result has 146 places, 153 transitions, 466 flow [2024-11-10 14:07:17,404 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=146, PETRI_TRANSITIONS=153} [2024-11-10 14:07:17,406 INFO L277 CegarLoopForPetriNet]: 152 programPoint places, -6 predicate places. [2024-11-10 14:07:17,406 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 153 transitions, 466 flow [2024-11-10 14:07:17,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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-10 14:07:17,406 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:07:17,407 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] [2024-11-10 14:07:17,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:07:17,407 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-10 14:07:17,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:07:17,408 INFO L85 PathProgramCache]: Analyzing trace with hash 565242748, now seen corresponding path program 1 times [2024-11-10 14:07:17,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:07:17,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579196204] [2024-11-10 14:07:17,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:07:17,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:07:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:07:17,445 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-10 14:07:17,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:07:17,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579196204] [2024-11-10 14:07:17,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579196204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:07:17,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:07:17,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:07:17,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478862297] [2024-11-10 14:07:17,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:07:17,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:07:17,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:07:17,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:07:17,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:07:17,509 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 152 [2024-11-10 14:07:17,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 153 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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-10 14:07:17,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:07:17,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 152 [2024-11-10 14:07:17,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:07:21,057 INFO L124 PetriNetUnfolderBase]: 16487/39494 cut-off events. [2024-11-10 14:07:21,057 INFO L125 PetriNetUnfolderBase]: For 26946/29063 co-relation queries the response was YES. [2024-11-10 14:07:21,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88360 conditions, 39494 events. 16487/39494 cut-off events. For 26946/29063 co-relation queries the response was YES. Maximal size of possible extension queue 1366. Compared 461568 event pairs, 9148 based on Foata normal form. 38/33388 useless extension candidates. Maximal degree in co-relation 88249. Up to 18525 conditions per place. [2024-11-10 14:07:21,676 INFO L140 encePairwiseOnDemand]: 139/152 looper letters, 51 selfloop transitions, 26 changer transitions 0/184 dead transitions. [2024-11-10 14:07:21,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 184 transitions, 770 flow [2024-11-10 14:07:21,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:07:21,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:07:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2024-11-10 14:07:21,678 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8289473684210527 [2024-11-10 14:07:21,678 INFO L175 Difference]: Start difference. First operand has 146 places, 153 transitions, 466 flow. Second operand 3 states and 378 transitions. [2024-11-10 14:07:21,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 184 transitions, 770 flow [2024-11-10 14:07:21,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 184 transitions, 702 flow, removed 15 selfloop flow, removed 2 redundant places. [2024-11-10 14:07:21,832 INFO L231 Difference]: Finished difference. Result has 148 places, 176 transitions, 674 flow [2024-11-10 14:07:21,832 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=674, PETRI_PLACES=148, PETRI_TRANSITIONS=176} [2024-11-10 14:07:21,832 INFO L277 CegarLoopForPetriNet]: 152 programPoint places, -4 predicate places. [2024-11-10 14:07:21,833 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 176 transitions, 674 flow [2024-11-10 14:07:21,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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-10 14:07:21,833 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:07:21,833 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] [2024-11-10 14:07:21,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:07:21,833 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-10 14:07:21,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:07:21,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1182216481, now seen corresponding path program 1 times [2024-11-10 14:07:21,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:07:21,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829703621] [2024-11-10 14:07:21,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:07:21,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:07:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:07:21,871 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-10 14:07:21,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:07:21,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829703621] [2024-11-10 14:07:21,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829703621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:07:21,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:07:21,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:07:21,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944075976] [2024-11-10 14:07:21,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:07:21,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:07:21,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:07:21,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:07:21,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:07:21,926 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 152 [2024-11-10 14:07:21,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 176 transitions, 674 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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-10 14:07:21,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:07:21,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 152 [2024-11-10 14:07:21,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:07:30,931 INFO L124 PetriNetUnfolderBase]: 42027/99745 cut-off events. [2024-11-10 14:07:30,931 INFO L125 PetriNetUnfolderBase]: For 129706/134613 co-relation queries the response was YES. [2024-11-10 14:07:31,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248432 conditions, 99745 events. 42027/99745 cut-off events. For 129706/134613 co-relation queries the response was YES. Maximal size of possible extension queue 3449. Compared 1296600 event pairs, 10298 based on Foata normal form. 123/82872 useless extension candidates. Maximal degree in co-relation 248303. Up to 27414 conditions per place. [2024-11-10 14:07:32,318 INFO L140 encePairwiseOnDemand]: 132/152 looper letters, 82 selfloop transitions, 55 changer transitions 0/242 dead transitions. [2024-11-10 14:07:32,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 242 transitions, 1361 flow [2024-11-10 14:07:32,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:07:32,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:07:32,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2024-11-10 14:07:32,320 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8355263157894737 [2024-11-10 14:07:32,320 INFO L175 Difference]: Start difference. First operand has 148 places, 176 transitions, 674 flow. Second operand 3 states and 381 transitions. [2024-11-10 14:07:32,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 242 transitions, 1361 flow [2024-11-10 14:07:32,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 242 transitions, 1261 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:07:32,667 INFO L231 Difference]: Finished difference. Result has 150 places, 231 transitions, 1288 flow [2024-11-10 14:07:32,667 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1288, PETRI_PLACES=150, PETRI_TRANSITIONS=231} [2024-11-10 14:07:32,668 INFO L277 CegarLoopForPetriNet]: 152 programPoint places, -2 predicate places. [2024-11-10 14:07:32,668 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 231 transitions, 1288 flow [2024-11-10 14:07:32,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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-10 14:07:32,668 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:07:32,669 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] [2024-11-10 14:07:32,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:07:32,669 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-10 14:07:32,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:07:32,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1649739185, now seen corresponding path program 1 times [2024-11-10 14:07:32,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:07:32,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653396048] [2024-11-10 14:07:32,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:07:32,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:07:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:07:32,701 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-10 14:07:32,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:07:32,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653396048] [2024-11-10 14:07:32,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653396048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:07:32,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:07:32,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:07:32,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304037497] [2024-11-10 14:07:32,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:07:32,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:07:32,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:07:32,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:07:32,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:07:32,750 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 152 [2024-11-10 14:07:32,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 231 transitions, 1288 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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-10 14:07:32,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:07:32,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 152 [2024-11-10 14:07:32,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:07:46,232 INFO L124 PetriNetUnfolderBase]: 56841/132746 cut-off events. [2024-11-10 14:07:46,233 INFO L125 PetriNetUnfolderBase]: For 353201/368684 co-relation queries the response was YES. [2024-11-10 14:07:46,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393321 conditions, 132746 events. 56841/132746 cut-off events. For 353201/368684 co-relation queries the response was YES. Maximal size of possible extension queue 4603. Compared 1770579 event pairs, 17606 based on Foata normal form. 338/111596 useless extension candidates. Maximal degree in co-relation 393192. Up to 58889 conditions per place. [2024-11-10 14:07:47,714 INFO L140 encePairwiseOnDemand]: 139/152 looper letters, 120 selfloop transitions, 50 changer transitions 0/283 dead transitions. [2024-11-10 14:07:47,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 283 transitions, 2056 flow [2024-11-10 14:07:47,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:07:47,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:07:47,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2024-11-10 14:07:47,716 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8289473684210527 [2024-11-10 14:07:47,716 INFO L175 Difference]: Start difference. First operand has 150 places, 231 transitions, 1288 flow. Second operand 3 states and 378 transitions. [2024-11-10 14:07:47,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 283 transitions, 2056 flow [2024-11-10 14:07:48,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 283 transitions, 1904 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:07:48,402 INFO L231 Difference]: Finished difference. Result has 152 places, 275 transitions, 1828 flow [2024-11-10 14:07:48,402 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=1178, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1828, PETRI_PLACES=152, PETRI_TRANSITIONS=275} [2024-11-10 14:07:48,403 INFO L277 CegarLoopForPetriNet]: 152 programPoint places, 0 predicate places. [2024-11-10 14:07:48,403 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 275 transitions, 1828 flow [2024-11-10 14:07:48,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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-10 14:07:48,404 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:07:48,404 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:07:48,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:07:48,404 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-10 14:07:48,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:07:48,404 INFO L85 PathProgramCache]: Analyzing trace with hash -239442909, now seen corresponding path program 1 times [2024-11-10 14:07:48,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:07:48,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396602309] [2024-11-10 14:07:48,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:07:48,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:07:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:07:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-10 14:07:48,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:07:48,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396602309] [2024-11-10 14:07:48,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396602309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:07:48,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:07:48,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:07:48,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978372758] [2024-11-10 14:07:48,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:07:48,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:07:48,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:07:48,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:07:48,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:07:48,487 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 152 [2024-11-10 14:07:48,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 275 transitions, 1828 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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-10 14:07:48,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:07:48,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 152 [2024-11-10 14:07:48,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:07:54,894 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([498] L690-2-->L690-1: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_6|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][328], [Black: 162#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), Black: 167#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 149#true, 151#true, 36#L689true, 153#true, 118#L689true, Black: 172#(= |#race~x~0| 0), 10#L691-1true, Black: 177#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet3#1|), 147#true, 175#true, 180#true, 98#L698true, 121#L690-1true, Black: 157#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-10 14:07:54,894 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-10 14:07:54,894 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-10 14:07:54,894 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-10 14:07:54,894 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-10 14:07:54,902 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([588] L690-2-->L690-1: Formula: (= |v_#race~x~0_6| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_6|} AuxVars[] AssignedVars[#race~x~0][327], [Black: 162#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), Black: 167#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 149#true, 151#true, 118#L689true, 153#true, Black: 172#(= |#race~x~0| 0), 10#L691-1true, 5#L690-1true, 177#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet3#1|), 147#true, Black: 175#true, 180#true, 98#L698true, 89#L689true, Black: 157#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-10 14:07:54,902 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-10 14:07:54,902 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-10 14:07:54,902 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-10 14:07:54,902 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-10 14:07:54,940 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([558] L690-2-->L690-1: Formula: (= |v_#race~x~0_6| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][325], [Black: 160#true, 104#L690-1true, Black: 167#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 36#L689true, 149#true, 151#true, 153#true, Black: 172#(= |#race~x~0| 0), 10#L691-1true, Black: 177#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet3#1|), 147#true, 175#true, 180#true, 98#L698true, Black: 157#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 89#L689true]) [2024-11-10 14:07:54,940 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-10 14:07:54,940 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-10 14:07:54,940 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-10 14:07:54,940 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-10 14:07:56,313 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([588] L690-2-->L690-1: Formula: (= |v_#race~x~0_6| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_6|} AuxVars[] AssignedVars[#race~x~0][88], [Black: 162#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), Black: 167#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 149#true, 151#true, 118#L689true, 153#true, 52#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, Black: 172#(= |#race~x~0| 0), 5#L690-1true, 177#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet3#1|), Black: 175#true, 147#true, 180#true, 12#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 98#L698true, Black: 157#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-10 14:07:56,313 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-10 14:07:56,313 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-10 14:07:56,313 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-10 14:07:56,313 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event