./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer.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 2775f713e378913186e8b7d26aeab9962af0cc62e93b6360bbda34aa29f8c3e8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:39:29,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:39:29,276 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-24 15:39:29,282 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:39:29,283 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:39:29,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:39:29,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:39:29,316 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:39:29,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:39:29,316 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:39:29,317 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:39:29,318 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:39:29,319 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:39:29,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:39:29,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:39:29,320 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:39:29,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:39:29,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:39:29,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:39:29,321 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:39:29,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:39:29,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:39:29,326 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-24 15:39:29,327 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:39:29,327 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:39:29,328 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:39:29,328 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:39:29,328 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:39:29,329 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:39:29,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:39:29,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:39:29,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:39:29,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:39:29,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:39:29,331 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 15:39:29,331 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 15:39:29,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 15:39:29,331 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:39:29,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:39:29,332 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:39:29,332 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:39:29,332 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 -> 2775f713e378913186e8b7d26aeab9962af0cc62e93b6360bbda34aa29f8c3e8 [2024-10-24 15:39:29,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:39:29,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:39:29,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:39:29,687 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:39:29,689 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:39:29,691 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer.i [2024-10-24 15:39:31,179 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:39:31,441 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:39:31,442 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer.i [2024-10-24 15:39:31,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be6e2acf0/3750dbd9fcf24f02b9b4fa2eaa71fcfa/FLAG62c95768a [2024-10-24 15:39:31,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be6e2acf0/3750dbd9fcf24f02b9b4fa2eaa71fcfa [2024-10-24 15:39:31,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:39:31,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:39:31,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:39:31,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:39:31,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:39:31,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:39:31" (1/1) ... [2024-10-24 15:39:31,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f847cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:31, skipping insertion in model container [2024-10-24 15:39:31,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:39:31" (1/1) ... [2024-10-24 15:39:31,552 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:39:31,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:39:31,960 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 15:39:32,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:39:32,043 INFO L204 MainTranslator]: Completed translation [2024-10-24 15:39:32,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:32 WrapperNode [2024-10-24 15:39:32,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:39:32,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 15:39:32,045 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 15:39:32,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 15:39:32,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:32" (1/1) ... [2024-10-24 15:39:32,071 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:32" (1/1) ... [2024-10-24 15:39:32,094 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 103 [2024-10-24 15:39:32,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 15:39:32,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 15:39:32,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 15:39:32,096 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 15:39:32,104 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:32" (1/1) ... [2024-10-24 15:39:32,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:32" (1/1) ... [2024-10-24 15:39:32,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:32" (1/1) ... [2024-10-24 15:39:32,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:32" (1/1) ... [2024-10-24 15:39:32,119 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:32" (1/1) ... [2024-10-24 15:39:32,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:32" (1/1) ... [2024-10-24 15:39:32,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:32" (1/1) ... [2024-10-24 15:39:32,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:32" (1/1) ... [2024-10-24 15:39:32,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 15:39:32,140 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 15:39:32,140 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 15:39:32,140 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 15:39:32,141 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:32" (1/1) ... [2024-10-24 15:39:32,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:39:32,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:39:32,191 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-10-24 15:39:32,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-10-24 15:39:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-24 15:39:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 15:39:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-24 15:39:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-24 15:39:32,237 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-24 15:39:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-24 15:39:32,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 15:39:32,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 15:39:32,239 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 15:39:32,370 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 15:39:32,372 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 15:39:32,644 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 15:39:32,645 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 15:39:32,682 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 15:39:32,683 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 15:39:32,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:39:32 BoogieIcfgContainer [2024-10-24 15:39:32,683 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 15:39:32,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 15:39:32,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 15:39:32,693 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 15:39:32,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:39:31" (1/3) ... [2024-10-24 15:39:32,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f7f9e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:39:32, skipping insertion in model container [2024-10-24 15:39:32,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:32" (2/3) ... [2024-10-24 15:39:32,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f7f9e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:39:32, skipping insertion in model container [2024-10-24 15:39:32,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:39:32" (3/3) ... [2024-10-24 15:39:32,696 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer.i [2024-10-24 15:39:32,715 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 15:39:32,715 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-24 15:39:32,716 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 15:39:32,773 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 15:39:32,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 139 transitions, 282 flow [2024-10-24 15:39:32,887 INFO L124 PetriNetUnfolderBase]: 7/181 cut-off events. [2024-10-24 15:39:32,888 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 15:39:32,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 181 events. 7/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 240 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 98. Up to 4 conditions per place. [2024-10-24 15:39:32,899 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 139 transitions, 282 flow [2024-10-24 15:39:32,906 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 139 transitions, 282 flow [2024-10-24 15:39:32,922 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:39:32,930 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;@3dc29eea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:39:32,931 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-10-24 15:39:32,952 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 15:39:32,952 INFO L124 PetriNetUnfolderBase]: 2/65 cut-off events. [2024-10-24 15:39:32,952 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 15:39:32,952 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:32,953 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:32,954 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:32,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:32,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1637793038, now seen corresponding path program 1 times [2024-10-24 15:39:32,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:32,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10587184] [2024-10-24 15:39:32,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:32,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:33,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:33,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:33,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10587184] [2024-10-24 15:39:33,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10587184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:33,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:33,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:33,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921690931] [2024-10-24 15:39:33,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:33,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:33,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:33,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:33,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:33,381 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 139 [2024-10-24 15:39:33,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 139 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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-10-24 15:39:33,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:33,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 139 [2024-10-24 15:39:33,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:33,598 INFO L124 PetriNetUnfolderBase]: 98/613 cut-off events. [2024-10-24 15:39:33,598 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-24 15:39:33,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 613 events. 98/613 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3330 event pairs, 33 based on Foata normal form. 9/564 useless extension candidates. Maximal degree in co-relation 731. Up to 138 conditions per place. [2024-10-24 15:39:33,606 INFO L140 encePairwiseOnDemand]: 125/139 looper letters, 32 selfloop transitions, 8 changer transitions 1/154 dead transitions. [2024-10-24 15:39:33,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 154 transitions, 392 flow [2024-10-24 15:39:33,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:33,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:33,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2024-10-24 15:39:33,625 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.935251798561151 [2024-10-24 15:39:33,627 INFO L175 Difference]: Start difference. First operand has 138 places, 139 transitions, 282 flow. Second operand 3 states and 390 transitions. [2024-10-24 15:39:33,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 154 transitions, 392 flow [2024-10-24 15:39:33,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 154 transitions, 392 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:39:33,639 INFO L231 Difference]: Finished difference. Result has 142 places, 143 transitions, 344 flow [2024-10-24 15:39:33,641 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=142, PETRI_TRANSITIONS=143} [2024-10-24 15:39:33,645 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 4 predicate places. [2024-10-24 15:39:33,646 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 143 transitions, 344 flow [2024-10-24 15:39:33,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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-10-24 15:39:33,646 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:33,647 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:33,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 15:39:33,647 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:33,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:33,649 INFO L85 PathProgramCache]: Analyzing trace with hash -2030281524, now seen corresponding path program 1 times [2024-10-24 15:39:33,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:33,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759963202] [2024-10-24 15:39:33,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:33,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:33,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:33,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:33,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759963202] [2024-10-24 15:39:33,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759963202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:33,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:33,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:33,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511420625] [2024-10-24 15:39:33,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:33,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:33,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:33,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:33,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:33,820 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 139 [2024-10-24 15:39:33,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 143 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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-10-24 15:39:33,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:33,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 139 [2024-10-24 15:39:33,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:34,035 INFO L124 PetriNetUnfolderBase]: 114/750 cut-off events. [2024-10-24 15:39:34,035 INFO L125 PetriNetUnfolderBase]: For 164/169 co-relation queries the response was YES. [2024-10-24 15:39:34,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 750 events. 114/750 cut-off events. For 164/169 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4473 event pairs, 72 based on Foata normal form. 4/698 useless extension candidates. Maximal degree in co-relation 1058. Up to 226 conditions per place. [2024-10-24 15:39:34,044 INFO L140 encePairwiseOnDemand]: 133/139 looper letters, 29 selfloop transitions, 7 changer transitions 0/152 dead transitions. [2024-10-24 15:39:34,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 152 transitions, 444 flow [2024-10-24 15:39:34,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:34,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:34,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2024-10-24 15:39:34,050 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.894484412470024 [2024-10-24 15:39:34,050 INFO L175 Difference]: Start difference. First operand has 142 places, 143 transitions, 344 flow. Second operand 3 states and 373 transitions. [2024-10-24 15:39:34,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 152 transitions, 444 flow [2024-10-24 15:39:34,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 152 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:34,056 INFO L231 Difference]: Finished difference. Result has 143 places, 148 transitions, 384 flow [2024-10-24 15:39:34,056 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=143, PETRI_TRANSITIONS=148} [2024-10-24 15:39:34,057 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 5 predicate places. [2024-10-24 15:39:34,057 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 148 transitions, 384 flow [2024-10-24 15:39:34,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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-10-24 15:39:34,058 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:34,058 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:34,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 15:39:34,059 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:34,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:34,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1640232873, now seen corresponding path program 1 times [2024-10-24 15:39:34,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:34,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706251833] [2024-10-24 15:39:34,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:34,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:34,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:34,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:34,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706251833] [2024-10-24 15:39:34,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706251833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:34,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:34,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:34,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76092864] [2024-10-24 15:39:34,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:34,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:34,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:34,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:34,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:34,154 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 139 [2024-10-24 15:39:34,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 148 transitions, 384 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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-10-24 15:39:34,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:34,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 139 [2024-10-24 15:39:34,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:34,278 INFO L124 PetriNetUnfolderBase]: 83/671 cut-off events. [2024-10-24 15:39:34,279 INFO L125 PetriNetUnfolderBase]: For 66/70 co-relation queries the response was YES. [2024-10-24 15:39:34,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 671 events. 83/671 cut-off events. For 66/70 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3993 event pairs, 45 based on Foata normal form. 0/613 useless extension candidates. Maximal degree in co-relation 870. Up to 114 conditions per place. [2024-10-24 15:39:34,284 INFO L140 encePairwiseOnDemand]: 135/139 looper letters, 17 selfloop transitions, 3 changer transitions 1/154 dead transitions. [2024-10-24 15:39:34,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 154 transitions, 438 flow [2024-10-24 15:39:34,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:34,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:34,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2024-10-24 15:39:34,287 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9232613908872902 [2024-10-24 15:39:34,288 INFO L175 Difference]: Start difference. First operand has 143 places, 148 transitions, 384 flow. Second operand 3 states and 385 transitions. [2024-10-24 15:39:34,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 154 transitions, 438 flow [2024-10-24 15:39:34,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 154 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:34,294 INFO L231 Difference]: Finished difference. Result has 145 places, 150 transitions, 392 flow [2024-10-24 15:39:34,295 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=145, PETRI_TRANSITIONS=150} [2024-10-24 15:39:34,296 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 7 predicate places. [2024-10-24 15:39:34,297 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 150 transitions, 392 flow [2024-10-24 15:39:34,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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-10-24 15:39:34,298 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:34,298 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:34,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 15:39:34,299 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:34,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:34,300 INFO L85 PathProgramCache]: Analyzing trace with hash 260494260, now seen corresponding path program 1 times [2024-10-24 15:39:34,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:34,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143220261] [2024-10-24 15:39:34,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:34,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:34,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:34,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143220261] [2024-10-24 15:39:34,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143220261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:34,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:34,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:34,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27696387] [2024-10-24 15:39:34,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:34,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:34,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:34,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:34,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:34,414 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 139 [2024-10-24 15:39:34,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 150 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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-10-24 15:39:34,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:34,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 139 [2024-10-24 15:39:34,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:34,558 INFO L124 PetriNetUnfolderBase]: 92/686 cut-off events. [2024-10-24 15:39:34,558 INFO L125 PetriNetUnfolderBase]: For 73/77 co-relation queries the response was YES. [2024-10-24 15:39:34,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1062 conditions, 686 events. 92/686 cut-off events. For 73/77 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4227 event pairs, 54 based on Foata normal form. 0/639 useless extension candidates. Maximal degree in co-relation 938. Up to 141 conditions per place. [2024-10-24 15:39:34,563 INFO L140 encePairwiseOnDemand]: 134/139 looper letters, 22 selfloop transitions, 5 changer transitions 0/159 dead transitions. [2024-10-24 15:39:34,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 159 transitions, 468 flow [2024-10-24 15:39:34,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:34,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:34,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2024-10-24 15:39:34,566 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.920863309352518 [2024-10-24 15:39:34,566 INFO L175 Difference]: Start difference. First operand has 145 places, 150 transitions, 392 flow. Second operand 3 states and 384 transitions. [2024-10-24 15:39:34,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 159 transitions, 468 flow [2024-10-24 15:39:34,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 159 transitions, 460 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:34,572 INFO L231 Difference]: Finished difference. Result has 147 places, 153 transitions, 422 flow [2024-10-24 15:39:34,572 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=147, PETRI_TRANSITIONS=153} [2024-10-24 15:39:34,573 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 9 predicate places. [2024-10-24 15:39:34,574 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 153 transitions, 422 flow [2024-10-24 15:39:34,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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-10-24 15:39:34,575 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:34,575 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:34,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 15:39:34,576 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:34,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:34,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1408818577, now seen corresponding path program 1 times [2024-10-24 15:39:34,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:34,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086391346] [2024-10-24 15:39:34,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:34,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:34,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:34,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086391346] [2024-10-24 15:39:34,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086391346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:34,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:34,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:34,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13622570] [2024-10-24 15:39:34,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:34,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:34,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:34,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:34,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:34,714 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 139 [2024-10-24 15:39:34,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 153 transitions, 422 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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-10-24 15:39:34,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:34,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 139 [2024-10-24 15:39:34,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:34,837 INFO L124 PetriNetUnfolderBase]: 159/870 cut-off events. [2024-10-24 15:39:34,838 INFO L125 PetriNetUnfolderBase]: For 212/219 co-relation queries the response was YES. [2024-10-24 15:39:34,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1553 conditions, 870 events. 159/870 cut-off events. For 212/219 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5515 event pairs, 73 based on Foata normal form. 1/827 useless extension candidates. Maximal degree in co-relation 1423. Up to 275 conditions per place. [2024-10-24 15:39:34,842 INFO L140 encePairwiseOnDemand]: 132/139 looper letters, 29 selfloop transitions, 11 changer transitions 4/166 dead transitions. [2024-10-24 15:39:34,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 166 transitions, 544 flow [2024-10-24 15:39:34,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:34,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:34,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2024-10-24 15:39:34,844 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9112709832134293 [2024-10-24 15:39:34,844 INFO L175 Difference]: Start difference. First operand has 147 places, 153 transitions, 422 flow. Second operand 3 states and 380 transitions. [2024-10-24 15:39:34,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 166 transitions, 544 flow [2024-10-24 15:39:34,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 166 transitions, 534 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:34,850 INFO L231 Difference]: Finished difference. Result has 149 places, 157 transitions, 488 flow [2024-10-24 15:39:34,850 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=488, PETRI_PLACES=149, PETRI_TRANSITIONS=157} [2024-10-24 15:39:34,852 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 11 predicate places. [2024-10-24 15:39:34,854 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 157 transitions, 488 flow [2024-10-24 15:39:34,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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-10-24 15:39:34,855 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:34,855 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:34,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 15:39:34,855 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:34,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:34,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1385277793, now seen corresponding path program 1 times [2024-10-24 15:39:34,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:34,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775543157] [2024-10-24 15:39:34,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:34,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 15:39:34,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 15:39:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 15:39:34,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 15:39:34,960 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 15:39:34,963 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-10-24 15:39:34,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-10-24 15:39:34,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-10-24 15:39:34,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-10-24 15:39:34,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-10-24 15:39:34,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-10-24 15:39:34,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-10-24 15:39:34,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-10-24 15:39:34,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-10-24 15:39:34,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-10-24 15:39:34,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-10-24 15:39:34,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 15:39:34,972 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 15:39:34,977 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-24 15:39:34,978 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-24 15:39:35,002 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 15:39:35,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 171 transitions, 352 flow [2024-10-24 15:39:35,047 INFO L124 PetriNetUnfolderBase]: 10/263 cut-off events. [2024-10-24 15:39:35,047 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-24 15:39:35,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 263 events. 10/263 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 415 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 182. Up to 6 conditions per place. [2024-10-24 15:39:35,049 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 171 transitions, 352 flow [2024-10-24 15:39:35,052 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 171 transitions, 352 flow [2024-10-24 15:39:35,053 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:39:35,055 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;@3dc29eea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:39:35,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-10-24 15:39:35,061 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 15:39:35,063 INFO L124 PetriNetUnfolderBase]: 2/65 cut-off events. [2024-10-24 15:39:35,063 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 15:39:35,063 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:35,063 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:35,064 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:39:35,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:35,064 INFO L85 PathProgramCache]: Analyzing trace with hash 225895357, now seen corresponding path program 1 times [2024-10-24 15:39:35,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:35,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783081373] [2024-10-24 15:39:35,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:35,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:35,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:35,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:35,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783081373] [2024-10-24 15:39:35,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783081373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:35,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:35,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:35,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790553611] [2024-10-24 15:39:35,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:35,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:35,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:35,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:35,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:35,145 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 171 [2024-10-24 15:39:35,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 171 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 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-10-24 15:39:35,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:35,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 171 [2024-10-24 15:39:35,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:36,152 INFO L124 PetriNetUnfolderBase]: 2216/7012 cut-off events. [2024-10-24 15:39:36,152 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-10-24 15:39:36,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10716 conditions, 7012 events. 2216/7012 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 68653 event pairs, 879 based on Foata normal form. 92/6345 useless extension candidates. Maximal degree in co-relation 9184. Up to 2089 conditions per place. [2024-10-24 15:39:36,205 INFO L140 encePairwiseOnDemand]: 153/171 looper letters, 46 selfloop transitions, 11 changer transitions 1/194 dead transitions. [2024-10-24 15:39:36,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 194 transitions, 517 flow [2024-10-24 15:39:36,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:36,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:36,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2024-10-24 15:39:36,208 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9298245614035088 [2024-10-24 15:39:36,208 INFO L175 Difference]: Start difference. First operand has 172 places, 171 transitions, 352 flow. Second operand 3 states and 477 transitions. [2024-10-24 15:39:36,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 194 transitions, 517 flow [2024-10-24 15:39:36,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 194 transitions, 517 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:39:36,213 INFO L231 Difference]: Finished difference. Result has 176 places, 178 transitions, 440 flow [2024-10-24 15:39:36,213 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=176, PETRI_TRANSITIONS=178} [2024-10-24 15:39:36,215 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 4 predicate places. [2024-10-24 15:39:36,215 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 178 transitions, 440 flow [2024-10-24 15:39:36,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 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-10-24 15:39:36,216 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:36,216 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:36,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 15:39:36,217 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:39:36,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:36,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1467184948, now seen corresponding path program 1 times [2024-10-24 15:39:36,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:36,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442255659] [2024-10-24 15:39:36,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:36,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:36,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:36,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:36,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442255659] [2024-10-24 15:39:36,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442255659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:36,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:36,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:36,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327287717] [2024-10-24 15:39:36,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:36,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:36,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:36,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:36,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:36,319 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 171 [2024-10-24 15:39:36,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 178 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 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-10-24 15:39:36,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:36,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 171 [2024-10-24 15:39:36,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:37,661 INFO L124 PetriNetUnfolderBase]: 2480/8923 cut-off events. [2024-10-24 15:39:37,662 INFO L125 PetriNetUnfolderBase]: For 2780/2954 co-relation queries the response was YES. [2024-10-24 15:39:37,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15689 conditions, 8923 events. 2480/8923 cut-off events. For 2780/2954 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 94636 event pairs, 1597 based on Foata normal form. 62/8189 useless extension candidates. Maximal degree in co-relation 13582. Up to 3442 conditions per place. [2024-10-24 15:39:37,740 INFO L140 encePairwiseOnDemand]: 163/171 looper letters, 42 selfloop transitions, 12 changer transitions 0/196 dead transitions. [2024-10-24 15:39:37,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 196 transitions, 608 flow [2024-10-24 15:39:37,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 461 transitions. [2024-10-24 15:39:37,743 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.898635477582846 [2024-10-24 15:39:37,743 INFO L175 Difference]: Start difference. First operand has 176 places, 178 transitions, 440 flow. Second operand 3 states and 461 transitions. [2024-10-24 15:39:37,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 196 transitions, 608 flow [2024-10-24 15:39:37,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 196 transitions, 578 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:37,758 INFO L231 Difference]: Finished difference. Result has 177 places, 188 transitions, 524 flow [2024-10-24 15:39:37,759 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=177, PETRI_TRANSITIONS=188} [2024-10-24 15:39:37,759 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 5 predicate places. [2024-10-24 15:39:37,760 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 188 transitions, 524 flow [2024-10-24 15:39:37,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 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-10-24 15:39:37,760 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:37,761 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:37,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 15:39:37,761 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:39:37,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:37,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1916357716, now seen corresponding path program 1 times [2024-10-24 15:39:37,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:37,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869302607] [2024-10-24 15:39:37,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:37,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:37,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:37,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:37,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869302607] [2024-10-24 15:39:37,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869302607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:37,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:37,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:37,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027854574] [2024-10-24 15:39:37,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:37,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:37,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:37,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:37,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:37,826 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 171 [2024-10-24 15:39:37,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 188 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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-10-24 15:39:37,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:37,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 171 [2024-10-24 15:39:37,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:38,940 INFO L124 PetriNetUnfolderBase]: 1878/8045 cut-off events. [2024-10-24 15:39:38,941 INFO L125 PetriNetUnfolderBase]: For 1128/2080 co-relation queries the response was YES. [2024-10-24 15:39:38,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12975 conditions, 8045 events. 1878/8045 cut-off events. For 1128/2080 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 89751 event pairs, 1092 based on Foata normal form. 7/7127 useless extension candidates. Maximal degree in co-relation 11327. Up to 1725 conditions per place. [2024-10-24 15:39:39,067 INFO L140 encePairwiseOnDemand]: 166/171 looper letters, 28 selfloop transitions, 4 changer transitions 0/199 dead transitions. [2024-10-24 15:39:39,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 199 transitions, 610 flow [2024-10-24 15:39:39,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:39,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:39,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2024-10-24 15:39:39,069 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2024-10-24 15:39:39,069 INFO L175 Difference]: Start difference. First operand has 177 places, 188 transitions, 524 flow. Second operand 3 states and 474 transitions. [2024-10-24 15:39:39,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 199 transitions, 610 flow [2024-10-24 15:39:39,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 199 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:39,079 INFO L231 Difference]: Finished difference. Result has 179 places, 191 transitions, 530 flow [2024-10-24 15:39:39,080 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=179, PETRI_TRANSITIONS=191} [2024-10-24 15:39:39,080 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 7 predicate places. [2024-10-24 15:39:39,081 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 191 transitions, 530 flow [2024-10-24 15:39:39,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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-10-24 15:39:39,081 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:39,081 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:39,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 15:39:39,082 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:39:39,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:39,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1840835883, now seen corresponding path program 1 times [2024-10-24 15:39:39,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:39,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836231526] [2024-10-24 15:39:39,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:39,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:39,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:39,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:39,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836231526] [2024-10-24 15:39:39,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836231526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:39,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:39,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:39,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155294202] [2024-10-24 15:39:39,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:39,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:39,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:39,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:39,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:39,138 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 171 [2024-10-24 15:39:39,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 191 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 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-10-24 15:39:39,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:39,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 171 [2024-10-24 15:39:39,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:40,565 INFO L124 PetriNetUnfolderBase]: 2430/10332 cut-off events. [2024-10-24 15:39:40,565 INFO L125 PetriNetUnfolderBase]: For 1615/2592 co-relation queries the response was YES. [2024-10-24 15:39:40,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17027 conditions, 10332 events. 2430/10332 cut-off events. For 1615/2592 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 122167 event pairs, 1418 based on Foata normal form. 11/9184 useless extension candidates. Maximal degree in co-relation 15284. Up to 2447 conditions per place. [2024-10-24 15:39:40,642 INFO L140 encePairwiseOnDemand]: 165/171 looper letters, 34 selfloop transitions, 7 changer transitions 0/207 dead transitions. [2024-10-24 15:39:40,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 207 transitions, 659 flow [2024-10-24 15:39:40,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:40,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2024-10-24 15:39:40,644 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2024-10-24 15:39:40,644 INFO L175 Difference]: Start difference. First operand has 179 places, 191 transitions, 530 flow. Second operand 3 states and 474 transitions. [2024-10-24 15:39:40,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 207 transitions, 659 flow [2024-10-24 15:39:40,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 207 transitions, 647 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:40,658 INFO L231 Difference]: Finished difference. Result has 181 places, 196 transitions, 578 flow [2024-10-24 15:39:40,658 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=181, PETRI_TRANSITIONS=196} [2024-10-24 15:39:40,659 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 9 predicate places. [2024-10-24 15:39:40,659 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 196 transitions, 578 flow [2024-10-24 15:39:40,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 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-10-24 15:39:40,660 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:40,660 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:40,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 15:39:40,660 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:39:40,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:40,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1525444953, now seen corresponding path program 1 times [2024-10-24 15:39:40,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:40,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807771734] [2024-10-24 15:39:40,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:40,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:40,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:40,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:40,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807771734] [2024-10-24 15:39:40,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807771734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:40,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:40,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:40,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526189913] [2024-10-24 15:39:40,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:40,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:40,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:40,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:40,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:40,751 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 171 [2024-10-24 15:39:40,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 196 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 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-10-24 15:39:40,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:40,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 171 [2024-10-24 15:39:40,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:41,932 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([430] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][178], [171#true, Black: 192#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 175#true, 101#L695-7true, 195#true, Black: 182#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 190#true, 93#L712-1true, 118#L695-2true, 173#true, Black: 187#(= |#race~data~0| 0)]) [2024-10-24 15:39:41,932 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2024-10-24 15:39:41,932 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-10-24 15:39:41,932 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-24 15:39:41,933 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-24 15:39:42,023 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([430] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][77], [171#true, Black: 192#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 175#true, 195#true, Black: 182#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 190#true, 45#L697true, 93#L712-1true, 118#L695-2true, 173#true, Black: 187#(= |#race~data~0| 0)]) [2024-10-24 15:39:42,023 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-10-24 15:39:42,023 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-24 15:39:42,023 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-24 15:39:42,023 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-24 15:39:42,202 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([430] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][77], [171#true, Black: 192#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 175#true, 195#true, Black: 182#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 190#true, 169#L697-3true, 93#L712-1true, 118#L695-2true, 173#true, Black: 187#(= |#race~data~0| 0)]) [2024-10-24 15:39:42,202 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2024-10-24 15:39:42,202 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-24 15:39:42,202 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2024-10-24 15:39:42,202 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-24 15:39:42,374 INFO L124 PetriNetUnfolderBase]: 4089/13929 cut-off events. [2024-10-24 15:39:42,375 INFO L125 PetriNetUnfolderBase]: For 5661/6065 co-relation queries the response was YES. [2024-10-24 15:39:42,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26313 conditions, 13929 events. 4089/13929 cut-off events. For 5661/6065 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 159038 event pairs, 2076 based on Foata normal form. 74/12579 useless extension candidates. Maximal degree in co-relation 22270. Up to 5204 conditions per place. [2024-10-24 15:39:42,459 INFO L140 encePairwiseOnDemand]: 162/171 looper letters, 49 selfloop transitions, 19 changer transitions 0/222 dead transitions. [2024-10-24 15:39:42,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 222 transitions, 815 flow [2024-10-24 15:39:42,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:42,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2024-10-24 15:39:42,462 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9142300194931774 [2024-10-24 15:39:42,462 INFO L175 Difference]: Start difference. First operand has 181 places, 196 transitions, 578 flow. Second operand 3 states and 469 transitions. [2024-10-24 15:39:42,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 222 transitions, 815 flow [2024-10-24 15:39:42,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 222 transitions, 801 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:42,470 INFO L231 Difference]: Finished difference. Result has 183 places, 211 transitions, 746 flow [2024-10-24 15:39:42,471 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=746, PETRI_PLACES=183, PETRI_TRANSITIONS=211} [2024-10-24 15:39:42,473 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 11 predicate places. [2024-10-24 15:39:42,473 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 211 transitions, 746 flow [2024-10-24 15:39:42,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 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-10-24 15:39:42,473 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:42,473 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:42,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 15:39:42,474 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:39:42,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:42,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1143944668, now seen corresponding path program 1 times [2024-10-24 15:39:42,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:42,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814242791] [2024-10-24 15:39:42,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:42,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:42,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:42,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:42,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814242791] [2024-10-24 15:39:42,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814242791] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 15:39:42,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343718448] [2024-10-24 15:39:42,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:42,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 15:39:42,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:39:42,656 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 15:39:42,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 15:39:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:42,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 15:39:42,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:39:43,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:43,005 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:39:43,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343718448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:43,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 15:39:43,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-24 15:39:43,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328913542] [2024-10-24 15:39:43,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:43,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 15:39:43,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:43,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 15:39:43,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 15:39:43,048 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 171 [2024-10-24 15:39:43,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 211 transitions, 746 flow. Second operand has 5 states, 5 states have (on average 144.4) internal successors, (722), 5 states have internal predecessors, (722), 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-10-24 15:39:43,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:43,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 171 [2024-10-24 15:39:43,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:44,635 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([430] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][189], [171#true, Black: 192#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 175#true, 101#L695-7true, 200#true, 195#true, Black: 197#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 182#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 93#L712-1true, 173#true, 118#L695-2true, Black: 187#(= |#race~data~0| 0)]) [2024-10-24 15:39:44,635 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2024-10-24 15:39:44,636 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-24 15:39:44,636 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-10-24 15:39:44,636 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-24 15:39:44,637 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([430] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][189], [171#true, Black: 192#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 175#true, 101#L695-7true, 195#true, Black: 197#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 182#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 93#L712-1true, 118#L695-2true, 173#true, Black: 187#(= |#race~data~0| 0), 204#(<= 1 ~threads_alive~0)]) [2024-10-24 15:39:44,637 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2024-10-24 15:39:44,638 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-10-24 15:39:44,638 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-24 15:39:44,638 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-24 15:39:44,816 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([430] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][77], [171#true, Black: 192#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 175#true, 200#true, 195#true, Black: 197#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 182#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 45#L697true, 93#L712-1true, 118#L695-2true, 173#true, Black: 187#(= |#race~data~0| 0)]) [2024-10-24 15:39:44,816 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-10-24 15:39:44,816 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-24 15:39:44,816 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-24 15:39:44,816 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-24 15:39:44,818 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([430] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][77], [171#true, Black: 192#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 175#true, 195#true, Black: 182#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), Black: 197#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), 45#L697true, 93#L712-1true, 173#true, 118#L695-2true, Black: 187#(= |#race~data~0| 0), 204#(<= 1 ~threads_alive~0)]) [2024-10-24 15:39:44,818 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-10-24 15:39:44,818 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-24 15:39:44,818 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-24 15:39:44,818 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-24 15:39:45,247 INFO L124 PetriNetUnfolderBase]: 5629/19770 cut-off events. [2024-10-24 15:39:45,247 INFO L125 PetriNetUnfolderBase]: For 10475/11843 co-relation queries the response was YES. [2024-10-24 15:39:45,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39188 conditions, 19770 events. 5629/19770 cut-off events. For 10475/11843 co-relation queries the response was YES. Maximal size of possible extension queue 891. Compared 246096 event pairs, 1267 based on Foata normal form. 131/17930 useless extension candidates. Maximal degree in co-relation 31228. Up to 3122 conditions per place. [2024-10-24 15:39:45,374 INFO L140 encePairwiseOnDemand]: 163/171 looper letters, 69 selfloop transitions, 14 changer transitions 3/270 dead transitions. [2024-10-24 15:39:45,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 270 transitions, 1037 flow [2024-10-24 15:39:45,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 15:39:45,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-24 15:39:45,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1081 transitions. [2024-10-24 15:39:45,377 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9030910609857978 [2024-10-24 15:39:45,377 INFO L175 Difference]: Start difference. First operand has 183 places, 211 transitions, 746 flow. Second operand 7 states and 1081 transitions. [2024-10-24 15:39:45,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 270 transitions, 1037 flow [2024-10-24 15:39:45,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 270 transitions, 999 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:45,458 INFO L231 Difference]: Finished difference. Result has 190 places, 224 transitions, 787 flow [2024-10-24 15:39:45,459 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=787, PETRI_PLACES=190, PETRI_TRANSITIONS=224} [2024-10-24 15:39:45,460 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 18 predicate places. [2024-10-24 15:39:45,460 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 224 transitions, 787 flow [2024-10-24 15:39:45,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 144.4) internal successors, (722), 5 states have internal predecessors, (722), 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-10-24 15:39:45,461 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:45,461 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:45,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 15:39:45,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-24 15:39:45,667 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:39:45,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:45,667 INFO L85 PathProgramCache]: Analyzing trace with hash 995030365, now seen corresponding path program 1 times [2024-10-24 15:39:45,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:45,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936941367] [2024-10-24 15:39:45,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:45,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:45,919 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:39:45,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:45,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936941367] [2024-10-24 15:39:45,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936941367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:45,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:45,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 15:39:45,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196188463] [2024-10-24 15:39:45,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:45,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:39:45,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:45,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:39:45,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:39:45,964 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 171 [2024-10-24 15:39:45,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 224 transitions, 787 flow. Second operand has 6 states, 6 states have (on average 151.5) internal successors, (909), 6 states have internal predecessors, (909), 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-10-24 15:39:45,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:45,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 171 [2024-10-24 15:39:45,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:46,426 INFO L124 PetriNetUnfolderBase]: 216/1800 cut-off events. [2024-10-24 15:39:46,427 INFO L125 PetriNetUnfolderBase]: For 464/477 co-relation queries the response was YES. [2024-10-24 15:39:46,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3215 conditions, 1800 events. 216/1800 cut-off events. For 464/477 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 13503 event pairs, 65 based on Foata normal form. 79/1800 useless extension candidates. Maximal degree in co-relation 2723. Up to 212 conditions per place. [2024-10-24 15:39:46,437 INFO L140 encePairwiseOnDemand]: 159/171 looper letters, 11 selfloop transitions, 12 changer transitions 0/184 dead transitions. [2024-10-24 15:39:46,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 184 transitions, 580 flow [2024-10-24 15:39:46,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:39:46,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 15:39:46,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 778 transitions. [2024-10-24 15:39:46,440 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9099415204678363 [2024-10-24 15:39:46,440 INFO L175 Difference]: Start difference. First operand has 190 places, 224 transitions, 787 flow. Second operand 5 states and 778 transitions. [2024-10-24 15:39:46,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 184 transitions, 580 flow [2024-10-24 15:39:46,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 184 transitions, 532 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-10-24 15:39:46,449 INFO L231 Difference]: Finished difference. Result has 182 places, 179 transitions, 495 flow [2024-10-24 15:39:46,450 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=495, PETRI_PLACES=182, PETRI_TRANSITIONS=179} [2024-10-24 15:39:46,451 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 10 predicate places. [2024-10-24 15:39:46,451 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 179 transitions, 495 flow [2024-10-24 15:39:46,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 151.5) internal successors, (909), 6 states have internal predecessors, (909), 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-10-24 15:39:46,452 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:46,452 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:46,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 15:39:46,453 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:39:46,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:46,453 INFO L85 PathProgramCache]: Analyzing trace with hash 546415679, now seen corresponding path program 1 times [2024-10-24 15:39:46,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:46,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683981780] [2024-10-24 15:39:46,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:46,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:46,516 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-24 15:39:46,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:46,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683981780] [2024-10-24 15:39:46,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683981780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:46,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:46,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:46,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645856929] [2024-10-24 15:39:46,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:46,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:46,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:46,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:46,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:46,535 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 171 [2024-10-24 15:39:46,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 179 transitions, 495 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 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-10-24 15:39:46,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:46,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 171 [2024-10-24 15:39:46,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:46,927 INFO L124 PetriNetUnfolderBase]: 647/2738 cut-off events. [2024-10-24 15:39:46,928 INFO L125 PetriNetUnfolderBase]: For 858/870 co-relation queries the response was YES. [2024-10-24 15:39:46,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5218 conditions, 2738 events. 647/2738 cut-off events. For 858/870 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 22909 event pairs, 351 based on Foata normal form. 0/2591 useless extension candidates. Maximal degree in co-relation 4728. Up to 908 conditions per place. [2024-10-24 15:39:46,943 INFO L140 encePairwiseOnDemand]: 165/171 looper letters, 34 selfloop transitions, 7 changer transitions 0/193 dead transitions. [2024-10-24 15:39:46,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 193 transitions, 629 flow [2024-10-24 15:39:46,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:46,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:46,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2024-10-24 15:39:46,945 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9220272904483431 [2024-10-24 15:39:46,946 INFO L175 Difference]: Start difference. First operand has 182 places, 179 transitions, 495 flow. Second operand 3 states and 473 transitions. [2024-10-24 15:39:46,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 193 transitions, 629 flow [2024-10-24 15:39:46,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 193 transitions, 608 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 15:39:46,953 INFO L231 Difference]: Finished difference. Result has 183 places, 183 transitions, 536 flow [2024-10-24 15:39:46,954 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=183, PETRI_TRANSITIONS=183} [2024-10-24 15:39:46,954 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 11 predicate places. [2024-10-24 15:39:46,954 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 183 transitions, 536 flow [2024-10-24 15:39:46,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 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-10-24 15:39:46,955 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:46,955 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:46,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 15:39:46,956 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:39:46,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:46,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1439840516, now seen corresponding path program 1 times [2024-10-24 15:39:46,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:46,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560382014] [2024-10-24 15:39:46,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:46,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:47,118 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-24 15:39:47,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:47,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560382014] [2024-10-24 15:39:47,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560382014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:47,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:47,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:39:47,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633661652] [2024-10-24 15:39:47,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:47,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:47,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:47,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:47,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:47,132 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 171 [2024-10-24 15:39:47,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 183 transitions, 536 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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-10-24 15:39:47,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:47,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 171 [2024-10-24 15:39:47,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:47,633 INFO L124 PetriNetUnfolderBase]: 334/2609 cut-off events. [2024-10-24 15:39:47,634 INFO L125 PetriNetUnfolderBase]: For 739/803 co-relation queries the response was YES. [2024-10-24 15:39:47,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4501 conditions, 2609 events. 334/2609 cut-off events. For 739/803 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 23284 event pairs, 93 based on Foata normal form. 12/2543 useless extension candidates. Maximal degree in co-relation 3321. Up to 495 conditions per place. [2024-10-24 15:39:47,645 INFO L140 encePairwiseOnDemand]: 162/171 looper letters, 21 selfloop transitions, 9 changer transitions 0/196 dead transitions. [2024-10-24 15:39:47,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 196 transitions, 637 flow [2024-10-24 15:39:47,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:47,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2024-10-24 15:39:47,647 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9454191033138402 [2024-10-24 15:39:47,647 INFO L175 Difference]: Start difference. First operand has 183 places, 183 transitions, 536 flow. Second operand 3 states and 485 transitions. [2024-10-24 15:39:47,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 196 transitions, 637 flow [2024-10-24 15:39:47,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 196 transitions, 623 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:47,654 INFO L231 Difference]: Finished difference. Result has 184 places, 190 transitions, 582 flow [2024-10-24 15:39:47,655 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=184, PETRI_TRANSITIONS=190} [2024-10-24 15:39:47,655 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 12 predicate places. [2024-10-24 15:39:47,655 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 190 transitions, 582 flow [2024-10-24 15:39:47,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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-10-24 15:39:47,656 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:47,656 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:47,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 15:39:47,657 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:39:47,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:47,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1215270748, now seen corresponding path program 2 times [2024-10-24 15:39:47,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:47,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171387769] [2024-10-24 15:39:47,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:47,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:47,869 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:39:47,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:47,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171387769] [2024-10-24 15:39:47,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171387769] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 15:39:47,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761233426] [2024-10-24 15:39:47,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:39:47,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 15:39:47,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:39:47,872 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 15:39:47,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 15:39:47,970 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 15:39:47,970 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:39:47,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 15:39:47,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:39:48,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 15:39:48,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 15:39:48,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 15:39:48,453 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:39:48,456 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:39:48,491 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_245 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#threads_alive_mutex~0.base| v_ArrVal_245) |c_~#data_mutex~0.base|) |c_~#data_mutex~0.offset|) 0))) is different from false [2024-10-24 15:39:48,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 15:39:48,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-10-24 15:39:48,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-10-24 15:39:48,687 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 11 not checked. [2024-10-24 15:39:48,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761233426] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:39:48,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 15:39:48,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-24 15:39:48,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446716298] [2024-10-24 15:39:48,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 15:39:48,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 15:39:48,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:48,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 15:39:48,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=76, Unknown=1, NotChecked=18, Total=132 [2024-10-24 15:39:48,721 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2024-10-24 15:39:48,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 190 transitions, 582 flow. Second operand has 12 states, 12 states have (on average 143.58333333333334) internal successors, (1723), 12 states have internal predecessors, (1723), 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-10-24 15:39:48,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:48,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2024-10-24 15:39:48,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:49,027 INFO L124 PetriNetUnfolderBase]: 193/1813 cut-off events. [2024-10-24 15:39:49,028 INFO L125 PetriNetUnfolderBase]: For 612/702 co-relation queries the response was YES. [2024-10-24 15:39:49,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3310 conditions, 1813 events. 193/1813 cut-off events. For 612/702 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 13868 event pairs, 43 based on Foata normal form. 45/1814 useless extension candidates. Maximal degree in co-relation 2729. Up to 248 conditions per place. [2024-10-24 15:39:49,040 INFO L140 encePairwiseOnDemand]: 165/171 looper letters, 38 selfloop transitions, 8 changer transitions 2/199 dead transitions. [2024-10-24 15:39:49,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 199 transitions, 705 flow [2024-10-24 15:39:49,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:39:49,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 15:39:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 741 transitions. [2024-10-24 15:39:49,043 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2024-10-24 15:39:49,043 INFO L175 Difference]: Start difference. First operand has 184 places, 190 transitions, 582 flow. Second operand 5 states and 741 transitions. [2024-10-24 15:39:49,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 199 transitions, 705 flow [2024-10-24 15:39:49,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 199 transitions, 694 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-24 15:39:49,050 INFO L231 Difference]: Finished difference. Result has 187 places, 186 transitions, 563 flow [2024-10-24 15:39:49,051 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=563, PETRI_PLACES=187, PETRI_TRANSITIONS=186} [2024-10-24 15:39:49,051 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 15 predicate places. [2024-10-24 15:39:49,051 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 186 transitions, 563 flow [2024-10-24 15:39:49,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 143.58333333333334) internal successors, (1723), 12 states have internal predecessors, (1723), 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-10-24 15:39:49,053 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:49,054 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:49,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 15:39:49,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-24 15:39:49,258 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:39:49,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:49,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1912941298, now seen corresponding path program 1 times [2024-10-24 15:39:49,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:49,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249180403] [2024-10-24 15:39:49,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:49,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:49,302 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-24 15:39:49,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:49,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249180403] [2024-10-24 15:39:49,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249180403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:49,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:49,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:49,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567809197] [2024-10-24 15:39:49,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:49,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:49,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:49,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:49,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:49,340 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 171 [2024-10-24 15:39:49,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 186 transitions, 563 flow. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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-10-24 15:39:49,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:49,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 171 [2024-10-24 15:39:49,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:49,634 INFO L124 PetriNetUnfolderBase]: 304/2247 cut-off events. [2024-10-24 15:39:49,635 INFO L125 PetriNetUnfolderBase]: For 1335/1433 co-relation queries the response was YES. [2024-10-24 15:39:49,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4525 conditions, 2247 events. 304/2247 cut-off events. For 1335/1433 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 18485 event pairs, 154 based on Foata normal form. 3/2189 useless extension candidates. Maximal degree in co-relation 3827. Up to 664 conditions per place. [2024-10-24 15:39:49,648 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 37 selfloop transitions, 2 changer transitions 2/188 dead transitions. [2024-10-24 15:39:49,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 188 transitions, 657 flow [2024-10-24 15:39:49,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:49,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:49,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2024-10-24 15:39:49,651 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8810916179337231 [2024-10-24 15:39:49,651 INFO L175 Difference]: Start difference. First operand has 187 places, 186 transitions, 563 flow. Second operand 3 states and 452 transitions. [2024-10-24 15:39:49,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 188 transitions, 657 flow [2024-10-24 15:39:49,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 188 transitions, 645 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 15:39:49,658 INFO L231 Difference]: Finished difference. Result has 185 places, 183 transitions, 548 flow [2024-10-24 15:39:49,658 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=185, PETRI_TRANSITIONS=183} [2024-10-24 15:39:49,659 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 13 predicate places. [2024-10-24 15:39:49,659 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 183 transitions, 548 flow [2024-10-24 15:39:49,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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-10-24 15:39:49,660 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:49,660 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:49,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 15:39:49,660 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:39:49,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:49,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1718257356, now seen corresponding path program 1 times [2024-10-24 15:39:49,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:49,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953776525] [2024-10-24 15:39:49,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:49,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 15:39:49,683 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 15:39:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 15:39:49,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 15:39:49,722 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 15:39:49,722 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2024-10-24 15:39:49,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2024-10-24 15:39:49,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2024-10-24 15:39:49,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2024-10-24 15:39:49,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2024-10-24 15:39:49,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2024-10-24 15:39:49,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2024-10-24 15:39:49,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2024-10-24 15:39:49,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2024-10-24 15:39:49,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2024-10-24 15:39:49,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2024-10-24 15:39:49,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2024-10-24 15:39:49,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2024-10-24 15:39:49,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2024-10-24 15:39:49,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 15:39:49,725 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:49,726 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-24 15:39:49,726 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-24 15:39:49,755 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 15:39:49,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 206 places, 203 transitions, 424 flow [2024-10-24 15:39:49,809 INFO L124 PetriNetUnfolderBase]: 13/345 cut-off events. [2024-10-24 15:39:49,809 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-24 15:39:49,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 345 events. 13/345 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 591 event pairs, 0 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 267. Up to 8 conditions per place. [2024-10-24 15:39:49,811 INFO L82 GeneralOperation]: Start removeDead. Operand has 206 places, 203 transitions, 424 flow [2024-10-24 15:39:49,816 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 206 places, 203 transitions, 424 flow [2024-10-24 15:39:49,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:39:49,817 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;@3dc29eea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:39:49,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-10-24 15:39:49,825 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 15:39:49,825 INFO L124 PetriNetUnfolderBase]: 2/65 cut-off events. [2024-10-24 15:39:49,825 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 15:39:49,826 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:49,826 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:49,826 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-10-24 15:39:49,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:49,827 INFO L85 PathProgramCache]: Analyzing trace with hash 479236264, now seen corresponding path program 1 times [2024-10-24 15:39:49,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:49,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904896955] [2024-10-24 15:39:49,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:49,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:49,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:49,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:49,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904896955] [2024-10-24 15:39:49,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904896955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:49,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:49,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:49,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092871359] [2024-10-24 15:39:49,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:49,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:49,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:49,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:49,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:49,895 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 203 [2024-10-24 15:39:49,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 203 transitions, 424 flow. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 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-10-24 15:39:49,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:49,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 203 [2024-10-24 15:39:49,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:40:02,254 INFO L124 PetriNetUnfolderBase]: 35239/82878 cut-off events. [2024-10-24 15:40:02,254 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2024-10-24 15:40:02,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133690 conditions, 82878 events. 35239/82878 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 2909. Compared 1039704 event pairs, 14941 based on Foata normal form. 986/74987 useless extension candidates. Maximal degree in co-relation 112523. Up to 27933 conditions per place. [2024-10-24 15:40:03,062 INFO L140 encePairwiseOnDemand]: 181/203 looper letters, 60 selfloop transitions, 14 changer transitions 1/234 dead transitions. [2024-10-24 15:40:03,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 234 transitions, 646 flow [2024-10-24 15:40:03,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:40:03,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:40:03,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 564 transitions. [2024-10-24 15:40:03,064 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9261083743842364 [2024-10-24 15:40:03,064 INFO L175 Difference]: Start difference. First operand has 206 places, 203 transitions, 424 flow. Second operand 3 states and 564 transitions. [2024-10-24 15:40:03,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 234 transitions, 646 flow [2024-10-24 15:40:03,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 234 transitions, 642 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-10-24 15:40:03,071 INFO L231 Difference]: Finished difference. Result has 210 places, 213 transitions, 536 flow [2024-10-24 15:40:03,072 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=210, PETRI_TRANSITIONS=213} [2024-10-24 15:40:03,072 INFO L277 CegarLoopForPetriNet]: 206 programPoint places, 4 predicate places. [2024-10-24 15:40:03,073 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 213 transitions, 536 flow [2024-10-24 15:40:03,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 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-10-24 15:40:03,073 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:40:03,073 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:40:03,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 15:40:03,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-10-24 15:40:03,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:40:03,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1059927244, now seen corresponding path program 1 times [2024-10-24 15:40:03,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:40:03,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123698747] [2024-10-24 15:40:03,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:40:03,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:40:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:40:03,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:40:03,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:40:03,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123698747] [2024-10-24 15:40:03,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123698747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:40:03,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:40:03,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:40:03,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824963512] [2024-10-24 15:40:03,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:40:03,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:40:03,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:40:03,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:40:03,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:40:03,149 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 203 [2024-10-24 15:40:03,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 213 transitions, 536 flow. Second operand has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 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-10-24 15:40:03,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:40:03,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 203 [2024-10-24 15:40:03,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:40:07,228 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([633] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][77], [214#true, 211#(= |#race~threads_alive~0| 0), 205#true, Black: 209#true, 164#L695-2true, 22#L691-3true, 207#true, 149#L712-1true, 151#L695-2true, 203#true]) [2024-10-24 15:40:07,228 INFO L294 olderBase$Statistics]: this new event has 181 ancestors and is cut-off event [2024-10-24 15:40:07,229 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-10-24 15:40:07,229 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-10-24 15:40:07,229 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-10-24 15:40:07,229 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([633] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][77], [57#L695-1true, 214#true, 211#(= |#race~threads_alive~0| 0), 205#true, Black: 209#true, 164#L695-2true, 22#L691-3true, 207#true, 149#L712-1true, 203#true]) [2024-10-24 15:40:07,229 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2024-10-24 15:40:07,229 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-10-24 15:40:07,229 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-10-24 15:40:07,229 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-10-24 15:40:07,229 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([633] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][77], [214#true, 211#(= |#race~threads_alive~0| 0), 205#true, Black: 209#true, 22#L691-3true, 207#true, 149#L712-1true, 151#L695-2true, 203#true, 94#L695-1true]) [2024-10-24 15:40:07,229 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2024-10-24 15:40:07,230 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-10-24 15:40:07,230 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-10-24 15:40:07,230 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-10-24 15:40:07,516 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([633] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][77], [57#L695-1true, 214#true, 211#(= |#race~threads_alive~0| 0), 205#true, Black: 209#true, 164#L695-2true, 22#L691-3true, 207#true, 149#L712-1true, 203#true]) [2024-10-24 15:40:07,517 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2024-10-24 15:40:07,517 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-10-24 15:40:07,517 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-10-24 15:40:07,517 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-10-24 15:40:07,517 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-10-24 15:40:07,518 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([633] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][77], [214#true, 211#(= |#race~threads_alive~0| 0), 205#true, Black: 209#true, 207#true, 22#L691-3true, 149#L712-1true, 151#L695-2true, 203#true, 94#L695-1true]) [2024-10-24 15:40:07,519 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2024-10-24 15:40:07,519 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-10-24 15:40:07,519 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-10-24 15:40:07,519 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-10-24 15:40:07,519 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-10-24 15:40:07,756 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([633] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][77], [214#true, 211#(= |#race~threads_alive~0| 0), 205#true, Black: 209#true, 164#L695-2true, 22#L691-3true, 207#true, 151#L695-2true, 149#L712-1true, 203#true]) [2024-10-24 15:40:07,757 INFO L294 olderBase$Statistics]: this new event has 181 ancestors and is cut-off event [2024-10-24 15:40:07,757 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-10-24 15:40:07,757 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2024-10-24 15:40:07,757 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-10-24 15:40:07,757 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-10-24 15:40:07,757 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([633] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][77], [214#true, 211#(= |#race~threads_alive~0| 0), 205#true, Black: 209#true, 164#L695-2true, 207#true, 148#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 22#L691-3true, 149#L712-1true, 203#true]) [2024-10-24 15:40:07,758 INFO L294 olderBase$Statistics]: this new event has 181 ancestors and is cut-off event [2024-10-24 15:40:07,758 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-10-24 15:40:07,758 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2024-10-24 15:40:07,758 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-10-24 15:40:09,216 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([633] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][63], [211#(= |#race~threads_alive~0| 0), 214#true, 205#true, Black: 209#true, 47#L695-6true, 207#true, 148#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 22#L691-3true, 149#L712-1true, 203#true]) [2024-10-24 15:40:09,216 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2024-10-24 15:40:09,216 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-10-24 15:40:09,216 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2024-10-24 15:40:09,216 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-10-24 15:40:09,220 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([633] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][63], [211#(= |#race~threads_alive~0| 0), 214#true, 205#true, Black: 209#true, 22#L691-3true, 98#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 207#true, 149#L712-1true, 203#true, 158#L695-6true]) [2024-10-24 15:40:09,220 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2024-10-24 15:40:09,220 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2024-10-24 15:40:09,220 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-10-24 15:40:09,220 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-10-24 15:40:10,436 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([633] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][63], [211#(= |#race~threads_alive~0| 0), 214#true, 170#L697-3true, 205#true, Black: 209#true, 207#true, 148#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 22#L691-3true, 149#L712-1true, 203#true]) [2024-10-24 15:40:10,437 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2024-10-24 15:40:10,437 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2024-10-24 15:40:10,437 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2024-10-24 15:40:10,437 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2024-10-24 15:40:10,439 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([633] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][63], [211#(= |#race~threads_alive~0| 0), 214#true, 205#true, Black: 209#true, 22#L691-3true, 98#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 207#true, 84#L697-3true, 149#L712-1true, 203#true]) [2024-10-24 15:40:10,440 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2024-10-24 15:40:10,440 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2024-10-24 15:40:10,440 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2024-10-24 15:40:10,440 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2024-10-24 15:40:10,442 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([633] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][77], [214#true, 211#(= |#race~threads_alive~0| 0), 205#true, Black: 209#true, 164#L695-2true, 207#true, 149#L712-1true, 151#L695-2true, 105#L693-3true, 203#true]) [2024-10-24 15:40:10,442 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2024-10-24 15:40:10,442 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-24 15:40:10,442 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-24 15:40:10,442 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-24 15:40:10,443 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([633] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][77], [57#L695-1true, 214#true, 211#(= |#race~threads_alive~0| 0), 205#true, Black: 209#true, 164#L695-2true, 207#true, 149#L712-1true, 105#L693-3true, 203#true]) [2024-10-24 15:40:10,443 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2024-10-24 15:40:10,443 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2024-10-24 15:40:10,443 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2024-10-24 15:40:10,443 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2024-10-24 15:40:10,443 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([633] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][77], [214#true, 211#(= |#race~threads_alive~0| 0), 205#true, Black: 209#true, 207#true, 149#L712-1true, 151#L695-2true, 105#L693-3true, 203#true, 94#L695-1true]) [2024-10-24 15:40:10,443 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2024-10-24 15:40:10,443 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2024-10-24 15:40:10,444 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2024-10-24 15:40:10,444 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2024-10-24 15:40:10,669 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([633] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][77], [214#true, 211#(= |#race~threads_alive~0| 0), 57#L695-1true, 205#true, Black: 209#true, 164#L695-2true, 207#true, 149#L712-1true, 105#L693-3true, 203#true]) [2024-10-24 15:40:10,669 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2024-10-24 15:40:10,669 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2024-10-24 15:40:10,669 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2024-10-24 15:40:10,669 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2024-10-24 15:40:10,669 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2024-10-24 15:40:10,671 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([633] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][77], [214#true, 211#(= |#race~threads_alive~0| 0), 205#true, Black: 209#true, 207#true, 149#L712-1true, 151#L695-2true, 105#L693-3true, 203#true, 94#L695-1true]) [2024-10-24 15:40:10,671 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2024-10-24 15:40:10,671 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2024-10-24 15:40:10,671 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2024-10-24 15:40:10,672 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2024-10-24 15:40:10,672 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2024-10-24 15:40:10,893 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([633] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][77], [214#true, 211#(= |#race~threads_alive~0| 0), 205#true, Black: 209#true, 164#L695-2true, 207#true, 151#L695-2true, 149#L712-1true, 105#L693-3true, 203#true]) [2024-10-24 15:40:10,893 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2024-10-24 15:40:10,893 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-24 15:40:10,893 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2024-10-24 15:40:10,893 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-24 15:40:10,893 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-24 15:40:10,893 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([633] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][77], [214#true, 211#(= |#race~threads_alive~0| 0), 205#true, Black: 209#true, 164#L695-2true, 207#true, 148#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 149#L712-1true, 105#L693-3true, 203#true]) [2024-10-24 15:40:10,894 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2024-10-24 15:40:10,894 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2024-10-24 15:40:10,894 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-24 15:40:10,894 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-24 15:40:10,896 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([633] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][77], [214#true, 211#(= |#race~threads_alive~0| 0), 182#L694-3true, 205#true, Black: 209#true, 164#L695-2true, 207#true, 151#L695-2true, 149#L712-1true, 203#true]) [2024-10-24 15:40:10,896 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2024-10-24 15:40:10,896 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2024-10-24 15:40:10,896 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2024-10-24 15:40:10,896 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2024-10-24 15:40:10,896 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([633] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][77], [57#L695-1true, 214#true, 211#(= |#race~threads_alive~0| 0), 182#L694-3true, 205#true, Black: 209#true, 164#L695-2true, 207#true, 149#L712-1true, 203#true]) [2024-10-24 15:40:10,896 INFO L294 olderBase$Statistics]: this new event has 192 ancestors and is cut-off event [2024-10-24 15:40:10,896 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-10-24 15:40:10,896 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-10-24 15:40:10,896 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-10-24 15:40:10,896 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([633] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][77], [214#true, 211#(= |#race~threads_alive~0| 0), 182#L694-3true, 205#true, Black: 209#true, 207#true, 149#L712-1true, 151#L695-2true, 203#true, 94#L695-1true]) [2024-10-24 15:40:10,896 INFO L294 olderBase$Statistics]: this new event has 192 ancestors and is cut-off event [2024-10-24 15:40:10,896 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-10-24 15:40:10,896 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-10-24 15:40:10,896 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-10-24 15:40:11,469 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([633] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][77], [214#true, 57#L695-1true, 211#(= |#race~threads_alive~0| 0), 182#L694-3true, 205#true, Black: 209#true, 164#L695-2true, 207#true, 149#L712-1true, 203#true]) [2024-10-24 15:40:11,470 INFO L294 olderBase$Statistics]: this new event has 192 ancestors and is cut-off event [2024-10-24 15:40:11,470 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-10-24 15:40:11,470 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2024-10-24 15:40:11,470 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-10-24 15:40:11,470 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-10-24 15:40:11,472 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([633] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][77], [214#true, 211#(= |#race~threads_alive~0| 0), 182#L694-3true, 205#true, Black: 209#true, 207#true, 149#L712-1true, 151#L695-2true, 203#true, 94#L695-1true]) [2024-10-24 15:40:11,472 INFO L294 olderBase$Statistics]: this new event has 192 ancestors and is cut-off event [2024-10-24 15:40:11,472 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-10-24 15:40:11,472 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-10-24 15:40:11,473 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2024-10-24 15:40:11,473 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event