./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/mult-dist.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/mult-dist.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 c31f1603fd15e011308b2e8fcd1cd45b23f0b00ac0b8b466c4f212460081639c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:38:51,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:38:51,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:38:51,685 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:38:51,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:38:51,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:38:51,713 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:38:51,713 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:38:51,713 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:38:51,714 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:38:51,714 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:38:51,714 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:38:51,714 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:38:51,714 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:38:51,714 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:38:51,715 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:38:51,715 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:38:51,715 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:38:51,715 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:38:51,715 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:38:51,715 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:38:51,715 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:38:51,715 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:38:51,716 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:38:51,716 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:38:51,716 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:38:51,716 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:38:51,716 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:38:51,716 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:38:51,716 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:38:51,716 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:38:51,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:38:51,717 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:38:51,717 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:38:51,717 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:38:51,717 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:38:51,717 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:38:51,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:38:51,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:38:51,718 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:38:51,718 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:38:51,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:38:51,718 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> c31f1603fd15e011308b2e8fcd1cd45b23f0b00ac0b8b466c4f212460081639c [2025-02-08 05:38:52,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:38:52,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:38:52,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:38:52,013 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:38:52,013 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:38:52,014 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/mult-dist.wvr.c [2025-02-08 05:38:53,361 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/12e6dbcfb/cfc5d5f532134c91aebc060327dc3ed8/FLAG786ad1f7a [2025-02-08 05:38:53,576 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:38:53,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/mult-dist.wvr.c [2025-02-08 05:38:53,600 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/12e6dbcfb/cfc5d5f532134c91aebc060327dc3ed8/FLAG786ad1f7a [2025-02-08 05:38:53,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/12e6dbcfb/cfc5d5f532134c91aebc060327dc3ed8 [2025-02-08 05:38:53,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:38:53,625 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:38:53,626 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:38:53,626 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:38:53,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:38:53,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:38:53" (1/1) ... [2025-02-08 05:38:53,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@673c1d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:53, skipping insertion in model container [2025-02-08 05:38:53,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:38:53" (1/1) ... [2025-02-08 05:38:53,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:38:53,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:38:53,805 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:38:53,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:38:53,842 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:38:53,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:53 WrapperNode [2025-02-08 05:38:53,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:38:53,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:38:53,844 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:38:53,844 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:38:53,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:53" (1/1) ... [2025-02-08 05:38:53,852 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:53" (1/1) ... [2025-02-08 05:38:53,864 INFO L138 Inliner]: procedures = 21, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2025-02-08 05:38:53,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:38:53,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:38:53,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:38:53,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:38:53,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:53" (1/1) ... [2025-02-08 05:38:53,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:53" (1/1) ... [2025-02-08 05:38:53,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:53" (1/1) ... [2025-02-08 05:38:53,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:53" (1/1) ... [2025-02-08 05:38:53,874 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:53" (1/1) ... [2025-02-08 05:38:53,875 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:53" (1/1) ... [2025-02-08 05:38:53,876 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:53" (1/1) ... [2025-02-08 05:38:53,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:53" (1/1) ... [2025-02-08 05:38:53,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:38:53,879 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:38:53,879 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:38:53,879 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:38:53,880 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:53" (1/1) ... [2025-02-08 05:38:53,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:38:53,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:38:53,919 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:38:53,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:38:53,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:38:53,942 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:38:53,943 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:38:53,943 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:38:53,943 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:38:53,943 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:38:53,943 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:38:53,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:38:53,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:38:53,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:38:53,945 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:38:54,039 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:38:54,041 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:38:54,273 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:38:54,273 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:38:54,291 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:38:54,291 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:38:54,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:54 BoogieIcfgContainer [2025-02-08 05:38:54,292 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:38:54,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:38:54,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:38:54,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:38:54,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:38:53" (1/3) ... [2025-02-08 05:38:54,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27562e46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:38:54, skipping insertion in model container [2025-02-08 05:38:54,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:53" (2/3) ... [2025-02-08 05:38:54,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27562e46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:38:54, skipping insertion in model container [2025-02-08 05:38:54,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:54" (3/3) ... [2025-02-08 05:38:54,299 INFO L128 eAbstractionObserver]: Analyzing ICFG mult-dist.wvr.c [2025-02-08 05:38:54,312 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:38:54,314 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mult-dist.wvr.c that has 4 procedures, 165 locations, 1 initial locations, 3 loop locations, and 19 error locations. [2025-02-08 05:38:54,314 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:38:54,423 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:38:54,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 171 transitions, 363 flow [2025-02-08 05:38:54,547 INFO L124 PetriNetUnfolderBase]: 7/168 cut-off events. [2025-02-08 05:38:54,551 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:38:54,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 168 events. 7/168 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 283 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 112. Up to 2 conditions per place. [2025-02-08 05:38:54,558 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 171 transitions, 363 flow [2025-02-08 05:38:54,565 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 151 transitions, 320 flow [2025-02-08 05:38:54,576 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:38:54,587 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;@5b8b4716, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:38:54,588 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-02-08 05:38:54,597 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:38:54,598 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-02-08 05:38:54,598 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:38:54,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:54,599 INFO L206 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] [2025-02-08 05:38:54,599 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:54,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:54,609 INFO L85 PathProgramCache]: Analyzing trace with hash -386637682, now seen corresponding path program 1 times [2025-02-08 05:38:54,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:54,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414240124] [2025-02-08 05:38:54,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:54,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:54,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:38:54,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:38:54,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:54,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:54,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:54,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:54,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414240124] [2025-02-08 05:38:54,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414240124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:54,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:54,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:54,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051334624] [2025-02-08 05:38:54,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:54,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:54,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:54,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:54,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:54,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 171 [2025-02-08 05:38:54,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 151 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 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) [2025-02-08 05:38:54,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:54,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 171 [2025-02-08 05:38:54,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:54,985 INFO L124 PetriNetUnfolderBase]: 11/226 cut-off events. [2025-02-08 05:38:54,985 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 05:38:54,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 226 events. 11/226 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 753 event pairs, 5 based on Foata normal form. 8/197 useless extension candidates. Maximal degree in co-relation 188. Up to 25 conditions per place. [2025-02-08 05:38:54,992 INFO L140 encePairwiseOnDemand]: 165/171 looper letters, 11 selfloop transitions, 2 changer transitions 0/147 dead transitions. [2025-02-08 05:38:54,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 147 transitions, 338 flow [2025-02-08 05:38:54,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:54,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2025-02-08 05:38:55,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9161793372319688 [2025-02-08 05:38:55,007 INFO L175 Difference]: Start difference. First operand has 155 places, 151 transitions, 320 flow. Second operand 3 states and 470 transitions. [2025-02-08 05:38:55,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 147 transitions, 338 flow [2025-02-08 05:38:55,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 147 transitions, 326 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:38:55,031 INFO L231 Difference]: Finished difference. Result has 150 places, 147 transitions, 304 flow [2025-02-08 05:38:55,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=150, PETRI_TRANSITIONS=147} [2025-02-08 05:38:55,039 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -5 predicate places. [2025-02-08 05:38:55,041 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 147 transitions, 304 flow [2025-02-08 05:38:55,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 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) [2025-02-08 05:38:55,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:55,042 INFO L206 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] [2025-02-08 05:38:55,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:38:55,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:55,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:55,044 INFO L85 PathProgramCache]: Analyzing trace with hash 5136324, now seen corresponding path program 1 times [2025-02-08 05:38:55,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:55,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941484228] [2025-02-08 05:38:55,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:55,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:55,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 05:38:55,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 05:38:55,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:55,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:55,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:55,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:55,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941484228] [2025-02-08 05:38:55,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941484228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:55,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:55,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:55,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066085708] [2025-02-08 05:38:55,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:55,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:55,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:55,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:55,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:55,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 171 [2025-02-08 05:38:55,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 147 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 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) [2025-02-08 05:38:55,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:55,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 171 [2025-02-08 05:38:55,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:55,204 INFO L124 PetriNetUnfolderBase]: 14/229 cut-off events. [2025-02-08 05:38:55,205 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:38:55,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 229 events. 14/229 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 713 event pairs, 7 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 238. Up to 29 conditions per place. [2025-02-08 05:38:55,207 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 11 selfloop transitions, 2 changer transitions 0/146 dead transitions. [2025-02-08 05:38:55,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 146 transitions, 328 flow [2025-02-08 05:38:55,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:55,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:55,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2025-02-08 05:38:55,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9103313840155945 [2025-02-08 05:38:55,212 INFO L175 Difference]: Start difference. First operand has 150 places, 147 transitions, 304 flow. Second operand 3 states and 467 transitions. [2025-02-08 05:38:55,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 146 transitions, 328 flow [2025-02-08 05:38:55,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 146 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:55,218 INFO L231 Difference]: Finished difference. Result has 149 places, 146 transitions, 302 flow [2025-02-08 05:38:55,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=302, PETRI_PLACES=149, PETRI_TRANSITIONS=146} [2025-02-08 05:38:55,220 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -6 predicate places. [2025-02-08 05:38:55,220 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 146 transitions, 302 flow [2025-02-08 05:38:55,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 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) [2025-02-08 05:38:55,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:55,220 INFO L206 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] [2025-02-08 05:38:55,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:38:55,221 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:55,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:55,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1188762359, now seen corresponding path program 1 times [2025-02-08 05:38:55,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:55,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384903733] [2025-02-08 05:38:55,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:55,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:55,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:38:55,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:38:55,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:55,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:55,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:55,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:55,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384903733] [2025-02-08 05:38:55,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384903733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:55,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:55,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:55,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902419422] [2025-02-08 05:38:55,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:55,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:55,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:55,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:55,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:55,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 171 [2025-02-08 05:38:55,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 146 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 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) [2025-02-08 05:38:55,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:55,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 171 [2025-02-08 05:38:55,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:55,389 INFO L124 PetriNetUnfolderBase]: 22/288 cut-off events. [2025-02-08 05:38:55,390 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:38:55,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 288 events. 22/288 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1183 event pairs, 15 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 304. Up to 40 conditions per place. [2025-02-08 05:38:55,396 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 12 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2025-02-08 05:38:55,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 145 transitions, 328 flow [2025-02-08 05:38:55,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:55,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:55,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2025-02-08 05:38:55,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9064327485380117 [2025-02-08 05:38:55,401 INFO L175 Difference]: Start difference. First operand has 149 places, 146 transitions, 302 flow. Second operand 3 states and 465 transitions. [2025-02-08 05:38:55,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 145 transitions, 328 flow [2025-02-08 05:38:55,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 145 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:55,406 INFO L231 Difference]: Finished difference. Result has 148 places, 145 transitions, 300 flow [2025-02-08 05:38:55,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=148, PETRI_TRANSITIONS=145} [2025-02-08 05:38:55,409 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -7 predicate places. [2025-02-08 05:38:55,409 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 145 transitions, 300 flow [2025-02-08 05:38:55,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 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) [2025-02-08 05:38:55,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:55,410 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:55,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:38:55,410 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:55,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:55,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1968918805, now seen corresponding path program 1 times [2025-02-08 05:38:55,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:55,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315195176] [2025-02-08 05:38:55,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:55,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:55,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:38:55,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:38:55,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:55,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:55,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:55,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:55,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315195176] [2025-02-08 05:38:55,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315195176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:55,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:55,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:55,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868945490] [2025-02-08 05:38:55,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:55,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:55,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:55,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:55,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:55,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-02-08 05:38:55,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 145 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:55,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:55,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-02-08 05:38:55,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:55,577 INFO L124 PetriNetUnfolderBase]: 23/306 cut-off events. [2025-02-08 05:38:55,578 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:38:55,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 306 events. 23/306 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1248 event pairs, 6 based on Foata normal form. 0/258 useless extension candidates. Maximal degree in co-relation 319. Up to 41 conditions per place. [2025-02-08 05:38:55,582 INFO L140 encePairwiseOnDemand]: 167/171 looper letters, 13 selfloop transitions, 2 changer transitions 0/147 dead transitions. [2025-02-08 05:38:55,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 147 transitions, 336 flow [2025-02-08 05:38:55,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:55,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:55,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 476 transitions. [2025-02-08 05:38:55,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9278752436647173 [2025-02-08 05:38:55,584 INFO L175 Difference]: Start difference. First operand has 148 places, 145 transitions, 300 flow. Second operand 3 states and 476 transitions. [2025-02-08 05:38:55,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 147 transitions, 336 flow [2025-02-08 05:38:55,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 147 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:55,589 INFO L231 Difference]: Finished difference. Result has 147 places, 145 transitions, 306 flow [2025-02-08 05:38:55,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=147, PETRI_TRANSITIONS=145} [2025-02-08 05:38:55,590 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -8 predicate places. [2025-02-08 05:38:55,590 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 145 transitions, 306 flow [2025-02-08 05:38:55,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:55,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:55,591 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:55,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:38:55,591 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:55,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:55,592 INFO L85 PathProgramCache]: Analyzing trace with hash -307930810, now seen corresponding path program 1 times [2025-02-08 05:38:55,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:55,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740659422] [2025-02-08 05:38:55,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:55,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:55,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 05:38:55,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 05:38:55,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:55,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:55,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:55,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740659422] [2025-02-08 05:38:55,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740659422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:55,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:55,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:55,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398951731] [2025-02-08 05:38:55,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:55,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:55,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:55,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:55,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:55,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-02-08 05:38:55,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 145 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:55,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:55,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-02-08 05:38:55,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:55,775 INFO L124 PetriNetUnfolderBase]: 14/252 cut-off events. [2025-02-08 05:38:55,776 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:38:55,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 252 events. 14/252 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 891 event pairs, 2 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 215. Up to 12 conditions per place. [2025-02-08 05:38:55,778 INFO L140 encePairwiseOnDemand]: 166/171 looper letters, 10 selfloop transitions, 3 changer transitions 0/145 dead transitions. [2025-02-08 05:38:55,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 145 transitions, 334 flow [2025-02-08 05:38:55,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:55,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:55,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-02-08 05:38:55,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2025-02-08 05:38:55,780 INFO L175 Difference]: Start difference. First operand has 147 places, 145 transitions, 306 flow. Second operand 3 states and 474 transitions. [2025-02-08 05:38:55,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 145 transitions, 334 flow [2025-02-08 05:38:55,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 145 transitions, 334 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:55,783 INFO L231 Difference]: Finished difference. Result has 147 places, 143 transitions, 308 flow [2025-02-08 05:38:55,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=147, PETRI_TRANSITIONS=143} [2025-02-08 05:38:55,786 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -8 predicate places. [2025-02-08 05:38:55,786 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 143 transitions, 308 flow [2025-02-08 05:38:55,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:55,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:55,788 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:55,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:38:55,788 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:55,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:55,789 INFO L85 PathProgramCache]: Analyzing trace with hash 431245255, now seen corresponding path program 1 times [2025-02-08 05:38:55,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:55,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920063326] [2025-02-08 05:38:55,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:55,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:55,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 05:38:55,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 05:38:55,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:55,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:55,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:55,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:55,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920063326] [2025-02-08 05:38:55,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920063326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:55,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:55,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:55,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923660272] [2025-02-08 05:38:55,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:55,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:55,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:55,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:55,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:55,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 171 [2025-02-08 05:38:55,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 143 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 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) [2025-02-08 05:38:55,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:55,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 171 [2025-02-08 05:38:55,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:56,030 INFO L124 PetriNetUnfolderBase]: 121/974 cut-off events. [2025-02-08 05:38:56,031 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:38:56,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1211 conditions, 974 events. 121/974 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 6750 event pairs, 25 based on Foata normal form. 0/819 useless extension candidates. Maximal degree in co-relation 1015. Up to 166 conditions per place. [2025-02-08 05:38:56,040 INFO L140 encePairwiseOnDemand]: 165/171 looper letters, 18 selfloop transitions, 3 changer transitions 0/148 dead transitions. [2025-02-08 05:38:56,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 148 transitions, 365 flow [2025-02-08 05:38:56,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:56,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:56,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-02-08 05:38:56,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2025-02-08 05:38:56,042 INFO L175 Difference]: Start difference. First operand has 147 places, 143 transitions, 308 flow. Second operand 3 states and 474 transitions. [2025-02-08 05:38:56,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 148 transitions, 365 flow [2025-02-08 05:38:56,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 148 transitions, 359 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:56,046 INFO L231 Difference]: Finished difference. Result has 145 places, 143 transitions, 317 flow [2025-02-08 05:38:56,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=317, PETRI_PLACES=145, PETRI_TRANSITIONS=143} [2025-02-08 05:38:56,047 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -10 predicate places. [2025-02-08 05:38:56,047 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 143 transitions, 317 flow [2025-02-08 05:38:56,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 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) [2025-02-08 05:38:56,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:56,048 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:56,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:38:56,048 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:56,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:56,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1912248784, now seen corresponding path program 1 times [2025-02-08 05:38:56,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:56,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694298046] [2025-02-08 05:38:56,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:56,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:56,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 05:38:56,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 05:38:56,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:56,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:56,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:56,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:56,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694298046] [2025-02-08 05:38:56,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694298046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:56,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:56,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:56,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639715698] [2025-02-08 05:38:56,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:56,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:56,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:56,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:56,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:56,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-02-08 05:38:56,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 143 transitions, 317 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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) [2025-02-08 05:38:56,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:56,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-02-08 05:38:56,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:56,228 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L57-8-->L57-6: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][113], [69#L41-6true, 42#L49-5true, 114#L74-1true, Black: 193#true, 195#(= |#race~c~0| 0), 199#(= |#race~b~0| 0), Black: 186#true, 125#L57-6true, 188#(= |#race~a~0| 0)]) [2025-02-08 05:38:56,228 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-02-08 05:38:56,228 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-02-08 05:38:56,228 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-02-08 05:38:56,229 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-02-08 05:38:56,251 INFO L124 PetriNetUnfolderBase]: 131/907 cut-off events. [2025-02-08 05:38:56,251 INFO L125 PetriNetUnfolderBase]: For 29/40 co-relation queries the response was YES. [2025-02-08 05:38:56,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1188 conditions, 907 events. 131/907 cut-off events. For 29/40 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 6403 event pairs, 40 based on Foata normal form. 0/787 useless extension candidates. Maximal degree in co-relation 919. Up to 151 conditions per place. [2025-02-08 05:38:56,261 INFO L140 encePairwiseOnDemand]: 167/171 looper letters, 13 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2025-02-08 05:38:56,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 145 transitions, 353 flow [2025-02-08 05:38:56,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:56,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:56,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 476 transitions. [2025-02-08 05:38:56,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9278752436647173 [2025-02-08 05:38:56,264 INFO L175 Difference]: Start difference. First operand has 145 places, 143 transitions, 317 flow. Second operand 3 states and 476 transitions. [2025-02-08 05:38:56,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 145 transitions, 353 flow [2025-02-08 05:38:56,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 145 transitions, 353 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:56,269 INFO L231 Difference]: Finished difference. Result has 146 places, 143 transitions, 327 flow [2025-02-08 05:38:56,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=327, PETRI_PLACES=146, PETRI_TRANSITIONS=143} [2025-02-08 05:38:56,272 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -9 predicate places. [2025-02-08 05:38:56,273 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 143 transitions, 327 flow [2025-02-08 05:38:56,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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) [2025-02-08 05:38:56,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:56,274 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:56,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:38:56,274 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:56,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:56,275 INFO L85 PathProgramCache]: Analyzing trace with hash 331663625, now seen corresponding path program 1 times [2025-02-08 05:38:56,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:56,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224966710] [2025-02-08 05:38:56,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:56,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:56,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:38:56,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:38:56,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:56,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:56,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:56,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:56,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224966710] [2025-02-08 05:38:56,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224966710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:56,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:56,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:56,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127280563] [2025-02-08 05:38:56,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:56,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:56,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:56,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:56,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:56,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-02-08 05:38:56,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 143 transitions, 327 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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) [2025-02-08 05:38:56,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:56,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-02-08 05:38:56,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:56,438 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L49-1-->L49-6: Formula: (= |v_#race~b~0_3| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_3|} AuxVars[] AssignedVars[#race~b~0][103], [69#L41-6true, 201#true, 114#L74-1true, Black: 193#true, 44#L49-6true, 195#(= |#race~c~0| 0), 199#(= |#race~b~0| 0), Black: 197#true, Black: 186#true, 125#L57-6true, 188#(= |#race~a~0| 0)]) [2025-02-08 05:38:56,439 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2025-02-08 05:38:56,441 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-02-08 05:38:56,441 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-02-08 05:38:56,441 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-02-08 05:38:56,454 INFO L124 PetriNetUnfolderBase]: 84/772 cut-off events. [2025-02-08 05:38:56,454 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-02-08 05:38:56,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 772 events. 84/772 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4966 event pairs, 16 based on Foata normal form. 0/676 useless extension candidates. Maximal degree in co-relation 808. Up to 56 conditions per place. [2025-02-08 05:38:56,462 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 12 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2025-02-08 05:38:56,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 144 transitions, 359 flow [2025-02-08 05:38:56,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:56,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-02-08 05:38:56,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2025-02-08 05:38:56,465 INFO L175 Difference]: Start difference. First operand has 146 places, 143 transitions, 327 flow. Second operand 3 states and 474 transitions. [2025-02-08 05:38:56,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 144 transitions, 359 flow [2025-02-08 05:38:56,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 144 transitions, 359 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:56,468 INFO L231 Difference]: Finished difference. Result has 147 places, 142 transitions, 329 flow [2025-02-08 05:38:56,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=329, PETRI_PLACES=147, PETRI_TRANSITIONS=142} [2025-02-08 05:38:56,469 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -8 predicate places. [2025-02-08 05:38:56,470 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 142 transitions, 329 flow [2025-02-08 05:38:56,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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) [2025-02-08 05:38:56,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:56,471 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:56,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:38:56,471 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:56,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:56,472 INFO L85 PathProgramCache]: Analyzing trace with hash 643026725, now seen corresponding path program 1 times [2025-02-08 05:38:56,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:56,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582043153] [2025-02-08 05:38:56,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:56,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:56,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:38:56,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:38:56,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:56,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:56,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:56,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:56,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582043153] [2025-02-08 05:38:56,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582043153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:56,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:56,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:56,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588983757] [2025-02-08 05:38:56,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:56,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:56,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:56,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:56,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:56,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-02-08 05:38:56,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 142 transitions, 329 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:56,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:56,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-02-08 05:38:56,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:56,606 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L57-8-->L57-6: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][101], [69#L41-6true, 201#true, 114#L74-1true, Black: 193#true, 44#L49-6true, 195#(= |#race~c~0| 0), 199#(= |#race~b~0| 0), Black: 197#true, Black: 186#true, 188#(= |#race~a~0| 0), 204#true, 125#L57-6true]) [2025-02-08 05:38:56,606 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-02-08 05:38:56,607 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-02-08 05:38:56,607 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-02-08 05:38:56,607 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-02-08 05:38:56,620 INFO L124 PetriNetUnfolderBase]: 73/542 cut-off events. [2025-02-08 05:38:56,620 INFO L125 PetriNetUnfolderBase]: For 15/19 co-relation queries the response was YES. [2025-02-08 05:38:56,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 542 events. 73/542 cut-off events. For 15/19 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3025 event pairs, 10 based on Foata normal form. 0/486 useless extension candidates. Maximal degree in co-relation 630. Up to 42 conditions per place. [2025-02-08 05:38:56,625 INFO L140 encePairwiseOnDemand]: 166/171 looper letters, 10 selfloop transitions, 3 changer transitions 0/142 dead transitions. [2025-02-08 05:38:56,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 142 transitions, 357 flow [2025-02-08 05:38:56,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:56,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:56,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-02-08 05:38:56,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2025-02-08 05:38:56,628 INFO L175 Difference]: Start difference. First operand has 147 places, 142 transitions, 329 flow. Second operand 3 states and 474 transitions. [2025-02-08 05:38:56,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 142 transitions, 357 flow [2025-02-08 05:38:56,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 142 transitions, 353 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:56,631 INFO L231 Difference]: Finished difference. Result has 145 places, 140 transitions, 327 flow [2025-02-08 05:38:56,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=327, PETRI_PLACES=145, PETRI_TRANSITIONS=140} [2025-02-08 05:38:56,632 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -10 predicate places. [2025-02-08 05:38:56,632 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 140 transitions, 327 flow [2025-02-08 05:38:56,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:56,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:56,633 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:56,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:38:56,633 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:56,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:56,634 INFO L85 PathProgramCache]: Analyzing trace with hash 225293672, now seen corresponding path program 1 times [2025-02-08 05:38:56,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:56,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106747787] [2025-02-08 05:38:56,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:56,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:56,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 05:38:56,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 05:38:56,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:56,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:56,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:56,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106747787] [2025-02-08 05:38:56,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106747787] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:56,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:56,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:56,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540528945] [2025-02-08 05:38:56,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:56,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:56,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:56,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:56,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:56,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-02-08 05:38:56,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 140 transitions, 327 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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) [2025-02-08 05:38:56,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:56,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-02-08 05:38:56,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:56,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L57-8-->L57-6: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][100], [69#L41-6true, 114#L74-1true, Black: 193#true, 195#(= |#race~c~0| 0), 44#L49-6true, 199#(= |#race~b~0| 0), Black: 197#true, 207#true, Black: 186#true, 204#true, 125#L57-6true, 188#(= |#race~a~0| 0)]) [2025-02-08 05:38:56,762 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-02-08 05:38:56,762 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-02-08 05:38:56,762 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-02-08 05:38:56,762 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-02-08 05:38:56,774 INFO L124 PetriNetUnfolderBase]: 81/541 cut-off events. [2025-02-08 05:38:56,774 INFO L125 PetriNetUnfolderBase]: For 32/35 co-relation queries the response was YES. [2025-02-08 05:38:56,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 779 conditions, 541 events. 81/541 cut-off events. For 32/35 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2987 event pairs, 19 based on Foata normal form. 0/494 useless extension candidates. Maximal degree in co-relation 605. Up to 59 conditions per place. [2025-02-08 05:38:56,780 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 12 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2025-02-08 05:38:56,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 141 transitions, 359 flow [2025-02-08 05:38:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:56,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:56,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-02-08 05:38:56,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2025-02-08 05:38:56,782 INFO L175 Difference]: Start difference. First operand has 145 places, 140 transitions, 327 flow. Second operand 3 states and 474 transitions. [2025-02-08 05:38:56,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 141 transitions, 359 flow [2025-02-08 05:38:56,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 141 transitions, 353 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:56,785 INFO L231 Difference]: Finished difference. Result has 144 places, 139 transitions, 323 flow [2025-02-08 05:38:56,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=323, PETRI_PLACES=144, PETRI_TRANSITIONS=139} [2025-02-08 05:38:56,786 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -11 predicate places. [2025-02-08 05:38:56,787 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 139 transitions, 323 flow [2025-02-08 05:38:56,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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) [2025-02-08 05:38:56,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:56,788 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:56,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:38:56,788 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:56,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:56,789 INFO L85 PathProgramCache]: Analyzing trace with hash 841687119, now seen corresponding path program 1 times [2025-02-08 05:38:56,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:56,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508261095] [2025-02-08 05:38:56,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:56,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:56,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 05:38:56,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 05:38:56,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:56,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:56,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:56,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:56,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508261095] [2025-02-08 05:38:56,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508261095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:56,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:56,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:56,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754728306] [2025-02-08 05:38:56,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:56,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:56,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:56,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:56,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:56,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-02-08 05:38:56,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 139 transitions, 323 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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) [2025-02-08 05:38:56,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:56,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-02-08 05:38:56,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:56,904 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L57-8-->L57-6: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][100], [69#L41-6true, 114#L74-1true, Black: 193#true, 44#L49-6true, 195#(= |#race~c~0| 0), 199#(= |#race~b~0| 0), Black: 197#true, 210#true, 207#true, Black: 186#true, 125#L57-6true, 188#(= |#race~a~0| 0)]) [2025-02-08 05:38:56,905 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-02-08 05:38:56,905 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-02-08 05:38:56,905 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-02-08 05:38:56,905 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-02-08 05:38:56,929 INFO L124 PetriNetUnfolderBase]: 65/459 cut-off events. [2025-02-08 05:38:56,929 INFO L125 PetriNetUnfolderBase]: For 17/21 co-relation queries the response was YES. [2025-02-08 05:38:56,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 652 conditions, 459 events. 65/459 cut-off events. For 17/21 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2376 event pairs, 8 based on Foata normal form. 2/427 useless extension candidates. Maximal degree in co-relation 522. Up to 46 conditions per place. [2025-02-08 05:38:56,932 INFO L140 encePairwiseOnDemand]: 166/171 looper letters, 8 selfloop transitions, 2 changer transitions 6/139 dead transitions. [2025-02-08 05:38:56,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 139 transitions, 349 flow [2025-02-08 05:38:56,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:56,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:56,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-02-08 05:38:56,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9220272904483431 [2025-02-08 05:38:56,934 INFO L175 Difference]: Start difference. First operand has 144 places, 139 transitions, 323 flow. Second operand 3 states and 473 transitions. [2025-02-08 05:38:56,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 139 transitions, 349 flow [2025-02-08 05:38:56,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 139 transitions, 345 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:56,938 INFO L231 Difference]: Finished difference. Result has 142 places, 131 transitions, 306 flow [2025-02-08 05:38:56,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=142, PETRI_TRANSITIONS=131} [2025-02-08 05:38:56,939 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -13 predicate places. [2025-02-08 05:38:56,939 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 131 transitions, 306 flow [2025-02-08 05:38:56,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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) [2025-02-08 05:38:56,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:56,940 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:56,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:38:56,940 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:56,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:56,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1437389298, now seen corresponding path program 1 times [2025-02-08 05:38:56,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:56,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039199101] [2025-02-08 05:38:56,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:56,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:56,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 05:38:56,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 05:38:56,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:56,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:57,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:57,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:57,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039199101] [2025-02-08 05:38:57,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039199101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:57,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:57,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:57,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407954835] [2025-02-08 05:38:57,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:57,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:57,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:57,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:57,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:57,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-02-08 05:38:57,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 131 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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) [2025-02-08 05:38:57,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:57,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-02-08 05:38:57,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:57,062 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L57-8-->L57-6: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][100], [69#L41-6true, 114#L74-1true, Black: 193#true, 44#L49-6true, 195#(= |#race~c~0| 0), 199#(= |#race~b~0| 0), Black: 197#true, 210#true, 213#true, Black: 186#true, 125#L57-6true, 188#(= |#race~a~0| 0)]) [2025-02-08 05:38:57,062 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-02-08 05:38:57,062 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-02-08 05:38:57,062 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-02-08 05:38:57,062 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-02-08 05:38:57,076 INFO L124 PetriNetUnfolderBase]: 72/483 cut-off events. [2025-02-08 05:38:57,076 INFO L125 PetriNetUnfolderBase]: For 41/45 co-relation queries the response was YES. [2025-02-08 05:38:57,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 483 events. 72/483 cut-off events. For 41/45 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2401 event pairs, 18 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 527. Up to 62 conditions per place. [2025-02-08 05:38:57,080 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 0 selfloop transitions, 0 changer transitions 132/132 dead transitions. [2025-02-08 05:38:57,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 132 transitions, 334 flow [2025-02-08 05:38:57,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:57,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:57,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2025-02-08 05:38:57,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9200779727095516 [2025-02-08 05:38:57,082 INFO L175 Difference]: Start difference. First operand has 142 places, 131 transitions, 306 flow. Second operand 3 states and 472 transitions. [2025-02-08 05:38:57,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 132 transitions, 334 flow [2025-02-08 05:38:57,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 132 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:57,085 INFO L231 Difference]: Finished difference. Result has 135 places, 0 transitions, 0 flow [2025-02-08 05:38:57,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=135, PETRI_TRANSITIONS=0} [2025-02-08 05:38:57,086 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -20 predicate places. [2025-02-08 05:38:57,086 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 0 transitions, 0 flow [2025-02-08 05:38:57,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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) [2025-02-08 05:38:57,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (34 of 35 remaining) [2025-02-08 05:38:57,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (33 of 35 remaining) [2025-02-08 05:38:57,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (32 of 35 remaining) [2025-02-08 05:38:57,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (31 of 35 remaining) [2025-02-08 05:38:57,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (30 of 35 remaining) [2025-02-08 05:38:57,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (29 of 35 remaining) [2025-02-08 05:38:57,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (28 of 35 remaining) [2025-02-08 05:38:57,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (27 of 35 remaining) [2025-02-08 05:38:57,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (26 of 35 remaining) [2025-02-08 05:38:57,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (25 of 35 remaining) [2025-02-08 05:38:57,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (24 of 35 remaining) [2025-02-08 05:38:57,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (23 of 35 remaining) [2025-02-08 05:38:57,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (22 of 35 remaining) [2025-02-08 05:38:57,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (21 of 35 remaining) [2025-02-08 05:38:57,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 35 remaining) [2025-02-08 05:38:57,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 35 remaining) [2025-02-08 05:38:57,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 35 remaining) [2025-02-08 05:38:57,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 35 remaining) [2025-02-08 05:38:57,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 35 remaining) [2025-02-08 05:38:57,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 35 remaining) [2025-02-08 05:38:57,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 35 remaining) [2025-02-08 05:38:57,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 35 remaining) [2025-02-08 05:38:57,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (12 of 35 remaining) [2025-02-08 05:38:57,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (11 of 35 remaining) [2025-02-08 05:38:57,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (10 of 35 remaining) [2025-02-08 05:38:57,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (9 of 35 remaining) [2025-02-08 05:38:57,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 35 remaining) [2025-02-08 05:38:57,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (7 of 35 remaining) [2025-02-08 05:38:57,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (6 of 35 remaining) [2025-02-08 05:38:57,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (5 of 35 remaining) [2025-02-08 05:38:57,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 35 remaining) [2025-02-08 05:38:57,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 35 remaining) [2025-02-08 05:38:57,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 35 remaining) [2025-02-08 05:38:57,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 35 remaining) [2025-02-08 05:38:57,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 35 remaining) [2025-02-08 05:38:57,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:38:57,092 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:57,097 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:38:57,097 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:38:57,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:38:57 BasicIcfg [2025-02-08 05:38:57,103 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:38:57,103 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:38:57,103 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:38:57,103 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:38:57,104 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:54" (3/4) ... [2025-02-08 05:38:57,105 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:38:57,108 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:38:57,109 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:38:57,109 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:38:57,114 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-08 05:38:57,115 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:38:57,115 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:38:57,115 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:38:57,197 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:38:57,197 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:38:57,197 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:38:57,199 INFO L158 Benchmark]: Toolchain (without parser) took 3573.95ms. Allocated memory is still 142.6MB. Free memory was 114.3MB in the beginning and 72.7MB in the end (delta: 41.6MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. [2025-02-08 05:38:57,199 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:38:57,200 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.29ms. Allocated memory is still 142.6MB. Free memory was 114.3MB in the beginning and 102.4MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:38:57,200 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.77ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 101.5MB in the end (delta: 905.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:38:57,201 INFO L158 Benchmark]: Boogie Preprocessor took 13.75ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 100.6MB in the end (delta: 922.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:38:57,204 INFO L158 Benchmark]: IcfgBuilder took 412.70ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 83.9MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:38:57,204 INFO L158 Benchmark]: TraceAbstraction took 2808.80ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 78.7MB in the end (delta: 4.9MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2025-02-08 05:38:57,204 INFO L158 Benchmark]: Witness Printer took 94.83ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 72.7MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:38:57,207 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.35ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.29ms. Allocated memory is still 142.6MB. Free memory was 114.3MB in the beginning and 102.4MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.77ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 101.5MB in the end (delta: 905.1kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.75ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 100.6MB in the end (delta: 922.1kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 412.70ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 83.9MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2808.80ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 78.7MB in the end (delta: 4.9MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Witness Printer took 94.83ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 72.7MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 246 locations, 35 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.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 244 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 332 IncrementalHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 66 mSDtfsCounter, 332 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=329occurred in iteration=8, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 588 NumberOfCodeBlocks, 588 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 576 ConstructedInterpolants, 0 QuantifiedInterpolants, 600 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:38:57,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 Result: TRUE