./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race.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 47827fdca8ccc83dae99015d656cdcf2872ea585121905304e5ffb2ef40b4eac --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:52:01,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:52:01,552 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-16 23:52:01,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:52:01,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:52:01,581 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:52:01,582 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:52:01,583 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:52:01,584 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:52:01,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:52:01,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:52:01,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:52:01,585 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:52:01,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:52:01,585 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:52:01,586 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:52:01,586 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:52:01,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:52:01,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:52:01,586 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:52:01,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:52:01,589 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:52:01,589 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-16 23:52:01,590 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:52:01,590 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:52:01,590 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:52:01,590 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:52:01,590 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:52:01,590 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:52:01,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:52:01,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:52:01,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:52:01,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:52:01,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:52:01,591 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 23:52:01,591 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:52:01,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:52:01,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:52:01,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:52:01,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:52:01,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:52:01,594 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 -> 47827fdca8ccc83dae99015d656cdcf2872ea585121905304e5ffb2ef40b4eac [2024-11-16 23:52:01,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:52:01,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:52:01,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:52:01,843 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:52:01,843 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:52:01,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race.i [2024-11-16 23:52:03,240 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:52:03,451 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:52:03,452 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race.i [2024-11-16 23:52:03,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c2fa263a/fa49235b57d7472b879e2b284360859c/FLAG56d1edf56 [2024-11-16 23:52:03,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c2fa263a/fa49235b57d7472b879e2b284360859c [2024-11-16 23:52:03,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:52:03,483 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:52:03,484 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:52:03,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:52:03,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:52:03,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:52:03" (1/1) ... [2024-11-16 23:52:03,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38b96d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:03, skipping insertion in model container [2024-11-16 23:52:03,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:52:03" (1/1) ... [2024-11-16 23:52:03,530 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:52:03,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:52:03,812 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:52:03,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:52:03,892 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:52:03,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:03 WrapperNode [2024-11-16 23:52:03,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:52:03,894 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:52:03,894 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:52:03,894 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:52:03,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:03" (1/1) ... [2024-11-16 23:52:03,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:03" (1/1) ... [2024-11-16 23:52:03,932 INFO L138 Inliner]: procedures = 159, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57 [2024-11-16 23:52:03,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:52:03,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:52:03,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:52:03,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:52:03,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:03" (1/1) ... [2024-11-16 23:52:03,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:03" (1/1) ... [2024-11-16 23:52:03,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:03" (1/1) ... [2024-11-16 23:52:03,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:03" (1/1) ... [2024-11-16 23:52:03,951 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:03" (1/1) ... [2024-11-16 23:52:03,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:03" (1/1) ... [2024-11-16 23:52:03,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:03" (1/1) ... [2024-11-16 23:52:03,953 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:03" (1/1) ... [2024-11-16 23:52:03,955 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:52:03,955 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:52:03,956 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:52:03,956 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:52:03,956 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:03" (1/1) ... [2024-11-16 23:52:03,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:52:03,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:52:03,988 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 23:52:03,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 23:52:04,031 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-16 23:52:04,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:52:04,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 23:52:04,033 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-16 23:52:04,033 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-16 23:52:04,033 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-16 23:52:04,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:52:04,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:52:04,035 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 23:52:04,148 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:52:04,149 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:52:04,264 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 23:52:04,265 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:52:04,283 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:52:04,284 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:52:04,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:52:04 BoogieIcfgContainer [2024-11-16 23:52:04,284 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:52:04,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:52:04,286 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:52:04,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:52:04,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:52:03" (1/3) ... [2024-11-16 23:52:04,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcfcf6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:52:04, skipping insertion in model container [2024-11-16 23:52:04,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:03" (2/3) ... [2024-11-16 23:52:04,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcfcf6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:52:04, skipping insertion in model container [2024-11-16 23:52:04,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:52:04" (3/3) ... [2024-11-16 23:52:04,290 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race.i [2024-11-16 23:52:04,302 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:52:04,302 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-16 23:52:04,302 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 23:52:04,337 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-16 23:52:04,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 96 transitions, 196 flow [2024-11-16 23:52:04,422 INFO L124 PetriNetUnfolderBase]: 7/129 cut-off events. [2024-11-16 23:52:04,426 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:52:04,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 129 events. 7/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 186 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 68. Up to 4 conditions per place. [2024-11-16 23:52:04,431 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 96 transitions, 196 flow [2024-11-16 23:52:04,439 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 96 transitions, 196 flow [2024-11-16 23:52:04,446 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:52:04,451 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;@3c6cc082, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:52:04,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-16 23:52:04,481 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:52:04,488 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2024-11-16 23:52:04,489 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:52:04,489 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:04,489 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] [2024-11-16 23:52:04,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-16 23:52:04,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:04,498 INFO L85 PathProgramCache]: Analyzing trace with hash 122296049, now seen corresponding path program 1 times [2024-11-16 23:52:04,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:04,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241602434] [2024-11-16 23:52:04,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:04,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:04,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:04,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:52:04,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241602434] [2024-11-16 23:52:04,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241602434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:52:04,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:52:04,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:52:04,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726187909] [2024-11-16 23:52:04,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:52:04,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:52:04,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:52:04,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:52:04,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:52:04,737 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 96 [2024-11-16 23:52:04,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 96 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:04,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:52:04,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 96 [2024-11-16 23:52:04,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:52:04,823 INFO L124 PetriNetUnfolderBase]: 32/295 cut-off events. [2024-11-16 23:52:04,825 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-16 23:52:04,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 382 conditions, 295 events. 32/295 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1188 event pairs, 7 based on Foata normal form. 7/271 useless extension candidates. Maximal degree in co-relation 311. Up to 59 conditions per place. [2024-11-16 23:52:04,830 INFO L140 encePairwiseOnDemand]: 82/96 looper letters, 16 selfloop transitions, 8 changer transitions 1/103 dead transitions. [2024-11-16 23:52:04,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 103 transitions, 258 flow [2024-11-16 23:52:04,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:52:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:52:04,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 269 transitions. [2024-11-16 23:52:04,845 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9340277777777778 [2024-11-16 23:52:04,847 INFO L175 Difference]: Start difference. First operand has 95 places, 96 transitions, 196 flow. Second operand 3 states and 269 transitions. [2024-11-16 23:52:04,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 103 transitions, 258 flow [2024-11-16 23:52:04,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 103 transitions, 258 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:52:04,855 INFO L231 Difference]: Finished difference. Result has 99 places, 100 transitions, 258 flow [2024-11-16 23:52:04,857 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=99, PETRI_TRANSITIONS=100} [2024-11-16 23:52:04,862 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, 4 predicate places. [2024-11-16 23:52:04,862 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 100 transitions, 258 flow [2024-11-16 23:52:04,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:04,863 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:04,863 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] [2024-11-16 23:52:04,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 23:52:04,863 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-16 23:52:04,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:04,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1596742808, now seen corresponding path program 1 times [2024-11-16 23:52:04,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:04,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610349258] [2024-11-16 23:52:04,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:04,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:04,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:52:04,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610349258] [2024-11-16 23:52:04,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610349258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:52:04,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:52:04,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:52:04,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069048631] [2024-11-16 23:52:04,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:52:04,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:52:04,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:52:04,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:52:04,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:52:04,940 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 96 [2024-11-16 23:52:04,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 100 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:04,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:52:04,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 96 [2024-11-16 23:52:04,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:52:05,012 INFO L124 PetriNetUnfolderBase]: 27/310 cut-off events. [2024-11-16 23:52:05,013 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-16 23:52:05,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 310 events. 27/310 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1401 event pairs, 5 based on Foata normal form. 0/279 useless extension candidates. Maximal degree in co-relation 360. Up to 45 conditions per place. [2024-11-16 23:52:05,016 INFO L140 encePairwiseOnDemand]: 92/96 looper letters, 8 selfloop transitions, 3 changer transitions 0/104 dead transitions. [2024-11-16 23:52:05,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 104 transitions, 288 flow [2024-11-16 23:52:05,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:52:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:52:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2024-11-16 23:52:05,020 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9375 [2024-11-16 23:52:05,020 INFO L175 Difference]: Start difference. First operand has 99 places, 100 transitions, 258 flow. Second operand 3 states and 270 transitions. [2024-11-16 23:52:05,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 104 transitions, 288 flow [2024-11-16 23:52:05,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 104 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:52:05,025 INFO L231 Difference]: Finished difference. Result has 100 places, 102 transitions, 264 flow [2024-11-16 23:52:05,025 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=100, PETRI_TRANSITIONS=102} [2024-11-16 23:52:05,026 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, 5 predicate places. [2024-11-16 23:52:05,026 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 102 transitions, 264 flow [2024-11-16 23:52:05,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:05,027 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:05,027 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:52:05,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 23:52:05,027 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-16 23:52:05,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:05,030 INFO L85 PathProgramCache]: Analyzing trace with hash 635998555, now seen corresponding path program 1 times [2024-11-16 23:52:05,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:05,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110639979] [2024-11-16 23:52:05,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:05,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:05,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:05,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:52:05,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110639979] [2024-11-16 23:52:05,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110639979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:52:05,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:52:05,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:52:05,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901338147] [2024-11-16 23:52:05,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:52:05,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:52:05,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:52:05,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:52:05,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:52:05,130 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 96 [2024-11-16 23:52:05,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 102 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:05,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:52:05,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 96 [2024-11-16 23:52:05,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:52:05,190 INFO L124 PetriNetUnfolderBase]: 54/458 cut-off events. [2024-11-16 23:52:05,190 INFO L125 PetriNetUnfolderBase]: For 63/71 co-relation queries the response was YES. [2024-11-16 23:52:05,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 458 events. 54/458 cut-off events. For 63/71 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2509 event pairs, 23 based on Foata normal form. 4/418 useless extension candidates. Maximal degree in co-relation 628. Up to 104 conditions per place. [2024-11-16 23:52:05,194 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 19 selfloop transitions, 7 changer transitions 0/109 dead transitions. [2024-11-16 23:52:05,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 109 transitions, 336 flow [2024-11-16 23:52:05,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:52:05,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:52:05,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2024-11-16 23:52:05,196 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8958333333333334 [2024-11-16 23:52:05,196 INFO L175 Difference]: Start difference. First operand has 100 places, 102 transitions, 264 flow. Second operand 3 states and 258 transitions. [2024-11-16 23:52:05,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 109 transitions, 336 flow [2024-11-16 23:52:05,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 109 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:52:05,201 INFO L231 Difference]: Finished difference. Result has 102 places, 107 transitions, 314 flow [2024-11-16 23:52:05,201 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=102, PETRI_TRANSITIONS=107} [2024-11-16 23:52:05,202 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, 7 predicate places. [2024-11-16 23:52:05,202 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 107 transitions, 314 flow [2024-11-16 23:52:05,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:05,202 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:05,202 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] [2024-11-16 23:52:05,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 23:52:05,202 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-16 23:52:05,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:05,203 INFO L85 PathProgramCache]: Analyzing trace with hash 559259253, now seen corresponding path program 1 times [2024-11-16 23:52:05,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:05,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920959899] [2024-11-16 23:52:05,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:05,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:05,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:05,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:52:05,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920959899] [2024-11-16 23:52:05,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920959899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:52:05,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:52:05,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:52:05,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650128829] [2024-11-16 23:52:05,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:52:05,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:52:05,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:52:05,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:52:05,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:52:05,288 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 96 [2024-11-16 23:52:05,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 107 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:05,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:52:05,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 96 [2024-11-16 23:52:05,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:52:05,324 INFO L124 PetriNetUnfolderBase]: 36/368 cut-off events. [2024-11-16 23:52:05,324 INFO L125 PetriNetUnfolderBase]: For 62/69 co-relation queries the response was YES. [2024-11-16 23:52:05,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 368 events. 36/368 cut-off events. For 62/69 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1949 event pairs, 8 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 496. Up to 51 conditions per place. [2024-11-16 23:52:05,327 INFO L140 encePairwiseOnDemand]: 91/96 looper letters, 8 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2024-11-16 23:52:05,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 110 transitions, 348 flow [2024-11-16 23:52:05,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:52:05,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:52:05,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2024-11-16 23:52:05,328 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9201388888888888 [2024-11-16 23:52:05,328 INFO L175 Difference]: Start difference. First operand has 102 places, 107 transitions, 314 flow. Second operand 3 states and 265 transitions. [2024-11-16 23:52:05,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 110 transitions, 348 flow [2024-11-16 23:52:05,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 110 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:52:05,331 INFO L231 Difference]: Finished difference. Result has 104 places, 110 transitions, 336 flow [2024-11-16 23:52:05,332 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=104, PETRI_TRANSITIONS=110} [2024-11-16 23:52:05,334 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, 9 predicate places. [2024-11-16 23:52:05,334 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 110 transitions, 336 flow [2024-11-16 23:52:05,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:05,334 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:05,334 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-11-16 23:52:05,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 23:52:05,335 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-16 23:52:05,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:05,337 INFO L85 PathProgramCache]: Analyzing trace with hash -218752092, now seen corresponding path program 1 times [2024-11-16 23:52:05,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:05,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039970847] [2024-11-16 23:52:05,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:05,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:05,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:05,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:52:05,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039970847] [2024-11-16 23:52:05,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039970847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:52:05,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:52:05,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:52:05,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506933144] [2024-11-16 23:52:05,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:52:05,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:52:05,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:52:05,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:52:05,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:52:05,469 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 96 [2024-11-16 23:52:05,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 110 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:05,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:52:05,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 96 [2024-11-16 23:52:05,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:52:05,553 INFO L124 PetriNetUnfolderBase]: 64/481 cut-off events. [2024-11-16 23:52:05,553 INFO L125 PetriNetUnfolderBase]: For 156/164 co-relation queries the response was YES. [2024-11-16 23:52:05,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 882 conditions, 481 events. 64/481 cut-off events. For 156/164 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2705 event pairs, 13 based on Foata normal form. 1/449 useless extension candidates. Maximal degree in co-relation 797. Up to 109 conditions per place. [2024-11-16 23:52:05,555 INFO L140 encePairwiseOnDemand]: 89/96 looper letters, 16 selfloop transitions, 11 changer transitions 1/117 dead transitions. [2024-11-16 23:52:05,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 117 transitions, 418 flow [2024-11-16 23:52:05,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:52:05,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:52:05,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2024-11-16 23:52:05,556 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.90625 [2024-11-16 23:52:05,556 INFO L175 Difference]: Start difference. First operand has 104 places, 110 transitions, 336 flow. Second operand 3 states and 261 transitions. [2024-11-16 23:52:05,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 117 transitions, 418 flow [2024-11-16 23:52:05,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 117 transitions, 408 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:52:05,560 INFO L231 Difference]: Finished difference. Result has 106 places, 116 transitions, 410 flow [2024-11-16 23:52:05,560 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=106, PETRI_TRANSITIONS=116} [2024-11-16 23:52:05,560 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, 11 predicate places. [2024-11-16 23:52:05,561 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 116 transitions, 410 flow [2024-11-16 23:52:05,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:05,561 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:05,561 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-16 23:52:05,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 23:52:05,561 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-16 23:52:05,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:05,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1204342742, now seen corresponding path program 1 times [2024-11-16 23:52:05,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:05,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429131261] [2024-11-16 23:52:05,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:05,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:05,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:05,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:52:05,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429131261] [2024-11-16 23:52:05,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429131261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:52:05,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524657602] [2024-11-16 23:52:05,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:05,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:52:05,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:52:05,720 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 23:52:05,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 23:52:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:05,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 23:52:05,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:52:05,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:05,902 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:52:05,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524657602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:52:05,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 23:52:05,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-16 23:52:05,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573552713] [2024-11-16 23:52:05,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:52:05,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 23:52:05,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:52:05,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 23:52:05,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-16 23:52:05,922 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 96 [2024-11-16 23:52:05,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 116 transitions, 410 flow. Second operand has 5 states, 5 states have (on average 82.6) internal successors, (413), 5 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:05,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:52:05,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 96 [2024-11-16 23:52:05,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:52:06,007 INFO L124 PetriNetUnfolderBase]: 79/552 cut-off events. [2024-11-16 23:52:06,008 INFO L125 PetriNetUnfolderBase]: For 321/336 co-relation queries the response was YES. [2024-11-16 23:52:06,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1117 conditions, 552 events. 79/552 cut-off events. For 321/336 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3446 event pairs, 9 based on Foata normal form. 5/527 useless extension candidates. Maximal degree in co-relation 1016. Up to 85 conditions per place. [2024-11-16 23:52:06,011 INFO L140 encePairwiseOnDemand]: 89/96 looper letters, 13 selfloop transitions, 10 changer transitions 2/123 dead transitions. [2024-11-16 23:52:06,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 123 transitions, 458 flow [2024-11-16 23:52:06,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 23:52:06,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-16 23:52:06,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 593 transitions. [2024-11-16 23:52:06,012 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8824404761904762 [2024-11-16 23:52:06,013 INFO L175 Difference]: Start difference. First operand has 106 places, 116 transitions, 410 flow. Second operand 7 states and 593 transitions. [2024-11-16 23:52:06,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 123 transitions, 458 flow [2024-11-16 23:52:06,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 123 transitions, 422 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-11-16 23:52:06,017 INFO L231 Difference]: Finished difference. Result has 107 places, 117 transitions, 398 flow [2024-11-16 23:52:06,017 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=398, PETRI_PLACES=107, PETRI_TRANSITIONS=117} [2024-11-16 23:52:06,017 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, 12 predicate places. [2024-11-16 23:52:06,018 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 117 transitions, 398 flow [2024-11-16 23:52:06,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.6) internal successors, (413), 5 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:06,018 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:06,018 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:52:06,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 23:52:06,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 23:52:06,223 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-16 23:52:06,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:06,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1362344536, now seen corresponding path program 1 times [2024-11-16 23:52:06,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:06,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140858633] [2024-11-16 23:52:06,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:06,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:52:06,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 23:52:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:52:06,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 23:52:06,281 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 23:52:06,281 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-11-16 23:52:06,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-11-16 23:52:06,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-11-16 23:52:06,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-11-16 23:52:06,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-11-16 23:52:06,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-11-16 23:52:06,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-11-16 23:52:06,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-11-16 23:52:06,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-11-16 23:52:06,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-11-16 23:52:06,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-11-16 23:52:06,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 23:52:06,286 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:52:06,288 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-16 23:52:06,288 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-16 23:52:06,304 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-16 23:52:06,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 124 transitions, 258 flow [2024-11-16 23:52:06,328 INFO L124 PetriNetUnfolderBase]: 10/198 cut-off events. [2024-11-16 23:52:06,329 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-16 23:52:06,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 198 events. 10/198 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 328 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 130. Up to 6 conditions per place. [2024-11-16 23:52:06,329 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 124 transitions, 258 flow [2024-11-16 23:52:06,330 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 124 transitions, 258 flow [2024-11-16 23:52:06,332 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:52:06,333 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;@3c6cc082, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:52:06,333 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-16 23:52:06,335 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:52:06,336 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2024-11-16 23:52:06,336 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:52:06,336 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:06,336 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] [2024-11-16 23:52:06,336 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-16 23:52:06,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:06,336 INFO L85 PathProgramCache]: Analyzing trace with hash 982798321, now seen corresponding path program 1 times [2024-11-16 23:52:06,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:06,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519004082] [2024-11-16 23:52:06,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:06,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:06,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:52:06,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519004082] [2024-11-16 23:52:06,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519004082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:52:06,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:52:06,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:52:06,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351028354] [2024-11-16 23:52:06,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:52:06,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:52:06,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:52:06,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:52:06,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:52:06,386 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 124 [2024-11-16 23:52:06,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 124 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:06,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:52:06,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 124 [2024-11-16 23:52:06,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:52:06,611 INFO L124 PetriNetUnfolderBase]: 563/2350 cut-off events. [2024-11-16 23:52:06,611 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-16 23:52:06,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3380 conditions, 2350 events. 563/2350 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 19436 event pairs, 195 based on Foata normal form. 53/2146 useless extension candidates. Maximal degree in co-relation 2680. Up to 666 conditions per place. [2024-11-16 23:52:06,628 INFO L140 encePairwiseOnDemand]: 106/124 looper letters, 26 selfloop transitions, 11 changer transitions 1/137 dead transitions. [2024-11-16 23:52:06,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 137 transitions, 363 flow [2024-11-16 23:52:06,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:52:06,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:52:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2024-11-16 23:52:06,630 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9301075268817204 [2024-11-16 23:52:06,630 INFO L175 Difference]: Start difference. First operand has 125 places, 124 transitions, 258 flow. Second operand 3 states and 346 transitions. [2024-11-16 23:52:06,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 137 transitions, 363 flow [2024-11-16 23:52:06,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 137 transitions, 363 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:52:06,633 INFO L231 Difference]: Finished difference. Result has 129 places, 131 transitions, 346 flow [2024-11-16 23:52:06,633 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=129, PETRI_TRANSITIONS=131} [2024-11-16 23:52:06,633 INFO L277 CegarLoopForPetriNet]: 125 programPoint places, 4 predicate places. [2024-11-16 23:52:06,634 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 131 transitions, 346 flow [2024-11-16 23:52:06,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:06,634 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:06,634 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] [2024-11-16 23:52:06,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 23:52:06,634 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-16 23:52:06,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:06,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1116969832, now seen corresponding path program 1 times [2024-11-16 23:52:06,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:06,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16082572] [2024-11-16 23:52:06,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:06,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:06,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:06,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:52:06,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16082572] [2024-11-16 23:52:06,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16082572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:52:06,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:52:06,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:52:06,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024937597] [2024-11-16 23:52:06,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:52:06,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:52:06,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:52:06,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:52:06,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:52:06,673 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 124 [2024-11-16 23:52:06,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 131 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:06,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:52:06,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 124 [2024-11-16 23:52:06,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:52:06,956 INFO L124 PetriNetUnfolderBase]: 497/2659 cut-off events. [2024-11-16 23:52:06,957 INFO L125 PetriNetUnfolderBase]: For 237/245 co-relation queries the response was YES. [2024-11-16 23:52:06,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4071 conditions, 2659 events. 497/2659 cut-off events. For 237/245 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 24889 event pairs, 168 based on Foata normal form. 0/2374 useless extension candidates. Maximal degree in co-relation 3199. Up to 510 conditions per place. [2024-11-16 23:52:06,976 INFO L140 encePairwiseOnDemand]: 119/124 looper letters, 14 selfloop transitions, 4 changer transitions 0/138 dead transitions. [2024-11-16 23:52:06,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 138 transitions, 396 flow [2024-11-16 23:52:06,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:52:06,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:52:06,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2024-11-16 23:52:06,978 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9381720430107527 [2024-11-16 23:52:06,978 INFO L175 Difference]: Start difference. First operand has 129 places, 131 transitions, 346 flow. Second operand 3 states and 349 transitions. [2024-11-16 23:52:06,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 138 transitions, 396 flow [2024-11-16 23:52:06,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 138 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:52:06,982 INFO L231 Difference]: Finished difference. Result has 130 places, 134 transitions, 354 flow [2024-11-16 23:52:06,983 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=130, PETRI_TRANSITIONS=134} [2024-11-16 23:52:06,984 INFO L277 CegarLoopForPetriNet]: 125 programPoint places, 5 predicate places. [2024-11-16 23:52:06,984 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 134 transitions, 354 flow [2024-11-16 23:52:06,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:06,985 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:06,985 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] [2024-11-16 23:52:06,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 23:52:06,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-16 23:52:06,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:06,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1138255401, now seen corresponding path program 1 times [2024-11-16 23:52:06,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:06,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882504502] [2024-11-16 23:52:06,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:06,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:07,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:07,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:52:07,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882504502] [2024-11-16 23:52:07,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882504502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:52:07,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:52:07,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:52:07,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732592236] [2024-11-16 23:52:07,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:52:07,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:52:07,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:52:07,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:52:07,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:52:07,042 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 124 [2024-11-16 23:52:07,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 134 transitions, 354 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:07,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:52:07,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 124 [2024-11-16 23:52:07,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:52:07,138 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L704-->L704-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][36], [124#true, Black: 128#true, 138#true, Black: 135#(= |#race~data~0| 0), 102#L689true, 46#L704-2true, 133#true, 118#L692-6true, 126#true]) [2024-11-16 23:52:07,138 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-11-16 23:52:07,138 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-16 23:52:07,138 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2024-11-16 23:52:07,138 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2024-11-16 23:52:07,240 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L704-->L704-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][36], [124#true, Black: 128#true, 104#L691true, Black: 135#(= |#race~data~0| 0), 138#true, 133#true, 46#L704-2true, 118#L692-6true, 126#true]) [2024-11-16 23:52:07,240 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2024-11-16 23:52:07,240 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-16 23:52:07,240 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-11-16 23:52:07,240 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-16 23:52:07,389 INFO L124 PetriNetUnfolderBase]: 1077/4637 cut-off events. [2024-11-16 23:52:07,389 INFO L125 PetriNetUnfolderBase]: For 834/975 co-relation queries the response was YES. [2024-11-16 23:52:07,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7778 conditions, 4637 events. 1077/4637 cut-off events. For 834/975 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 46274 event pairs, 539 based on Foata normal form. 39/4078 useless extension candidates. Maximal degree in co-relation 6530. Up to 1374 conditions per place. [2024-11-16 23:52:07,418 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 28 selfloop transitions, 12 changer transitions 0/148 dead transitions. [2024-11-16 23:52:07,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 148 transitions, 478 flow [2024-11-16 23:52:07,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:52:07,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:52:07,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2024-11-16 23:52:07,419 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9032258064516129 [2024-11-16 23:52:07,420 INFO L175 Difference]: Start difference. First operand has 130 places, 134 transitions, 354 flow. Second operand 3 states and 336 transitions. [2024-11-16 23:52:07,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 148 transitions, 478 flow [2024-11-16 23:52:07,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 148 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:52:07,423 INFO L231 Difference]: Finished difference. Result has 132 places, 144 transitions, 452 flow [2024-11-16 23:52:07,423 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=132, PETRI_TRANSITIONS=144} [2024-11-16 23:52:07,424 INFO L277 CegarLoopForPetriNet]: 125 programPoint places, 7 predicate places. [2024-11-16 23:52:07,424 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 144 transitions, 452 flow [2024-11-16 23:52:07,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:07,425 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:07,425 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] [2024-11-16 23:52:07,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 23:52:07,425 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-16 23:52:07,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:07,425 INFO L85 PathProgramCache]: Analyzing trace with hash -14214858, now seen corresponding path program 1 times [2024-11-16 23:52:07,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:07,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912224709] [2024-11-16 23:52:07,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:07,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:07,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:07,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:52:07,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912224709] [2024-11-16 23:52:07,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912224709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:52:07,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:52:07,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:52:07,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971314853] [2024-11-16 23:52:07,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:52:07,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:52:07,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:52:07,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:52:07,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:52:07,461 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 124 [2024-11-16 23:52:07,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 144 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:07,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:52:07,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 124 [2024-11-16 23:52:07,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:52:07,752 INFO L124 PetriNetUnfolderBase]: 779/4021 cut-off events. [2024-11-16 23:52:07,752 INFO L125 PetriNetUnfolderBase]: For 1045/1280 co-relation queries the response was YES. [2024-11-16 23:52:07,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6880 conditions, 4021 events. 779/4021 cut-off events. For 1045/1280 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 42247 event pairs, 259 based on Foata normal form. 5/3542 useless extension candidates. Maximal degree in co-relation 5943. Up to 718 conditions per place. [2024-11-16 23:52:07,777 INFO L140 encePairwiseOnDemand]: 118/124 looper letters, 16 selfloop transitions, 7 changer transitions 0/152 dead transitions. [2024-11-16 23:52:07,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 152 transitions, 525 flow [2024-11-16 23:52:07,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:52:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:52:07,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2024-11-16 23:52:07,779 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9274193548387096 [2024-11-16 23:52:07,779 INFO L175 Difference]: Start difference. First operand has 132 places, 144 transitions, 452 flow. Second operand 3 states and 345 transitions. [2024-11-16 23:52:07,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 152 transitions, 525 flow [2024-11-16 23:52:07,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 152 transitions, 501 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:52:07,785 INFO L231 Difference]: Finished difference. Result has 134 places, 149 transitions, 484 flow [2024-11-16 23:52:07,786 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=484, PETRI_PLACES=134, PETRI_TRANSITIONS=149} [2024-11-16 23:52:07,786 INFO L277 CegarLoopForPetriNet]: 125 programPoint places, 9 predicate places. [2024-11-16 23:52:07,786 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 149 transitions, 484 flow [2024-11-16 23:52:07,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:07,787 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:07,787 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-11-16 23:52:07,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 23:52:07,787 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-16 23:52:07,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:07,787 INFO L85 PathProgramCache]: Analyzing trace with hash 2097033535, now seen corresponding path program 1 times [2024-11-16 23:52:07,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:07,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007423384] [2024-11-16 23:52:07,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:07,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:07,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:07,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:52:07,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007423384] [2024-11-16 23:52:07,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007423384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:52:07,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:52:07,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:52:07,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916257972] [2024-11-16 23:52:07,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:52:07,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:52:07,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:52:07,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:52:07,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:52:07,838 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 124 [2024-11-16 23:52:07,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 149 transitions, 484 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:07,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:52:07,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 124 [2024-11-16 23:52:07,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:52:07,938 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L704-->L704-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][36], [Black: 145#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 124#true, Black: 128#true, 143#true, Black: 135#(= |#race~data~0| 0), 102#L689true, 46#L704-2true, 148#true, 118#L692-6true, Black: 140#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 126#true]) [2024-11-16 23:52:07,938 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-11-16 23:52:07,938 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-16 23:52:07,938 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2024-11-16 23:52:07,939 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2024-11-16 23:52:08,060 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L704-->L704-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][36], [124#true, Black: 145#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 128#true, 143#true, 104#L691true, Black: 135#(= |#race~data~0| 0), 46#L704-2true, 148#true, 118#L692-6true, 126#true, Black: 140#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|)]) [2024-11-16 23:52:08,060 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2024-11-16 23:52:08,060 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-16 23:52:08,060 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-16 23:52:08,060 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-11-16 23:52:08,168 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L704-->L704-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][121], [124#true, Black: 145#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 99#L692-1true, Black: 128#true, 143#true, Black: 135#(= |#race~data~0| 0), 41#L692-6true, 46#L704-2true, 148#true, Black: 140#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 126#true]) [2024-11-16 23:52:08,168 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2024-11-16 23:52:08,168 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-16 23:52:08,168 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-11-16 23:52:08,168 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-16 23:52:08,280 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L704-->L704-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][36], [Black: 145#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 124#true, Black: 128#true, 143#true, Black: 135#(= |#race~data~0| 0), 41#L692-6true, 46#L704-2true, 148#true, 52#L693true, Black: 140#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 126#true]) [2024-11-16 23:52:08,280 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2024-11-16 23:52:08,280 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-16 23:52:08,280 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-16 23:52:08,280 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-11-16 23:52:08,358 INFO L124 PetriNetUnfolderBase]: 1586/6324 cut-off events. [2024-11-16 23:52:08,358 INFO L125 PetriNetUnfolderBase]: For 3302/3582 co-relation queries the response was YES. [2024-11-16 23:52:08,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12398 conditions, 6324 events. 1586/6324 cut-off events. For 3302/3582 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 66569 event pairs, 515 based on Foata normal form. 46/5559 useless extension candidates. Maximal degree in co-relation 10315. Up to 1835 conditions per place. [2024-11-16 23:52:08,441 INFO L140 encePairwiseOnDemand]: 115/124 looper letters, 31 selfloop transitions, 19 changer transitions 0/167 dead transitions. [2024-11-16 23:52:08,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 167 transitions, 669 flow [2024-11-16 23:52:08,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:52:08,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:52:08,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2024-11-16 23:52:08,444 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9139784946236559 [2024-11-16 23:52:08,444 INFO L175 Difference]: Start difference. First operand has 134 places, 149 transitions, 484 flow. Second operand 3 states and 340 transitions. [2024-11-16 23:52:08,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 167 transitions, 669 flow [2024-11-16 23:52:08,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 167 transitions, 655 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:52:08,447 INFO L231 Difference]: Finished difference. Result has 136 places, 164 transitions, 652 flow [2024-11-16 23:52:08,448 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=652, PETRI_PLACES=136, PETRI_TRANSITIONS=164} [2024-11-16 23:52:08,448 INFO L277 CegarLoopForPetriNet]: 125 programPoint places, 11 predicate places. [2024-11-16 23:52:08,448 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 164 transitions, 652 flow [2024-11-16 23:52:08,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:08,449 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:08,449 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-16 23:52:08,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 23:52:08,449 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-16 23:52:08,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:08,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1098850575, now seen corresponding path program 1 times [2024-11-16 23:52:08,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:08,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603938444] [2024-11-16 23:52:08,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:08,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:08,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:08,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:52:08,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603938444] [2024-11-16 23:52:08,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603938444] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:52:08,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185774324] [2024-11-16 23:52:08,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:08,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:52:08,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:52:08,512 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 23:52:08,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 23:52:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:08,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 23:52:08,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:52:08,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:08,632 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:52:08,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185774324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:52:08,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 23:52:08,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-16 23:52:08,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088126380] [2024-11-16 23:52:08,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:52:08,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 23:52:08,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:52:08,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 23:52:08,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-16 23:52:08,652 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 124 [2024-11-16 23:52:08,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 164 transitions, 652 flow. Second operand has 5 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:08,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:52:08,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 124 [2024-11-16 23:52:08,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:52:09,234 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L704-->L704-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][127], [124#true, Black: 145#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 128#true, 99#L692-1true, Black: 135#(= |#race~data~0| 0), Black: 150#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 41#L692-6true, 148#true, 46#L704-2true, 153#true, 126#true, Black: 140#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|)]) [2024-11-16 23:52:09,235 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2024-11-16 23:52:09,235 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-11-16 23:52:09,235 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-16 23:52:09,235 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-16 23:52:09,236 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L704-->L704-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][127], [124#true, Black: 145#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 128#true, 99#L692-1true, Black: 135#(= |#race~data~0| 0), 41#L692-6true, Black: 150#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 157#(<= 1 ~threads_alive~0), 148#true, 46#L704-2true, 126#true, Black: 140#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|)]) [2024-11-16 23:52:09,237 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2024-11-16 23:52:09,237 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-16 23:52:09,237 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-16 23:52:09,237 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-11-16 23:52:09,385 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L704-->L704-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][36], [124#true, Black: 145#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 128#true, 96#L692-7true, Black: 150#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 135#(= |#race~data~0| 0), 46#L704-2true, 148#true, 153#true, Black: 140#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 52#L693true, 126#true]) [2024-11-16 23:52:09,385 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2024-11-16 23:52:09,385 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-16 23:52:09,385 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2024-11-16 23:52:09,385 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-16 23:52:09,387 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L704-->L704-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][36], [Black: 145#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 124#true, Black: 128#true, Black: 135#(= |#race~data~0| 0), Black: 150#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 41#L692-6true, 148#true, 46#L704-2true, 153#true, 52#L693true, Black: 140#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 126#true]) [2024-11-16 23:52:09,387 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2024-11-16 23:52:09,387 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-16 23:52:09,387 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-16 23:52:09,387 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-11-16 23:52:09,419 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([303] L704-->L704-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][36], [124#true, Black: 145#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 128#true, Black: 150#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 41#L692-6true, Black: 135#(= |#race~data~0| 0), 46#L704-2true, 148#true, 153#true, Black: 140#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 52#L693true, 126#true]) [2024-11-16 23:52:09,419 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2024-11-16 23:52:09,419 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-16 23:52:09,419 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-16 23:52:09,419 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-11-16 23:52:09,419 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-11-16 23:52:09,421 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L704-->L704-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][36], [124#true, Black: 145#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 128#true, 41#L692-6true, Black: 150#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 135#(= |#race~data~0| 0), 157#(<= 1 ~threads_alive~0), 46#L704-2true, 148#true, 126#true, 52#L693true, Black: 140#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|)]) [2024-11-16 23:52:09,421 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2024-11-16 23:52:09,421 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-11-16 23:52:09,421 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-16 23:52:09,421 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-16 23:52:09,495 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([249] L699-3-->L699-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_5| |v_#race~threads_alive~0_6|) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, #race~threads_alive~0=|v_#race~threads_alive~0_6|} AuxVars[] AssignedVars[#race~threads_alive~0][40], [9#L699-2true, 124#true, Black: 145#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 130#(= |#race~threads_alive~0| 0), 41#L692-6true, Black: 135#(= |#race~data~0| 0), Black: 150#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 148#true, 352#(and (<= 0 |ULTIMATE.start_main_#t~post7#1|) (<= 1 ~threads_alive~0)), 126#true, 52#L693true, Black: 138#true]) [2024-11-16 23:52:09,495 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is not cut-off event [2024-11-16 23:52:09,495 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is not cut-off event [2024-11-16 23:52:09,496 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is not cut-off event [2024-11-16 23:52:09,496 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is not cut-off event [2024-11-16 23:52:09,579 INFO L124 PetriNetUnfolderBase]: 2670/9859 cut-off events. [2024-11-16 23:52:09,579 INFO L125 PetriNetUnfolderBase]: For 7603/8494 co-relation queries the response was YES. [2024-11-16 23:52:09,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21267 conditions, 9859 events. 2670/9859 cut-off events. For 7603/8494 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 113462 event pairs, 387 based on Foata normal form. 102/8801 useless extension candidates. Maximal degree in co-relation 16919. Up to 2237 conditions per place. [2024-11-16 23:52:09,637 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 36 selfloop transitions, 14 changer transitions 2/199 dead transitions. [2024-11-16 23:52:09,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 199 transitions, 827 flow [2024-11-16 23:52:09,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 23:52:09,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-16 23:52:09,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 788 transitions. [2024-11-16 23:52:09,639 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9078341013824884 [2024-11-16 23:52:09,639 INFO L175 Difference]: Start difference. First operand has 136 places, 164 transitions, 652 flow. Second operand 7 states and 788 transitions. [2024-11-16 23:52:09,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 199 transitions, 827 flow [2024-11-16 23:52:09,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 199 transitions, 789 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:52:09,762 INFO L231 Difference]: Finished difference. Result has 143 places, 177 transitions, 693 flow [2024-11-16 23:52:09,763 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=693, PETRI_PLACES=143, PETRI_TRANSITIONS=177} [2024-11-16 23:52:09,763 INFO L277 CegarLoopForPetriNet]: 125 programPoint places, 18 predicate places. [2024-11-16 23:52:09,763 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 177 transitions, 693 flow [2024-11-16 23:52:09,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:09,764 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:09,764 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-16 23:52:09,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 23:52:09,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-16 23:52:09,970 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-16 23:52:09,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:09,970 INFO L85 PathProgramCache]: Analyzing trace with hash -568399627, now seen corresponding path program 1 times [2024-11-16 23:52:09,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:09,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223456988] [2024-11-16 23:52:09,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:09,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:52:09,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 23:52:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:52:09,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 23:52:09,992 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 23:52:09,992 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr1ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2024-11-16 23:52:09,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2024-11-16 23:52:09,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2024-11-16 23:52:09,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2024-11-16 23:52:09,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2024-11-16 23:52:09,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining) [2024-11-16 23:52:09,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2024-11-16 23:52:09,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2024-11-16 23:52:09,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2024-11-16 23:52:09,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2024-11-16 23:52:09,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2024-11-16 23:52:09,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2024-11-16 23:52:09,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2024-11-16 23:52:09,994 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2024-11-16 23:52:09,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 23:52:09,994 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:52:10,031 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-11-16 23:52:10,032 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 23:52:10,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:52:10 BasicIcfg [2024-11-16 23:52:10,037 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 23:52:10,038 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 23:52:10,038 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 23:52:10,038 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 23:52:10,038 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:52:04" (3/4) ... [2024-11-16 23:52:10,039 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 23:52:10,096 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 23:52:10,096 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 23:52:10,096 INFO L158 Benchmark]: Toolchain (without parser) took 6613.25ms. Allocated memory was 211.8MB in the beginning and 455.1MB in the end (delta: 243.3MB). Free memory was 139.9MB in the beginning and 289.4MB in the end (delta: -149.5MB). Peak memory consumption was 95.4MB. Max. memory is 16.1GB. [2024-11-16 23:52:10,097 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory was 84.5MB in the beginning and 84.4MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 23:52:10,097 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.32ms. Allocated memory is still 211.8MB. Free memory was 139.5MB in the beginning and 118.0MB in the end (delta: 21.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-16 23:52:10,097 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.01ms. Allocated memory is still 211.8MB. Free memory was 118.0MB in the beginning and 115.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 23:52:10,097 INFO L158 Benchmark]: Boogie Preprocessor took 17.83ms. Allocated memory is still 211.8MB. Free memory was 115.9MB in the beginning and 114.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 23:52:10,097 INFO L158 Benchmark]: IcfgBuilder took 328.87ms. Allocated memory is still 211.8MB. Free memory was 114.7MB in the beginning and 99.2MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 23:52:10,097 INFO L158 Benchmark]: TraceAbstraction took 5751.66ms. Allocated memory was 211.8MB in the beginning and 455.1MB in the end (delta: 243.3MB). Free memory was 98.4MB in the beginning and 297.8MB in the end (delta: -199.4MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. [2024-11-16 23:52:10,097 INFO L158 Benchmark]: Witness Printer took 58.19ms. Allocated memory is still 455.1MB. Free memory was 297.8MB in the beginning and 289.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 23:52:10,098 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory was 84.5MB in the beginning and 84.4MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.32ms. Allocated memory is still 211.8MB. Free memory was 139.5MB in the beginning and 118.0MB in the end (delta: 21.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.01ms. Allocated memory is still 211.8MB. Free memory was 118.0MB in the beginning and 115.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.83ms. Allocated memory is still 211.8MB. Free memory was 115.9MB in the beginning and 114.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 328.87ms. Allocated memory is still 211.8MB. Free memory was 114.7MB in the beginning and 99.2MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5751.66ms. Allocated memory was 211.8MB in the beginning and 455.1MB in the end (delta: 243.3MB). Free memory was 98.4MB in the beginning and 297.8MB in the end (delta: -199.4MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. * Witness Printer took 58.19ms. Allocated memory is still 455.1MB. Free memory was 297.8MB in the beginning and 289.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 692]: Data race detected Data race detected The following path leads to a data race: [L685] 0 int threads_alive = 0; VAL [threads_alive=0] [L686] 0 int data = 0; VAL [data=0, threads_alive=0] [L687] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={1:0}, threads_alive=0] [L696] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, data_mutex={1:0}, threads_alive=0, threads_total=2] [L697] CALL 0 assume_abort_if_not(threads_total >= 0) [L682] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data=0, data_mutex={1:0}, threads_alive=0] [L697] RET 0 assume_abort_if_not(threads_total >= 0) [L698] 0 int i = 0; VAL [data=0, data_mutex={1:0}, i=0, threads_alive=0, threads_total=2] [L698] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={1:0}, i=0, threads_alive=0, threads_total=2] [L699] 0 threads_alive++ VAL [data=0, data_mutex={1:0}, i=0, threads_alive=1, threads_total=2] [L700] 0 pthread_t tid; VAL [data=0, data_mutex={1:0}, i=0, threads_alive=1, threads_total=2] [L701] FCALL, FORK 0 pthread_create(&tid, ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=0, threads_alive=1, threads_total=2, tid=-1] [L698] 0 i++ VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=1, threads_total=2] [L698] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=1, threads_total=2] [L699] 0 threads_alive++ VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=1, threads_total=2] [L690] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_alive=1] [L692] 1 threads_alive-- VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_alive=1] [L699] 0 threads_alive++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=2, threads_total=2] [L692] 1 threads_alive-- VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_alive=2] Now there is a data race on ~threads_alive~0 between C: threads_alive++ [699] and C: threads_alive-- [692] - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 704]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 121 locations, 11 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.9s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 144 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 172 IncrementalHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 38 mSDtfsCounter, 172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=410occurred in iteration=5, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 394 NumberOfCodeBlocks, 394 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 323 ConstructedInterpolants, 0 QuantifiedInterpolants, 537 SizeOfPredicates, 2 NumberOfNonLiveVariables, 119 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 149 locations, 14 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.7s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 233 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 104 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 297 IncrementalHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 44 mSDtfsCounter, 297 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=693occurred in iteration=6, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 401 NumberOfCodeBlocks, 401 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 323 ConstructedInterpolants, 0 QuantifiedInterpolants, 537 SizeOfPredicates, 2 NumberOfNonLiveVariables, 119 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-16 23:52:10,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE