./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/per-thread-index-bitmask-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 9dc253a71095a3ed3b49fc56a3d17da307efb7fa91be8525b1f50977899b5b3d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:20:17,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:20:17,465 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:20:17,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:20:17,474 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:20:17,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:20:17,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:20:17,503 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:20:17,504 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:20:17,504 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:20:17,505 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:20:17,505 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:20:17,506 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:20:17,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:20:17,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:20:17,509 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:20:17,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:20:17,513 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:20:17,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:20:17,514 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:20:17,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:20:17,515 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:20:17,515 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:20:17,515 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:20:17,516 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:20:17,516 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:20:17,516 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:20:17,516 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:20:17,517 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:20:17,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:20:17,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:20:17,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:20:17,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:20:17,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:20:17,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:20:17,519 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:20:17,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:20:17,519 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:20:17,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:20:17,520 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:20:17,520 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:20:17,521 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-clean/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-clean/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 -> 9dc253a71095a3ed3b49fc56a3d17da307efb7fa91be8525b1f50977899b5b3d [2024-10-11 17:20:17,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:20:17,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:20:17,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:20:17,824 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:20:17,825 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:20:17,826 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i [2024-10-11 17:20:19,268 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:20:19,563 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:20:19,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i [2024-10-11 17:20:19,584 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1a6ac7b72/6bce46337bcf43c6a74066058c389fba/FLAGf77c60dad [2024-10-11 17:20:19,602 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1a6ac7b72/6bce46337bcf43c6a74066058c389fba [2024-10-11 17:20:19,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:20:19,605 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:20:19,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:20:19,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:20:19,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:20:19,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:20:19" (1/1) ... [2024-10-11 17:20:19,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@127b7cd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:19, skipping insertion in model container [2024-10-11 17:20:19,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:20:19" (1/1) ... [2024-10-11 17:20:19,668 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:20:20,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:20:20,214 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:20:20,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:20:20,354 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:20:20,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:20 WrapperNode [2024-10-11 17:20:20,354 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:20:20,356 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:20:20,356 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:20:20,356 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:20:20,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:20" (1/1) ... [2024-10-11 17:20:20,389 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:20" (1/1) ... [2024-10-11 17:20:20,431 INFO L138 Inliner]: procedures = 273, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 132 [2024-10-11 17:20:20,435 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:20:20,436 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:20:20,436 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:20:20,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:20:20,448 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:20" (1/1) ... [2024-10-11 17:20:20,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:20" (1/1) ... [2024-10-11 17:20:20,451 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:20" (1/1) ... [2024-10-11 17:20:20,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:20" (1/1) ... [2024-10-11 17:20:20,460 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:20" (1/1) ... [2024-10-11 17:20:20,464 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:20" (1/1) ... [2024-10-11 17:20:20,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:20" (1/1) ... [2024-10-11 17:20:20,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:20" (1/1) ... [2024-10-11 17:20:20,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:20:20,477 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:20:20,477 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:20:20,477 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:20:20,478 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:20" (1/1) ... [2024-10-11 17:20:20,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:20:20,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:20:20,526 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:20:20,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:20:20,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:20:20,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:20:20,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:20:20,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:20:20,594 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-11 17:20:20,594 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-11 17:20:20,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:20:20,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:20:20,599 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:20:20,773 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:20:20,776 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:20:21,161 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:20:21,161 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:20:21,204 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:20:21,204 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 17:20:21,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:20:21 BoogieIcfgContainer [2024-10-11 17:20:21,205 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:20:21,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:20:21,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:20:21,234 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:20:21,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:20:19" (1/3) ... [2024-10-11 17:20:21,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e38690e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:20:21, skipping insertion in model container [2024-10-11 17:20:21,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:20" (2/3) ... [2024-10-11 17:20:21,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e38690e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:20:21, skipping insertion in model container [2024-10-11 17:20:21,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:20:21" (3/3) ... [2024-10-11 17:20:21,240 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i [2024-10-11 17:20:21,258 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:20:21,258 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-10-11 17:20:21,258 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:20:21,368 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-11 17:20:21,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 187 transitions, 381 flow [2024-10-11 17:20:21,511 INFO L124 PetriNetUnfolderBase]: 30/281 cut-off events. [2024-10-11 17:20:21,511 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:20:21,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 281 events. 30/281 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 611 event pairs, 0 based on Foata normal form. 0/231 useless extension candidates. Maximal degree in co-relation 142. Up to 6 conditions per place. [2024-10-11 17:20:21,523 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 187 transitions, 381 flow [2024-10-11 17:20:21,531 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 187 transitions, 381 flow [2024-10-11 17:20:21,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:20:21,556 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;@3b0ef22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:20:21,556 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-11 17:20:21,569 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:20:21,571 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-10-11 17:20:21,571 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:20:21,572 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:21,572 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:21,573 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:20:21,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:21,581 INFO L85 PathProgramCache]: Analyzing trace with hash 835015357, now seen corresponding path program 1 times [2024-10-11 17:20:21,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:21,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415116211] [2024-10-11 17:20:21,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:21,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:21,849 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-11 17:20:21,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:21,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415116211] [2024-10-11 17:20:21,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415116211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:21,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:21,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:20:21,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854758666] [2024-10-11 17:20:21,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:21,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:20:21,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:21,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:20:21,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:20:21,926 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 187 [2024-10-11 17:20:21,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 187 transitions, 381 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 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-11 17:20:21,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:21,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 187 [2024-10-11 17:20:21,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:22,094 INFO L124 PetriNetUnfolderBase]: 62/554 cut-off events. [2024-10-11 17:20:22,095 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2024-10-11 17:20:22,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 554 events. 62/554 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2355 event pairs, 2 based on Foata normal form. 6/462 useless extension candidates. Maximal degree in co-relation 469. Up to 65 conditions per place. [2024-10-11 17:20:22,105 INFO L140 encePairwiseOnDemand]: 180/187 looper letters, 16 selfloop transitions, 2 changer transitions 2/182 dead transitions. [2024-10-11 17:20:22,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 182 transitions, 407 flow [2024-10-11 17:20:22,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:20:22,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:20:22,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 515 transitions. [2024-10-11 17:20:22,122 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9180035650623886 [2024-10-11 17:20:22,124 INFO L175 Difference]: Start difference. First operand has 172 places, 187 transitions, 381 flow. Second operand 3 states and 515 transitions. [2024-10-11 17:20:22,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 182 transitions, 407 flow [2024-10-11 17:20:22,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 182 transitions, 407 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:22,134 INFO L231 Difference]: Finished difference. Result has 173 places, 180 transitions, 371 flow [2024-10-11 17:20:22,136 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=371, PETRI_PLACES=173, PETRI_TRANSITIONS=180} [2024-10-11 17:20:22,142 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 1 predicate places. [2024-10-11 17:20:22,142 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 180 transitions, 371 flow [2024-10-11 17:20:22,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 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-11 17:20:22,143 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:22,143 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] [2024-10-11 17:20:22,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:20:22,143 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:20:22,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:22,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1053039575, now seen corresponding path program 1 times [2024-10-11 17:20:22,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:22,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043359957] [2024-10-11 17:20:22,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:22,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:22,320 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-11 17:20:22,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:22,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043359957] [2024-10-11 17:20:22,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043359957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:22,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:22,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:20:22,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854279114] [2024-10-11 17:20:22,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:22,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:20:22,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:22,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:20:22,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:20:22,357 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 187 [2024-10-11 17:20:22,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 180 transitions, 371 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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-11 17:20:22,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:22,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 187 [2024-10-11 17:20:22,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:22,498 INFO L124 PetriNetUnfolderBase]: 132/715 cut-off events. [2024-10-11 17:20:22,498 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:20:22,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 881 conditions, 715 events. 132/715 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3513 event pairs, 6 based on Foata normal form. 0/591 useless extension candidates. Maximal degree in co-relation 843. Up to 106 conditions per place. [2024-10-11 17:20:22,505 INFO L140 encePairwiseOnDemand]: 176/187 looper letters, 29 selfloop transitions, 8 changer transitions 0/196 dead transitions. [2024-10-11 17:20:22,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 196 transitions, 477 flow [2024-10-11 17:20:22,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:20:22,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:20:22,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2024-10-11 17:20:22,508 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9376114081996435 [2024-10-11 17:20:22,509 INFO L175 Difference]: Start difference. First operand has 173 places, 180 transitions, 371 flow. Second operand 3 states and 526 transitions. [2024-10-11 17:20:22,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 196 transitions, 477 flow [2024-10-11 17:20:22,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 196 transitions, 473 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:20:22,514 INFO L231 Difference]: Finished difference. Result has 173 places, 188 transitions, 437 flow [2024-10-11 17:20:22,515 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=437, PETRI_PLACES=173, PETRI_TRANSITIONS=188} [2024-10-11 17:20:22,516 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 1 predicate places. [2024-10-11 17:20:22,516 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 188 transitions, 437 flow [2024-10-11 17:20:22,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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-11 17:20:22,517 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:22,517 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] [2024-10-11 17:20:22,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:20:22,518 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:20:22,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:22,518 INFO L85 PathProgramCache]: Analyzing trace with hash -2119049841, now seen corresponding path program 1 times [2024-10-11 17:20:22,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:22,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749072638] [2024-10-11 17:20:22,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:22,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:22,594 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-11 17:20:22,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:22,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749072638] [2024-10-11 17:20:22,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749072638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:22,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:22,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:20:22,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217581292] [2024-10-11 17:20:22,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:22,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:20:22,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:22,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:20:22,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:20:22,616 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 187 [2024-10-11 17:20:22,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 188 transitions, 437 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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-11 17:20:22,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:22,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 187 [2024-10-11 17:20:22,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:22,797 INFO L124 PetriNetUnfolderBase]: 118/810 cut-off events. [2024-10-11 17:20:22,797 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-10-11 17:20:22,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1013 conditions, 810 events. 118/810 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4379 event pairs, 11 based on Foata normal form. 0/683 useless extension candidates. Maximal degree in co-relation 841. Up to 73 conditions per place. [2024-10-11 17:20:22,807 INFO L140 encePairwiseOnDemand]: 183/187 looper letters, 21 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2024-10-11 17:20:22,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 194 transitions, 495 flow [2024-10-11 17:20:22,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:20:22,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:20:22,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2024-10-11 17:20:22,811 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9322638146167558 [2024-10-11 17:20:22,812 INFO L175 Difference]: Start difference. First operand has 173 places, 188 transitions, 437 flow. Second operand 3 states and 523 transitions. [2024-10-11 17:20:22,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 194 transitions, 495 flow [2024-10-11 17:20:22,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 194 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:20:22,823 INFO L231 Difference]: Finished difference. Result has 172 places, 188 transitions, 431 flow [2024-10-11 17:20:22,824 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=431, PETRI_PLACES=172, PETRI_TRANSITIONS=188} [2024-10-11 17:20:22,825 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 0 predicate places. [2024-10-11 17:20:22,825 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 188 transitions, 431 flow [2024-10-11 17:20:22,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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-11 17:20:22,825 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:22,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] [2024-10-11 17:20:22,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:20:22,826 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:20:22,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:22,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1734929095, now seen corresponding path program 1 times [2024-10-11 17:20:22,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:22,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17734644] [2024-10-11 17:20:22,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:22,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:23,001 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-11 17:20:23,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:23,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17734644] [2024-10-11 17:20:23,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17734644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:23,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:23,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:23,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114718136] [2024-10-11 17:20:23,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:23,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:20:23,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:23,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:20:23,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:20:23,109 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 187 [2024-10-11 17:20:23,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 188 transitions, 431 flow. Second operand has 5 states, 5 states have (on average 163.4) internal successors, (817), 5 states have internal predecessors, (817), 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-11 17:20:23,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:23,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 187 [2024-10-11 17:20:23,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:23,248 INFO L124 PetriNetUnfolderBase]: 109/712 cut-off events. [2024-10-11 17:20:23,249 INFO L125 PetriNetUnfolderBase]: For 25/40 co-relation queries the response was YES. [2024-10-11 17:20:23,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 712 events. 109/712 cut-off events. For 25/40 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3660 event pairs, 15 based on Foata normal form. 2/601 useless extension candidates. Maximal degree in co-relation 711. Up to 83 conditions per place. [2024-10-11 17:20:23,256 INFO L140 encePairwiseOnDemand]: 179/187 looper letters, 27 selfloop transitions, 2 changer transitions 5/201 dead transitions. [2024-10-11 17:20:23,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 201 transitions, 525 flow [2024-10-11 17:20:23,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:23,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:23,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1007 transitions. [2024-10-11 17:20:23,260 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8975044563279857 [2024-10-11 17:20:23,261 INFO L175 Difference]: Start difference. First operand has 172 places, 188 transitions, 431 flow. Second operand 6 states and 1007 transitions. [2024-10-11 17:20:23,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 201 transitions, 525 flow [2024-10-11 17:20:23,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 201 transitions, 525 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:23,266 INFO L231 Difference]: Finished difference. Result has 181 places, 188 transitions, 449 flow [2024-10-11 17:20:23,266 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=449, PETRI_PLACES=181, PETRI_TRANSITIONS=188} [2024-10-11 17:20:23,268 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 9 predicate places. [2024-10-11 17:20:23,268 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 188 transitions, 449 flow [2024-10-11 17:20:23,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 163.4) internal successors, (817), 5 states have internal predecessors, (817), 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-11 17:20:23,270 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:23,270 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] [2024-10-11 17:20:23,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:20:23,270 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:20:23,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:23,271 INFO L85 PathProgramCache]: Analyzing trace with hash -578263167, now seen corresponding path program 1 times [2024-10-11 17:20:23,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:23,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521607696] [2024-10-11 17:20:23,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:23,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:23,342 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-11 17:20:23,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:23,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521607696] [2024-10-11 17:20:23,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521607696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:23,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:23,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:20:23,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564502962] [2024-10-11 17:20:23,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:23,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:20:23,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:23,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:20:23,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:20:23,385 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 187 [2024-10-11 17:20:23,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 188 transitions, 449 flow. Second operand has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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-11 17:20:23,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:23,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 187 [2024-10-11 17:20:23,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:23,483 INFO L124 PetriNetUnfolderBase]: 110/657 cut-off events. [2024-10-11 17:20:23,483 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-10-11 17:20:23,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 657 events. 110/657 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3015 event pairs, 12 based on Foata normal form. 1/556 useless extension candidates. Maximal degree in co-relation 767. Up to 87 conditions per place. [2024-10-11 17:20:23,489 INFO L140 encePairwiseOnDemand]: 184/187 looper letters, 19 selfloop transitions, 2 changer transitions 0/195 dead transitions. [2024-10-11 17:20:23,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 195 transitions, 505 flow [2024-10-11 17:20:23,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:20:23,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:20:23,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2024-10-11 17:20:23,491 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9429590017825312 [2024-10-11 17:20:23,491 INFO L175 Difference]: Start difference. First operand has 181 places, 188 transitions, 449 flow. Second operand 3 states and 529 transitions. [2024-10-11 17:20:23,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 195 transitions, 505 flow [2024-10-11 17:20:23,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 195 transitions, 491 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-11 17:20:23,496 INFO L231 Difference]: Finished difference. Result has 176 places, 189 transitions, 447 flow [2024-10-11 17:20:23,496 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=447, PETRI_PLACES=176, PETRI_TRANSITIONS=189} [2024-10-11 17:20:23,497 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 4 predicate places. [2024-10-11 17:20:23,497 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 189 transitions, 447 flow [2024-10-11 17:20:23,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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-11 17:20:23,498 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:23,498 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-11 17:20:23,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:20:23,498 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:20:23,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:23,499 INFO L85 PathProgramCache]: Analyzing trace with hash 548981719, now seen corresponding path program 1 times [2024-10-11 17:20:23,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:23,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89047212] [2024-10-11 17:20:23,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:23,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:23,582 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-11 17:20:23,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:23,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89047212] [2024-10-11 17:20:23,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89047212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:23,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:23,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:20:23,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910786883] [2024-10-11 17:20:23,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:23,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:20:23,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:23,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:20:23,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:20:23,653 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 187 [2024-10-11 17:20:23,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 189 transitions, 447 flow. Second operand has 4 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 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-11 17:20:23,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:23,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 187 [2024-10-11 17:20:23,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:23,753 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][185], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 147#L1048-16true, 185#(= |#race~datas~0| 0), Black: 178#true, 110#L1058-11true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 198#true, Black: 183#true, 173#true, 202#true]) [2024-10-11 17:20:23,754 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is not cut-off event [2024-10-11 17:20:23,754 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2024-10-11 17:20:23,754 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2024-10-11 17:20:23,754 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2024-10-11 17:20:23,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][185], [111#L1058-14true, Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 147#L1048-16true, 185#(= |#race~datas~0| 0), Black: 178#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 198#true, Black: 183#true, 173#true, 202#true]) [2024-10-11 17:20:23,763 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is not cut-off event [2024-10-11 17:20:23,763 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is not cut-off event [2024-10-11 17:20:23,763 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2024-10-11 17:20:23,763 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is not cut-off event [2024-10-11 17:20:23,794 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][185], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 147#L1048-16true, 185#(= |#race~datas~0| 0), Black: 178#true, 164#L1058-25true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 198#true, Black: 183#true, 173#true, 202#true]) [2024-10-11 17:20:23,794 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2024-10-11 17:20:23,794 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-10-11 17:20:23,794 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-10-11 17:20:23,794 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-10-11 17:20:23,803 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][185], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 147#L1048-16true, 185#(= |#race~datas~0| 0), 29#L1058-28true, Black: 178#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 198#true, Black: 183#true, 173#true, 202#true]) [2024-10-11 17:20:23,803 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is not cut-off event [2024-10-11 17:20:23,803 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is not cut-off event [2024-10-11 17:20:23,803 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is not cut-off event [2024-10-11 17:20:23,803 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is not cut-off event [2024-10-11 17:20:23,818 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][168], [65#L1059-10true, Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 147#L1048-16true, 185#(= |#race~datas~0| 0), Black: 178#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 198#true, Black: 183#true, 173#true, 202#true]) [2024-10-11 17:20:23,819 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is not cut-off event [2024-10-11 17:20:23,819 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-10-11 17:20:23,819 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-10-11 17:20:23,819 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2024-10-11 17:20:23,844 INFO L124 PetriNetUnfolderBase]: 218/1009 cut-off events. [2024-10-11 17:20:23,845 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-10-11 17:20:23,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1408 conditions, 1009 events. 218/1009 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5767 event pairs, 23 based on Foata normal form. 1/890 useless extension candidates. Maximal degree in co-relation 1298. Up to 111 conditions per place. [2024-10-11 17:20:23,852 INFO L140 encePairwiseOnDemand]: 174/187 looper letters, 39 selfloop transitions, 13 changer transitions 0/216 dead transitions. [2024-10-11 17:20:23,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 216 transitions, 607 flow [2024-10-11 17:20:23,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:20:23,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 17:20:23,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 689 transitions. [2024-10-11 17:20:23,855 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9211229946524064 [2024-10-11 17:20:23,855 INFO L175 Difference]: Start difference. First operand has 176 places, 189 transitions, 447 flow. Second operand 4 states and 689 transitions. [2024-10-11 17:20:23,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 216 transitions, 607 flow [2024-10-11 17:20:23,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 216 transitions, 605 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:20:23,860 INFO L231 Difference]: Finished difference. Result has 181 places, 200 transitions, 545 flow [2024-10-11 17:20:23,860 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=545, PETRI_PLACES=181, PETRI_TRANSITIONS=200} [2024-10-11 17:20:23,861 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 9 predicate places. [2024-10-11 17:20:23,861 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 200 transitions, 545 flow [2024-10-11 17:20:23,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 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-11 17:20:23,862 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:23,862 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-11 17:20:23,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:20:23,863 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:20:23,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:23,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1630609388, now seen corresponding path program 1 times [2024-10-11 17:20:23,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:23,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952105469] [2024-10-11 17:20:23,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:23,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:24,024 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-11 17:20:24,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:24,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952105469] [2024-10-11 17:20:24,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952105469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:24,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:24,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:20:24,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120982018] [2024-10-11 17:20:24,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:24,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:20:24,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:24,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:20:24,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:20:24,090 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 187 [2024-10-11 17:20:24,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 200 transitions, 545 flow. Second operand has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 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-11 17:20:24,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:24,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 187 [2024-10-11 17:20:24,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:24,211 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][198], [Black: 204#(not (= ~threads_mask~0 0)), 65#L1059-10true, Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 147#L1048-16true, 185#(= |#race~datas~0| 0), Black: 178#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 183#true, 173#true, 202#true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0)))]) [2024-10-11 17:20:24,212 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is not cut-off event [2024-10-11 17:20:24,212 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-10-11 17:20:24,212 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2024-10-11 17:20:24,212 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-10-11 17:20:24,246 INFO L124 PetriNetUnfolderBase]: 234/1129 cut-off events. [2024-10-11 17:20:24,247 INFO L125 PetriNetUnfolderBase]: For 420/443 co-relation queries the response was YES. [2024-10-11 17:20:24,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1849 conditions, 1129 events. 234/1129 cut-off events. For 420/443 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 6929 event pairs, 19 based on Foata normal form. 5/1001 useless extension candidates. Maximal degree in co-relation 1661. Up to 202 conditions per place. [2024-10-11 17:20:24,256 INFO L140 encePairwiseOnDemand]: 180/187 looper letters, 37 selfloop transitions, 9 changer transitions 0/220 dead transitions. [2024-10-11 17:20:24,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 220 transitions, 711 flow [2024-10-11 17:20:24,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:20:24,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 17:20:24,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 693 transitions. [2024-10-11 17:20:24,258 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9264705882352942 [2024-10-11 17:20:24,258 INFO L175 Difference]: Start difference. First operand has 181 places, 200 transitions, 545 flow. Second operand 4 states and 693 transitions. [2024-10-11 17:20:24,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 220 transitions, 711 flow [2024-10-11 17:20:24,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 220 transitions, 711 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:24,264 INFO L231 Difference]: Finished difference. Result has 186 places, 206 transitions, 624 flow [2024-10-11 17:20:24,264 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=624, PETRI_PLACES=186, PETRI_TRANSITIONS=206} [2024-10-11 17:20:24,265 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 14 predicate places. [2024-10-11 17:20:24,265 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 206 transitions, 624 flow [2024-10-11 17:20:24,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 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-11 17:20:24,266 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:24,266 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-11 17:20:24,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:20:24,267 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:20:24,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:24,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1655830246, now seen corresponding path program 1 times [2024-10-11 17:20:24,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:24,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518357638] [2024-10-11 17:20:24,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:24,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:24,350 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-11 17:20:24,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:24,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518357638] [2024-10-11 17:20:24,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518357638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:24,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:24,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:20:24,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513424089] [2024-10-11 17:20:24,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:24,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:20:24,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:24,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:20:24,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:20:24,423 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 187 [2024-10-11 17:20:24,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 206 transitions, 624 flow. Second operand has 4 states, 4 states have (on average 161.5) internal successors, (646), 4 states have internal predecessors, (646), 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-11 17:20:24,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:24,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 187 [2024-10-11 17:20:24,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:24,543 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][188], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 110#L1058-11true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 173#true, 215#true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 147#L1048-16true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 178#true, Black: 183#true, 202#true]) [2024-10-11 17:20:24,543 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is not cut-off event [2024-10-11 17:20:24,544 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2024-10-11 17:20:24,544 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2024-10-11 17:20:24,544 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2024-10-11 17:20:24,585 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][198], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 164#L1058-25true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 215#true, 173#true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 147#L1048-16true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 178#true, Black: 183#true, 202#true]) [2024-10-11 17:20:24,586 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2024-10-11 17:20:24,586 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-10-11 17:20:24,586 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-10-11 17:20:24,586 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-10-11 17:20:24,595 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][198], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 29#L1058-28true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 173#true, 215#true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 147#L1048-16true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 178#true, Black: 183#true, 202#true]) [2024-10-11 17:20:24,595 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is not cut-off event [2024-10-11 17:20:24,595 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is not cut-off event [2024-10-11 17:20:24,595 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is not cut-off event [2024-10-11 17:20:24,595 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is not cut-off event [2024-10-11 17:20:24,616 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][190], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 215#true, 173#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 204#(not (= ~threads_mask~0 0)), 65#L1059-10true, 147#L1048-16true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 178#true, Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 183#true, 202#true]) [2024-10-11 17:20:24,616 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is not cut-off event [2024-10-11 17:20:24,616 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2024-10-11 17:20:24,617 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-10-11 17:20:24,617 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-10-11 17:20:24,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][174], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 173#true, 215#true, 52#L1058-37true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 147#L1048-16true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 178#true, Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 183#true, 202#true]) [2024-10-11 17:20:24,621 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2024-10-11 17:20:24,621 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-11 17:20:24,621 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-11 17:20:24,622 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-11 17:20:24,625 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][210], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 173#true, 215#true, 52#L1058-37true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 147#L1048-16true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 178#true, Black: 183#true, 202#true]) [2024-10-11 17:20:24,625 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2024-10-11 17:20:24,626 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-10-11 17:20:24,626 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-11 17:20:24,626 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-11 17:20:24,636 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][210], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 173#true, 215#true, 52#L1058-37true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 147#L1048-16true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 178#true, Black: 183#true, 202#true]) [2024-10-11 17:20:24,637 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2024-10-11 17:20:24,637 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-10-11 17:20:24,637 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-10-11 17:20:24,637 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-11 17:20:24,637 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-11 17:20:24,664 INFO L124 PetriNetUnfolderBase]: 287/1261 cut-off events. [2024-10-11 17:20:24,664 INFO L125 PetriNetUnfolderBase]: For 795/860 co-relation queries the response was YES. [2024-10-11 17:20:24,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2345 conditions, 1261 events. 287/1261 cut-off events. For 795/860 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 7856 event pairs, 26 based on Foata normal form. 28/1156 useless extension candidates. Maximal degree in co-relation 2104. Up to 200 conditions per place. [2024-10-11 17:20:24,676 INFO L140 encePairwiseOnDemand]: 176/187 looper letters, 41 selfloop transitions, 16 changer transitions 0/225 dead transitions. [2024-10-11 17:20:24,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 225 transitions, 790 flow [2024-10-11 17:20:24,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:20:24,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 17:20:24,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 687 transitions. [2024-10-11 17:20:24,679 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9184491978609626 [2024-10-11 17:20:24,679 INFO L175 Difference]: Start difference. First operand has 186 places, 206 transitions, 624 flow. Second operand 4 states and 687 transitions. [2024-10-11 17:20:24,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 225 transitions, 790 flow [2024-10-11 17:20:24,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 225 transitions, 790 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:24,686 INFO L231 Difference]: Finished difference. Result has 191 places, 210 transitions, 698 flow [2024-10-11 17:20:24,686 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=698, PETRI_PLACES=191, PETRI_TRANSITIONS=210} [2024-10-11 17:20:24,688 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 19 predicate places. [2024-10-11 17:20:24,688 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 210 transitions, 698 flow [2024-10-11 17:20:24,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 161.5) internal successors, (646), 4 states have internal predecessors, (646), 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-11 17:20:24,689 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:24,689 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-11 17:20:24,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:20:24,690 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:20:24,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:24,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1265509489, now seen corresponding path program 1 times [2024-10-11 17:20:24,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:24,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830960863] [2024-10-11 17:20:24,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:24,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:24,755 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-11 17:20:24,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:24,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830960863] [2024-10-11 17:20:24,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830960863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:24,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:24,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:20:24,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140358025] [2024-10-11 17:20:24,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:24,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:20:24,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:24,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:20:24,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:20:24,773 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 187 [2024-10-11 17:20:24,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 210 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 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-11 17:20:24,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:24,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 187 [2024-10-11 17:20:24,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:24,872 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][160], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 215#true, 173#true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 147#L1048-16true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 178#true, Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), 221#true, Black: 183#true, 93#L1059-16true, Black: 218#(and (<= (+ 2 |ULTIMATE.start_main_#t~bitwise15#1|) 0) (not (= ~threads_mask~0 0))), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2024-10-11 17:20:24,872 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-10-11 17:20:24,872 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-11 17:20:24,872 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-11 17:20:24,873 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-11 17:20:24,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][184], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 215#true, 173#true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 65#L1059-10true, Black: 204#(not (= ~threads_mask~0 0)), 147#L1048-16true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 178#true, Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), 221#true, Black: 183#true, Black: 218#(and (<= (+ 2 |ULTIMATE.start_main_#t~bitwise15#1|) 0) (not (= ~threads_mask~0 0))), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2024-10-11 17:20:24,874 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2024-10-11 17:20:24,874 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-10-11 17:20:24,874 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-11 17:20:24,874 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-11 17:20:24,882 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][160], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 215#true, 173#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 204#(not (= ~threads_mask~0 0)), 147#L1048-16true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 178#true, Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), 221#true, Black: 183#true, Black: 218#(and (<= (+ 2 |ULTIMATE.start_main_#t~bitwise15#1|) 0) (not (= ~threads_mask~0 0))), 93#L1059-16true, Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2024-10-11 17:20:24,883 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is not cut-off event [2024-10-11 17:20:24,883 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-10-11 17:20:24,883 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-10-11 17:20:24,883 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2024-10-11 17:20:24,883 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-10-11 17:20:24,887 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][160], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 215#true, 173#true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 147#L1048-16true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 178#true, Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), 221#true, Black: 183#true, Black: 218#(and (<= (+ 2 |ULTIMATE.start_main_#t~bitwise15#1|) 0) (not (= ~threads_mask~0 0))), 93#L1059-16true, Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2024-10-11 17:20:24,887 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2024-10-11 17:20:24,887 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-11 17:20:24,887 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-11 17:20:24,887 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-11 17:20:24,887 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-11 17:20:24,888 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-11 17:20:24,918 INFO L124 PetriNetUnfolderBase]: 207/1170 cut-off events. [2024-10-11 17:20:24,918 INFO L125 PetriNetUnfolderBase]: For 721/731 co-relation queries the response was YES. [2024-10-11 17:20:24,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2099 conditions, 1170 events. 207/1170 cut-off events. For 721/731 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 7511 event pairs, 15 based on Foata normal form. 15/1061 useless extension candidates. Maximal degree in co-relation 1897. Up to 80 conditions per place. [2024-10-11 17:20:24,931 INFO L140 encePairwiseOnDemand]: 183/187 looper letters, 17 selfloop transitions, 3 changer transitions 0/210 dead transitions. [2024-10-11 17:20:24,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 210 transitions, 738 flow [2024-10-11 17:20:24,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:20:24,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:20:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions. [2024-10-11 17:20:24,933 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9215686274509803 [2024-10-11 17:20:24,933 INFO L175 Difference]: Start difference. First operand has 191 places, 210 transitions, 698 flow. Second operand 3 states and 517 transitions. [2024-10-11 17:20:24,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 210 transitions, 738 flow [2024-10-11 17:20:24,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 210 transitions, 724 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:20:24,939 INFO L231 Difference]: Finished difference. Result has 191 places, 208 transitions, 686 flow [2024-10-11 17:20:24,939 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=191, PETRI_TRANSITIONS=208} [2024-10-11 17:20:24,940 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 19 predicate places. [2024-10-11 17:20:24,940 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 208 transitions, 686 flow [2024-10-11 17:20:24,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 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-11 17:20:24,941 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:24,941 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] [2024-10-11 17:20:24,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:20:24,941 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:20:24,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:24,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1102956399, now seen corresponding path program 1 times [2024-10-11 17:20:24,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:24,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638315712] [2024-10-11 17:20:24,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:24,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:25,047 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-11 17:20:25,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:25,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638315712] [2024-10-11 17:20:25,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638315712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:25,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:25,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:20:25,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758557337] [2024-10-11 17:20:25,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:25,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:20:25,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:25,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:20:25,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:20:25,128 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 187 [2024-10-11 17:20:25,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 208 transitions, 686 flow. Second operand has 4 states, 4 states have (on average 165.25) internal successors, (661), 4 states have internal predecessors, (661), 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-11 17:20:25,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:25,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 187 [2024-10-11 17:20:25,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:25,275 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][189], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 224#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 173#true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 65#L1059-10true, 147#L1048-16true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 178#true, 221#true, Black: 183#true, Black: 218#(and (<= (+ 2 |ULTIMATE.start_main_#t~bitwise15#1|) 0) (not (= ~threads_mask~0 0))), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2024-10-11 17:20:25,276 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2024-10-11 17:20:25,276 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-11 17:20:25,276 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-11 17:20:25,276 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-10-11 17:20:25,316 INFO L124 PetriNetUnfolderBase]: 223/1109 cut-off events. [2024-10-11 17:20:25,316 INFO L125 PetriNetUnfolderBase]: For 1128/1164 co-relation queries the response was YES. [2024-10-11 17:20:25,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2160 conditions, 1109 events. 223/1109 cut-off events. For 1128/1164 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6824 event pairs, 20 based on Foata normal form. 15/1009 useless extension candidates. Maximal degree in co-relation 1961. Up to 205 conditions per place. [2024-10-11 17:20:25,327 INFO L140 encePairwiseOnDemand]: 180/187 looper letters, 33 selfloop transitions, 9 changer transitions 0/218 dead transitions. [2024-10-11 17:20:25,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 218 transitions, 804 flow [2024-10-11 17:20:25,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:20:25,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 17:20:25,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 684 transitions. [2024-10-11 17:20:25,329 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9144385026737968 [2024-10-11 17:20:25,330 INFO L175 Difference]: Start difference. First operand has 191 places, 208 transitions, 686 flow. Second operand 4 states and 684 transitions. [2024-10-11 17:20:25,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 218 transitions, 804 flow [2024-10-11 17:20:25,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 218 transitions, 798 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:20:25,337 INFO L231 Difference]: Finished difference. Result has 194 places, 210 transitions, 727 flow [2024-10-11 17:20:25,338 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=727, PETRI_PLACES=194, PETRI_TRANSITIONS=210} [2024-10-11 17:20:25,338 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 22 predicate places. [2024-10-11 17:20:25,338 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 210 transitions, 727 flow [2024-10-11 17:20:25,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 165.25) internal successors, (661), 4 states have internal predecessors, (661), 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-11 17:20:25,339 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:25,339 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] [2024-10-11 17:20:25,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:20:25,340 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:20:25,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:25,340 INFO L85 PathProgramCache]: Analyzing trace with hash -415515770, now seen corresponding path program 1 times [2024-10-11 17:20:25,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:25,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215497163] [2024-10-11 17:20:25,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:25,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:25,450 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-11 17:20:25,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:25,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215497163] [2024-10-11 17:20:25,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215497163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:25,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:25,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:25,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696447194] [2024-10-11 17:20:25,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:25,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:20:25,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:25,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:20:25,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:20:25,516 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 187 [2024-10-11 17:20:25,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 210 transitions, 727 flow. Second operand has 5 states, 5 states have (on average 162.2) internal successors, (811), 5 states have internal predecessors, (811), 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-11 17:20:25,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:25,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 187 [2024-10-11 17:20:25,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:25,538 INFO L124 PetriNetUnfolderBase]: 1/62 cut-off events. [2024-10-11 17:20:25,538 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-10-11 17:20:25,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 62 events. 1/62 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 2/63 useless extension candidates. Maximal degree in co-relation 99. Up to 6 conditions per place. [2024-10-11 17:20:25,538 INFO L140 encePairwiseOnDemand]: 183/187 looper letters, 0 selfloop transitions, 0 changer transitions 53/53 dead transitions. [2024-10-11 17:20:25,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 53 transitions, 165 flow [2024-10-11 17:20:25,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:20:25,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 17:20:25,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 807 transitions. [2024-10-11 17:20:25,541 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8631016042780749 [2024-10-11 17:20:25,541 INFO L175 Difference]: Start difference. First operand has 194 places, 210 transitions, 727 flow. Second operand 5 states and 807 transitions. [2024-10-11 17:20:25,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 53 transitions, 165 flow [2024-10-11 17:20:25,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 53 transitions, 127 flow, removed 4 selfloop flow, removed 19 redundant places. [2024-10-11 17:20:25,542 INFO L231 Difference]: Finished difference. Result has 64 places, 0 transitions, 0 flow [2024-10-11 17:20:25,542 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=64, PETRI_TRANSITIONS=0} [2024-10-11 17:20:25,542 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, -108 predicate places. [2024-10-11 17:20:25,543 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 0 transitions, 0 flow [2024-10-11 17:20:25,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 162.2) internal successors, (811), 5 states have internal predecessors, (811), 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-11 17:20:25,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 16 remaining) [2024-10-11 17:20:25,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-10-11 17:20:25,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-10-11 17:20:25,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-10-11 17:20:25,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-10-11 17:20:25,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-10-11 17:20:25,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-10-11 17:20:25,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 16 remaining) [2024-10-11 17:20:25,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-10-11 17:20:25,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-10-11 17:20:25,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-10-11 17:20:25,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-10-11 17:20:25,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-10-11 17:20:25,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-10-11 17:20:25,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-10-11 17:20:25,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-10-11 17:20:25,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:20:25,550 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:25,556 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:20:25,556 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:20:25,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:20:25 BasicIcfg [2024-10-11 17:20:25,566 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:20:25,567 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:20:25,567 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:20:25,567 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:20:25,568 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:20:21" (3/4) ... [2024-10-11 17:20:25,571 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:20:25,575 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread [2024-10-11 17:20:25,582 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-11 17:20:25,583 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-11 17:20:25,583 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 17:20:25,682 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:20:25,683 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:20:25,683 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:20:25,684 INFO L158 Benchmark]: Toolchain (without parser) took 6078.70ms. Allocated memory was 157.3MB in the beginning and 264.2MB in the end (delta: 107.0MB). Free memory was 101.8MB in the beginning and 99.8MB in the end (delta: 2.0MB). Peak memory consumption was 110.8MB. Max. memory is 16.1GB. [2024-10-11 17:20:25,684 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 157.3MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:20:25,684 INFO L158 Benchmark]: CACSL2BoogieTranslator took 746.71ms. Allocated memory is still 157.3MB. Free memory was 101.2MB in the beginning and 69.7MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 17:20:25,685 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.04ms. Allocated memory is still 157.3MB. Free memory was 69.7MB in the beginning and 66.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:20:25,685 INFO L158 Benchmark]: Boogie Preprocessor took 39.88ms. Allocated memory is still 157.3MB. Free memory was 66.9MB in the beginning and 64.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:20:25,685 INFO L158 Benchmark]: RCFGBuilder took 727.97ms. Allocated memory is still 157.3MB. Free memory was 64.8MB in the beginning and 40.5MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 17:20:25,685 INFO L158 Benchmark]: TraceAbstraction took 4359.22ms. Allocated memory was 157.3MB in the beginning and 264.2MB in the end (delta: 107.0MB). Free memory was 40.3MB in the beginning and 105.7MB in the end (delta: -65.4MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. [2024-10-11 17:20:25,686 INFO L158 Benchmark]: Witness Printer took 116.39ms. Allocated memory is still 264.2MB. Free memory was 105.7MB in the beginning and 99.8MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 17:20:25,687 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 157.3MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 746.71ms. Allocated memory is still 157.3MB. Free memory was 101.2MB in the beginning and 69.7MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.04ms. Allocated memory is still 157.3MB. Free memory was 69.7MB in the beginning and 66.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.88ms. Allocated memory is still 157.3MB. Free memory was 66.9MB in the beginning and 64.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 727.97ms. Allocated memory is still 157.3MB. Free memory was 64.8MB in the beginning and 40.5MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4359.22ms. Allocated memory was 157.3MB in the beginning and 264.2MB in the end (delta: 107.0MB). Free memory was 40.3MB in the beginning and 105.7MB in the end (delta: -65.4MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. * Witness Printer took 116.39ms. Allocated memory is still 264.2MB. Free memory was 105.7MB in the beginning and 99.8MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1056]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1058]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1066]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1063]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1059]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1059]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1060]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1047]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1047]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1048]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1048]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 209 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 690 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 389 mSDsluCounter, 80 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 904 IncrementalHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 30 mSDtfsCounter, 904 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=727occurred in iteration=10, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 595 NumberOfCodeBlocks, 595 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 584 ConstructedInterpolants, 0 QuantifiedInterpolants, 1315 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:20:25,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE