./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/value-barrier-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/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-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:52:16,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:52:16,454 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-16 23:52:16,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:52:16,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:52:16,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:52:16,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:52:16,486 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:52:16,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:52:16,487 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:52:16,487 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:52:16,488 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:52:16,488 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:52:16,488 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:52:16,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:52:16,489 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:52:16,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:52:16,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:52:16,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:52:16,490 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:52:16,491 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:52:16,494 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:52:16,495 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-16 23:52:16,495 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:52:16,495 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:52:16,496 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:52:16,496 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:52:16,496 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:52:16,496 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:52:16,497 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:52:16,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:52:16,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:52:16,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:52:16,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:52:16,498 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 23:52:16,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:52:16,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:52:16,501 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:52:16,501 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:52:16,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:52:16,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:52:16,503 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-11-16 23:52:16,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:52:16,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:52:16,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:52:16,801 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:52:16,802 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:52:16,804 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/value-barrier-race.i [2024-11-16 23:52:18,209 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:52:18,496 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:52:18,496 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/value-barrier-race.i [2024-11-16 23:52:18,516 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efd05ba9e/c8966f4b067247d38b1ec0e7b882df61/FLAG403b24880 [2024-11-16 23:52:18,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efd05ba9e/c8966f4b067247d38b1ec0e7b882df61 [2024-11-16 23:52:18,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:52:18,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:52:18,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:52:18,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:52:18,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:52:18,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:52:18" (1/1) ... [2024-11-16 23:52:18,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48149b52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:18, skipping insertion in model container [2024-11-16 23:52:18,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:52:18" (1/1) ... [2024-11-16 23:52:18,593 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:52:19,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:52:19,081 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:52:19,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:52:19,204 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:52:19,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:19 WrapperNode [2024-11-16 23:52:19,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:52:19,206 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:52:19,207 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:52:19,207 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:52:19,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:19" (1/1) ... [2024-11-16 23:52:19,232 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:19" (1/1) ... [2024-11-16 23:52:19,260 INFO L138 Inliner]: procedures = 261, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2024-11-16 23:52:19,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:52:19,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:52:19,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:52:19,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:52:19,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:19" (1/1) ... [2024-11-16 23:52:19,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:19" (1/1) ... [2024-11-16 23:52:19,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:19" (1/1) ... [2024-11-16 23:52:19,273 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:19" (1/1) ... [2024-11-16 23:52:19,279 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:19" (1/1) ... [2024-11-16 23:52:19,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:19" (1/1) ... [2024-11-16 23:52:19,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:19" (1/1) ... [2024-11-16 23:52:19,282 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:19" (1/1) ... [2024-11-16 23:52:19,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:52:19,288 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:52:19,288 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:52:19,288 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:52:19,289 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:19" (1/1) ... [2024-11-16 23:52:19,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:52:19,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:52:19,328 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 23:52:19,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 23:52:19,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 23:52:19,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 23:52:19,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 23:52:19,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 23:52:19,380 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-16 23:52:19,380 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-16 23:52:19,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:52:19,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:52:19,382 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 23:52:19,566 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:52:19,568 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:52:19,747 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 23:52:19,747 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:52:19,763 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:52:19,765 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:52:19,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:52:19 BoogieIcfgContainer [2024-11-16 23:52:19,765 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:52:19,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:52:19,769 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:52:19,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:52:19,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:52:18" (1/3) ... [2024-11-16 23:52:19,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c3c397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:52:19, skipping insertion in model container [2024-11-16 23:52:19,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:19" (2/3) ... [2024-11-16 23:52:19,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c3c397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:52:19, skipping insertion in model container [2024-11-16 23:52:19,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:52:19" (3/3) ... [2024-11-16 23:52:19,775 INFO L112 eAbstractionObserver]: Analyzing ICFG value-barrier-race.i [2024-11-16 23:52:19,790 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:52:19,791 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-16 23:52:19,791 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 23:52:19,840 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-16 23:52:19,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 96 transitions, 199 flow [2024-11-16 23:52:19,957 INFO L124 PetriNetUnfolderBase]: 8/144 cut-off events. [2024-11-16 23:52:19,957 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-16 23:52:19,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 144 events. 8/144 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 233 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 70. Up to 4 conditions per place. [2024-11-16 23:52:19,965 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 96 transitions, 199 flow [2024-11-16 23:52:19,969 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 96 transitions, 199 flow [2024-11-16 23:52:19,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:52:19,983 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;@71798874, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:52:19,983 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-16 23:52:19,994 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:52:19,994 INFO L124 PetriNetUnfolderBase]: 2/39 cut-off events. [2024-11-16 23:52:19,994 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:52:19,998 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:19,999 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:52:19,999 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:52:20,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:20,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1174198581, now seen corresponding path program 1 times [2024-11-16 23:52:20,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:20,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829846947] [2024-11-16 23:52:20,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:20,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:20,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:20,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:52:20,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829846947] [2024-11-16 23:52:20,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829846947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:52:20,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:52:20,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:52:20,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767295187] [2024-11-16 23:52:20,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:52:20,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 23:52:20,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:52:20,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 23:52:20,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 23:52:20,248 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 96 [2024-11-16 23:52:20,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 96 transitions, 199 flow. Second operand has 2 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:20,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:52:20,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 96 [2024-11-16 23:52:20,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:52:20,299 INFO L124 PetriNetUnfolderBase]: 2/138 cut-off events. [2024-11-16 23:52:20,299 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-16 23:52:20,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 138 events. 2/138 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 229 event pairs, 0 based on Foata normal form. 6/128 useless extension candidates. Maximal degree in co-relation 65. Up to 3 conditions per place. [2024-11-16 23:52:20,302 INFO L140 encePairwiseOnDemand]: 92/96 looper letters, 2 selfloop transitions, 0 changer transitions 1/92 dead transitions. [2024-11-16 23:52:20,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 92 transitions, 195 flow [2024-11-16 23:52:20,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 23:52:20,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-16 23:52:20,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 186 transitions. [2024-11-16 23:52:20,316 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.96875 [2024-11-16 23:52:20,319 INFO L175 Difference]: Start difference. First operand has 93 places, 96 transitions, 199 flow. Second operand 2 states and 186 transitions. [2024-11-16 23:52:20,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 92 transitions, 195 flow [2024-11-16 23:52:20,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 92 transitions, 195 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:52:20,331 INFO L231 Difference]: Finished difference. Result has 94 places, 91 transitions, 189 flow [2024-11-16 23:52:20,333 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=189, PETRI_PLACES=94, PETRI_TRANSITIONS=91} [2024-11-16 23:52:20,337 INFO L277 CegarLoopForPetriNet]: 93 programPoint places, 1 predicate places. [2024-11-16 23:52:20,339 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 91 transitions, 189 flow [2024-11-16 23:52:20,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:20,341 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:20,341 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] [2024-11-16 23:52:20,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 23:52:20,342 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:52:20,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:20,343 INFO L85 PathProgramCache]: Analyzing trace with hash 498599235, now seen corresponding path program 1 times [2024-11-16 23:52:20,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:20,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126199376] [2024-11-16 23:52:20,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:20,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:20,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:20,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:52:20,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126199376] [2024-11-16 23:52:20,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126199376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:52:20,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:52:20,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:52:20,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050510533] [2024-11-16 23:52:20,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:52:20,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:52:20,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:52:20,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:52:20,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:52:20,497 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 96 [2024-11-16 23:52:20,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 91 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:20,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:52:20,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 96 [2024-11-16 23:52:20,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:52:20,547 INFO L124 PetriNetUnfolderBase]: 7/174 cut-off events. [2024-11-16 23:52:20,548 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-11-16 23:52:20,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 174 events. 7/174 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 436 event pairs, 3 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 204. Up to 21 conditions per place. [2024-11-16 23:52:20,552 INFO L140 encePairwiseOnDemand]: 91/96 looper letters, 9 selfloop transitions, 4 changer transitions 0/94 dead transitions. [2024-11-16 23:52:20,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 94 transitions, 221 flow [2024-11-16 23:52:20,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:52:20,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:52:20,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2024-11-16 23:52:20,556 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9027777777777778 [2024-11-16 23:52:20,557 INFO L175 Difference]: Start difference. First operand has 94 places, 91 transitions, 189 flow. Second operand 3 states and 260 transitions. [2024-11-16 23:52:20,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 94 transitions, 221 flow [2024-11-16 23:52:20,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 94 transitions, 221 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:52:20,562 INFO L231 Difference]: Finished difference. Result has 97 places, 94 transitions, 219 flow [2024-11-16 23:52:20,562 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=219, PETRI_PLACES=97, PETRI_TRANSITIONS=94} [2024-11-16 23:52:20,563 INFO L277 CegarLoopForPetriNet]: 93 programPoint places, 4 predicate places. [2024-11-16 23:52:20,563 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 94 transitions, 219 flow [2024-11-16 23:52:20,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:20,564 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:20,564 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] [2024-11-16 23:52:20,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 23:52:20,564 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:52:20,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:20,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1808434979, now seen corresponding path program 1 times [2024-11-16 23:52:20,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:20,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550370526] [2024-11-16 23:52:20,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:20,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:21,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:21,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:52:21,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550370526] [2024-11-16 23:52:21,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550370526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:52:21,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:52:21,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:52:21,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699550011] [2024-11-16 23:52:21,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:52:21,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:52:21,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:52:21,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:52:21,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:52:21,275 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 96 [2024-11-16 23:52:21,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 219 flow. Second operand has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:21,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:52:21,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 96 [2024-11-16 23:52:21,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:52:21,348 INFO L124 PetriNetUnfolderBase]: 5/158 cut-off events. [2024-11-16 23:52:21,348 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-16 23:52:21,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 158 events. 5/158 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 362 event pairs, 1 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 217. Up to 21 conditions per place. [2024-11-16 23:52:21,352 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 14 selfloop transitions, 5 changer transitions 0/93 dead transitions. [2024-11-16 23:52:21,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 93 transitions, 255 flow [2024-11-16 23:52:21,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:52:21,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:52:21,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 452 transitions. [2024-11-16 23:52:21,358 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7847222222222222 [2024-11-16 23:52:21,358 INFO L175 Difference]: Start difference. First operand has 97 places, 94 transitions, 219 flow. Second operand 6 states and 452 transitions. [2024-11-16 23:52:21,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 93 transitions, 255 flow [2024-11-16 23:52:21,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 93 transitions, 247 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:52:21,363 INFO L231 Difference]: Finished difference. Result has 99 places, 93 transitions, 219 flow [2024-11-16 23:52:21,363 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=99, PETRI_TRANSITIONS=93} [2024-11-16 23:52:21,364 INFO L277 CegarLoopForPetriNet]: 93 programPoint places, 6 predicate places. [2024-11-16 23:52:21,365 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 93 transitions, 219 flow [2024-11-16 23:52:21,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:21,365 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:21,365 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] [2024-11-16 23:52:21,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 23:52:21,366 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:52:21,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:21,366 INFO L85 PathProgramCache]: Analyzing trace with hash 335540212, now seen corresponding path program 1 times [2024-11-16 23:52:21,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:21,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147465626] [2024-11-16 23:52:21,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:21,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:21,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:21,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:52:21,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147465626] [2024-11-16 23:52:21,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147465626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:52:21,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:52:21,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:52:21,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734667251] [2024-11-16 23:52:21,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:52:21,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:52:21,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:52:21,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:52:21,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:52:21,416 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 96 [2024-11-16 23:52:21,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 93 transitions, 219 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:21,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:52:21,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 96 [2024-11-16 23:52:21,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:52:21,448 INFO L124 PetriNetUnfolderBase]: 18/227 cut-off events. [2024-11-16 23:52:21,448 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-11-16 23:52:21,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 227 events. 18/227 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 727 event pairs, 4 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 295. Up to 29 conditions per place. [2024-11-16 23:52:21,451 INFO L140 encePairwiseOnDemand]: 91/96 looper letters, 9 selfloop transitions, 4 changer transitions 0/96 dead transitions. [2024-11-16 23:52:21,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 96 transitions, 251 flow [2024-11-16 23:52:21,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:52:21,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:52:21,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2024-11-16 23:52:21,454 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9027777777777778 [2024-11-16 23:52:21,454 INFO L175 Difference]: Start difference. First operand has 99 places, 93 transitions, 219 flow. Second operand 3 states and 260 transitions. [2024-11-16 23:52:21,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 96 transitions, 251 flow [2024-11-16 23:52:21,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 96 transitions, 241 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:52:21,458 INFO L231 Difference]: Finished difference. Result has 98 places, 96 transitions, 239 flow [2024-11-16 23:52:21,459 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=239, PETRI_PLACES=98, PETRI_TRANSITIONS=96} [2024-11-16 23:52:21,459 INFO L277 CegarLoopForPetriNet]: 93 programPoint places, 5 predicate places. [2024-11-16 23:52:21,460 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 96 transitions, 239 flow [2024-11-16 23:52:21,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:21,460 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:21,462 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] [2024-11-16 23:52:21,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 23:52:21,462 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:52:21,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:21,463 INFO L85 PathProgramCache]: Analyzing trace with hash -412206281, now seen corresponding path program 1 times [2024-11-16 23:52:21,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:21,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091741357] [2024-11-16 23:52:21,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:21,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:21,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:21,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:52:21,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091741357] [2024-11-16 23:52:21,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091741357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:52:21,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:52:21,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:52:21,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274400645] [2024-11-16 23:52:21,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:52:21,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:52:21,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:52:21,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:52:21,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:52:21,534 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 96 [2024-11-16 23:52:21,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 96 transitions, 239 flow. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:21,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:52:21,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 96 [2024-11-16 23:52:21,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:52:21,578 INFO L124 PetriNetUnfolderBase]: 19/273 cut-off events. [2024-11-16 23:52:21,579 INFO L125 PetriNetUnfolderBase]: For 50/57 co-relation queries the response was YES. [2024-11-16 23:52:21,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 273 events. 19/273 cut-off events. For 50/57 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 961 event pairs, 1 based on Foata normal form. 2/244 useless extension candidates. Maximal degree in co-relation 377. Up to 24 conditions per place. [2024-11-16 23:52:21,581 INFO L140 encePairwiseOnDemand]: 92/96 looper letters, 8 selfloop transitions, 4 changer transitions 0/101 dead transitions. [2024-11-16 23:52:21,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 101 transitions, 286 flow [2024-11-16 23:52:21,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:52:21,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:52:21,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 269 transitions. [2024-11-16 23:52:21,584 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9340277777777778 [2024-11-16 23:52:21,585 INFO L175 Difference]: Start difference. First operand has 98 places, 96 transitions, 239 flow. Second operand 3 states and 269 transitions. [2024-11-16 23:52:21,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 101 transitions, 286 flow [2024-11-16 23:52:21,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 101 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:52:21,590 INFO L231 Difference]: Finished difference. Result has 100 places, 100 transitions, 271 flow [2024-11-16 23:52:21,591 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=271, PETRI_PLACES=100, PETRI_TRANSITIONS=100} [2024-11-16 23:52:21,592 INFO L277 CegarLoopForPetriNet]: 93 programPoint places, 7 predicate places. [2024-11-16 23:52:21,594 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 100 transitions, 271 flow [2024-11-16 23:52:21,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:21,594 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:21,595 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] [2024-11-16 23:52:21,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 23:52:21,595 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:52:21,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:21,598 INFO L85 PathProgramCache]: Analyzing trace with hash -725652205, now seen corresponding path program 1 times [2024-11-16 23:52:21,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:21,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056944091] [2024-11-16 23:52:21,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:21,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:21,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:21,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:52:21,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056944091] [2024-11-16 23:52:21,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056944091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:52:21,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:52:21,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:52:21,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564640024] [2024-11-16 23:52:21,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:52:21,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:52:21,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:52:21,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:52:21,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:52:21,657 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 96 [2024-11-16 23:52:21,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 100 transitions, 271 flow. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:21,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:52:21,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 96 [2024-11-16 23:52:21,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:52:21,711 INFO L124 PetriNetUnfolderBase]: 19/342 cut-off events. [2024-11-16 23:52:21,711 INFO L125 PetriNetUnfolderBase]: For 74/88 co-relation queries the response was YES. [2024-11-16 23:52:21,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 342 events. 19/342 cut-off events. For 74/88 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1409 event pairs, 0 based on Foata normal form. 4/316 useless extension candidates. Maximal degree in co-relation 479. Up to 26 conditions per place. [2024-11-16 23:52:21,713 INFO L140 encePairwiseOnDemand]: 92/96 looper letters, 6 selfloop transitions, 4 changer transitions 0/103 dead transitions. [2024-11-16 23:52:21,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 103 transitions, 302 flow [2024-11-16 23:52:21,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:52:21,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:52:21,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2024-11-16 23:52:21,715 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9305555555555556 [2024-11-16 23:52:21,715 INFO L175 Difference]: Start difference. First operand has 100 places, 100 transitions, 271 flow. Second operand 3 states and 268 transitions. [2024-11-16 23:52:21,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 103 transitions, 302 flow [2024-11-16 23:52:21,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 103 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:52:21,719 INFO L231 Difference]: Finished difference. Result has 102 places, 102 transitions, 291 flow [2024-11-16 23:52:21,720 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=291, PETRI_PLACES=102, PETRI_TRANSITIONS=102} [2024-11-16 23:52:21,721 INFO L277 CegarLoopForPetriNet]: 93 programPoint places, 9 predicate places. [2024-11-16 23:52:21,722 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 102 transitions, 291 flow [2024-11-16 23:52:21,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:21,722 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:21,722 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:52:21,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 23:52:21,723 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:52:21,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:21,723 INFO L85 PathProgramCache]: Analyzing trace with hash 233516993, now seen corresponding path program 1 times [2024-11-16 23:52:21,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:21,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774029412] [2024-11-16 23:52:21,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:21,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:21,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:21,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:52:21,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774029412] [2024-11-16 23:52:21,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774029412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:52:21,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:52:21,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:52:21,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005831301] [2024-11-16 23:52:21,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:52:21,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 23:52:21,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:52:21,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 23:52:21,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 23:52:21,952 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 96 [2024-11-16 23:52:21,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 102 transitions, 291 flow. Second operand has 5 states, 5 states have (on average 80.4) internal successors, (402), 5 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:21,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:52:21,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 96 [2024-11-16 23:52:21,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:52:22,006 INFO L124 PetriNetUnfolderBase]: 19/349 cut-off events. [2024-11-16 23:52:22,007 INFO L125 PetriNetUnfolderBase]: For 66/72 co-relation queries the response was YES. [2024-11-16 23:52:22,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 349 events. 19/349 cut-off events. For 66/72 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1454 event pairs, 0 based on Foata normal form. 1/330 useless extension candidates. Maximal degree in co-relation 528. Up to 44 conditions per place. [2024-11-16 23:52:22,008 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 11 selfloop transitions, 2 changer transitions 5/107 dead transitions. [2024-11-16 23:52:22,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 107 transitions, 337 flow [2024-11-16 23:52:22,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:52:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:52:22,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 493 transitions. [2024-11-16 23:52:22,011 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8559027777777778 [2024-11-16 23:52:22,012 INFO L175 Difference]: Start difference. First operand has 102 places, 102 transitions, 291 flow. Second operand 6 states and 493 transitions. [2024-11-16 23:52:22,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 107 transitions, 337 flow [2024-11-16 23:52:22,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 107 transitions, 329 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:52:22,016 INFO L231 Difference]: Finished difference. Result has 109 places, 102 transitions, 301 flow [2024-11-16 23:52:22,017 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=301, PETRI_PLACES=109, PETRI_TRANSITIONS=102} [2024-11-16 23:52:22,017 INFO L277 CegarLoopForPetriNet]: 93 programPoint places, 16 predicate places. [2024-11-16 23:52:22,018 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 102 transitions, 301 flow [2024-11-16 23:52:22,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.4) internal successors, (402), 5 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:22,019 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:22,019 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:52:22,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 23:52:22,019 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:52:22,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:22,020 INFO L85 PathProgramCache]: Analyzing trace with hash -934061840, now seen corresponding path program 1 times [2024-11-16 23:52:22,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:22,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935133340] [2024-11-16 23:52:22,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:22,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:52:22,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 23:52:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:52:22,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 23:52:22,096 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 23:52:22,098 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-11-16 23:52:22,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-11-16 23:52:22,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-11-16 23:52:22,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-11-16 23:52:22,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-11-16 23:52:22,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-11-16 23:52:22,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-11-16 23:52:22,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-11-16 23:52:22,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-11-16 23:52:22,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 23:52:22,102 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:52:22,104 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-16 23:52:22,105 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-16 23:52:22,122 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-16 23:52:22,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 111 transitions, 238 flow [2024-11-16 23:52:22,148 INFO L124 PetriNetUnfolderBase]: 15/240 cut-off events. [2024-11-16 23:52:22,149 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-16 23:52:22,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 240 events. 15/240 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 469 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 146. Up to 8 conditions per place. [2024-11-16 23:52:22,150 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 111 transitions, 238 flow [2024-11-16 23:52:22,151 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 111 transitions, 238 flow [2024-11-16 23:52:22,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:52:22,153 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;@71798874, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:52:22,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-16 23:52:22,157 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:52:22,158 INFO L124 PetriNetUnfolderBase]: 2/39 cut-off events. [2024-11-16 23:52:22,158 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:52:22,158 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:22,158 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:52:22,159 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-16 23:52:22,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:22,159 INFO L85 PathProgramCache]: Analyzing trace with hash 531284235, now seen corresponding path program 1 times [2024-11-16 23:52:22,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:22,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554250168] [2024-11-16 23:52:22,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:22,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:22,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:22,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:52:22,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554250168] [2024-11-16 23:52:22,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554250168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:52:22,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:52:22,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:52:22,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073266028] [2024-11-16 23:52:22,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:52:22,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 23:52:22,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:52:22,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 23:52:22,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 23:52:22,187 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 111 [2024-11-16 23:52:22,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 111 transitions, 238 flow. Second operand has 2 states, 2 states have (on average 102.5) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:22,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:52:22,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 111 [2024-11-16 23:52:22,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:52:22,228 INFO L124 PetriNetUnfolderBase]: 5/230 cut-off events. [2024-11-16 23:52:22,229 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-11-16 23:52:22,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 230 events. 5/230 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 464 event pairs, 0 based on Foata normal form. 13/216 useless extension candidates. Maximal degree in co-relation 142. Up to 7 conditions per place. [2024-11-16 23:52:22,231 INFO L140 encePairwiseOnDemand]: 106/111 looper letters, 4 selfloop transitions, 0 changer transitions 1/106 dead transitions. [2024-11-16 23:52:22,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 106 transitions, 236 flow [2024-11-16 23:52:22,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 23:52:22,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-16 23:52:22,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 213 transitions. [2024-11-16 23:52:22,232 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9594594594594594 [2024-11-16 23:52:22,233 INFO L175 Difference]: Start difference. First operand has 107 places, 111 transitions, 238 flow. Second operand 2 states and 213 transitions. [2024-11-16 23:52:22,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 106 transitions, 236 flow [2024-11-16 23:52:22,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 106 transitions, 236 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:52:22,235 INFO L231 Difference]: Finished difference. Result has 108 places, 105 transitions, 226 flow [2024-11-16 23:52:22,235 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=226, PETRI_PLACES=108, PETRI_TRANSITIONS=105} [2024-11-16 23:52:22,236 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 1 predicate places. [2024-11-16 23:52:22,237 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 105 transitions, 226 flow [2024-11-16 23:52:22,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 102.5) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:22,237 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:22,238 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] [2024-11-16 23:52:22,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 23:52:22,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-16 23:52:22,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:22,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1828959090, now seen corresponding path program 1 times [2024-11-16 23:52:22,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:22,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872399003] [2024-11-16 23:52:22,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:22,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:22,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:52:22,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872399003] [2024-11-16 23:52:22,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872399003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:52:22,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:52:22,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:52:22,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774598649] [2024-11-16 23:52:22,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:52:22,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:52:22,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:52:22,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:52:22,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:52:22,306 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 111 [2024-11-16 23:52:22,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 105 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:22,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:52:22,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 111 [2024-11-16 23:52:22,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:52:22,370 INFO L124 PetriNetUnfolderBase]: 43/443 cut-off events. [2024-11-16 23:52:22,371 INFO L125 PetriNetUnfolderBase]: For 36/43 co-relation queries the response was YES. [2024-11-16 23:52:22,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 563 conditions, 443 events. 43/443 cut-off events. For 36/43 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1898 event pairs, 23 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 558. Up to 83 conditions per place. [2024-11-16 23:52:22,376 INFO L140 encePairwiseOnDemand]: 105/111 looper letters, 12 selfloop transitions, 5 changer transitions 0/109 dead transitions. [2024-11-16 23:52:22,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 109 transitions, 268 flow [2024-11-16 23:52:22,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:52:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:52:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2024-11-16 23:52:22,378 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8918918918918919 [2024-11-16 23:52:22,378 INFO L175 Difference]: Start difference. First operand has 108 places, 105 transitions, 226 flow. Second operand 3 states and 297 transitions. [2024-11-16 23:52:22,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 109 transitions, 268 flow [2024-11-16 23:52:22,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 109 transitions, 268 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:52:22,381 INFO L231 Difference]: Finished difference. Result has 111 places, 109 transitions, 264 flow [2024-11-16 23:52:22,381 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=111, PETRI_TRANSITIONS=109} [2024-11-16 23:52:22,382 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 4 predicate places. [2024-11-16 23:52:22,383 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 109 transitions, 264 flow [2024-11-16 23:52:22,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:22,383 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:22,383 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] [2024-11-16 23:52:22,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 23:52:22,384 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-16 23:52:22,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:22,385 INFO L85 PathProgramCache]: Analyzing trace with hash 384004978, now seen corresponding path program 1 times [2024-11-16 23:52:22,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:22,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69593473] [2024-11-16 23:52:22,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:22,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:22,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:22,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:52:22,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69593473] [2024-11-16 23:52:22,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69593473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:52:22,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:52:22,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:52:22,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641635329] [2024-11-16 23:52:22,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:52:22,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:52:22,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:52:22,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:52:22,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:52:22,730 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 111 [2024-11-16 23:52:22,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 109 transitions, 264 flow. Second operand has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:22,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:52:22,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 111 [2024-11-16 23:52:22,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:52:22,810 INFO L124 PetriNetUnfolderBase]: 28/361 cut-off events. [2024-11-16 23:52:22,810 INFO L125 PetriNetUnfolderBase]: For 45/50 co-relation queries the response was YES. [2024-11-16 23:52:22,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 361 events. 28/361 cut-off events. For 45/50 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1324 event pairs, 9 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 519. Up to 45 conditions per place. [2024-11-16 23:52:22,813 INFO L140 encePairwiseOnDemand]: 105/111 looper letters, 16 selfloop transitions, 5 changer transitions 0/108 dead transitions. [2024-11-16 23:52:22,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 108 transitions, 304 flow [2024-11-16 23:52:22,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:52:22,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:52:22,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 526 transitions. [2024-11-16 23:52:22,815 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7897897897897898 [2024-11-16 23:52:22,815 INFO L175 Difference]: Start difference. First operand has 111 places, 109 transitions, 264 flow. Second operand 6 states and 526 transitions. [2024-11-16 23:52:22,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 108 transitions, 304 flow [2024-11-16 23:52:22,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 108 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:52:22,818 INFO L231 Difference]: Finished difference. Result has 113 places, 108 transitions, 262 flow [2024-11-16 23:52:22,819 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=113, PETRI_TRANSITIONS=108} [2024-11-16 23:52:22,819 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 6 predicate places. [2024-11-16 23:52:22,821 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 108 transitions, 262 flow [2024-11-16 23:52:22,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:22,821 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:22,821 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] [2024-11-16 23:52:22,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 23:52:22,822 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-16 23:52:22,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:22,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1968193667, now seen corresponding path program 1 times [2024-11-16 23:52:22,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:22,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092126232] [2024-11-16 23:52:22,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:22,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:22,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:52:22,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092126232] [2024-11-16 23:52:22,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092126232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:52:22,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:52:22,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:52:22,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647609189] [2024-11-16 23:52:22,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:52:22,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:52:22,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:52:22,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:52:22,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:52:22,869 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 111 [2024-11-16 23:52:22,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 108 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:22,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:52:22,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 111 [2024-11-16 23:52:22,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:52:22,937 INFO L124 PetriNetUnfolderBase]: 119/775 cut-off events. [2024-11-16 23:52:22,937 INFO L125 PetriNetUnfolderBase]: For 36/40 co-relation queries the response was YES. [2024-11-16 23:52:22,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 775 events. 119/775 cut-off events. For 36/40 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4400 event pairs, 39 based on Foata normal form. 0/619 useless extension candidates. Maximal degree in co-relation 1052. Up to 129 conditions per place. [2024-11-16 23:52:22,943 INFO L140 encePairwiseOnDemand]: 105/111 looper letters, 12 selfloop transitions, 5 changer transitions 0/112 dead transitions. [2024-11-16 23:52:22,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 112 transitions, 304 flow [2024-11-16 23:52:22,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:52:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:52:22,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2024-11-16 23:52:22,944 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8918918918918919 [2024-11-16 23:52:22,944 INFO L175 Difference]: Start difference. First operand has 113 places, 108 transitions, 262 flow. Second operand 3 states and 297 transitions. [2024-11-16 23:52:22,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 112 transitions, 304 flow [2024-11-16 23:52:22,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 112 transitions, 294 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:52:22,947 INFO L231 Difference]: Finished difference. Result has 112 places, 112 transitions, 290 flow [2024-11-16 23:52:22,947 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=112, PETRI_TRANSITIONS=112} [2024-11-16 23:52:22,948 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 5 predicate places. [2024-11-16 23:52:22,948 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 112 transitions, 290 flow [2024-11-16 23:52:22,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:22,948 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:22,948 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] [2024-11-16 23:52:22,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 23:52:22,949 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-16 23:52:22,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:22,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1220834457, now seen corresponding path program 1 times [2024-11-16 23:52:22,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:22,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220678779] [2024-11-16 23:52:22,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:22,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:22,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:22,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:52:22,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220678779] [2024-11-16 23:52:22,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220678779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:52:22,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:52:22,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:52:22,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594603300] [2024-11-16 23:52:22,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:52:22,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:52:22,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:52:22,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:52:22,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:52:22,988 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 111 [2024-11-16 23:52:22,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 112 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:22,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:52:22,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 111 [2024-11-16 23:52:22,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:52:23,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([316] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][115], [130#(= |#race~ready~0| 0), 25#L1022-1true, 106#true, 74#L1022-2true, Black: 114#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 110#true, 49#L1034true, 123#true, 108#true, Black: 125#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|)]) [2024-11-16 23:52:23,058 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2024-11-16 23:52:23,058 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-16 23:52:23,058 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-16 23:52:23,058 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-16 23:52:23,060 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][104], [130#(= |#race~ready~0| 0), 106#true, 33#L1022-1true, Black: 114#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 83#L1022-2true, 110#true, 49#L1034true, 123#true, 108#true, Black: 125#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|)]) [2024-11-16 23:52:23,061 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2024-11-16 23:52:23,061 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-16 23:52:23,061 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-16 23:52:23,061 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-16 23:52:23,065 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][58], [130#(= |#race~ready~0| 0), 106#true, 33#L1022-1true, 83#L1022-2true, Black: 114#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 59#L1035-6true, 110#true, 123#true, 108#true, Black: 125#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|)]) [2024-11-16 23:52:23,065 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2024-11-16 23:52:23,065 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-16 23:52:23,065 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-16 23:52:23,065 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-16 23:52:23,072 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([316] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][93], [130#(= |#race~ready~0| 0), 25#L1022-1true, 106#true, 74#L1022-2true, Black: 114#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 59#L1035-6true, 110#true, 123#true, 108#true, Black: 125#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|)]) [2024-11-16 23:52:23,072 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2024-11-16 23:52:23,072 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-16 23:52:23,072 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-16 23:52:23,072 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-16 23:52:23,161 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([331] threadEXIT-->L1036: Formula: (= v_threadThread1of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem12#1_8|) InVars {threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_8|} OutVars{threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_8|} AuxVars[] AssignedVars[][108], [130#(= |#race~ready~0| 0), Black: 114#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 110#true, 107#true, 41#L1036true, 123#true, 105#true, Black: 125#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|)]) [2024-11-16 23:52:23,161 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2024-11-16 23:52:23,161 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-16 23:52:23,161 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-16 23:52:23,161 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-16 23:52:23,161 INFO L124 PetriNetUnfolderBase]: 232/1485 cut-off events. [2024-11-16 23:52:23,161 INFO L125 PetriNetUnfolderBase]: For 435/514 co-relation queries the response was YES. [2024-11-16 23:52:23,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2298 conditions, 1485 events. 232/1485 cut-off events. For 435/514 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 11073 event pairs, 35 based on Foata normal form. 7/1246 useless extension candidates. Maximal degree in co-relation 2290. Up to 247 conditions per place. [2024-11-16 23:52:23,169 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 16 selfloop transitions, 7 changer transitions 0/122 dead transitions. [2024-11-16 23:52:23,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 122 transitions, 383 flow [2024-11-16 23:52:23,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:52:23,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:52:23,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2024-11-16 23:52:23,171 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.918918918918919 [2024-11-16 23:52:23,171 INFO L175 Difference]: Start difference. First operand has 112 places, 112 transitions, 290 flow. Second operand 3 states and 306 transitions. [2024-11-16 23:52:23,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 122 transitions, 383 flow [2024-11-16 23:52:23,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 122 transitions, 367 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:52:23,174 INFO L231 Difference]: Finished difference. Result has 114 places, 119 transitions, 350 flow [2024-11-16 23:52:23,174 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=114, PETRI_TRANSITIONS=119} [2024-11-16 23:52:23,175 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 7 predicate places. [2024-11-16 23:52:23,175 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 119 transitions, 350 flow [2024-11-16 23:52:23,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:23,176 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:23,176 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] [2024-11-16 23:52:23,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 23:52:23,176 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-16 23:52:23,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:23,177 INFO L85 PathProgramCache]: Analyzing trace with hash 96521984, now seen corresponding path program 1 times [2024-11-16 23:52:23,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:23,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322320549] [2024-11-16 23:52:23,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:23,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:23,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:23,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:52:23,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322320549] [2024-11-16 23:52:23,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322320549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:52:23,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:52:23,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:52:23,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745191133] [2024-11-16 23:52:23,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:52:23,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:52:23,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:52:23,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:52:23,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:52:23,223 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 111 [2024-11-16 23:52:23,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 119 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:23,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:52:23,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 111 [2024-11-16 23:52:23,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:52:23,310 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([316] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][121], [130#(= |#race~ready~0| 0), 106#true, 25#L1022-1true, Black: 114#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 74#L1022-2true, Black: 128#true, 110#true, 49#L1034true, 133#true, 108#true, Black: 125#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|)]) [2024-11-16 23:52:23,311 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2024-11-16 23:52:23,311 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-16 23:52:23,311 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-16 23:52:23,311 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-16 23:52:23,313 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][105], [130#(= |#race~ready~0| 0), 106#true, Black: 114#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 33#L1022-1true, 83#L1022-2true, Black: 128#true, 110#true, 49#L1034true, 133#true, 108#true, Black: 125#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|)]) [2024-11-16 23:52:23,313 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2024-11-16 23:52:23,314 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-16 23:52:23,314 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-16 23:52:23,314 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-16 23:52:23,320 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][58], [130#(= |#race~ready~0| 0), 106#true, Black: 128#true, Black: 114#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 33#L1022-1true, 83#L1022-2true, 59#L1035-6true, 110#true, 133#true, 108#true, Black: 125#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|)]) [2024-11-16 23:52:23,321 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2024-11-16 23:52:23,321 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-16 23:52:23,321 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-16 23:52:23,321 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-16 23:52:23,333 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([316] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][92], [130#(= |#race~ready~0| 0), 106#true, 25#L1022-1true, Black: 114#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 74#L1022-2true, Black: 128#true, 59#L1035-6true, 110#true, 133#true, 108#true, Black: 125#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|)]) [2024-11-16 23:52:23,333 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2024-11-16 23:52:23,334 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-16 23:52:23,334 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-16 23:52:23,334 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-16 23:52:23,530 INFO L124 PetriNetUnfolderBase]: 382/2641 cut-off events. [2024-11-16 23:52:23,531 INFO L125 PetriNetUnfolderBase]: For 892/1205 co-relation queries the response was YES. [2024-11-16 23:52:23,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4182 conditions, 2641 events. 382/2641 cut-off events. For 892/1205 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 23964 event pairs, 43 based on Foata normal form. 27/2342 useless extension candidates. Maximal degree in co-relation 4173. Up to 353 conditions per place. [2024-11-16 23:52:23,547 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 16 selfloop transitions, 7 changer transitions 0/129 dead transitions. [2024-11-16 23:52:23,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 129 transitions, 437 flow [2024-11-16 23:52:23,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:52:23,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:52:23,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2024-11-16 23:52:23,549 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.918918918918919 [2024-11-16 23:52:23,549 INFO L175 Difference]: Start difference. First operand has 114 places, 119 transitions, 350 flow. Second operand 3 states and 306 transitions. [2024-11-16 23:52:23,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 129 transitions, 437 flow [2024-11-16 23:52:23,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 129 transitions, 423 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:52:23,554 INFO L231 Difference]: Finished difference. Result has 116 places, 126 transitions, 406 flow [2024-11-16 23:52:23,554 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=116, PETRI_TRANSITIONS=126} [2024-11-16 23:52:23,555 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 9 predicate places. [2024-11-16 23:52:23,555 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 126 transitions, 406 flow [2024-11-16 23:52:23,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:23,556 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:23,556 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:52:23,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 23:52:23,556 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-16 23:52:23,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:23,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1567887632, now seen corresponding path program 1 times [2024-11-16 23:52:23,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:23,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360900057] [2024-11-16 23:52:23,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:23,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:23,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:52:23,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:52:23,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360900057] [2024-11-16 23:52:23,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360900057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:52:23,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:52:23,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:52:23,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655884839] [2024-11-16 23:52:23,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:52:23,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 23:52:23,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:52:23,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 23:52:23,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 23:52:23,724 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 111 [2024-11-16 23:52:23,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 126 transitions, 406 flow. Second operand has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:23,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:52:23,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 111 [2024-11-16 23:52:23,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:52:23,819 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][101], [106#true, 33#L1022-1true, Black: 114#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 83#L1022-2true, Black: 128#true, 110#true, 49#L1034true, 138#true, Black: 135#(= |#race~data~0| 0), 133#true, 108#true, Black: 125#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|)]) [2024-11-16 23:52:23,820 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2024-11-16 23:52:23,820 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-16 23:52:23,820 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-16 23:52:23,820 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-16 23:52:23,821 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([316] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][125], [25#L1022-1true, 106#true, Black: 114#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 74#L1022-2true, Black: 128#true, 110#true, 49#L1034true, 138#true, Black: 135#(= |#race~data~0| 0), 133#true, 108#true, Black: 125#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|)]) [2024-11-16 23:52:23,821 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2024-11-16 23:52:23,821 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-16 23:52:23,821 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-16 23:52:23,821 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-16 23:52:23,830 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][57], [106#true, 33#L1022-1true, Black: 114#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 83#L1022-2true, Black: 128#true, 59#L1035-6true, 110#true, 138#true, Black: 135#(= |#race~data~0| 0), 133#true, 108#true, Black: 125#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|)]) [2024-11-16 23:52:23,830 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2024-11-16 23:52:23,830 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-16 23:52:23,830 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-16 23:52:23,830 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-16 23:52:23,841 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([316] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][79], [25#L1022-1true, 106#true, Black: 114#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 74#L1022-2true, Black: 128#true, 59#L1035-6true, 110#true, 138#true, Black: 135#(= |#race~data~0| 0), 133#true, 108#true, Black: 125#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|)]) [2024-11-16 23:52:23,841 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2024-11-16 23:52:23,842 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-16 23:52:23,842 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-16 23:52:23,842 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-16 23:52:24,011 INFO L124 PetriNetUnfolderBase]: 363/2625 cut-off events. [2024-11-16 23:52:24,011 INFO L125 PetriNetUnfolderBase]: For 803/1052 co-relation queries the response was YES. [2024-11-16 23:52:24,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4411 conditions, 2625 events. 363/2625 cut-off events. For 803/1052 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 24059 event pairs, 33 based on Foata normal form. 1/2374 useless extension candidates. Maximal degree in co-relation 4401. Up to 329 conditions per place. [2024-11-16 23:52:24,026 INFO L140 encePairwiseOnDemand]: 103/111 looper letters, 14 selfloop transitions, 2 changer transitions 5/132 dead transitions. [2024-11-16 23:52:24,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 132 transitions, 460 flow [2024-11-16 23:52:24,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:52:24,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:52:24,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 568 transitions. [2024-11-16 23:52:24,028 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8528528528528528 [2024-11-16 23:52:24,028 INFO L175 Difference]: Start difference. First operand has 116 places, 126 transitions, 406 flow. Second operand 6 states and 568 transitions. [2024-11-16 23:52:24,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 132 transitions, 460 flow [2024-11-16 23:52:24,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 132 transitions, 446 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:52:24,033 INFO L231 Difference]: Finished difference. Result has 123 places, 127 transitions, 414 flow [2024-11-16 23:52:24,034 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=414, PETRI_PLACES=123, PETRI_TRANSITIONS=127} [2024-11-16 23:52:24,034 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 16 predicate places. [2024-11-16 23:52:24,034 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 127 transitions, 414 flow [2024-11-16 23:52:24,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:24,035 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:24,035 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:52:24,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 23:52:24,036 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-16 23:52:24,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:24,036 INFO L85 PathProgramCache]: Analyzing trace with hash -847161916, now seen corresponding path program 1 times [2024-11-16 23:52:24,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:24,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938157793] [2024-11-16 23:52:24,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:24,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:52:24,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 23:52:24,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:52:24,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938157793] [2024-11-16 23:52:24,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938157793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:52:24,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:52:24,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:52:24,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558170319] [2024-11-16 23:52:24,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:52:24,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:52:24,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:52:24,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:52:24,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:52:24,153 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 111 [2024-11-16 23:52:24,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 127 transitions, 414 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:24,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:52:24,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 111 [2024-11-16 23:52:24,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:52:24,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][78], [33#L1022-1true, 83#L1022-2true, Black: 128#true, 110#true, Black: 135#(= |#race~data~0| 0), 108#true, 149#true, Black: 140#(= |ULTIMATE.start_main_~i~0#1| 0), 106#true, Black: 141#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 144#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 114#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 142#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 49#L1034true, 138#true, Black: 125#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|)]) [2024-11-16 23:52:24,204 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2024-11-16 23:52:24,204 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-16 23:52:24,204 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-16 23:52:24,205 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-16 23:52:24,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([316] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][103], [Black: 128#true, 110#true, Black: 135#(= |#race~data~0| 0), 108#true, 149#true, Black: 140#(= |ULTIMATE.start_main_~i~0#1| 0), 106#true, 25#L1022-1true, Black: 141#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 144#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 114#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 74#L1022-2true, Black: 142#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 49#L1034true, 138#true, Black: 125#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|)]) [2024-11-16 23:52:24,207 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2024-11-16 23:52:24,207 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-16 23:52:24,207 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-16 23:52:24,207 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-16 23:52:24,214 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][40], [33#L1022-1true, Black: 128#true, 83#L1022-2true, 59#L1035-6true, 110#true, Black: 135#(= |#race~data~0| 0), 108#true, 149#true, Black: 140#(= |ULTIMATE.start_main_~i~0#1| 0), 106#true, Black: 141#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 144#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 114#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 142#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 138#true, Black: 125#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|)]) [2024-11-16 23:52:24,214 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2024-11-16 23:52:24,214 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-16 23:52:24,214 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-16 23:52:24,214 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-16 23:52:24,221 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([316] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][58], [Black: 128#true, 59#L1035-6true, 110#true, Black: 135#(= |#race~data~0| 0), 108#true, 149#true, Black: 140#(= |ULTIMATE.start_main_~i~0#1| 0), 106#true, Black: 141#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 25#L1022-1true, Black: 144#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 114#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 74#L1022-2true, Black: 142#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 138#true, Black: 125#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|)]) [2024-11-16 23:52:24,222 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2024-11-16 23:52:24,222 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-16 23:52:24,222 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-16 23:52:24,222 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-16 23:52:24,303 INFO L124 PetriNetUnfolderBase]: 216/1461 cut-off events. [2024-11-16 23:52:24,303 INFO L125 PetriNetUnfolderBase]: For 368/499 co-relation queries the response was YES. [2024-11-16 23:52:24,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2418 conditions, 1461 events. 216/1461 cut-off events. For 368/499 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 11274 event pairs, 32 based on Foata normal form. 9/1359 useless extension candidates. Maximal degree in co-relation 2404. Up to 214 conditions per place. [2024-11-16 23:52:24,314 INFO L140 encePairwiseOnDemand]: 107/111 looper letters, 6 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2024-11-16 23:52:24,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 115 transitions, 372 flow [2024-11-16 23:52:24,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:52:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:52:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2024-11-16 23:52:24,316 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9129129129129129 [2024-11-16 23:52:24,316 INFO L175 Difference]: Start difference. First operand has 123 places, 127 transitions, 414 flow. Second operand 3 states and 304 transitions. [2024-11-16 23:52:24,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 115 transitions, 372 flow [2024-11-16 23:52:24,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 115 transitions, 350 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-16 23:52:24,321 INFO L231 Difference]: Finished difference. Result has 115 places, 115 transitions, 344 flow [2024-11-16 23:52:24,322 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=115, PETRI_TRANSITIONS=115} [2024-11-16 23:52:24,322 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 8 predicate places. [2024-11-16 23:52:24,322 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 115 transitions, 344 flow [2024-11-16 23:52:24,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:52:24,323 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:52:24,323 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:52:24,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 23:52:24,323 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-16 23:52:24,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:52:24,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1188570079, now seen corresponding path program 1 times [2024-11-16 23:52:24,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:52:24,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468251537] [2024-11-16 23:52:24,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:52:24,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:52:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:52:24,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 23:52:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:52:24,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 23:52:24,347 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 23:52:24,347 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr1ASSERT_VIOLATIONDATA_RACE (10 of 11 remaining) [2024-11-16 23:52:24,347 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-11-16 23:52:24,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-11-16 23:52:24,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-11-16 23:52:24,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-11-16 23:52:24,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 11 remaining) [2024-11-16 23:52:24,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-11-16 23:52:24,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-11-16 23:52:24,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-11-16 23:52:24,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-11-16 23:52:24,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-11-16 23:52:24,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 23:52:24,350 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:52:24,400 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-11-16 23:52:24,400 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 23:52:24,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:52:24 BasicIcfg [2024-11-16 23:52:24,407 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 23:52:24,407 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 23:52:24,407 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 23:52:24,407 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 23:52:24,408 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:52:19" (3/4) ... [2024-11-16 23:52:24,409 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 23:52:24,460 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 23:52:24,460 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 23:52:24,461 INFO L158 Benchmark]: Toolchain (without parser) took 5921.93ms. Allocated memory was 169.9MB in the beginning and 249.6MB in the end (delta: 79.7MB). Free memory was 139.0MB in the beginning and 213.7MB in the end (delta: -74.7MB). Peak memory consumption was 151.0MB. Max. memory is 16.1GB. [2024-11-16 23:52:24,461 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 109.1MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 23:52:24,461 INFO L158 Benchmark]: CACSL2BoogieTranslator took 664.50ms. Allocated memory is still 169.9MB. Free memory was 139.0MB in the beginning and 107.7MB in the end (delta: 31.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-16 23:52:24,461 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.96ms. Allocated memory is still 169.9MB. Free memory was 107.7MB in the beginning and 105.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 23:52:24,462 INFO L158 Benchmark]: Boogie Preprocessor took 23.91ms. Allocated memory is still 169.9MB. Free memory was 105.6MB in the beginning and 104.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 23:52:24,462 INFO L158 Benchmark]: IcfgBuilder took 477.76ms. Allocated memory is still 169.9MB. Free memory was 104.6MB in the beginning and 128.3MB in the end (delta: -23.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 23:52:24,462 INFO L158 Benchmark]: TraceAbstraction took 4638.87ms. Allocated memory was 169.9MB in the beginning and 249.6MB in the end (delta: 79.7MB). Free memory was 128.3MB in the beginning and 73.4MB in the end (delta: 54.9MB). Peak memory consumption was 136.5MB. Max. memory is 16.1GB. [2024-11-16 23:52:24,462 INFO L158 Benchmark]: Witness Printer took 52.78ms. Allocated memory is still 249.6MB. Free memory was 73.4MB in the beginning and 213.7MB in the end (delta: -140.3MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2024-11-16 23:52:24,464 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.21ms. Allocated memory is still 109.1MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 664.50ms. Allocated memory is still 169.9MB. Free memory was 139.0MB in the beginning and 107.7MB in the end (delta: 31.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.96ms. Allocated memory is still 169.9MB. Free memory was 107.7MB in the beginning and 105.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.91ms. Allocated memory is still 169.9MB. Free memory was 105.6MB in the beginning and 104.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 477.76ms. Allocated memory is still 169.9MB. Free memory was 104.6MB in the beginning and 128.3MB in the end (delta: -23.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4638.87ms. Allocated memory was 169.9MB in the beginning and 249.6MB in the end (delta: 79.7MB). Free memory was 128.3MB in the beginning and 73.4MB in the end (delta: 54.9MB). Peak memory consumption was 136.5MB. Max. memory is 16.1GB. * Witness Printer took 52.78ms. Allocated memory is still 249.6MB. Free memory was 73.4MB in the beginning and 213.7MB in the end (delta: -140.3MB). Peak memory consumption was 6.5MB. 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, 103 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: 2.2s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 220 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 120 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 315 IncrementalHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 17 mSDtfsCounter, 315 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=7, InterpolantAutomatonStates: 26, 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.8s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 234 ConstructedInterpolants, 0 QuantifiedInterpolants, 403 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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, 115 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: 2.2s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 265 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 137 mSDsluCounter, 119 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 340 IncrementalHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 83 mSDtfsCounter, 340 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=414occurred in iteration=7, InterpolantAutomatonStates: 29, 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.5s InterpolantComputationTime, 348 NumberOfCodeBlocks, 348 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 285 ConstructedInterpolants, 0 QuantifiedInterpolants, 548 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-16 23:52:24,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE