./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-inner-race-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-inner-race-5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c9074e122b1777f395c954ed30ab626f529c102cb2614b7e83435b6d498a843 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:39:07,364 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:39:07,452 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-24 15:39:07,456 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:39:07,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:39:07,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:39:07,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:39:07,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:39:07,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:39:07,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:39:07,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:39:07,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:39:07,486 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:39:07,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:39:07,488 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:39:07,488 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:39:07,488 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:39:07,491 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:39:07,491 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:39:07,491 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:39:07,491 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:39:07,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:39:07,493 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-24 15:39:07,493 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:39:07,493 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:39:07,493 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:39:07,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:39:07,494 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:39:07,494 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:39:07,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:39:07,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:39:07,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:39:07,495 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:39:07,495 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:39:07,495 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 15:39:07,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 15:39:07,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 15:39:07,495 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:39:07,496 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:39:07,496 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:39:07,498 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:39:07,499 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9c9074e122b1777f395c954ed30ab626f529c102cb2614b7e83435b6d498a843 [2024-10-24 15:39:07,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:39:07,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:39:07,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:39:07,775 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:39:07,775 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:39:07,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-inner-race-5.i [2024-10-24 15:39:09,191 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:39:09,449 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:39:09,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-inner-race-5.i [2024-10-24 15:39:09,469 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d9135b71/f8f2031e34404dfdb3a3c4342b18d893/FLAG79e6f6b6a [2024-10-24 15:39:09,764 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d9135b71/f8f2031e34404dfdb3a3c4342b18d893 [2024-10-24 15:39:09,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:39:09,768 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:39:09,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:39:09,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:39:09,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:39:09,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:39:09" (1/1) ... [2024-10-24 15:39:09,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@448fc8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:09, skipping insertion in model container [2024-10-24 15:39:09,781 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:39:09" (1/1) ... [2024-10-24 15:39:09,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:39:10,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:39:10,303 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 15:39:10,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:39:10,403 INFO L204 MainTranslator]: Completed translation [2024-10-24 15:39:10,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:10 WrapperNode [2024-10-24 15:39:10,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:39:10,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 15:39:10,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 15:39:10,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 15:39:10,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:10" (1/1) ... [2024-10-24 15:39:10,439 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:10" (1/1) ... [2024-10-24 15:39:10,466 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2024-10-24 15:39:10,469 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 15:39:10,470 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 15:39:10,470 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 15:39:10,470 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 15:39:10,479 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:10" (1/1) ... [2024-10-24 15:39:10,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:10" (1/1) ... [2024-10-24 15:39:10,483 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:10" (1/1) ... [2024-10-24 15:39:10,487 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:10" (1/1) ... [2024-10-24 15:39:10,492 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:10" (1/1) ... [2024-10-24 15:39:10,499 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:10" (1/1) ... [2024-10-24 15:39:10,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:10" (1/1) ... [2024-10-24 15:39:10,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:10" (1/1) ... [2024-10-24 15:39:10,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 15:39:10,515 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 15:39:10,515 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 15:39:10,516 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 15:39:10,517 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:10" (1/1) ... [2024-10-24 15:39:10,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:39:10,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:39:10,553 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 15:39:10,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 15:39:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-24 15:39:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 15:39:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-24 15:39:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-24 15:39:10,605 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-24 15:39:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-24 15:39:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 15:39:10,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 15:39:10,607 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 15:39:10,725 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 15:39:10,728 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 15:39:10,930 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 15:39:10,931 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 15:39:10,983 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 15:39:10,983 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 15:39:10,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:39:10 BoogieIcfgContainer [2024-10-24 15:39:10,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 15:39:10,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 15:39:10,987 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 15:39:10,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 15:39:10,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:39:09" (1/3) ... [2024-10-24 15:39:10,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279442b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:39:10, skipping insertion in model container [2024-10-24 15:39:10,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:10" (2/3) ... [2024-10-24 15:39:10,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279442b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:39:10, skipping insertion in model container [2024-10-24 15:39:10,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:39:10" (3/3) ... [2024-10-24 15:39:10,994 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-counter-inner-race-5.i [2024-10-24 15:39:11,010 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 15:39:11,011 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-24 15:39:11,011 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 15:39:11,069 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 15:39:11,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 139 transitions, 282 flow [2024-10-24 15:39:11,201 INFO L124 PetriNetUnfolderBase]: 7/166 cut-off events. [2024-10-24 15:39:11,201 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 15:39:11,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 166 events. 7/166 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 193 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. [2024-10-24 15:39:11,209 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 139 transitions, 282 flow [2024-10-24 15:39:11,217 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 139 transitions, 282 flow [2024-10-24 15:39:11,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:39:11,243 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;@567fcac8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:39:11,243 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-10-24 15:39:11,266 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 15:39:11,267 INFO L124 PetriNetUnfolderBase]: 2/69 cut-off events. [2024-10-24 15:39:11,268 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 15:39:11,268 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:11,269 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] [2024-10-24 15:39:11,269 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-10-24 15:39:11,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:11,275 INFO L85 PathProgramCache]: Analyzing trace with hash -2033096920, now seen corresponding path program 1 times [2024-10-24 15:39:11,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:11,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620525652] [2024-10-24 15:39:11,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:11,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:11,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:11,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:11,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620525652] [2024-10-24 15:39:11,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620525652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:11,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:11,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:11,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983057512] [2024-10-24 15:39:11,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:11,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:11,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:11,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:11,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:11,685 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 139 [2024-10-24 15:39:11,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 139 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:11,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:11,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 139 [2024-10-24 15:39:11,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:11,902 INFO L124 PetriNetUnfolderBase]: 122/659 cut-off events. [2024-10-24 15:39:11,903 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-24 15:39:11,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 659 events. 122/659 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3268 event pairs, 29 based on Foata normal form. 13/607 useless extension candidates. Maximal degree in co-relation 832. Up to 167 conditions per place. [2024-10-24 15:39:11,910 INFO L140 encePairwiseOnDemand]: 127/139 looper letters, 28 selfloop transitions, 6 changer transitions 1/148 dead transitions. [2024-10-24 15:39:11,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 148 transitions, 368 flow [2024-10-24 15:39:11,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:11,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:11,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2024-10-24 15:39:11,928 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.920863309352518 [2024-10-24 15:39:11,930 INFO L175 Difference]: Start difference. First operand has 138 places, 139 transitions, 282 flow. Second operand 3 states and 384 transitions. [2024-10-24 15:39:11,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 148 transitions, 368 flow [2024-10-24 15:39:11,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 148 transitions, 368 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:39:11,964 INFO L231 Difference]: Finished difference. Result has 140 places, 137 transitions, 312 flow [2024-10-24 15:39:11,967 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=140, PETRI_TRANSITIONS=137} [2024-10-24 15:39:11,973 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 2 predicate places. [2024-10-24 15:39:11,974 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 137 transitions, 312 flow [2024-10-24 15:39:11,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:11,974 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:11,975 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:11,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 15:39:11,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-10-24 15:39:11,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:11,976 INFO L85 PathProgramCache]: Analyzing trace with hash 687111492, now seen corresponding path program 1 times [2024-10-24 15:39:11,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:11,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135256627] [2024-10-24 15:39:11,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:11,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:12,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:12,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:12,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135256627] [2024-10-24 15:39:12,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135256627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:12,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:12,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:12,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657877542] [2024-10-24 15:39:12,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:12,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:12,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:12,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:12,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:12,107 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 139 [2024-10-24 15:39:12,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 137 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:12,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:12,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 139 [2024-10-24 15:39:12,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:12,236 INFO L124 PetriNetUnfolderBase]: 122/752 cut-off events. [2024-10-24 15:39:12,237 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-10-24 15:39:12,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1108 conditions, 752 events. 122/752 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4141 event pairs, 56 based on Foata normal form. 0/682 useless extension candidates. Maximal degree in co-relation 1010. Up to 170 conditions per place. [2024-10-24 15:39:12,245 INFO L140 encePairwiseOnDemand]: 135/139 looper letters, 19 selfloop transitions, 3 changer transitions 1/145 dead transitions. [2024-10-24 15:39:12,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 145 transitions, 374 flow [2024-10-24 15:39:12,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:12,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:12,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2024-10-24 15:39:12,251 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9280575539568345 [2024-10-24 15:39:12,252 INFO L175 Difference]: Start difference. First operand has 140 places, 137 transitions, 312 flow. Second operand 3 states and 387 transitions. [2024-10-24 15:39:12,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 145 transitions, 374 flow [2024-10-24 15:39:12,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 145 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:12,258 INFO L231 Difference]: Finished difference. Result has 141 places, 139 transitions, 322 flow [2024-10-24 15:39:12,258 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=141, PETRI_TRANSITIONS=139} [2024-10-24 15:39:12,259 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 3 predicate places. [2024-10-24 15:39:12,259 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 139 transitions, 322 flow [2024-10-24 15:39:12,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:12,260 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:12,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 15:39:12,260 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-10-24 15:39:12,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:12,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1931662701, now seen corresponding path program 1 times [2024-10-24 15:39:12,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:12,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440278546] [2024-10-24 15:39:12,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:12,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:12,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:12,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:12,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440278546] [2024-10-24 15:39:12,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440278546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:12,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:12,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:12,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411575291] [2024-10-24 15:39:12,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:12,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:12,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:12,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:12,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:12,390 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 139 [2024-10-24 15:39:12,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 139 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:12,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:12,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 139 [2024-10-24 15:39:12,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:12,529 INFO L124 PetriNetUnfolderBase]: 146/788 cut-off events. [2024-10-24 15:39:12,529 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-10-24 15:39:12,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 788 events. 146/788 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4267 event pairs, 73 based on Foata normal form. 0/728 useless extension candidates. Maximal degree in co-relation 1150. Up to 267 conditions per place. [2024-10-24 15:39:12,537 INFO L140 encePairwiseOnDemand]: 134/139 looper letters, 26 selfloop transitions, 5 changer transitions 0/147 dead transitions. [2024-10-24 15:39:12,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 147 transitions, 404 flow [2024-10-24 15:39:12,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:12,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:12,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2024-10-24 15:39:12,539 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9016786570743405 [2024-10-24 15:39:12,539 INFO L175 Difference]: Start difference. First operand has 141 places, 139 transitions, 322 flow. Second operand 3 states and 376 transitions. [2024-10-24 15:39:12,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 147 transitions, 404 flow [2024-10-24 15:39:12,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 147 transitions, 398 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:12,547 INFO L231 Difference]: Finished difference. Result has 143 places, 143 transitions, 358 flow [2024-10-24 15:39:12,547 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=143, PETRI_TRANSITIONS=143} [2024-10-24 15:39:12,548 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 5 predicate places. [2024-10-24 15:39:12,548 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 143 transitions, 358 flow [2024-10-24 15:39:12,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:12,549 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:12,549 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:12,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 15:39:12,549 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-10-24 15:39:12,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:12,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1587979243, now seen corresponding path program 1 times [2024-10-24 15:39:12,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:12,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589714376] [2024-10-24 15:39:12,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:12,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 15:39:12,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 15:39:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 15:39:12,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 15:39:12,665 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 15:39:12,666 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2024-10-24 15:39:12,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2024-10-24 15:39:12,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2024-10-24 15:39:12,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2024-10-24 15:39:12,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2024-10-24 15:39:12,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2024-10-24 15:39:12,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2024-10-24 15:39:12,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2024-10-24 15:39:12,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2024-10-24 15:39:12,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2024-10-24 15:39:12,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2024-10-24 15:39:12,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2024-10-24 15:39:12,673 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2024-10-24 15:39:12,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 15:39:12,673 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 15:39:12,676 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-24 15:39:12,676 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-24 15:39:12,716 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 15:39:12,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 186 transitions, 382 flow [2024-10-24 15:39:12,753 INFO L124 PetriNetUnfolderBase]: 10/248 cut-off events. [2024-10-24 15:39:12,753 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-24 15:39:12,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 248 events. 10/248 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 473 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 167. Up to 6 conditions per place. [2024-10-24 15:39:12,755 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 186 transitions, 382 flow [2024-10-24 15:39:12,758 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 186 transitions, 382 flow [2024-10-24 15:39:12,760 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:39:12,764 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;@567fcac8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:39:12,764 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-10-24 15:39:12,770 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 15:39:12,770 INFO L124 PetriNetUnfolderBase]: 2/69 cut-off events. [2024-10-24 15:39:12,770 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 15:39:12,770 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:12,771 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] [2024-10-24 15:39:12,771 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2024-10-24 15:39:12,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:12,772 INFO L85 PathProgramCache]: Analyzing trace with hash -676679512, now seen corresponding path program 1 times [2024-10-24 15:39:12,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:12,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738664911] [2024-10-24 15:39:12,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:12,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:12,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:12,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738664911] [2024-10-24 15:39:12,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738664911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:12,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:12,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:12,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685933472] [2024-10-24 15:39:12,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:12,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:12,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:12,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:12,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:12,884 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 186 [2024-10-24 15:39:12,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 186 transitions, 382 flow. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:12,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:12,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 186 [2024-10-24 15:39:12,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:14,552 INFO L124 PetriNetUnfolderBase]: 4627/13081 cut-off events. [2024-10-24 15:39:14,554 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-10-24 15:39:14,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20491 conditions, 13081 events. 4627/13081 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 131250 event pairs, 1551 based on Foata normal form. 264/11856 useless extension candidates. Maximal degree in co-relation 19499. Up to 4243 conditions per place. [2024-10-24 15:39:14,662 INFO L140 encePairwiseOnDemand]: 164/186 looper letters, 54 selfloop transitions, 14 changer transitions 1/214 dead transitions. [2024-10-24 15:39:14,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 214 transitions, 579 flow [2024-10-24 15:39:14,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:14,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:14,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 516 transitions. [2024-10-24 15:39:14,664 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2024-10-24 15:39:14,665 INFO L175 Difference]: Start difference. First operand has 187 places, 186 transitions, 382 flow. Second operand 3 states and 516 transitions. [2024-10-24 15:39:14,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 214 transitions, 579 flow [2024-10-24 15:39:14,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 214 transitions, 579 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:39:14,670 INFO L231 Difference]: Finished difference. Result has 191 places, 196 transitions, 496 flow [2024-10-24 15:39:14,671 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=191, PETRI_TRANSITIONS=196} [2024-10-24 15:39:14,673 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 4 predicate places. [2024-10-24 15:39:14,673 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 196 transitions, 496 flow [2024-10-24 15:39:14,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:14,674 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:14,674 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:14,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 15:39:14,675 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2024-10-24 15:39:14,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:14,675 INFO L85 PathProgramCache]: Analyzing trace with hash -293497346, now seen corresponding path program 1 times [2024-10-24 15:39:14,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:14,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014575090] [2024-10-24 15:39:14,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:14,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:14,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:14,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:14,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014575090] [2024-10-24 15:39:14,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014575090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:14,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:14,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:14,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526083127] [2024-10-24 15:39:14,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:14,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:14,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:14,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:14,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:14,761 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 186 [2024-10-24 15:39:14,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 196 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:14,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:14,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 186 [2024-10-24 15:39:14,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:16,665 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([449] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][81], [136#L699-1true, Black: 190#true, 106#L713-1true, 195#true, 192#(= |#race~threads_alive~0| 0), 98#L699-6true, 186#true, 188#true]) [2024-10-24 15:39:16,665 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-10-24 15:39:16,666 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-24 15:39:16,666 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-24 15:39:16,666 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-24 15:39:16,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([449] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][81], [Black: 190#true, 106#L713-1true, 24#L699-2true, 195#true, 192#(= |#race~threads_alive~0| 0), 98#L699-6true, 186#true, 188#true]) [2024-10-24 15:39:16,687 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2024-10-24 15:39:16,687 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-10-24 15:39:16,687 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-24 15:39:16,688 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-10-24 15:39:16,755 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([449] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][63], [Black: 190#true, 106#L713-1true, 195#true, 192#(= |#race~threads_alive~0| 0), 46#L699-6true, 98#L699-6true, 186#true, 188#true]) [2024-10-24 15:39:16,755 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2024-10-24 15:39:16,755 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2024-10-24 15:39:16,755 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-24 15:39:16,756 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2024-10-24 15:39:16,920 INFO L124 PetriNetUnfolderBase]: 4195/15202 cut-off events. [2024-10-24 15:39:16,920 INFO L125 PetriNetUnfolderBase]: For 824/865 co-relation queries the response was YES. [2024-10-24 15:39:16,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24210 conditions, 15202 events. 4195/15202 cut-off events. For 824/865 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 173471 event pairs, 2308 based on Foata normal form. 0/13594 useless extension candidates. Maximal degree in co-relation 23033. Up to 4051 conditions per place. [2024-10-24 15:39:17,037 INFO L140 encePairwiseOnDemand]: 181/186 looper letters, 34 selfloop transitions, 4 changer transitions 0/211 dead transitions. [2024-10-24 15:39:17,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 211 transitions, 602 flow [2024-10-24 15:39:17,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:17,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:17,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2024-10-24 15:39:17,039 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9301075268817204 [2024-10-24 15:39:17,039 INFO L175 Difference]: Start difference. First operand has 191 places, 196 transitions, 496 flow. Second operand 3 states and 519 transitions. [2024-10-24 15:39:17,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 211 transitions, 602 flow [2024-10-24 15:39:17,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 211 transitions, 574 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:17,053 INFO L231 Difference]: Finished difference. Result has 192 places, 199 transitions, 498 flow [2024-10-24 15:39:17,054 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=192, PETRI_TRANSITIONS=199} [2024-10-24 15:39:17,055 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 5 predicate places. [2024-10-24 15:39:17,057 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 199 transitions, 498 flow [2024-10-24 15:39:17,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:17,057 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:17,057 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] [2024-10-24 15:39:17,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 15:39:17,058 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2024-10-24 15:39:17,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:17,058 INFO L85 PathProgramCache]: Analyzing trace with hash 454472155, now seen corresponding path program 1 times [2024-10-24 15:39:17,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:17,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733576386] [2024-10-24 15:39:17,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:17,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:17,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:17,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:17,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733576386] [2024-10-24 15:39:17,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733576386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:17,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:17,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:17,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210772588] [2024-10-24 15:39:17,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:17,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:17,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:17,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:17,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:17,168 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 186 [2024-10-24 15:39:17,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 199 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:17,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:17,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 186 [2024-10-24 15:39:17,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:17,440 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([449] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][144], [Black: 190#true, 106#L713-1true, 200#true, 99#L692-7true, 195#true, 162#L692-2true, Black: 197#(= |#race~data~0| 0), 186#true, 188#true]) [2024-10-24 15:39:17,441 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2024-10-24 15:39:17,441 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-10-24 15:39:17,441 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-10-24 15:39:17,441 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2024-10-24 15:39:17,512 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([449] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][81], [Black: 190#true, 106#L713-1true, 200#true, 162#L692-2true, 195#true, Black: 197#(= |#race~data~0| 0), 186#true, 108#L694true, 188#true]) [2024-10-24 15:39:17,513 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2024-10-24 15:39:17,513 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2024-10-24 15:39:17,513 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2024-10-24 15:39:17,513 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2024-10-24 15:39:17,546 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([449] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][81], [Black: 190#true, 106#L713-1true, 200#true, 195#true, 162#L692-2true, Black: 197#(= |#race~data~0| 0), 186#true, 159#L694-3true, 188#true]) [2024-10-24 15:39:17,546 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2024-10-24 15:39:17,546 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-10-24 15:39:17,546 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-10-24 15:39:17,547 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-10-24 15:39:17,693 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([449] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][81], [Black: 190#true, 106#L713-1true, 200#true, 195#true, 162#L692-2true, Black: 197#(= |#race~data~0| 0), 123#L695-3true, 186#true, 188#true]) [2024-10-24 15:39:17,694 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2024-10-24 15:39:17,694 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2024-10-24 15:39:17,694 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2024-10-24 15:39:17,694 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2024-10-24 15:39:17,965 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([449] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][81], [Black: 190#true, 106#L713-1true, 200#true, 195#true, 162#L692-2true, Black: 197#(= |#race~data~0| 0), 186#true, 184#L697-3true, 188#true]) [2024-10-24 15:39:17,966 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2024-10-24 15:39:17,966 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-10-24 15:39:17,966 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2024-10-24 15:39:17,966 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-10-24 15:39:18,030 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([449] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][81], [Black: 190#true, 106#L713-1true, 200#true, 195#true, 162#L692-2true, Black: 197#(= |#race~data~0| 0), 186#true, 188#true, 94#L698-3true]) [2024-10-24 15:39:18,031 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2024-10-24 15:39:18,031 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-10-24 15:39:18,031 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-10-24 15:39:18,031 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-10-24 15:39:18,445 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([449] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][144], [146#L699-2true, Black: 190#true, 106#L713-1true, 200#true, 99#L692-7true, 195#true, Black: 197#(= |#race~data~0| 0), 186#true, 188#true]) [2024-10-24 15:39:18,445 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-10-24 15:39:18,445 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-24 15:39:18,445 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-24 15:39:18,446 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-24 15:39:18,547 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([449] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][81], [146#L699-2true, Black: 190#true, 106#L713-1true, 200#true, 195#true, Black: 197#(= |#race~data~0| 0), 186#true, 108#L694true, 188#true]) [2024-10-24 15:39:18,548 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2024-10-24 15:39:18,548 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-10-24 15:39:18,548 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-10-24 15:39:18,548 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-10-24 15:39:18,576 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([449] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][81], [146#L699-2true, Black: 190#true, 106#L713-1true, 200#true, 195#true, Black: 197#(= |#race~data~0| 0), 186#true, 159#L694-3true, 188#true]) [2024-10-24 15:39:18,576 INFO L294 olderBase$Statistics]: this new event has 135 ancestors and is cut-off event [2024-10-24 15:39:18,576 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-24 15:39:18,576 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-24 15:39:18,576 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-24 15:39:18,625 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([449] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][81], [146#L699-2true, Black: 190#true, 106#L713-1true, 200#true, 195#true, Black: 197#(= |#race~data~0| 0), 123#L695-3true, 186#true, 188#true]) [2024-10-24 15:39:18,626 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is cut-off event [2024-10-24 15:39:18,626 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-24 15:39:18,626 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-24 15:39:18,626 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-24 15:39:18,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([449] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][81], [146#L699-2true, Black: 190#true, 106#L713-1true, 200#true, 195#true, Black: 197#(= |#race~data~0| 0), 186#true, 184#L697-3true, 188#true]) [2024-10-24 15:39:18,988 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2024-10-24 15:39:18,988 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-24 15:39:18,988 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-24 15:39:18,989 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-24 15:39:19,026 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([449] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][81], [146#L699-2true, Black: 190#true, 106#L713-1true, 200#true, 195#true, Black: 197#(= |#race~data~0| 0), 186#true, 188#true, 94#L698-3true]) [2024-10-24 15:39:19,027 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2024-10-24 15:39:19,027 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-10-24 15:39:19,027 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-24 15:39:19,027 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-24 15:39:19,300 INFO L124 PetriNetUnfolderBase]: 5725/18224 cut-off events. [2024-10-24 15:39:19,301 INFO L125 PetriNetUnfolderBase]: For 2811/3084 co-relation queries the response was YES. [2024-10-24 15:39:19,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32153 conditions, 18224 events. 5725/18224 cut-off events. For 2811/3084 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 202439 event pairs, 3047 based on Foata normal form. 94/16519 useless extension candidates. Maximal degree in co-relation 30791. Up to 7701 conditions per place. [2024-10-24 15:39:19,454 INFO L140 encePairwiseOnDemand]: 177/186 looper letters, 49 selfloop transitions, 14 changer transitions 0/222 dead transitions. [2024-10-24 15:39:19,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 222 transitions, 695 flow [2024-10-24 15:39:19,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:19,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:19,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2024-10-24 15:39:19,458 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9068100358422939 [2024-10-24 15:39:19,459 INFO L175 Difference]: Start difference. First operand has 192 places, 199 transitions, 498 flow. Second operand 3 states and 506 transitions. [2024-10-24 15:39:19,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 222 transitions, 695 flow [2024-10-24 15:39:19,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 222 transitions, 687 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:19,479 INFO L231 Difference]: Finished difference. Result has 194 places, 211 transitions, 616 flow [2024-10-24 15:39:19,480 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=194, PETRI_TRANSITIONS=211} [2024-10-24 15:39:19,481 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 7 predicate places. [2024-10-24 15:39:19,482 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 211 transitions, 616 flow [2024-10-24 15:39:19,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:19,482 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:19,482 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:19,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 15:39:19,483 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2024-10-24 15:39:19,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:19,483 INFO L85 PathProgramCache]: Analyzing trace with hash -453810334, now seen corresponding path program 1 times [2024-10-24 15:39:19,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:19,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819073195] [2024-10-24 15:39:19,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:19,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:19,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:19,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:19,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819073195] [2024-10-24 15:39:19,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819073195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:19,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:19,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:19,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140554758] [2024-10-24 15:39:19,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:19,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:19,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:19,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:19,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:19,589 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 186 [2024-10-24 15:39:19,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 211 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:19,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:19,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 186 [2024-10-24 15:39:19,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:20,030 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([449] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][139], [Black: 190#true, 106#L713-1true, 205#true, 200#true, 99#L692-7true, 162#L692-2true, Black: 197#(= |#race~data~0| 0), 186#true, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 188#true]) [2024-10-24 15:39:20,031 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2024-10-24 15:39:20,031 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2024-10-24 15:39:20,031 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-10-24 15:39:20,031 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-10-24 15:39:20,097 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([449] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][81], [Black: 190#true, 106#L713-1true, 205#true, 200#true, 162#L692-2true, Black: 197#(= |#race~data~0| 0), 186#true, 108#L694true, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 188#true]) [2024-10-24 15:39:20,097 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2024-10-24 15:39:20,099 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2024-10-24 15:39:20,099 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2024-10-24 15:39:20,099 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2024-10-24 15:39:20,893 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([603] L699-->L699-1: Formula: (= |v_#race~threads_alive~0_10| 0) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|} AuxVars[] AssignedVars[#race~threads_alive~0][223], [111#L699-1true, Black: 190#true, 205#true, 200#true, 99#L692-7true, Black: 197#(= |#race~data~0| 0), 14#L713-2true, 186#true, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 188#true]) [2024-10-24 15:39:20,894 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-10-24 15:39:20,894 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-24 15:39:20,894 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-24 15:39:20,894 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-24 15:39:20,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([449] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][139], [111#L699-1true, Black: 190#true, 106#L713-1true, 205#true, 200#true, 99#L692-7true, Black: 197#(= |#race~data~0| 0), 186#true, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 188#true]) [2024-10-24 15:39:20,944 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2024-10-24 15:39:20,944 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-24 15:39:20,944 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-24 15:39:20,944 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-24 15:39:20,945 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([449] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][139], [146#L699-2true, Black: 190#true, 106#L713-1true, 205#true, 200#true, 99#L692-7true, Black: 197#(= |#race~data~0| 0), 186#true, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 188#true]) [2024-10-24 15:39:20,945 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-10-24 15:39:20,945 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-24 15:39:20,945 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-24 15:39:20,945 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-24 15:39:20,946 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([449] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][139], [146#L699-2true, Black: 190#true, 106#L713-1true, 205#true, 99#L692-7true, 200#true, Black: 197#(= |#race~data~0| 0), 186#true, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 188#true]) [2024-10-24 15:39:20,946 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-10-24 15:39:20,946 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-24 15:39:20,946 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-24 15:39:20,946 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-24 15:39:20,946 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-24 15:39:20,999 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([449] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][81], [146#L699-2true, Black: 190#true, 106#L713-1true, 205#true, 200#true, Black: 197#(= |#race~data~0| 0), 11#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 186#true, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 188#true]) [2024-10-24 15:39:20,999 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-10-24 15:39:21,000 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-24 15:39:21,000 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-24 15:39:21,000 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-24 15:39:21,138 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([449] L714-6-->L713-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][81], [146#L699-2true, Black: 190#true, 106#L713-1true, 205#true, 200#true, Black: 197#(= |#race~data~0| 0), 186#true, 108#L694true, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~threads_alive~0|), 188#true]) [2024-10-24 15:39:21,138 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2024-10-24 15:39:21,138 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-10-24 15:39:21,139 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-10-24 15:39:21,139 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-10-24 15:39:21,966 INFO L124 PetriNetUnfolderBase]: 5599/20131 cut-off events. [2024-10-24 15:39:21,966 INFO L125 PetriNetUnfolderBase]: For 3179/3539 co-relation queries the response was YES. [2024-10-24 15:39:22,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34611 conditions, 20131 events. 5599/20131 cut-off events. For 3179/3539 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 239678 event pairs, 3099 based on Foata normal form. 21/18084 useless extension candidates. Maximal degree in co-relation 33125. Up to 6066 conditions per place. [2024-10-24 15:39:22,137 INFO L140 encePairwiseOnDemand]: 180/186 looper letters, 36 selfloop transitions, 7 changer transitions 0/227 dead transitions. [2024-10-24 15:39:22,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 227 transitions, 745 flow [2024-10-24 15:39:22,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:22,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:22,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 515 transitions. [2024-10-24 15:39:22,140 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9229390681003584 [2024-10-24 15:39:22,140 INFO L175 Difference]: Start difference. First operand has 194 places, 211 transitions, 616 flow. Second operand 3 states and 515 transitions. [2024-10-24 15:39:22,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 227 transitions, 745 flow [2024-10-24 15:39:22,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 227 transitions, 717 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:22,155 INFO L231 Difference]: Finished difference. Result has 196 places, 216 transitions, 644 flow [2024-10-24 15:39:22,156 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=196, PETRI_TRANSITIONS=216} [2024-10-24 15:39:22,157 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 9 predicate places. [2024-10-24 15:39:22,157 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 216 transitions, 644 flow [2024-10-24 15:39:22,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:22,157 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:22,158 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:22,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 15:39:22,158 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2024-10-24 15:39:22,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:22,159 INFO L85 PathProgramCache]: Analyzing trace with hash -56396617, now seen corresponding path program 1 times [2024-10-24 15:39:22,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:22,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250226907] [2024-10-24 15:39:22,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:22,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:22,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 15:39:22,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:22,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250226907] [2024-10-24 15:39:22,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250226907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:22,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:22,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:39:22,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815515751] [2024-10-24 15:39:22,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:22,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:22,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:22,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:22,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:22,326 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 186 [2024-10-24 15:39:22,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 216 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:22,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:22,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 186 [2024-10-24 15:39:22,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:23,475 INFO L124 PetriNetUnfolderBase]: 1939/10668 cut-off events. [2024-10-24 15:39:23,476 INFO L125 PetriNetUnfolderBase]: For 1673/1954 co-relation queries the response was YES. [2024-10-24 15:39:23,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17690 conditions, 10668 events. 1939/10668 cut-off events. For 1673/1954 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 127670 event pairs, 546 based on Foata normal form. 260/10012 useless extension candidates. Maximal degree in co-relation 16781. Up to 1517 conditions per place. [2024-10-24 15:39:23,535 INFO L140 encePairwiseOnDemand]: 172/186 looper letters, 16 selfloop transitions, 14 changer transitions 0/223 dead transitions. [2024-10-24 15:39:23,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 223 transitions, 707 flow [2024-10-24 15:39:23,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:23,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:23,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2024-10-24 15:39:23,538 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.946236559139785 [2024-10-24 15:39:23,538 INFO L175 Difference]: Start difference. First operand has 196 places, 216 transitions, 644 flow. Second operand 3 states and 528 transitions. [2024-10-24 15:39:23,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 223 transitions, 707 flow [2024-10-24 15:39:23,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 223 transitions, 693 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:23,546 INFO L231 Difference]: Finished difference. Result has 197 places, 220 transitions, 680 flow [2024-10-24 15:39:23,546 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=197, PETRI_TRANSITIONS=220} [2024-10-24 15:39:23,547 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 10 predicate places. [2024-10-24 15:39:23,547 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 220 transitions, 680 flow [2024-10-24 15:39:23,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:23,548 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:23,548 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:23,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 15:39:23,548 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2024-10-24 15:39:23,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:23,549 INFO L85 PathProgramCache]: Analyzing trace with hash -660831656, now seen corresponding path program 1 times [2024-10-24 15:39:23,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:23,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549934193] [2024-10-24 15:39:23,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:23,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:23,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 15:39:23,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:23,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549934193] [2024-10-24 15:39:23,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549934193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:23,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:23,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:23,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502048505] [2024-10-24 15:39:23,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:23,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:23,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:23,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:23,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:23,643 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 186 [2024-10-24 15:39:23,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 220 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:23,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:23,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 186 [2024-10-24 15:39:23,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:25,041 INFO L124 PetriNetUnfolderBase]: 3007/13072 cut-off events. [2024-10-24 15:39:25,042 INFO L125 PetriNetUnfolderBase]: For 6962/7608 co-relation queries the response was YES. [2024-10-24 15:39:25,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27585 conditions, 13072 events. 3007/13072 cut-off events. For 6962/7608 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 154209 event pairs, 1195 based on Foata normal form. 50/12092 useless extension candidates. Maximal degree in co-relation 26433. Up to 4921 conditions per place. [2024-10-24 15:39:25,122 INFO L140 encePairwiseOnDemand]: 179/186 looper letters, 60 selfloop transitions, 10 changer transitions 0/236 dead transitions. [2024-10-24 15:39:25,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 236 transitions, 889 flow [2024-10-24 15:39:25,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:25,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:25,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2024-10-24 15:39:25,126 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8978494623655914 [2024-10-24 15:39:25,126 INFO L175 Difference]: Start difference. First operand has 197 places, 220 transitions, 680 flow. Second operand 3 states and 501 transitions. [2024-10-24 15:39:25,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 236 transitions, 889 flow [2024-10-24 15:39:25,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 236 transitions, 868 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:39:25,139 INFO L231 Difference]: Finished difference. Result has 200 places, 228 transitions, 756 flow [2024-10-24 15:39:25,140 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=200, PETRI_TRANSITIONS=228} [2024-10-24 15:39:25,141 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 13 predicate places. [2024-10-24 15:39:25,141 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 228 transitions, 756 flow [2024-10-24 15:39:25,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:25,141 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:25,142 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:25,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 15:39:25,142 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2024-10-24 15:39:25,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:25,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1935630994, now seen corresponding path program 1 times [2024-10-24 15:39:25,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:25,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067358352] [2024-10-24 15:39:25,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:25,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 15:39:25,170 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 15:39:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 15:39:25,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 15:39:25,201 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 15:39:25,201 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2024-10-24 15:39:25,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2024-10-24 15:39:25,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2024-10-24 15:39:25,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2024-10-24 15:39:25,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2024-10-24 15:39:25,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2024-10-24 15:39:25,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2024-10-24 15:39:25,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2024-10-24 15:39:25,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2024-10-24 15:39:25,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2024-10-24 15:39:25,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2024-10-24 15:39:25,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2024-10-24 15:39:25,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2024-10-24 15:39:25,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2024-10-24 15:39:25,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2024-10-24 15:39:25,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2024-10-24 15:39:25,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2024-10-24 15:39:25,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2024-10-24 15:39:25,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 15:39:25,206 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:25,207 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-24 15:39:25,207 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-24 15:39:25,253 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 15:39:25,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 236 places, 233 transitions, 484 flow [2024-10-24 15:39:25,317 INFO L124 PetriNetUnfolderBase]: 13/330 cut-off events. [2024-10-24 15:39:25,317 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-24 15:39:25,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 330 events. 13/330 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 812 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 252. Up to 8 conditions per place. [2024-10-24 15:39:25,320 INFO L82 GeneralOperation]: Start removeDead. Operand has 236 places, 233 transitions, 484 flow [2024-10-24 15:39:25,323 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 236 places, 233 transitions, 484 flow [2024-10-24 15:39:25,326 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:39:25,327 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;@567fcac8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:39:25,327 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-10-24 15:39:25,334 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 15:39:25,334 INFO L124 PetriNetUnfolderBase]: 2/69 cut-off events. [2024-10-24 15:39:25,334 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 15:39:25,334 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:25,335 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] [2024-10-24 15:39:25,335 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2024-10-24 15:39:25,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:25,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1715225192, now seen corresponding path program 1 times [2024-10-24 15:39:25,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:25,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039271159] [2024-10-24 15:39:25,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:25,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:25,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:25,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:25,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039271159] [2024-10-24 15:39:25,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039271159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:25,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:25,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:25,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100908084] [2024-10-24 15:39:25,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:25,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:25,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:25,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:25,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:25,434 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 233 [2024-10-24 15:39:25,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 233 transitions, 484 flow. Second operand has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:25,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:25,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 233 [2024-10-24 15:39:25,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:53,127 INFO L124 PetriNetUnfolderBase]: 119918/257830 cut-off events. [2024-10-24 15:39:53,127 INFO L125 PetriNetUnfolderBase]: For 1618/1618 co-relation queries the response was YES. [2024-10-24 15:39:54,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426208 conditions, 257830 events. 119918/257830 cut-off events. For 1618/1618 co-relation queries the response was YES. Maximal size of possible extension queue 5101. Compared 3349983 event pairs, 42479 based on Foata normal form. 5027/232059 useless extension candidates. Maximal degree in co-relation 332503. Up to 93558 conditions per place. [2024-10-24 15:39:55,415 INFO L140 encePairwiseOnDemand]: 203/233 looper letters, 76 selfloop transitions, 20 changer transitions 1/274 dead transitions. [2024-10-24 15:39:55,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 274 transitions, 770 flow [2024-10-24 15:39:55,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:55,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 642 transitions. [2024-10-24 15:39:55,417 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9184549356223176 [2024-10-24 15:39:55,417 INFO L175 Difference]: Start difference. First operand has 236 places, 233 transitions, 484 flow. Second operand 3 states and 642 transitions. [2024-10-24 15:39:55,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 274 transitions, 770 flow [2024-10-24 15:39:55,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 274 transitions, 766 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-10-24 15:39:55,422 INFO L231 Difference]: Finished difference. Result has 240 places, 249 transitions, 648 flow [2024-10-24 15:39:55,422 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=240, PETRI_TRANSITIONS=249} [2024-10-24 15:39:55,423 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, 4 predicate places. [2024-10-24 15:39:55,423 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 249 transitions, 648 flow [2024-10-24 15:39:55,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:55,424 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:55,424 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:55,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 15:39:55,424 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2024-10-24 15:39:55,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:55,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1775897881, now seen corresponding path program 1 times [2024-10-24 15:39:55,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:55,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604096684] [2024-10-24 15:39:55,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:55,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:55,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:55,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:55,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604096684] [2024-10-24 15:39:55,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604096684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:55,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:55,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:55,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114395687] [2024-10-24 15:39:55,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:55,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:55,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:55,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:55,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:55,472 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 233 [2024-10-24 15:39:55,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 249 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:55,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:55,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 233 [2024-10-24 15:39:55,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand