./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-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf4857c62d483a773a35fae36979eac9c903a6d30c1e665676e5036b445ef343 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:03:23,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:03:23,372 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 10:03:23,381 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:03:23,381 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:03:23,416 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:03:23,417 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:03:23,418 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:03:23,419 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:03:23,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:03:23,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:03:23,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:03:23,423 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:03:23,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:03:23,423 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:03:23,423 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:03:23,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:03:23,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:03:23,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:03:23,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:03:23,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:03:23,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:03:23,429 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 10:03:23,429 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:03:23,430 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:03:23,430 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:03:23,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:03:23,431 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:03:23,431 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:03:23,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:03:23,432 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:03:23,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:03:23,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:03:23,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:03:23,433 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 10:03:23,433 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:03:23,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:03:23,434 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:03:23,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:03:23,435 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:03:23,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:03:23,435 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf4857c62d483a773a35fae36979eac9c903a6d30c1e665676e5036b445ef343 [2024-10-13 10:03:23,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:03:23,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:03:23,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:03:23,744 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:03:23,745 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:03:23,746 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-2.i [2024-10-13 10:03:25,214 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:03:25,504 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:03:25,506 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race-2.i [2024-10-13 10:03:25,531 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7ea97b9e/f607e9cc5ff94338a7564c91e2d66e60/FLAGa57989f30 [2024-10-13 10:03:25,546 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7ea97b9e/f607e9cc5ff94338a7564c91e2d66e60 [2024-10-13 10:03:25,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:03:25,549 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:03:25,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:03:25,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:03:25,557 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:03:25,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:03:25" (1/1) ... [2024-10-13 10:03:25,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@738753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:25, skipping insertion in model container [2024-10-13 10:03:25,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:03:25" (1/1) ... [2024-10-13 10:03:25,609 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:03:26,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:03:26,177 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:03:26,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:03:26,324 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:03:26,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:26 WrapperNode [2024-10-13 10:03:26,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:03:26,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:03:26,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:03:26,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:03:26,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:26" (1/1) ... [2024-10-13 10:03:26,361 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:26" (1/1) ... [2024-10-13 10:03:26,404 INFO L138 Inliner]: procedures = 277, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 145 [2024-10-13 10:03:26,405 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:03:26,406 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:03:26,406 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:03:26,406 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:03:26,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:26" (1/1) ... [2024-10-13 10:03:26,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:26" (1/1) ... [2024-10-13 10:03:26,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:26" (1/1) ... [2024-10-13 10:03:26,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:26" (1/1) ... [2024-10-13 10:03:26,453 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:26" (1/1) ... [2024-10-13 10:03:26,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:26" (1/1) ... [2024-10-13 10:03:26,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:26" (1/1) ... [2024-10-13 10:03:26,464 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:26" (1/1) ... [2024-10-13 10:03:26,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:03:26,473 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:03:26,473 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:03:26,473 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:03:26,474 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:26" (1/1) ... [2024-10-13 10:03:26,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:03:26,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:03:26,515 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:03:26,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:03:26,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:03:26,574 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-13 10:03:26,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-13 10:03:26,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-13 10:03:26,575 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-13 10:03:26,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:03:26,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:03:26,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 10:03:26,577 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-13 10:03:26,577 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-13 10:03:26,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:03:26,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:03:26,579 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 10:03:26,734 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:03:26,737 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:03:27,147 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 10:03:27,148 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:03:27,185 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:03:27,185 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 10:03:27,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:03:27 BoogieIcfgContainer [2024-10-13 10:03:27,186 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:03:27,188 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:03:27,189 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:03:27,194 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:03:27,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:03:25" (1/3) ... [2024-10-13 10:03:27,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b661a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:03:27, skipping insertion in model container [2024-10-13 10:03:27,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:03:26" (2/3) ... [2024-10-13 10:03:27,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b661a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:03:27, skipping insertion in model container [2024-10-13 10:03:27,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:03:27" (3/3) ... [2024-10-13 10:03:27,197 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race-2.i [2024-10-13 10:03:27,220 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:03:27,220 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-10-13 10:03:27,221 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 10:03:27,309 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-13 10:03:27,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 202 transitions, 411 flow [2024-10-13 10:03:27,475 INFO L124 PetriNetUnfolderBase]: 30/300 cut-off events. [2024-10-13 10:03:27,475 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 10:03:27,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 300 events. 30/300 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 595 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 150. Up to 6 conditions per place. [2024-10-13 10:03:27,487 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 202 transitions, 411 flow [2024-10-13 10:03:27,497 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 202 transitions, 411 flow [2024-10-13 10:03:27,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:03:27,514 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;@17382a6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:03:27,515 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-13 10:03:27,524 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 10:03:27,525 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2024-10-13 10:03:27,525 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 10:03:27,526 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:03:27,527 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] [2024-10-13 10:03:27,527 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-13 10:03:27,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:03:27,535 INFO L85 PathProgramCache]: Analyzing trace with hash 722694404, now seen corresponding path program 1 times [2024-10-13 10:03:27,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:03:27,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268865540] [2024-10-13 10:03:27,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:03:27,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:03:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:03:27,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-13 10:03:27,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:03:27,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268865540] [2024-10-13 10:03:27,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268865540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:03:27,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:03:27,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:03:27,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170568893] [2024-10-13 10:03:27,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:03:27,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:03:27,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:03:27,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:03:27,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:03:27,951 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 202 [2024-10-13 10:03:27,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 202 transitions, 411 flow. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 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-13 10:03:27,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:03:27,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 202 [2024-10-13 10:03:27,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:03:28,159 INFO L124 PetriNetUnfolderBase]: 125/772 cut-off events. [2024-10-13 10:03:28,160 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-13 10:03:28,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 772 events. 125/772 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4009 event pairs, 18 based on Foata normal form. 10/641 useless extension candidates. Maximal degree in co-relation 749. Up to 138 conditions per place. [2024-10-13 10:03:28,174 INFO L140 encePairwiseOnDemand]: 195/202 looper letters, 20 selfloop transitions, 2 changer transitions 2/197 dead transitions. [2024-10-13 10:03:28,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 197 transitions, 445 flow [2024-10-13 10:03:28,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:03:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:03:28,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 552 transitions. [2024-10-13 10:03:28,193 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9108910891089109 [2024-10-13 10:03:28,197 INFO L175 Difference]: Start difference. First operand has 187 places, 202 transitions, 411 flow. Second operand 3 states and 552 transitions. [2024-10-13 10:03:28,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 197 transitions, 445 flow [2024-10-13 10:03:28,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 197 transitions, 445 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:03:28,250 INFO L231 Difference]: Finished difference. Result has 188 places, 195 transitions, 401 flow [2024-10-13 10:03:28,253 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=401, PETRI_PLACES=188, PETRI_TRANSITIONS=195} [2024-10-13 10:03:28,258 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 1 predicate places. [2024-10-13 10:03:28,258 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 195 transitions, 401 flow [2024-10-13 10:03:28,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 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-13 10:03:28,259 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:03:28,260 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] [2024-10-13 10:03:28,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:03:28,261 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-13 10:03:28,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:03:28,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1125955006, now seen corresponding path program 1 times [2024-10-13 10:03:28,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:03:28,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699643626] [2024-10-13 10:03:28,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:03:28,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:03:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:03:28,463 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-13 10:03:28,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:03:28,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699643626] [2024-10-13 10:03:28,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699643626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:03:28,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:03:28,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:03:28,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105758858] [2024-10-13 10:03:28,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:03:28,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:03:28,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:03:28,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:03:28,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:03:28,490 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 202 [2024-10-13 10:03:28,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 195 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 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-13 10:03:28,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:03:28,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 202 [2024-10-13 10:03:28,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:03:28,709 INFO L124 PetriNetUnfolderBase]: 208/1170 cut-off events. [2024-10-13 10:03:28,710 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-13 10:03:28,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1445 conditions, 1170 events. 208/1170 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 7140 event pairs, 22 based on Foata normal form. 0/976 useless extension candidates. Maximal degree in co-relation 1400. Up to 158 conditions per place. [2024-10-13 10:03:28,721 INFO L140 encePairwiseOnDemand]: 191/202 looper letters, 37 selfloop transitions, 8 changer transitions 0/215 dead transitions. [2024-10-13 10:03:28,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 215 transitions, 531 flow [2024-10-13 10:03:28,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:03:28,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:03:28,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2024-10-13 10:03:28,725 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9356435643564357 [2024-10-13 10:03:28,725 INFO L175 Difference]: Start difference. First operand has 188 places, 195 transitions, 401 flow. Second operand 3 states and 567 transitions. [2024-10-13 10:03:28,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 215 transitions, 531 flow [2024-10-13 10:03:28,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 215 transitions, 527 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:03:28,735 INFO L231 Difference]: Finished difference. Result has 188 places, 203 transitions, 467 flow [2024-10-13 10:03:28,736 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=467, PETRI_PLACES=188, PETRI_TRANSITIONS=203} [2024-10-13 10:03:28,737 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 1 predicate places. [2024-10-13 10:03:28,737 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 203 transitions, 467 flow [2024-10-13 10:03:28,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 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-13 10:03:28,738 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:03:28,738 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] [2024-10-13 10:03:28,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:03:28,738 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-13 10:03:28,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:03:28,739 INFO L85 PathProgramCache]: Analyzing trace with hash 2084740169, now seen corresponding path program 1 times [2024-10-13 10:03:28,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:03:28,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841734677] [2024-10-13 10:03:28,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:03:28,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:03:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:03:28,837 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-13 10:03:28,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:03:28,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841734677] [2024-10-13 10:03:28,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841734677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:03:28,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:03:28,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:03:28,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107964611] [2024-10-13 10:03:28,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:03:28,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:03:28,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:03:28,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:03:28,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:03:28,854 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 202 [2024-10-13 10:03:28,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 203 transitions, 467 flow. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 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-13 10:03:28,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:03:28,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 202 [2024-10-13 10:03:28,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:03:29,012 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([318] L1063-17-->L1063-18: Formula: (= |v_#race~threads_mask~0_7| |v_ULTIMATE.start_main_#t~nondet22#1_3|) InVars {ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_3|} OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_7|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_3|} AuxVars[] AssignedVars[#race~threads_mask~0][203], [Black: 195#(= |#race~threads_mask~0| 0), 193#true, 70#L1049-18true, 198#true, 142#L1063-18true, 188#true]) [2024-10-13 10:03:29,012 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2024-10-13 10:03:29,012 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-10-13 10:03:29,013 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-10-13 10:03:29,013 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-10-13 10:03:29,024 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([325] L1063-->L1063-1: Formula: (= |v_#race~threads_mask~0_4| 0) InVars {} OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_4|} AuxVars[] AssignedVars[#race~threads_mask~0][184], [Black: 193#true, 195#(= |#race~threads_mask~0| 0), 70#L1049-18true, 198#true, 103#L1063-1true, 188#true]) [2024-10-13 10:03:29,025 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2024-10-13 10:03:29,025 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2024-10-13 10:03:29,025 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2024-10-13 10:03:29,025 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2024-10-13 10:03:29,025 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([325] L1063-->L1063-1: Formula: (= |v_#race~threads_mask~0_4| 0) InVars {} OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_4|} AuxVars[] AssignedVars[#race~threads_mask~0][184], [Black: 193#true, 195#(= |#race~threads_mask~0| 0), 70#L1049-18true, 103#L1063-1true, 198#true, 188#true]) [2024-10-13 10:03:29,026 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2024-10-13 10:03:29,026 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2024-10-13 10:03:29,026 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2024-10-13 10:03:29,026 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-10-13 10:03:29,026 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2024-10-13 10:03:29,035 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([318] L1063-17-->L1063-18: Formula: (= |v_#race~threads_mask~0_7| |v_ULTIMATE.start_main_#t~nondet22#1_3|) InVars {ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_3|} OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_7|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_3|} AuxVars[] AssignedVars[#race~threads_mask~0][203], [193#true, Black: 195#(= |#race~threads_mask~0| 0), 70#L1049-18true, 198#true, 188#true, 142#L1063-18true]) [2024-10-13 10:03:29,035 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2024-10-13 10:03:29,035 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-10-13 10:03:29,036 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-10-13 10:03:29,036 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-10-13 10:03:29,036 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-10-13 10:03:29,089 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([498] L1064-->L1064-3: Formula: (and (= 0 |v_ULTIMATE.start_main_#t~ret23#1_7|) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|) |v_~#threads_mask_mutex~0.offset_17| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, ULTIMATE.start_main_#t~ret23#1=|v_ULTIMATE.start_main_#t~ret23#1_7|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~ret23#1][210], [200#(= |#race~datas~0| 0), 193#true, Black: 195#(= |#race~threads_mask~0| 0), 73#L1051-2true, 188#true, 158#L1064-3true]) [2024-10-13 10:03:29,089 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2024-10-13 10:03:29,089 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-13 10:03:29,089 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-13 10:03:29,090 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-10-13 10:03:29,091 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([320] L1063-5-->L1063-7: Formula: (< 1 |v_ULTIMATE.start_main_#t~bitwise20#1_12|) InVars {} OutVars{ULTIMATE.start_main_#t~bitwise20#1=|v_ULTIMATE.start_main_#t~bitwise20#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~bitwise20#1][204], [200#(= |#race~datas~0| 0), Black: 193#true, 195#(= |#race~threads_mask~0| 0), 73#L1051-2true, 118#L1063-7true, 188#true]) [2024-10-13 10:03:29,091 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2024-10-13 10:03:29,091 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-10-13 10:03:29,091 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-13 10:03:29,091 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-10-13 10:03:29,097 INFO L124 PetriNetUnfolderBase]: 224/1310 cut-off events. [2024-10-13 10:03:29,097 INFO L125 PetriNetUnfolderBase]: For 42/44 co-relation queries the response was YES. [2024-10-13 10:03:29,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1705 conditions, 1310 events. 224/1310 cut-off events. For 42/44 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 8769 event pairs, 26 based on Foata normal form. 0/1123 useless extension candidates. Maximal degree in co-relation 1522. Up to 123 conditions per place. [2024-10-13 10:03:29,107 INFO L140 encePairwiseOnDemand]: 198/202 looper letters, 31 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2024-10-13 10:03:29,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 215 transitions, 557 flow [2024-10-13 10:03:29,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:03:29,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:03:29,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 566 transitions. [2024-10-13 10:03:29,110 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.933993399339934 [2024-10-13 10:03:29,110 INFO L175 Difference]: Start difference. First operand has 188 places, 203 transitions, 467 flow. Second operand 3 states and 566 transitions. [2024-10-13 10:03:29,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 215 transitions, 557 flow [2024-10-13 10:03:29,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 215 transitions, 541 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:03:29,117 INFO L231 Difference]: Finished difference. Result has 187 places, 203 transitions, 461 flow [2024-10-13 10:03:29,118 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=187, PETRI_TRANSITIONS=203} [2024-10-13 10:03:29,118 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 0 predicate places. [2024-10-13 10:03:29,119 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 203 transitions, 461 flow [2024-10-13 10:03:29,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 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-13 10:03:29,119 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:03:29,119 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] [2024-10-13 10:03:29,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:03:29,120 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-13 10:03:29,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:03:29,121 INFO L85 PathProgramCache]: Analyzing trace with hash -818577634, now seen corresponding path program 1 times [2024-10-13 10:03:29,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:03:29,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799438965] [2024-10-13 10:03:29,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:03:29,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:03:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:03:29,300 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-13 10:03:29,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:03:29,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799438965] [2024-10-13 10:03:29,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799438965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:03:29,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:03:29,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:03:29,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128254820] [2024-10-13 10:03:29,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:03:29,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:03:29,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:03:29,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:03:29,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:03:29,397 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 202 [2024-10-13 10:03:29,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 203 transitions, 461 flow. Second operand has 5 states, 5 states have (on average 174.4) internal successors, (872), 5 states have internal predecessors, (872), 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-13 10:03:29,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:03:29,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 202 [2024-10-13 10:03:29,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:03:29,578 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([325] L1063-->L1063-1: Formula: (= |v_#race~threads_mask~0_4| 0) InVars {} OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_4|} AuxVars[] AssignedVars[#race~threads_mask~0][193], [Black: 193#true, 70#L1049-18true, 103#L1063-1true, 198#true, 202#true, 188#true]) [2024-10-13 10:03:29,578 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2024-10-13 10:03:29,578 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2024-10-13 10:03:29,579 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-10-13 10:03:29,579 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2024-10-13 10:03:29,600 INFO L124 PetriNetUnfolderBase]: 184/1130 cut-off events. [2024-10-13 10:03:29,601 INFO L125 PetriNetUnfolderBase]: For 11/18 co-relation queries the response was YES. [2024-10-13 10:03:29,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1440 conditions, 1130 events. 184/1130 cut-off events. For 11/18 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 7102 event pairs, 28 based on Foata normal form. 1/967 useless extension candidates. Maximal degree in co-relation 1249. Up to 176 conditions per place. [2024-10-13 10:03:29,608 INFO L140 encePairwiseOnDemand]: 194/202 looper letters, 35 selfloop transitions, 2 changer transitions 5/220 dead transitions. [2024-10-13 10:03:29,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 220 transitions, 579 flow [2024-10-13 10:03:29,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:03:29,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:03:29,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1081 transitions. [2024-10-13 10:03:29,611 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.891914191419142 [2024-10-13 10:03:29,611 INFO L175 Difference]: Start difference. First operand has 187 places, 203 transitions, 461 flow. Second operand 6 states and 1081 transitions. [2024-10-13 10:03:29,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 220 transitions, 579 flow [2024-10-13 10:03:29,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 220 transitions, 579 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:03:29,618 INFO L231 Difference]: Finished difference. Result has 196 places, 203 transitions, 479 flow [2024-10-13 10:03:29,618 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=479, PETRI_PLACES=196, PETRI_TRANSITIONS=203} [2024-10-13 10:03:29,620 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 9 predicate places. [2024-10-13 10:03:29,620 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 203 transitions, 479 flow [2024-10-13 10:03:29,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 174.4) internal successors, (872), 5 states have internal predecessors, (872), 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-13 10:03:29,621 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:03:29,621 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] [2024-10-13 10:03:29,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:03:29,622 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-13 10:03:29,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:03:29,623 INFO L85 PathProgramCache]: Analyzing trace with hash 2060651451, now seen corresponding path program 1 times [2024-10-13 10:03:29,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:03:29,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122456445] [2024-10-13 10:03:29,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:03:29,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:03:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:03:29,735 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-13 10:03:29,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:03:29,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122456445] [2024-10-13 10:03:29,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122456445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:03:29,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:03:29,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:03:29,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261025326] [2024-10-13 10:03:29,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:03:29,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:03:29,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:03:29,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:03:29,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:03:29,782 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 202 [2024-10-13 10:03:29,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 203 transitions, 479 flow. Second operand has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 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-13 10:03:29,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:03:29,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 202 [2024-10-13 10:03:29,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:03:29,949 INFO L124 PetriNetUnfolderBase]: 167/1076 cut-off events. [2024-10-13 10:03:29,950 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-10-13 10:03:29,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1389 conditions, 1076 events. 167/1076 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6449 event pairs, 37 based on Foata normal form. 1/925 useless extension candidates. Maximal degree in co-relation 1309. Up to 165 conditions per place. [2024-10-13 10:03:29,959 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 24 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2024-10-13 10:03:29,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 211 transitions, 547 flow [2024-10-13 10:03:29,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:03:29,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:03:29,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2024-10-13 10:03:29,962 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9356435643564357 [2024-10-13 10:03:29,962 INFO L175 Difference]: Start difference. First operand has 196 places, 203 transitions, 479 flow. Second operand 3 states and 567 transitions. [2024-10-13 10:03:29,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 211 transitions, 547 flow [2024-10-13 10:03:29,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 211 transitions, 533 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-13 10:03:29,969 INFO L231 Difference]: Finished difference. Result has 191 places, 204 transitions, 477 flow [2024-10-13 10:03:29,970 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=477, PETRI_PLACES=191, PETRI_TRANSITIONS=204} [2024-10-13 10:03:29,971 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 4 predicate places. [2024-10-13 10:03:29,972 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 204 transitions, 477 flow [2024-10-13 10:03:29,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 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-13 10:03:29,973 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:03:29,973 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:03:29,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:03:29,973 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-13 10:03:29,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:03:29,974 INFO L85 PathProgramCache]: Analyzing trace with hash 2087426238, now seen corresponding path program 1 times [2024-10-13 10:03:29,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:03:29,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123085010] [2024-10-13 10:03:29,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:03:29,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:03:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:03:30,073 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-13 10:03:30,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:03:30,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123085010] [2024-10-13 10:03:30,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123085010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:03:30,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:03:30,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:03:30,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862789845] [2024-10-13 10:03:30,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:03:30,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:03:30,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:03:30,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:03:30,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:03:30,135 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 202 [2024-10-13 10:03:30,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 204 transitions, 477 flow. Second operand has 4 states, 4 states have (on average 172.25) internal successors, (689), 4 states have internal predecessors, (689), 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-13 10:03:30,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:03:30,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 202 [2024-10-13 10:03:30,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:03:30,459 INFO L124 PetriNetUnfolderBase]: 399/1953 cut-off events. [2024-10-13 10:03:30,460 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-10-13 10:03:30,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2694 conditions, 1953 events. 399/1953 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 14625 event pairs, 52 based on Foata normal form. 1/1738 useless extension candidates. Maximal degree in co-relation 2544. Up to 239 conditions per place. [2024-10-13 10:03:30,474 INFO L140 encePairwiseOnDemand]: 190/202 looper letters, 52 selfloop transitions, 12 changer transitions 0/239 dead transitions. [2024-10-13 10:03:30,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 239 transitions, 677 flow [2024-10-13 10:03:30,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:03:30,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 10:03:30,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 745 transitions. [2024-10-13 10:03:30,477 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9220297029702971 [2024-10-13 10:03:30,477 INFO L175 Difference]: Start difference. First operand has 191 places, 204 transitions, 477 flow. Second operand 4 states and 745 transitions. [2024-10-13 10:03:30,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 239 transitions, 677 flow [2024-10-13 10:03:30,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 239 transitions, 675 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:03:30,482 INFO L231 Difference]: Finished difference. Result has 196 places, 214 transitions, 567 flow [2024-10-13 10:03:30,483 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=567, PETRI_PLACES=196, PETRI_TRANSITIONS=214} [2024-10-13 10:03:30,484 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 9 predicate places. [2024-10-13 10:03:30,484 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 214 transitions, 567 flow [2024-10-13 10:03:30,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 172.25) internal successors, (689), 4 states have internal predecessors, (689), 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-13 10:03:30,485 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:03:30,485 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:03:30,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:03:30,485 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-13 10:03:30,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:03:30,486 INFO L85 PathProgramCache]: Analyzing trace with hash 510978154, now seen corresponding path program 1 times [2024-10-13 10:03:30,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:03:30,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308232295] [2024-10-13 10:03:30,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:03:30,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:03:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:03:30,596 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-13 10:03:30,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:03:30,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308232295] [2024-10-13 10:03:30,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308232295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:03:30,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:03:30,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:03:30,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754892817] [2024-10-13 10:03:30,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:03:30,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:03:30,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:03:30,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:03:30,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:03:30,662 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 202 [2024-10-13 10:03:30,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 214 transitions, 567 flow. Second operand has 4 states, 4 states have (on average 172.5) internal successors, (690), 4 states have internal predecessors, (690), 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-13 10:03:30,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:03:30,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 202 [2024-10-13 10:03:30,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:03:30,943 INFO L124 PetriNetUnfolderBase]: 399/1895 cut-off events. [2024-10-13 10:03:30,944 INFO L125 PetriNetUnfolderBase]: For 444/522 co-relation queries the response was YES. [2024-10-13 10:03:30,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2994 conditions, 1895 events. 399/1895 cut-off events. For 444/522 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 14004 event pairs, 52 based on Foata normal form. 21/1709 useless extension candidates. Maximal degree in co-relation 2775. Up to 243 conditions per place. [2024-10-13 10:03:30,959 INFO L140 encePairwiseOnDemand]: 191/202 looper letters, 52 selfloop transitions, 13 changer transitions 0/240 dead transitions. [2024-10-13 10:03:30,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 240 transitions, 763 flow [2024-10-13 10:03:30,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:03:30,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 10:03:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 743 transitions. [2024-10-13 10:03:30,961 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9195544554455446 [2024-10-13 10:03:30,962 INFO L175 Difference]: Start difference. First operand has 196 places, 214 transitions, 567 flow. Second operand 4 states and 743 transitions. [2024-10-13 10:03:30,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 240 transitions, 763 flow [2024-10-13 10:03:30,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 240 transitions, 763 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:03:30,968 INFO L231 Difference]: Finished difference. Result has 201 places, 217 transitions, 626 flow [2024-10-13 10:03:30,968 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=626, PETRI_PLACES=201, PETRI_TRANSITIONS=217} [2024-10-13 10:03:30,969 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 14 predicate places. [2024-10-13 10:03:30,969 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 217 transitions, 626 flow [2024-10-13 10:03:30,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 172.5) internal successors, (690), 4 states have internal predecessors, (690), 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-13 10:03:30,970 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:03:30,970 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:03:30,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:03:30,971 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-13 10:03:30,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:03:30,971 INFO L85 PathProgramCache]: Analyzing trace with hash 448452604, now seen corresponding path program 1 times [2024-10-13 10:03:30,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:03:30,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996726745] [2024-10-13 10:03:30,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:03:30,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:03:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:03:31,066 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-13 10:03:31,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:03:31,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996726745] [2024-10-13 10:03:31,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996726745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:03:31,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:03:31,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:03:31,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129172400] [2024-10-13 10:03:31,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:03:31,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:03:31,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:03:31,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:03:31,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:03:31,128 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 202 [2024-10-13 10:03:31,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 217 transitions, 626 flow. Second operand has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 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-13 10:03:31,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:03:31,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 202 [2024-10-13 10:03:31,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:03:31,297 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L1049-15-->L1049-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise5_3| v_~threads_mask~0_25) InVars {threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_3|} OutVars{threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_3|, ~threads_mask~0=v_~threads_mask~0_25} AuxVars[] AssignedVars[~threads_mask~0][200], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), 224#true, 36#L1049-16true, 217#true, 140#L1062-25true, Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 198#true, 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-13 10:03:31,297 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2024-10-13 10:03:31,297 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2024-10-13 10:03:31,297 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-10-13 10:03:31,297 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2024-10-13 10:03:31,298 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L1049-15-->L1049-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise5_3| v_~threads_mask~0_25) InVars {threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_3|} OutVars{threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_3|, ~threads_mask~0=v_~threads_mask~0_25} AuxVars[] AssignedVars[~threads_mask~0][201], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), 224#true, 36#L1049-16true, 217#true, 140#L1062-25true, Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 198#true, 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-13 10:03:31,299 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2024-10-13 10:03:31,299 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2024-10-13 10:03:31,299 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2024-10-13 10:03:31,299 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-10-13 10:03:31,325 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L1049-15-->L1049-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise5_3| v_~threads_mask~0_25) InVars {threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_3|} OutVars{threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_3|, ~threads_mask~0=v_~threads_mask~0_25} AuxVars[] AssignedVars[~threads_mask~0][201], [8#L1062-28true, Black: 193#true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), 224#true, 36#L1049-16true, 217#true, Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 198#true, 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-13 10:03:31,325 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2024-10-13 10:03:31,325 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-10-13 10:03:31,325 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-10-13 10:03:31,325 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-10-13 10:03:31,328 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L1049-15-->L1049-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise5_3| v_~threads_mask~0_25) InVars {threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_3|} OutVars{threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_3|, ~threads_mask~0=v_~threads_mask~0_25} AuxVars[] AssignedVars[~threads_mask~0][200], [8#L1062-28true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), 224#true, 36#L1049-16true, 217#true, Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 198#true, 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-13 10:03:31,328 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is not cut-off event [2024-10-13 10:03:31,328 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-10-13 10:03:31,328 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-10-13 10:03:31,328 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2024-10-13 10:03:31,364 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L1049-15-->L1049-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise5_3| v_~threads_mask~0_25) InVars {threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_3|} OutVars{threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_3|, ~threads_mask~0=v_~threads_mask~0_25} AuxVars[] AssignedVars[~threads_mask~0][144], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), 224#true, 36#L1049-16true, 217#true, 34#L1062-37true, Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 198#true, 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-13 10:03:31,365 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2024-10-13 10:03:31,365 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-10-13 10:03:31,365 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-10-13 10:03:31,365 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-10-13 10:03:31,370 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L1049-15-->L1049-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise5_3| v_~threads_mask~0_25) InVars {threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_3|} OutVars{threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_3|, ~threads_mask~0=v_~threads_mask~0_25} AuxVars[] AssignedVars[~threads_mask~0][220], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), 224#true, 36#L1049-16true, 217#true, 34#L1062-37true, Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 198#true, 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-13 10:03:31,370 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-10-13 10:03:31,370 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-10-13 10:03:31,370 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-13 10:03:31,370 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-10-13 10:03:31,388 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([526] L1049-15-->L1049-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise5_3| v_~threads_mask~0_25) InVars {threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_3|} OutVars{threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_3|, ~threads_mask~0=v_~threads_mask~0_25} AuxVars[] AssignedVars[~threads_mask~0][220], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), 224#true, 36#L1049-16true, 217#true, 34#L1062-37true, Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 198#true, 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-13 10:03:31,388 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-10-13 10:03:31,389 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-10-13 10:03:31,389 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-13 10:03:31,389 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-10-13 10:03:31,389 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-13 10:03:31,461 INFO L124 PetriNetUnfolderBase]: 495/2190 cut-off events. [2024-10-13 10:03:31,462 INFO L125 PetriNetUnfolderBase]: For 1074/1165 co-relation queries the response was YES. [2024-10-13 10:03:31,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3864 conditions, 2190 events. 495/2190 cut-off events. For 1074/1165 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 16993 event pairs, 59 based on Foata normal form. 32/1990 useless extension candidates. Maximal degree in co-relation 3601. Up to 350 conditions per place. [2024-10-13 10:03:31,480 INFO L140 encePairwiseOnDemand]: 191/202 looper letters, 49 selfloop transitions, 16 changer transitions 0/243 dead transitions. [2024-10-13 10:03:31,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 243 transitions, 833 flow [2024-10-13 10:03:31,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:03:31,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 10:03:31,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 741 transitions. [2024-10-13 10:03:31,483 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9170792079207921 [2024-10-13 10:03:31,483 INFO L175 Difference]: Start difference. First operand has 201 places, 217 transitions, 626 flow. Second operand 4 states and 741 transitions. [2024-10-13 10:03:31,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 243 transitions, 833 flow [2024-10-13 10:03:31,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 243 transitions, 817 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-13 10:03:31,489 INFO L231 Difference]: Finished difference. Result has 205 places, 222 transitions, 697 flow [2024-10-13 10:03:31,490 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=697, PETRI_PLACES=205, PETRI_TRANSITIONS=222} [2024-10-13 10:03:31,491 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 18 predicate places. [2024-10-13 10:03:31,491 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 222 transitions, 697 flow [2024-10-13 10:03:31,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 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-13 10:03:31,492 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:03:31,492 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:03:31,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:03:31,492 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-13 10:03:31,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:03:31,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1686664894, now seen corresponding path program 1 times [2024-10-13 10:03:31,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:03:31,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230840780] [2024-10-13 10:03:31,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:03:31,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:03:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:03:31,543 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-13 10:03:31,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:03:31,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230840780] [2024-10-13 10:03:31,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230840780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:03:31,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:03:31,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:03:31,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806375005] [2024-10-13 10:03:31,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:03:31,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:03:31,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:03:31,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:03:31,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:03:31,558 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 202 [2024-10-13 10:03:31,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 222 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 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-13 10:03:31,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:03:31,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 202 [2024-10-13 10:03:31,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:03:31,634 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L1049-15-->L1049-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise5_3| v_~threads_mask~0_25) InVars {threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_3|} OutVars{threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_3|, ~threads_mask~0=v_~threads_mask~0_25} AuxVars[] AssignedVars[~threads_mask~0][177], [Black: 193#true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), Black: 233#(and (not (= ~threads_mask~0 0)) (<= (+ 2 |ULTIMATE.start_main_#t~bitwise18#1|) 0)), Black: 232#(not (= ~threads_mask~0 0)), 36#L1049-16true, 217#true, Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 138#L1062-14true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 198#true, 238#(<= |ULTIMATE.start_main_#t~nondet15#1| 32), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-13 10:03:31,635 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2024-10-13 10:03:31,635 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-10-13 10:03:31,635 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-10-13 10:03:31,635 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-10-13 10:03:31,635 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L1049-15-->L1049-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise5_3| v_~threads_mask~0_25) InVars {threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_3|} OutVars{threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_3|, ~threads_mask~0=v_~threads_mask~0_25} AuxVars[] AssignedVars[~threads_mask~0][177], [Black: 193#true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), 29#L1062-11true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= (+ 2 |ULTIMATE.start_main_#t~bitwise18#1|) 0)), Black: 232#(not (= ~threads_mask~0 0)), 36#L1049-16true, 217#true, Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 198#true, 238#(<= |ULTIMATE.start_main_#t~nondet15#1| 32), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-13 10:03:31,636 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2024-10-13 10:03:31,636 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-10-13 10:03:31,636 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-10-13 10:03:31,636 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-10-13 10:03:31,679 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L1049-15-->L1049-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise5_3| v_~threads_mask~0_25) InVars {threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_3|} OutVars{threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_3|, ~threads_mask~0=v_~threads_mask~0_25} AuxVars[] AssignedVars[~threads_mask~0][189], [Black: 193#true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), Black: 233#(and (not (= ~threads_mask~0 0)) (<= (+ 2 |ULTIMATE.start_main_#t~bitwise18#1|) 0)), Black: 232#(not (= ~threads_mask~0 0)), 36#L1049-16true, 217#true, 140#L1062-25true, Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 198#true, 238#(<= |ULTIMATE.start_main_#t~nondet15#1| 32), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-13 10:03:31,679 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2024-10-13 10:03:31,679 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-10-13 10:03:31,680 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-10-13 10:03:31,680 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-10-13 10:03:31,680 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L1049-15-->L1049-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise5_3| v_~threads_mask~0_25) InVars {threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_3|} OutVars{threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_3|, ~threads_mask~0=v_~threads_mask~0_25} AuxVars[] AssignedVars[~threads_mask~0][189], [8#L1062-28true, Black: 193#true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), Black: 233#(and (not (= ~threads_mask~0 0)) (<= (+ 2 |ULTIMATE.start_main_#t~bitwise18#1|) 0)), Black: 232#(not (= ~threads_mask~0 0)), 36#L1049-16true, 217#true, Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 198#true, 238#(<= |ULTIMATE.start_main_#t~nondet15#1| 32), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-13 10:03:31,680 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2024-10-13 10:03:31,680 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-10-13 10:03:31,680 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-10-13 10:03:31,680 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-10-13 10:03:31,814 INFO L124 PetriNetUnfolderBase]: 315/1897 cut-off events. [2024-10-13 10:03:31,814 INFO L125 PetriNetUnfolderBase]: For 824/840 co-relation queries the response was YES. [2024-10-13 10:03:31,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3090 conditions, 1897 events. 315/1897 cut-off events. For 824/840 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 14455 event pairs, 49 based on Foata normal form. 27/1728 useless extension candidates. Maximal degree in co-relation 2867. Up to 163 conditions per place. [2024-10-13 10:03:31,827 INFO L140 encePairwiseOnDemand]: 198/202 looper letters, 23 selfloop transitions, 3 changer transitions 0/224 dead transitions. [2024-10-13 10:03:31,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 224 transitions, 753 flow [2024-10-13 10:03:31,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:03:31,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:03:31,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2024-10-13 10:03:31,830 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9174917491749175 [2024-10-13 10:03:31,830 INFO L175 Difference]: Start difference. First operand has 205 places, 222 transitions, 697 flow. Second operand 3 states and 556 transitions. [2024-10-13 10:03:31,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 224 transitions, 753 flow [2024-10-13 10:03:31,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 224 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:03:31,838 INFO L231 Difference]: Finished difference. Result has 205 places, 220 transitions, 685 flow [2024-10-13 10:03:31,839 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=685, PETRI_PLACES=205, PETRI_TRANSITIONS=220} [2024-10-13 10:03:31,839 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 18 predicate places. [2024-10-13 10:03:31,840 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 220 transitions, 685 flow [2024-10-13 10:03:31,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 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-13 10:03:31,840 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:03:31,840 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:03:31,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 10:03:31,841 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-13 10:03:31,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:03:31,843 INFO L85 PathProgramCache]: Analyzing trace with hash -438406941, now seen corresponding path program 1 times [2024-10-13 10:03:31,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:03:31,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172129736] [2024-10-13 10:03:31,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:03:31,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:03:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:03:31,931 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-13 10:03:31,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:03:31,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172129736] [2024-10-13 10:03:31,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172129736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:03:31,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:03:31,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:03:31,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506322293] [2024-10-13 10:03:31,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:03:31,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:03:31,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:03:31,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:03:31,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:03:31,993 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 202 [2024-10-13 10:03:31,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 220 transitions, 685 flow. Second operand has 4 states, 4 states have (on average 176.5) internal successors, (706), 4 states have internal predecessors, (706), 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-13 10:03:31,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:03:31,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 202 [2024-10-13 10:03:31,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:03:32,318 INFO L124 PetriNetUnfolderBase]: 348/2125 cut-off events. [2024-10-13 10:03:32,319 INFO L125 PetriNetUnfolderBase]: For 1080/1103 co-relation queries the response was YES. [2024-10-13 10:03:32,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3496 conditions, 2125 events. 348/2125 cut-off events. For 1080/1103 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 17328 event pairs, 84 based on Foata normal form. 9/1922 useless extension candidates. Maximal degree in co-relation 3276. Up to 365 conditions per place. [2024-10-13 10:03:32,338 INFO L140 encePairwiseOnDemand]: 195/202 looper letters, 42 selfloop transitions, 9 changer transitions 0/237 dead transitions. [2024-10-13 10:03:32,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 237 transitions, 859 flow [2024-10-13 10:03:32,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:03:32,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 10:03:32,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 735 transitions. [2024-10-13 10:03:32,341 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9096534653465347 [2024-10-13 10:03:32,341 INFO L175 Difference]: Start difference. First operand has 205 places, 220 transitions, 685 flow. Second operand 4 states and 735 transitions. [2024-10-13 10:03:32,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 237 transitions, 859 flow [2024-10-13 10:03:32,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 237 transitions, 853 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:03:32,349 INFO L231 Difference]: Finished difference. Result has 208 places, 226 transitions, 766 flow [2024-10-13 10:03:32,350 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=766, PETRI_PLACES=208, PETRI_TRANSITIONS=226} [2024-10-13 10:03:32,351 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 21 predicate places. [2024-10-13 10:03:32,352 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 226 transitions, 766 flow [2024-10-13 10:03:32,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 176.5) internal successors, (706), 4 states have internal predecessors, (706), 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-13 10:03:32,353 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:03:32,353 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:03:32,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 10:03:32,353 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-13 10:03:32,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:03:32,354 INFO L85 PathProgramCache]: Analyzing trace with hash -80518923, now seen corresponding path program 1 times [2024-10-13 10:03:32,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:03:32,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308175281] [2024-10-13 10:03:32,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:03:32,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:03:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:03:32,463 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-13 10:03:32,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:03:32,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308175281] [2024-10-13 10:03:32,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308175281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:03:32,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:03:32,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:03:32,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566370546] [2024-10-13 10:03:32,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:03:32,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:03:32,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:03:32,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:03:32,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:03:32,567 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 202 [2024-10-13 10:03:32,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 226 transitions, 766 flow. Second operand has 5 states, 5 states have (on average 173.2) internal successors, (866), 5 states have internal predecessors, (866), 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-13 10:03:32,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:03:32,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 202 [2024-10-13 10:03:32,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:03:32,594 INFO L124 PetriNetUnfolderBase]: 2/73 cut-off events. [2024-10-13 10:03:32,594 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-10-13 10:03:32,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 73 events. 2/73 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 2/72 useless extension candidates. Maximal degree in co-relation 108. Up to 6 conditions per place. [2024-10-13 10:03:32,595 INFO L140 encePairwiseOnDemand]: 198/202 looper letters, 0 selfloop transitions, 0 changer transitions 62/62 dead transitions. [2024-10-13 10:03:32,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 62 transitions, 178 flow [2024-10-13 10:03:32,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:03:32,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 10:03:32,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 863 transitions. [2024-10-13 10:03:32,597 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8544554455445544 [2024-10-13 10:03:32,597 INFO L175 Difference]: Start difference. First operand has 208 places, 226 transitions, 766 flow. Second operand 5 states and 863 transitions. [2024-10-13 10:03:32,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 62 transitions, 178 flow [2024-10-13 10:03:32,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 62 transitions, 143 flow, removed 4 selfloop flow, removed 19 redundant places. [2024-10-13 10:03:32,598 INFO L231 Difference]: Finished difference. Result has 72 places, 0 transitions, 0 flow [2024-10-13 10:03:32,599 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=72, PETRI_TRANSITIONS=0} [2024-10-13 10:03:32,599 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, -115 predicate places. [2024-10-13 10:03:32,599 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 0 transitions, 0 flow [2024-10-13 10:03:32,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 173.2) internal successors, (866), 5 states have internal predecessors, (866), 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-13 10:03:32,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 16 remaining) [2024-10-13 10:03:32,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-10-13 10:03:32,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-10-13 10:03:32,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-10-13 10:03:32,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-10-13 10:03:32,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-10-13 10:03:32,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-10-13 10:03:32,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 16 remaining) [2024-10-13 10:03:32,604 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-10-13 10:03:32,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-10-13 10:03:32,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-10-13 10:03:32,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-10-13 10:03:32,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-10-13 10:03:32,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-10-13 10:03:32,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-10-13 10:03:32,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-10-13 10:03:32,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 10:03:32,606 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:03:32,611 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 10:03:32,611 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 10:03:32,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:03:32 BasicIcfg [2024-10-13 10:03:32,617 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 10:03:32,618 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 10:03:32,618 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 10:03:32,618 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 10:03:32,619 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:03:27" (3/4) ... [2024-10-13 10:03:32,620 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 10:03:32,623 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread [2024-10-13 10:03:32,627 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-10-13 10:03:32,628 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 10:03:32,628 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 10:03:32,718 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 10:03:32,718 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 10:03:32,718 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 10:03:32,719 INFO L158 Benchmark]: Toolchain (without parser) took 7169.84ms. Allocated memory was 153.1MB in the beginning and 295.7MB in the end (delta: 142.6MB). Free memory was 97.2MB in the beginning and 154.7MB in the end (delta: -57.5MB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. [2024-10-13 10:03:32,719 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 153.1MB. Free memory is still 112.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:03:32,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 773.97ms. Allocated memory is still 153.1MB. Free memory was 96.8MB in the beginning and 64.0MB in the end (delta: 32.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-13 10:03:32,720 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.32ms. Allocated memory is still 153.1MB. Free memory was 64.0MB in the beginning and 121.5MB in the end (delta: -57.4MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2024-10-13 10:03:32,720 INFO L158 Benchmark]: Boogie Preprocessor took 65.58ms. Allocated memory was 153.1MB in the beginning and 192.9MB in the end (delta: 39.8MB). Free memory was 121.4MB in the beginning and 162.5MB in the end (delta: -41.0MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-10-13 10:03:32,720 INFO L158 Benchmark]: RCFGBuilder took 712.90ms. Allocated memory is still 192.9MB. Free memory was 162.5MB in the beginning and 135.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-13 10:03:32,720 INFO L158 Benchmark]: TraceAbstraction took 5428.75ms. Allocated memory was 192.9MB in the beginning and 295.7MB in the end (delta: 102.8MB). Free memory was 135.2MB in the beginning and 158.9MB in the end (delta: -23.7MB). Peak memory consumption was 78.0MB. Max. memory is 16.1GB. [2024-10-13 10:03:32,720 INFO L158 Benchmark]: Witness Printer took 100.77ms. Allocated memory is still 295.7MB. Free memory was 158.9MB in the beginning and 154.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 10:03:32,722 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.18ms. Allocated memory is still 153.1MB. Free memory is still 112.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 773.97ms. Allocated memory is still 153.1MB. Free memory was 96.8MB in the beginning and 64.0MB in the end (delta: 32.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.32ms. Allocated memory is still 153.1MB. Free memory was 64.0MB in the beginning and 121.5MB in the end (delta: -57.4MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.58ms. Allocated memory was 153.1MB in the beginning and 192.9MB in the end (delta: 39.8MB). Free memory was 121.4MB in the beginning and 162.5MB in the end (delta: -41.0MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * RCFGBuilder took 712.90ms. Allocated memory is still 192.9MB. Free memory was 162.5MB in the beginning and 135.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5428.75ms. Allocated memory was 192.9MB in the beginning and 295.7MB in the end (delta: 102.8MB). Free memory was 135.2MB in the beginning and 158.9MB in the end (delta: -23.7MB). Peak memory consumption was 78.0MB. Max. memory is 16.1GB. * Witness Printer took 100.77ms. Allocated memory is still 295.7MB. Free memory was 158.9MB in the beginning and 154.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1059]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1062]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1071]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1068]: 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: 1063]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1065]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1049]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1049]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1051]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1051]: 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, 228 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: 5.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 778 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 430 mSDsluCounter, 219 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 103 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1106 IncrementalHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 116 mSDtfsCounter, 1106 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=766occurred 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.1s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 676 ConstructedInterpolants, 0 QuantifiedInterpolants, 1406 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-13 10:03:32,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE