./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/value-barrier-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/value-barrier-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 4e3d22e98e469d91cee59ee59a7893605d6313bab33afdf939e81a0c217e3b1b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:39:44,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:39:44,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-24 15:39:44,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:39:44,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:39:44,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:39:44,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:39:44,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:39:44,864 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:39:44,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:39:44,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:39:44,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:39:44,867 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:39:44,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:39:44,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:39:44,867 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:39:44,868 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:39:44,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:39:44,868 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:39:44,868 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:39:44,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:39:44,872 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:39:44,873 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-24 15:39:44,873 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:39:44,873 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:39:44,873 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:39:44,873 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:39:44,873 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:39:44,874 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:39:44,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:39:44,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:39:44,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:39:44,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:39:44,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:39:44,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 15:39:44,875 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 15:39:44,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 15:39:44,876 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:39:44,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:39:44,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:39:44,878 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:39:44,878 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 -> 4e3d22e98e469d91cee59ee59a7893605d6313bab33afdf939e81a0c217e3b1b [2024-10-24 15:39:45,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:39:45,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:39:45,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:39:45,119 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:39:45,121 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:39:45,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/value-barrier-race.i [2024-10-24 15:39:46,411 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:39:46,672 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:39:46,676 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/value-barrier-race.i [2024-10-24 15:39:46,695 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc5169dc9/110bf344950544468af741119120ff2c/FLAGdb5df7218 [2024-10-24 15:39:46,707 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc5169dc9/110bf344950544468af741119120ff2c [2024-10-24 15:39:46,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:39:46,710 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:39:46,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:39:46,713 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:39:46,717 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:39:46,718 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:39:46" (1/1) ... [2024-10-24 15:39:46,719 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f99899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:46, skipping insertion in model container [2024-10-24 15:39:46,719 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:39:46" (1/1) ... [2024-10-24 15:39:46,766 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:39:47,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:39:47,214 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 15:39:47,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:39:47,299 INFO L204 MainTranslator]: Completed translation [2024-10-24 15:39:47,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:47 WrapperNode [2024-10-24 15:39:47,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:39:47,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 15:39:47,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 15:39:47,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 15:39:47,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:47" (1/1) ... [2024-10-24 15:39:47,326 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:47" (1/1) ... [2024-10-24 15:39:47,351 INFO L138 Inliner]: procedures = 261, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2024-10-24 15:39:47,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 15:39:47,354 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 15:39:47,354 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 15:39:47,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 15:39:47,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:47" (1/1) ... [2024-10-24 15:39:47,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:47" (1/1) ... [2024-10-24 15:39:47,365 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:47" (1/1) ... [2024-10-24 15:39:47,368 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:47" (1/1) ... [2024-10-24 15:39:47,375 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:47" (1/1) ... [2024-10-24 15:39:47,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:47" (1/1) ... [2024-10-24 15:39:47,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:47" (1/1) ... [2024-10-24 15:39:47,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:47" (1/1) ... [2024-10-24 15:39:47,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 15:39:47,386 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 15:39:47,386 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 15:39:47,386 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 15:39:47,387 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:47" (1/1) ... [2024-10-24 15:39:47,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:39:47,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:39:47,417 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 15:39:47,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 15:39:47,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 15:39:47,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-24 15:39:47,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-24 15:39:47,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 15:39:47,467 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-24 15:39:47,467 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-24 15:39:47,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 15:39:47,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 15:39:47,469 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 15:39:47,586 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 15:39:47,588 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 15:39:47,731 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 15:39:47,732 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 15:39:47,743 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 15:39:47,743 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-24 15:39:47,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:39:47 BoogieIcfgContainer [2024-10-24 15:39:47,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 15:39:47,745 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 15:39:47,745 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 15:39:47,748 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 15:39:47,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:39:46" (1/3) ... [2024-10-24 15:39:47,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3206fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:39:47, skipping insertion in model container [2024-10-24 15:39:47,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:47" (2/3) ... [2024-10-24 15:39:47,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3206fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:39:47, skipping insertion in model container [2024-10-24 15:39:47,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:39:47" (3/3) ... [2024-10-24 15:39:47,750 INFO L112 eAbstractionObserver]: Analyzing ICFG value-barrier-race.i [2024-10-24 15:39:47,764 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 15:39:47,765 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-24 15:39:47,765 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 15:39:47,809 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-24 15:39:47,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 94 transitions, 195 flow [2024-10-24 15:39:47,884 INFO L124 PetriNetUnfolderBase]: 8/140 cut-off events. [2024-10-24 15:39:47,884 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-24 15:39:47,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 140 events. 8/140 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 225 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 68. Up to 4 conditions per place. [2024-10-24 15:39:47,894 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 94 transitions, 195 flow [2024-10-24 15:39:47,899 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 94 transitions, 195 flow [2024-10-24 15:39:47,907 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:39:47,912 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;@f1d3ffd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:39:47,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-10-24 15:39:47,922 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 15:39:47,922 INFO L124 PetriNetUnfolderBase]: 2/38 cut-off events. [2024-10-24 15:39:47,922 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 15:39:47,923 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:47,923 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-10-24 15:39:47,924 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-24 15:39:47,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:47,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1537660805, now seen corresponding path program 1 times [2024-10-24 15:39:47,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:47,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043177085] [2024-10-24 15:39:47,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:47,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:48,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:48,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043177085] [2024-10-24 15:39:48,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043177085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:48,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:48,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:48,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593733632] [2024-10-24 15:39:48,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:48,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:48,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:48,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:48,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:48,174 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 94 [2024-10-24 15:39:48,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 94 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:48,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:48,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 94 [2024-10-24 15:39:48,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:48,227 INFO L124 PetriNetUnfolderBase]: 7/171 cut-off events. [2024-10-24 15:39:48,228 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-10-24 15:39:48,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 171 events. 7/171 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 427 event pairs, 3 based on Foata normal form. 11/160 useless extension candidates. Maximal degree in co-relation 119. Up to 21 conditions per place. [2024-10-24 15:39:48,232 INFO L140 encePairwiseOnDemand]: 85/94 looper letters, 9 selfloop transitions, 4 changer transitions 1/93 dead transitions. [2024-10-24 15:39:48,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 93 transitions, 219 flow [2024-10-24 15:39:48,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:48,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:48,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2024-10-24 15:39:48,247 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9184397163120568 [2024-10-24 15:39:48,250 INFO L175 Difference]: Start difference. First operand has 91 places, 94 transitions, 195 flow. Second operand 3 states and 259 transitions. [2024-10-24 15:39:48,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 93 transitions, 219 flow [2024-10-24 15:39:48,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 93 transitions, 219 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:39:48,260 INFO L231 Difference]: Finished difference. Result has 95 places, 92 transitions, 215 flow [2024-10-24 15:39:48,262 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=215, PETRI_PLACES=95, PETRI_TRANSITIONS=92} [2024-10-24 15:39:48,267 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 4 predicate places. [2024-10-24 15:39:48,267 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 92 transitions, 215 flow [2024-10-24 15:39:48,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:48,268 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:48,268 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:48,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 15:39:48,269 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-24 15:39:48,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:48,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1216131606, now seen corresponding path program 1 times [2024-10-24 15:39:48,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:48,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382814745] [2024-10-24 15:39:48,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:48,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:48,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:48,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:48,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382814745] [2024-10-24 15:39:48,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382814745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:48,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:48,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:39:48,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640640049] [2024-10-24 15:39:48,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:48,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:39:48,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:48,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:39:48,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:39:48,837 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 94 [2024-10-24 15:39:48,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:48,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:48,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 94 [2024-10-24 15:39:48,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:48,882 INFO L124 PetriNetUnfolderBase]: 5/154 cut-off events. [2024-10-24 15:39:48,882 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-24 15:39:48,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 154 events. 5/154 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 360 event pairs, 1 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 119. Up to 21 conditions per place. [2024-10-24 15:39:48,883 INFO L140 encePairwiseOnDemand]: 88/94 looper letters, 14 selfloop transitions, 5 changer transitions 0/91 dead transitions. [2024-10-24 15:39:48,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 91 transitions, 251 flow [2024-10-24 15:39:48,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:39:48,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 15:39:48,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 440 transitions. [2024-10-24 15:39:48,887 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7801418439716312 [2024-10-24 15:39:48,887 INFO L175 Difference]: Start difference. First operand has 95 places, 92 transitions, 215 flow. Second operand 6 states and 440 transitions. [2024-10-24 15:39:48,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 91 transitions, 251 flow [2024-10-24 15:39:48,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 91 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:48,905 INFO L231 Difference]: Finished difference. Result has 96 places, 91 transitions, 215 flow [2024-10-24 15:39:48,905 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=215, PETRI_PLACES=96, PETRI_TRANSITIONS=91} [2024-10-24 15:39:48,906 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 5 predicate places. [2024-10-24 15:39:48,906 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 91 transitions, 215 flow [2024-10-24 15:39:48,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:48,906 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:48,906 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] [2024-10-24 15:39:48,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 15:39:48,907 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-24 15:39:48,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:48,907 INFO L85 PathProgramCache]: Analyzing trace with hash 2021984939, now seen corresponding path program 1 times [2024-10-24 15:39:48,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:48,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438853113] [2024-10-24 15:39:48,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:48,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:48,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:48,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:48,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438853113] [2024-10-24 15:39:48,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438853113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:48,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:48,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:48,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861876628] [2024-10-24 15:39:48,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:48,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:48,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:48,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:48,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:48,957 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 94 [2024-10-24 15:39:48,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:48,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:48,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 94 [2024-10-24 15:39:48,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:49,000 INFO L124 PetriNetUnfolderBase]: 8/228 cut-off events. [2024-10-24 15:39:49,001 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-10-24 15:39:49,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 228 events. 8/228 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 701 event pairs, 1 based on Foata normal form. 1/202 useless extension candidates. Maximal degree in co-relation 187. Up to 11 conditions per place. [2024-10-24 15:39:49,002 INFO L140 encePairwiseOnDemand]: 90/94 looper letters, 7 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2024-10-24 15:39:49,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 95 transitions, 246 flow [2024-10-24 15:39:49,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:49,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:49,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2024-10-24 15:39:49,005 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9326241134751773 [2024-10-24 15:39:49,005 INFO L175 Difference]: Start difference. First operand has 96 places, 91 transitions, 215 flow. Second operand 3 states and 263 transitions. [2024-10-24 15:39:49,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 95 transitions, 246 flow [2024-10-24 15:39:49,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 95 transitions, 236 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-24 15:39:49,009 INFO L231 Difference]: Finished difference. Result has 95 places, 94 transitions, 231 flow [2024-10-24 15:39:49,009 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=231, PETRI_PLACES=95, PETRI_TRANSITIONS=94} [2024-10-24 15:39:49,010 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 4 predicate places. [2024-10-24 15:39:49,011 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 94 transitions, 231 flow [2024-10-24 15:39:49,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:49,011 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:49,011 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] [2024-10-24 15:39:49,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 15:39:49,012 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-24 15:39:49,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:49,012 INFO L85 PathProgramCache]: Analyzing trace with hash -212740164, now seen corresponding path program 1 times [2024-10-24 15:39:49,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:49,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471432971] [2024-10-24 15:39:49,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:49,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:49,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:49,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471432971] [2024-10-24 15:39:49,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471432971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:49,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:49,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:49,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668652753] [2024-10-24 15:39:49,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:49,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:49,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:49,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:49,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:49,060 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 94 [2024-10-24 15:39:49,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 94 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:49,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:49,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 94 [2024-10-24 15:39:49,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:49,096 INFO L124 PetriNetUnfolderBase]: 25/292 cut-off events. [2024-10-24 15:39:49,097 INFO L125 PetriNetUnfolderBase]: For 52/54 co-relation queries the response was YES. [2024-10-24 15:39:49,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 292 events. 25/292 cut-off events. For 52/54 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1104 event pairs, 3 based on Foata normal form. 1/257 useless extension candidates. Maximal degree in co-relation 309. Up to 44 conditions per place. [2024-10-24 15:39:49,100 INFO L140 encePairwiseOnDemand]: 89/94 looper letters, 10 selfloop transitions, 6 changer transitions 0/98 dead transitions. [2024-10-24 15:39:49,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 98 transitions, 277 flow [2024-10-24 15:39:49,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:49,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:49,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2024-10-24 15:39:49,103 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.900709219858156 [2024-10-24 15:39:49,103 INFO L175 Difference]: Start difference. First operand has 95 places, 94 transitions, 231 flow. Second operand 3 states and 254 transitions. [2024-10-24 15:39:49,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 98 transitions, 277 flow [2024-10-24 15:39:49,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 98 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:49,108 INFO L231 Difference]: Finished difference. Result has 97 places, 98 transitions, 271 flow [2024-10-24 15:39:49,108 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=271, PETRI_PLACES=97, PETRI_TRANSITIONS=98} [2024-10-24 15:39:49,109 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 6 predicate places. [2024-10-24 15:39:49,109 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 98 transitions, 271 flow [2024-10-24 15:39:49,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:49,109 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:49,109 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:49,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 15:39:49,110 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-24 15:39:49,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:49,110 INFO L85 PathProgramCache]: Analyzing trace with hash 37244536, now seen corresponding path program 1 times [2024-10-24 15:39:49,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:49,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317229932] [2024-10-24 15:39:49,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:49,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:49,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:49,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:49,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317229932] [2024-10-24 15:39:49,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317229932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:49,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:49,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:49,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221918165] [2024-10-24 15:39:49,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:49,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:49,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:49,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:49,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:49,159 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 94 [2024-10-24 15:39:49,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 98 transitions, 271 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:49,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:49,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 94 [2024-10-24 15:39:49,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:49,194 INFO L124 PetriNetUnfolderBase]: 19/332 cut-off events. [2024-10-24 15:39:49,195 INFO L125 PetriNetUnfolderBase]: For 75/87 co-relation queries the response was YES. [2024-10-24 15:39:49,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 332 events. 19/332 cut-off events. For 75/87 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1383 event pairs, 0 based on Foata normal form. 3/305 useless extension candidates. Maximal degree in co-relation 345. Up to 26 conditions per place. [2024-10-24 15:39:49,196 INFO L140 encePairwiseOnDemand]: 90/94 looper letters, 6 selfloop transitions, 4 changer transitions 0/101 dead transitions. [2024-10-24 15:39:49,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 101 transitions, 302 flow [2024-10-24 15:39:49,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:49,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:49,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2024-10-24 15:39:49,197 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9290780141843972 [2024-10-24 15:39:49,197 INFO L175 Difference]: Start difference. First operand has 97 places, 98 transitions, 271 flow. Second operand 3 states and 262 transitions. [2024-10-24 15:39:49,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 101 transitions, 302 flow [2024-10-24 15:39:49,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 101 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:49,201 INFO L231 Difference]: Finished difference. Result has 99 places, 100 transitions, 287 flow [2024-10-24 15:39:49,202 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=287, PETRI_PLACES=99, PETRI_TRANSITIONS=100} [2024-10-24 15:39:49,202 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 8 predicate places. [2024-10-24 15:39:49,202 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 100 transitions, 287 flow [2024-10-24 15:39:49,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:49,203 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:49,203 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:49,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 15:39:49,203 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-24 15:39:49,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:49,203 INFO L85 PathProgramCache]: Analyzing trace with hash -438296460, now seen corresponding path program 1 times [2024-10-24 15:39:49,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:49,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844971726] [2024-10-24 15:39:49,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:49,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:49,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:49,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844971726] [2024-10-24 15:39:49,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844971726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:49,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:49,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:39:49,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305099084] [2024-10-24 15:39:49,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:49,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 15:39:49,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:49,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 15:39:49,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:39:49,392 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 94 [2024-10-24 15:39:49,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 100 transitions, 287 flow. Second operand has 5 states, 5 states have (on average 78.4) internal successors, (392), 5 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:49,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:49,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 94 [2024-10-24 15:39:49,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:49,435 INFO L124 PetriNetUnfolderBase]: 19/338 cut-off events. [2024-10-24 15:39:49,435 INFO L125 PetriNetUnfolderBase]: For 70/80 co-relation queries the response was YES. [2024-10-24 15:39:49,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 338 events. 19/338 cut-off events. For 70/80 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1432 event pairs, 0 based on Foata normal form. 1/319 useless extension candidates. Maximal degree in co-relation 360. Up to 44 conditions per place. [2024-10-24 15:39:49,436 INFO L140 encePairwiseOnDemand]: 86/94 looper letters, 11 selfloop transitions, 2 changer transitions 5/105 dead transitions. [2024-10-24 15:39:49,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 105 transitions, 333 flow [2024-10-24 15:39:49,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:39:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 15:39:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 481 transitions. [2024-10-24 15:39:49,438 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8528368794326241 [2024-10-24 15:39:49,438 INFO L175 Difference]: Start difference. First operand has 99 places, 100 transitions, 287 flow. Second operand 6 states and 481 transitions. [2024-10-24 15:39:49,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 105 transitions, 333 flow [2024-10-24 15:39:49,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 105 transitions, 325 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:49,442 INFO L231 Difference]: Finished difference. Result has 106 places, 100 transitions, 297 flow [2024-10-24 15:39:49,442 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=297, PETRI_PLACES=106, PETRI_TRANSITIONS=100} [2024-10-24 15:39:49,444 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 15 predicate places. [2024-10-24 15:39:49,444 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 100 transitions, 297 flow [2024-10-24 15:39:49,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.4) internal successors, (392), 5 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:49,444 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:49,444 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-10-24 15:39:49,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 15:39:49,445 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-24 15:39:49,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:49,445 INFO L85 PathProgramCache]: Analyzing trace with hash -443007062, now seen corresponding path program 1 times [2024-10-24 15:39:49,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:49,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905197558] [2024-10-24 15:39:49,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:49,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 15:39:49,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 15:39:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 15:39:49,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 15:39:49,509 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 15:39:49,510 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-10-24 15:39:49,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-10-24 15:39:49,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-10-24 15:39:49,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-10-24 15:39:49,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-10-24 15:39:49,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-10-24 15:39:49,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-10-24 15:39:49,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-10-24 15:39:49,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-10-24 15:39:49,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 15:39:49,515 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:49,521 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-24 15:39:49,522 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-24 15:39:49,535 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-24 15:39:49,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 109 transitions, 234 flow [2024-10-24 15:39:49,556 INFO L124 PetriNetUnfolderBase]: 15/233 cut-off events. [2024-10-24 15:39:49,556 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-24 15:39:49,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 233 events. 15/233 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 456 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 142. Up to 8 conditions per place. [2024-10-24 15:39:49,557 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 109 transitions, 234 flow [2024-10-24 15:39:49,558 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 109 transitions, 234 flow [2024-10-24 15:39:49,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:39:49,560 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;@f1d3ffd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:39:49,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-10-24 15:39:49,562 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 15:39:49,562 INFO L124 PetriNetUnfolderBase]: 2/38 cut-off events. [2024-10-24 15:39:49,562 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 15:39:49,562 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:49,562 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-10-24 15:39:49,563 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:49,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:49,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2051612229, now seen corresponding path program 1 times [2024-10-24 15:39:49,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:49,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672168656] [2024-10-24 15:39:49,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:49,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:49,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:49,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:49,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672168656] [2024-10-24 15:39:49,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672168656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:49,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:49,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:49,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417232687] [2024-10-24 15:39:49,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:49,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:49,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:49,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:49,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:49,608 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 109 [2024-10-24 15:39:49,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 109 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:49,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:49,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 109 [2024-10-24 15:39:49,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:49,654 INFO L124 PetriNetUnfolderBase]: 43/436 cut-off events. [2024-10-24 15:39:49,654 INFO L125 PetriNetUnfolderBase]: For 29/36 co-relation queries the response was YES. [2024-10-24 15:39:49,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 436 events. 43/436 cut-off events. For 29/36 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1892 event pairs, 23 based on Foata normal form. 51/422 useless extension candidates. Maximal degree in co-relation 309. Up to 83 conditions per place. [2024-10-24 15:39:49,656 INFO L140 encePairwiseOnDemand]: 98/109 looper letters, 12 selfloop transitions, 5 changer transitions 1/108 dead transitions. [2024-10-24 15:39:49,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 108 transitions, 266 flow [2024-10-24 15:39:49,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:49,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2024-10-24 15:39:49,657 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9113149847094801 [2024-10-24 15:39:49,657 INFO L175 Difference]: Start difference. First operand has 105 places, 109 transitions, 234 flow. Second operand 3 states and 298 transitions. [2024-10-24 15:39:49,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 108 transitions, 266 flow [2024-10-24 15:39:49,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 108 transitions, 266 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:39:49,660 INFO L231 Difference]: Finished difference. Result has 109 places, 107 transitions, 260 flow [2024-10-24 15:39:49,660 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=109, PETRI_TRANSITIONS=107} [2024-10-24 15:39:49,662 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, 4 predicate places. [2024-10-24 15:39:49,662 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 107 transitions, 260 flow [2024-10-24 15:39:49,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:49,662 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:49,662 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:49,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 15:39:49,662 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:49,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:49,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1202214518, now seen corresponding path program 1 times [2024-10-24 15:39:49,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:49,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994847943] [2024-10-24 15:39:49,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:49,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:49,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:49,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:49,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994847943] [2024-10-24 15:39:49,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994847943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:49,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:49,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:39:49,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452542160] [2024-10-24 15:39:49,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:49,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:39:49,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:49,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:39:49,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:39:49,959 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 109 [2024-10-24 15:39:49,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 107 transitions, 260 flow. Second operand has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:49,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:49,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 109 [2024-10-24 15:39:49,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:50,022 INFO L124 PetriNetUnfolderBase]: 28/353 cut-off events. [2024-10-24 15:39:50,023 INFO L125 PetriNetUnfolderBase]: For 40/45 co-relation queries the response was YES. [2024-10-24 15:39:50,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 353 events. 28/353 cut-off events. For 40/45 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1340 event pairs, 9 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 273. Up to 45 conditions per place. [2024-10-24 15:39:50,025 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 16 selfloop transitions, 5 changer transitions 0/106 dead transitions. [2024-10-24 15:39:50,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 106 transitions, 300 flow [2024-10-24 15:39:50,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:39:50,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 15:39:50,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 514 transitions. [2024-10-24 15:39:50,026 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7859327217125383 [2024-10-24 15:39:50,026 INFO L175 Difference]: Start difference. First operand has 109 places, 107 transitions, 260 flow. Second operand 6 states and 514 transitions. [2024-10-24 15:39:50,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 106 transitions, 300 flow [2024-10-24 15:39:50,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 106 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:50,028 INFO L231 Difference]: Finished difference. Result has 110 places, 106 transitions, 258 flow [2024-10-24 15:39:50,028 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=110, PETRI_TRANSITIONS=106} [2024-10-24 15:39:50,029 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, 5 predicate places. [2024-10-24 15:39:50,029 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 106 transitions, 258 flow [2024-10-24 15:39:50,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:50,029 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:50,029 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] [2024-10-24 15:39:50,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 15:39:50,030 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:50,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:50,030 INFO L85 PathProgramCache]: Analyzing trace with hash -155149538, now seen corresponding path program 1 times [2024-10-24 15:39:50,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:50,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099384806] [2024-10-24 15:39:50,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:50,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:50,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:50,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:50,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099384806] [2024-10-24 15:39:50,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099384806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:50,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:50,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:50,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786828483] [2024-10-24 15:39:50,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:50,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:50,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:50,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:50,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:50,057 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 109 [2024-10-24 15:39:50,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 106 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:50,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:50,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 109 [2024-10-24 15:39:50,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:50,159 INFO L124 PetriNetUnfolderBase]: 102/1044 cut-off events. [2024-10-24 15:39:50,159 INFO L125 PetriNetUnfolderBase]: For 84/105 co-relation queries the response was YES. [2024-10-24 15:39:50,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 1044 events. 102/1044 cut-off events. For 84/105 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 7261 event pairs, 25 based on Foata normal form. 4/885 useless extension candidates. Maximal degree in co-relation 613. Up to 93 conditions per place. [2024-10-24 15:39:50,165 INFO L140 encePairwiseOnDemand]: 102/109 looper letters, 14 selfloop transitions, 5 changer transitions 0/114 dead transitions. [2024-10-24 15:39:50,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 114 transitions, 323 flow [2024-10-24 15:39:50,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:50,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:50,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2024-10-24 15:39:50,167 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9174311926605505 [2024-10-24 15:39:50,167 INFO L175 Difference]: Start difference. First operand has 110 places, 106 transitions, 258 flow. Second operand 3 states and 300 transitions. [2024-10-24 15:39:50,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 114 transitions, 323 flow [2024-10-24 15:39:50,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 114 transitions, 313 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-24 15:39:50,169 INFO L231 Difference]: Finished difference. Result has 109 places, 111 transitions, 292 flow [2024-10-24 15:39:50,169 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=109, PETRI_TRANSITIONS=111} [2024-10-24 15:39:50,169 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, 4 predicate places. [2024-10-24 15:39:50,170 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 111 transitions, 292 flow [2024-10-24 15:39:50,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:50,170 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:50,170 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] [2024-10-24 15:39:50,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 15:39:50,170 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:50,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:50,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1904705372, now seen corresponding path program 1 times [2024-10-24 15:39:50,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:50,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249166257] [2024-10-24 15:39:50,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:50,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:50,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:50,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:50,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249166257] [2024-10-24 15:39:50,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249166257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:50,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:50,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:50,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766155718] [2024-10-24 15:39:50,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:50,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:50,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:50,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:50,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:50,199 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 109 [2024-10-24 15:39:50,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 111 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:50,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:50,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 109 [2024-10-24 15:39:50,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:50,260 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([329] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][102], [106#true, 124#true, 26#L1022-1true, 104#true, 73#L1022-2true, Black: 119#true, 71#L1034-4true, 121#(= |#race~ready~0| 0), Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|)]) [2024-10-24 15:39:50,260 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2024-10-24 15:39:50,261 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-10-24 15:39:50,261 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-10-24 15:39:50,261 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-10-24 15:39:50,270 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([342] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][111], [34#L1022-1true, 106#true, 124#true, 104#true, Black: 119#true, 71#L1034-4true, 82#L1022-2true, 121#(= |#race~ready~0| 0), Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|)]) [2024-10-24 15:39:50,270 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2024-10-24 15:39:50,270 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-10-24 15:39:50,270 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-10-24 15:39:50,270 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-10-24 15:39:50,276 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([329] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][57], [106#true, 26#L1022-1true, 124#true, 33#L1035true, 104#true, 73#L1022-2true, Black: 119#true, 121#(= |#race~ready~0| 0), Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|)]) [2024-10-24 15:39:50,276 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-10-24 15:39:50,276 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-10-24 15:39:50,276 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-10-24 15:39:50,276 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-10-24 15:39:50,284 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([342] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][86], [34#L1022-1true, 106#true, 124#true, 33#L1035true, 104#true, Black: 119#true, 82#L1022-2true, 121#(= |#race~ready~0| 0), Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|)]) [2024-10-24 15:39:50,284 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-10-24 15:39:50,284 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-10-24 15:39:50,284 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-10-24 15:39:50,284 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-10-24 15:39:50,317 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([329] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][57], [106#true, 26#L1022-1true, 124#true, 59#ULTIMATE.startFINALtrue, 73#L1022-2true, 104#true, Black: 119#true, 121#(= |#race~ready~0| 0), Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|)]) [2024-10-24 15:39:50,317 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-10-24 15:39:50,317 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-24 15:39:50,317 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-24 15:39:50,317 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-24 15:39:50,320 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([342] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][86], [34#L1022-1true, 106#true, 124#true, 59#ULTIMATE.startFINALtrue, 104#true, Black: 119#true, 82#L1022-2true, 121#(= |#race~ready~0| 0), Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|)]) [2024-10-24 15:39:50,320 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-10-24 15:39:50,320 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-24 15:39:50,320 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-24 15:39:50,320 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-24 15:39:50,368 INFO L124 PetriNetUnfolderBase]: 298/1564 cut-off events. [2024-10-24 15:39:50,369 INFO L125 PetriNetUnfolderBase]: For 484/527 co-relation queries the response was YES. [2024-10-24 15:39:50,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2554 conditions, 1564 events. 298/1564 cut-off events. For 484/527 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 11499 event pairs, 48 based on Foata normal form. 8/1307 useless extension candidates. Maximal degree in co-relation 1971. Up to 348 conditions per place. [2024-10-24 15:39:50,379 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 14 selfloop transitions, 8 changer transitions 0/117 dead transitions. [2024-10-24 15:39:50,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 117 transitions, 360 flow [2024-10-24 15:39:50,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:50,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:50,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2024-10-24 15:39:50,381 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8899082568807339 [2024-10-24 15:39:50,381 INFO L175 Difference]: Start difference. First operand has 109 places, 111 transitions, 292 flow. Second operand 3 states and 291 transitions. [2024-10-24 15:39:50,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 117 transitions, 360 flow [2024-10-24 15:39:50,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 117 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:50,384 INFO L231 Difference]: Finished difference. Result has 111 places, 117 transitions, 348 flow [2024-10-24 15:39:50,385 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=111, PETRI_TRANSITIONS=117} [2024-10-24 15:39:50,386 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, 6 predicate places. [2024-10-24 15:39:50,386 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 117 transitions, 348 flow [2024-10-24 15:39:50,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:50,386 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:50,387 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:50,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 15:39:50,387 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:50,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:50,387 INFO L85 PathProgramCache]: Analyzing trace with hash -674714638, now seen corresponding path program 1 times [2024-10-24 15:39:50,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:50,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433465407] [2024-10-24 15:39:50,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:50,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:50,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:50,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:50,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433465407] [2024-10-24 15:39:50,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433465407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:50,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:50,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:50,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067102773] [2024-10-24 15:39:50,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:50,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:50,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:50,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:50,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:50,429 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 109 [2024-10-24 15:39:50,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 117 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:50,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:50,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 109 [2024-10-24 15:39:50,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:50,497 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([329] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][104], [Black: 126#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 106#true, 124#true, 26#L1022-1true, 73#L1022-2true, 104#true, 71#L1034-4true, 129#true, Black: 119#true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|)]) [2024-10-24 15:39:50,497 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2024-10-24 15:39:50,497 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-10-24 15:39:50,497 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-10-24 15:39:50,498 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-10-24 15:39:50,498 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([342] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][119], [Black: 126#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 34#L1022-1true, 106#true, 124#true, 104#true, 71#L1034-4true, Black: 119#true, 129#true, 82#L1022-2true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|)]) [2024-10-24 15:39:50,498 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2024-10-24 15:39:50,498 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-10-24 15:39:50,498 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-10-24 15:39:50,498 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-10-24 15:39:50,505 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([329] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][57], [Black: 126#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 106#true, 124#true, 26#L1022-1true, 33#L1035true, 73#L1022-2true, 104#true, Black: 119#true, 129#true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|)]) [2024-10-24 15:39:50,506 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-10-24 15:39:50,506 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-10-24 15:39:50,506 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-10-24 15:39:50,506 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-10-24 15:39:50,515 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([342] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][85], [Black: 126#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 34#L1022-1true, 106#true, 124#true, 33#L1035true, 104#true, Black: 119#true, 129#true, 82#L1022-2true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|)]) [2024-10-24 15:39:50,515 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-10-24 15:39:50,515 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-10-24 15:39:50,515 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-10-24 15:39:50,516 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-10-24 15:39:50,652 INFO L124 PetriNetUnfolderBase]: 382/2576 cut-off events. [2024-10-24 15:39:50,653 INFO L125 PetriNetUnfolderBase]: For 808/1103 co-relation queries the response was YES. [2024-10-24 15:39:50,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4178 conditions, 2576 events. 382/2576 cut-off events. For 808/1103 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 23527 event pairs, 42 based on Foata normal form. 25/2272 useless extension candidates. Maximal degree in co-relation 2510. Up to 353 conditions per place. [2024-10-24 15:39:50,667 INFO L140 encePairwiseOnDemand]: 102/109 looper letters, 16 selfloop transitions, 7 changer transitions 0/127 dead transitions. [2024-10-24 15:39:50,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 127 transitions, 435 flow [2024-10-24 15:39:50,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:50,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:50,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2024-10-24 15:39:50,669 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9174311926605505 [2024-10-24 15:39:50,669 INFO L175 Difference]: Start difference. First operand has 111 places, 117 transitions, 348 flow. Second operand 3 states and 300 transitions. [2024-10-24 15:39:50,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 127 transitions, 435 flow [2024-10-24 15:39:50,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 127 transitions, 419 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:50,672 INFO L231 Difference]: Finished difference. Result has 113 places, 124 transitions, 402 flow [2024-10-24 15:39:50,672 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=113, PETRI_TRANSITIONS=124} [2024-10-24 15:39:50,673 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, 8 predicate places. [2024-10-24 15:39:50,673 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 124 transitions, 402 flow [2024-10-24 15:39:50,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:50,674 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:50,674 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:50,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 15:39:50,674 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:50,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:50,675 INFO L85 PathProgramCache]: Analyzing trace with hash -868542783, now seen corresponding path program 1 times [2024-10-24 15:39:50,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:50,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956669916] [2024-10-24 15:39:50,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:50,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:50,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:50,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956669916] [2024-10-24 15:39:50,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956669916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:50,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:50,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:39:50,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085753730] [2024-10-24 15:39:50,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:50,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 15:39:50,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:50,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 15:39:50,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:39:50,808 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 109 [2024-10-24 15:39:50,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 124 transitions, 402 flow. Second operand has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:50,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:50,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 109 [2024-10-24 15:39:50,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:50,894 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([329] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][100], [Black: 126#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 106#true, 26#L1022-1true, Black: 131#(= |#race~data~0| 0), 104#true, 73#L1022-2true, 134#true, 129#true, Black: 119#true, 71#L1034-4true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|)]) [2024-10-24 15:39:50,894 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2024-10-24 15:39:50,894 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-10-24 15:39:50,894 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-10-24 15:39:50,894 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-10-24 15:39:50,895 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([342] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][123], [Black: 126#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 34#L1022-1true, 106#true, Black: 131#(= |#race~data~0| 0), 104#true, 134#true, Black: 119#true, 129#true, 71#L1034-4true, 82#L1022-2true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|)]) [2024-10-24 15:39:50,895 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2024-10-24 15:39:50,895 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-10-24 15:39:50,895 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-10-24 15:39:50,895 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-10-24 15:39:50,902 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([329] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][57], [Black: 126#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 106#true, 26#L1022-1true, 33#L1035true, Black: 131#(= |#race~data~0| 0), 73#L1022-2true, 104#true, 134#true, 129#true, Black: 119#true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|)]) [2024-10-24 15:39:50,902 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-10-24 15:39:50,902 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-10-24 15:39:50,902 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-10-24 15:39:50,902 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-10-24 15:39:50,911 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([342] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][78], [Black: 126#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 34#L1022-1true, 106#true, 33#L1035true, Black: 131#(= |#race~data~0| 0), 104#true, 134#true, 129#true, Black: 119#true, 82#L1022-2true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|)]) [2024-10-24 15:39:50,912 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-10-24 15:39:50,912 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-10-24 15:39:50,912 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-10-24 15:39:50,912 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-10-24 15:39:51,027 INFO L124 PetriNetUnfolderBase]: 363/2559 cut-off events. [2024-10-24 15:39:51,028 INFO L125 PetriNetUnfolderBase]: For 789/1006 co-relation queries the response was YES. [2024-10-24 15:39:51,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4344 conditions, 2559 events. 363/2559 cut-off events. For 789/1006 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 23595 event pairs, 33 based on Foata normal form. 1/2310 useless extension candidates. Maximal degree in co-relation 3398. Up to 329 conditions per place. [2024-10-24 15:39:51,067 INFO L140 encePairwiseOnDemand]: 101/109 looper letters, 14 selfloop transitions, 2 changer transitions 5/130 dead transitions. [2024-10-24 15:39:51,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 130 transitions, 456 flow [2024-10-24 15:39:51,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:39:51,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 15:39:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 556 transitions. [2024-10-24 15:39:51,069 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8501529051987767 [2024-10-24 15:39:51,069 INFO L175 Difference]: Start difference. First operand has 113 places, 124 transitions, 402 flow. Second operand 6 states and 556 transitions. [2024-10-24 15:39:51,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 130 transitions, 456 flow [2024-10-24 15:39:51,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 130 transitions, 442 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:51,072 INFO L231 Difference]: Finished difference. Result has 120 places, 125 transitions, 410 flow [2024-10-24 15:39:51,072 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=410, PETRI_PLACES=120, PETRI_TRANSITIONS=125} [2024-10-24 15:39:51,073 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, 15 predicate places. [2024-10-24 15:39:51,073 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 125 transitions, 410 flow [2024-10-24 15:39:51,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:51,074 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:51,074 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:51,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 15:39:51,074 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:51,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:51,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1025210636, now seen corresponding path program 1 times [2024-10-24 15:39:51,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:51,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950877212] [2024-10-24 15:39:51,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:51,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:51,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 15:39:51,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:51,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950877212] [2024-10-24 15:39:51,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950877212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:51,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:51,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:39:51,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829318816] [2024-10-24 15:39:51,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:51,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:51,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:51,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:51,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:51,154 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 109 [2024-10-24 15:39:51,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 125 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:51,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:51,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 109 [2024-10-24 15:39:51,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:51,192 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([329] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][78], [Black: 126#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 26#L1022-1true, Black: 131#(= |#race~data~0| 0), 145#true, 73#L1022-2true, 104#true, 134#true, 71#L1034-4true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 140#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 137#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 138#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 106#true, Black: 119#true]) [2024-10-24 15:39:51,193 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2024-10-24 15:39:51,193 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-10-24 15:39:51,193 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-10-24 15:39:51,193 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-10-24 15:39:51,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([342] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][101], [Black: 126#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), Black: 131#(= |#race~data~0| 0), 145#true, 104#true, 134#true, 71#L1034-4true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 140#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 137#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 138#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 34#L1022-1true, 106#true, Black: 119#true, 82#L1022-2true]) [2024-10-24 15:39:51,197 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2024-10-24 15:39:51,197 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-10-24 15:39:51,197 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-10-24 15:39:51,197 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-10-24 15:39:51,202 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([329] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][40], [Black: 126#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 26#L1022-1true, 33#L1035true, Black: 131#(= |#race~data~0| 0), 145#true, 73#L1022-2true, 104#true, 134#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 140#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 137#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 138#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 106#true, Black: 119#true]) [2024-10-24 15:39:51,203 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-10-24 15:39:51,203 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-10-24 15:39:51,203 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-10-24 15:39:51,203 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-10-24 15:39:51,209 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([342] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][58], [Black: 126#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 33#L1035true, Black: 131#(= |#race~data~0| 0), 145#true, 104#true, 134#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 140#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 137#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 138#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 34#L1022-1true, 106#true, Black: 119#true, 82#L1022-2true]) [2024-10-24 15:39:51,209 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-10-24 15:39:51,209 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-10-24 15:39:51,209 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-10-24 15:39:51,209 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-10-24 15:39:51,271 INFO L124 PetriNetUnfolderBase]: 217/1432 cut-off events. [2024-10-24 15:39:51,271 INFO L125 PetriNetUnfolderBase]: For 344/462 co-relation queries the response was YES. [2024-10-24 15:39:51,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2394 conditions, 1432 events. 217/1432 cut-off events. For 344/462 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 11187 event pairs, 34 based on Foata normal form. 9/1331 useless extension candidates. Maximal degree in co-relation 2338. Up to 214 conditions per place. [2024-10-24 15:39:51,280 INFO L140 encePairwiseOnDemand]: 105/109 looper letters, 6 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2024-10-24 15:39:51,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 113 transitions, 368 flow [2024-10-24 15:39:51,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:51,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2024-10-24 15:39:51,282 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9113149847094801 [2024-10-24 15:39:51,282 INFO L175 Difference]: Start difference. First operand has 120 places, 125 transitions, 410 flow. Second operand 3 states and 298 transitions. [2024-10-24 15:39:51,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 113 transitions, 368 flow [2024-10-24 15:39:51,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 113 transitions, 346 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-10-24 15:39:51,287 INFO L231 Difference]: Finished difference. Result has 112 places, 113 transitions, 340 flow [2024-10-24 15:39:51,287 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=112, PETRI_TRANSITIONS=113} [2024-10-24 15:39:51,288 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, 7 predicate places. [2024-10-24 15:39:51,288 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 113 transitions, 340 flow [2024-10-24 15:39:51,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:51,288 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:51,289 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] [2024-10-24 15:39:51,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 15:39:51,289 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:51,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:51,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1310043735, now seen corresponding path program 1 times [2024-10-24 15:39:51,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:51,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961163615] [2024-10-24 15:39:51,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:51,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 15:39:51,305 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 15:39:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 15:39:51,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 15:39:51,318 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 15:39:51,318 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (10 of 11 remaining) [2024-10-24 15:39:51,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-10-24 15:39:51,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-10-24 15:39:51,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-10-24 15:39:51,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-10-24 15:39:51,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 11 remaining) [2024-10-24 15:39:51,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-10-24 15:39:51,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-10-24 15:39:51,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-10-24 15:39:51,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-10-24 15:39:51,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-10-24 15:39:51,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 15:39:51,321 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:51,359 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-10-24 15:39:51,360 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 15:39:51,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:39:51 BasicIcfg [2024-10-24 15:39:51,365 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 15:39:51,365 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 15:39:51,365 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 15:39:51,365 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 15:39:51,366 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:39:47" (3/4) ... [2024-10-24 15:39:51,367 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 15:39:51,368 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 15:39:51,369 INFO L158 Benchmark]: Toolchain (without parser) took 4658.67ms. Allocated memory was 159.4MB in the beginning and 262.1MB in the end (delta: 102.8MB). Free memory was 90.4MB in the beginning and 107.8MB in the end (delta: -17.4MB). Peak memory consumption was 86.2MB. Max. memory is 16.1GB. [2024-10-24 15:39:51,369 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:39:51,369 INFO L158 Benchmark]: CACSL2BoogieTranslator took 587.96ms. Allocated memory is still 159.4MB. Free memory was 90.3MB in the beginning and 115.2MB in the end (delta: -24.9MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2024-10-24 15:39:51,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.83ms. Allocated memory is still 159.4MB. Free memory was 115.2MB in the beginning and 112.9MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 15:39:51,370 INFO L158 Benchmark]: Boogie Preprocessor took 27.30ms. Allocated memory is still 159.4MB. Free memory was 112.9MB in the beginning and 111.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:39:51,370 INFO L158 Benchmark]: RCFGBuilder took 357.89ms. Allocated memory is still 159.4MB. Free memory was 111.2MB in the beginning and 95.7MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 15:39:51,371 INFO L158 Benchmark]: TraceAbstraction took 3619.43ms. Allocated memory was 159.4MB in the beginning and 262.1MB in the end (delta: 102.8MB). Free memory was 94.6MB in the beginning and 108.9MB in the end (delta: -14.3MB). Peak memory consumption was 91.3MB. Max. memory is 16.1GB. [2024-10-24 15:39:51,371 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 262.1MB. Free memory was 108.9MB in the beginning and 107.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:39:51,372 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.14ms. Allocated memory is still 159.4MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 587.96ms. Allocated memory is still 159.4MB. Free memory was 90.3MB in the beginning and 115.2MB in the end (delta: -24.9MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.83ms. Allocated memory is still 159.4MB. Free memory was 115.2MB in the beginning and 112.9MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.30ms. Allocated memory is still 159.4MB. Free memory was 112.9MB in the beginning and 111.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 357.89ms. Allocated memory is still 159.4MB. Free memory was 111.2MB in the beginning and 95.7MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3619.43ms. Allocated memory was 159.4MB in the beginning and 262.1MB in the end (delta: 102.8MB). Free memory was 94.6MB in the beginning and 108.9MB in the end (delta: -14.3MB). Peak memory consumption was 91.3MB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 262.1MB. Free memory was 108.9MB in the beginning and 107.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1022]: Data race detected Data race detected The following path leads to a data race: [L1019] 0 _Bool ready = 0; VAL [ready=0] [L1020] 0 int data = 0; VAL [data=0, ready=0] [L1027] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, ready=0, threads_total=1] [L1028] CALL 0 assume_abort_if_not(threads_total >= 0) [L1016] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data=0, ready=0] [L1028] RET 0 assume_abort_if_not(threads_total >= 0) [L1029] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [data=0, ready=0, threads_total=1, tids={-2:0}] [L1030] 0 int i = 0; VAL [data=0, i=0, ready=0, threads_total=1, tids={-2:0}] [L1030] COND TRUE 0 i < threads_total VAL [data=0, i=0, ready=0, threads_total=1, tids={-2:0}] [L1031] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [data=0, i=0, ready=0, threads_total=1, tids={-2:0}] [L1031] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, i=0, ready=0, threads_total=1, tids={-2:0}] [L1022] 1 !ready VAL [\old(arg)={0:0}, arg={0:0}, data=0, ready=0] [L1030] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, i=1, ready=0, threads_total=1, tids={-2:0}] [L1030] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, arg={0:0}, data=0, i=1, ready=0, threads_total=1, tids={-2:0}] [L1033] 0 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, ready=0, threads_total=1, tids={-2:0}] [L1034] 0 ready = 1 VAL [\old(arg)={0:0}, arg={0:0}, data=0, ready=1, threads_total=1, tids={-2:0}] [L1022] 1 !ready VAL [\old(arg)={0:0}, arg={0:0}, data=0, ready=1] Now there is a data race on ~ready~0 between C: ready = 1 [1034] and C: !ready [1022] - UnprovableResult [Line: 1033]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1031]: 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: 1023]: 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, 101 locations, 9 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.7s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 211 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 116 mSDsluCounter, 83 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 284 IncrementalHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 12 mSDtfsCounter, 284 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=297occurred in iteration=6, InterpolantAutomatonStates: 24, 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.6s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 361 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 113 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.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 264 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 146 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 306 IncrementalHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 17 mSDtfsCounter, 306 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=410occurred in iteration=6, InterpolantAutomatonStates: 27, 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.4s InterpolantComputationTime, 309 NumberOfCodeBlocks, 309 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 249 ConstructedInterpolants, 0 QuantifiedInterpolants, 500 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 1/1 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-10-24 15:39:51,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE