./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-time-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-time-trans.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef62179d17d90afe74c7b4fe8189ca3bb011e55daf3a169b42e4b3589691fc53 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:24:02,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:24:02,654 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:24:02,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:24:02,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:24:02,683 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:24:02,684 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:24:02,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:24:02,684 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:24:02,685 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:24:02,685 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:24:02,685 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:24:02,685 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:24:02,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:24:02,686 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:24:02,686 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:24:02,686 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:24:02,686 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:24:02,686 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:24:02,686 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:24:02,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:24:02,687 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:24:02,687 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:24:02,687 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:24:02,687 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:24:02,687 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:24:02,687 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:24:02,687 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:24:02,687 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:24:02,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:24:02,688 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:24:02,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:24:02,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:24:02,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:24:02,688 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:24:02,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:24:02,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:24:02,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:24:02,688 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:24:02,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:24:02,688 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:24:02,688 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:24:02,689 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/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 -> ef62179d17d90afe74c7b4fe8189ca3bb011e55daf3a169b42e4b3589691fc53 [2025-03-13 22:24:02,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:24:02,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:24:02,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:24:02,912 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:24:02,912 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:24:02,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-time-trans.wvr.c [2025-03-13 22:24:04,085 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2136f882e/adca49f3629a48fbaf7767af4400518b/FLAG7ae809b10 [2025-03-13 22:24:04,272 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:24:04,273 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-time-trans.wvr.c [2025-03-13 22:24:04,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2136f882e/adca49f3629a48fbaf7767af4400518b/FLAG7ae809b10 [2025-03-13 22:24:04,327 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2136f882e/adca49f3629a48fbaf7767af4400518b [2025-03-13 22:24:04,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:24:04,331 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:24:04,332 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:24:04,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:24:04,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:24:04,337 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:24:04" (1/1) ... [2025-03-13 22:24:04,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@557153f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:04, skipping insertion in model container [2025-03-13 22:24:04,338 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:24:04" (1/1) ... [2025-03-13 22:24:04,353 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:24:04,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:24:04,491 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:24:04,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:24:04,518 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:24:04,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:04 WrapperNode [2025-03-13 22:24:04,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:24:04,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:24:04,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:24:04,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:24:04,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:04" (1/1) ... [2025-03-13 22:24:04,529 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:04" (1/1) ... [2025-03-13 22:24:04,555 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 12, calls inlined = 22, statements flattened = 319 [2025-03-13 22:24:04,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:24:04,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:24:04,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:24:04,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:24:04,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:04" (1/1) ... [2025-03-13 22:24:04,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:04" (1/1) ... [2025-03-13 22:24:04,568 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:04" (1/1) ... [2025-03-13 22:24:04,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:04" (1/1) ... [2025-03-13 22:24:04,576 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:04" (1/1) ... [2025-03-13 22:24:04,578 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:04" (1/1) ... [2025-03-13 22:24:04,579 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:04" (1/1) ... [2025-03-13 22:24:04,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:04" (1/1) ... [2025-03-13 22:24:04,581 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:24:04,582 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:24:04,582 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:24:04,582 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:24:04,583 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:04" (1/1) ... [2025-03-13 22:24:04,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:24:04,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:24:04,614 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:24:04,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:24:04,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:24:04,635 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 22:24:04,635 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 22:24:04,635 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 22:24:04,635 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 22:24:04,635 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 22:24:04,635 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 22:24:04,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:24:04,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 22:24:04,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 22:24:04,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:24:04,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:24:04,636 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:24:04,711 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:24:04,712 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:24:05,096 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:24:05,097 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:24:05,097 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:24:05,462 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:24:05,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:24:05 BoogieIcfgContainer [2025-03-13 22:24:05,464 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:24:05,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:24:05,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:24:05,470 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:24:05,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:24:04" (1/3) ... [2025-03-13 22:24:05,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ffcd0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:24:05, skipping insertion in model container [2025-03-13 22:24:05,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:04" (2/3) ... [2025-03-13 22:24:05,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ffcd0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:24:05, skipping insertion in model container [2025-03-13 22:24:05,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:24:05" (3/3) ... [2025-03-13 22:24:05,473 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-time-trans.wvr.c [2025-03-13 22:24:05,484 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:24:05,485 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-time-trans.wvr.c that has 4 procedures, 194 locations, 1 initial locations, 0 loop locations, and 36 error locations. [2025-03-13 22:24:05,486 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:24:05,538 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 22:24:05,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 196 transitions, 413 flow [2025-03-13 22:24:05,613 INFO L124 PetriNetUnfolderBase]: 3/193 cut-off events. [2025-03-13 22:24:05,615 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 22:24:05,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 193 events. 3/193 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2025-03-13 22:24:05,618 INFO L82 GeneralOperation]: Start removeDead. Operand has 203 places, 196 transitions, 413 flow [2025-03-13 22:24:05,621 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 172 transitions, 362 flow [2025-03-13 22:24:05,626 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:24:05,634 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;@550cd00e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:24:05,634 INFO L334 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2025-03-13 22:24:05,655 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:24:05,656 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-13 22:24:05,656 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:24:05,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:05,657 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] [2025-03-13 22:24:05,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-03-13 22:24:05,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:05,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1592021720, now seen corresponding path program 1 times [2025-03-13 22:24:05,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:05,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816196028] [2025-03-13 22:24:05,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:05,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:05,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-13 22:24:05,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 22:24:05,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:05,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:05,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:05,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:05,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816196028] [2025-03-13 22:24:05,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816196028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:05,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:05,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:05,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668657181] [2025-03-13 22:24:05,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:05,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:05,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:05,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:05,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:05,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 196 [2025-03-13 22:24:05,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 172 transitions, 362 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-03-13 22:24:05,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:05,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 196 [2025-03-13 22:24:05,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:05,902 INFO L124 PetriNetUnfolderBase]: 16/194 cut-off events. [2025-03-13 22:24:05,903 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-13 22:24:05,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 194 events. 16/194 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 220 event pairs, 15 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 150. Up to 40 conditions per place. [2025-03-13 22:24:05,905 INFO L140 encePairwiseOnDemand]: 169/196 looper letters, 12 selfloop transitions, 2 changer transitions 0/147 dead transitions. [2025-03-13 22:24:05,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 147 transitions, 340 flow [2025-03-13 22:24:05,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:05,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:05,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2025-03-13 22:24:05,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8520408163265306 [2025-03-13 22:24:05,919 INFO L175 Difference]: Start difference. First operand has 181 places, 172 transitions, 362 flow. Second operand 3 states and 501 transitions. [2025-03-13 22:24:05,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 147 transitions, 340 flow [2025-03-13 22:24:05,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 147 transitions, 328 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 22:24:05,927 INFO L231 Difference]: Finished difference. Result has 152 places, 147 transitions, 304 flow [2025-03-13 22:24:05,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=150, 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=152, PETRI_TRANSITIONS=147} [2025-03-13 22:24:05,932 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -29 predicate places. [2025-03-13 22:24:05,932 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 147 transitions, 304 flow [2025-03-13 22:24:05,932 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-03-13 22:24:05,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:05,933 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] [2025-03-13 22:24:05,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:24:05,933 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-03-13 22:24:05,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:05,934 INFO L85 PathProgramCache]: Analyzing trace with hash -945696684, now seen corresponding path program 1 times [2025-03-13 22:24:05,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:05,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106075643] [2025-03-13 22:24:05,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:05,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:05,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 22:24:05,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 22:24:05,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:05,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:05,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:05,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:05,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106075643] [2025-03-13 22:24:05,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106075643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:05,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:05,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:05,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636449810] [2025-03-13 22:24:05,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:05,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:05,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:05,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:05,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:06,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 196 [2025-03-13 22:24:06,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 147 transitions, 304 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-03-13 22:24:06,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:06,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 196 [2025-03-13 22:24:06,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:06,056 INFO L124 PetriNetUnfolderBase]: 16/193 cut-off events. [2025-03-13 22:24:06,056 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:24:06,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 193 events. 16/193 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 219 event pairs, 15 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 212. Up to 40 conditions per place. [2025-03-13 22:24:06,058 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 12 selfloop transitions, 2 changer transitions 0/146 dead transitions. [2025-03-13 22:24:06,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 146 transitions, 330 flow [2025-03-13 22:24:06,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:06,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2025-03-13 22:24:06,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8112244897959183 [2025-03-13 22:24:06,062 INFO L175 Difference]: Start difference. First operand has 152 places, 147 transitions, 304 flow. Second operand 3 states and 477 transitions. [2025-03-13 22:24:06,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 146 transitions, 330 flow [2025-03-13 22:24:06,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 146 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:06,064 INFO L231 Difference]: Finished difference. Result has 151 places, 146 transitions, 302 flow [2025-03-13 22:24:06,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=149, 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=151, PETRI_TRANSITIONS=146} [2025-03-13 22:24:06,065 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -30 predicate places. [2025-03-13 22:24:06,065 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 146 transitions, 302 flow [2025-03-13 22:24:06,065 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-03-13 22:24:06,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:06,065 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] [2025-03-13 22:24:06,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:24:06,066 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-03-13 22:24:06,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:06,066 INFO L85 PathProgramCache]: Analyzing trace with hash 622505266, now seen corresponding path program 1 times [2025-03-13 22:24:06,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:06,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144805835] [2025-03-13 22:24:06,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:06,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:06,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-13 22:24:06,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 22:24:06,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:06,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:06,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:06,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:06,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144805835] [2025-03-13 22:24:06,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144805835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:06,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:06,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:06,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398274069] [2025-03-13 22:24:06,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:06,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:06,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:06,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:06,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:06,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 196 [2025-03-13 22:24:06,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 146 transitions, 302 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-03-13 22:24:06,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:06,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 196 [2025-03-13 22:24:06,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:06,194 INFO L124 PetriNetUnfolderBase]: 16/192 cut-off events. [2025-03-13 22:24:06,194 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:24:06,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 192 events. 16/192 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 216 event pairs, 15 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 203. Up to 40 conditions per place. [2025-03-13 22:24:06,195 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 12 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2025-03-13 22:24:06,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 145 transitions, 328 flow [2025-03-13 22:24:06,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:06,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:06,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2025-03-13 22:24:06,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8112244897959183 [2025-03-13 22:24:06,198 INFO L175 Difference]: Start difference. First operand has 151 places, 146 transitions, 302 flow. Second operand 3 states and 477 transitions. [2025-03-13 22:24:06,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 145 transitions, 328 flow [2025-03-13 22:24:06,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 145 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:06,202 INFO L231 Difference]: Finished difference. Result has 150 places, 145 transitions, 300 flow [2025-03-13 22:24:06,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=148, 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=150, PETRI_TRANSITIONS=145} [2025-03-13 22:24:06,203 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -31 predicate places. [2025-03-13 22:24:06,203 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 145 transitions, 300 flow [2025-03-13 22:24:06,203 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-03-13 22:24:06,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:06,203 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] [2025-03-13 22:24:06,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:24:06,203 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-03-13 22:24:06,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:06,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2110899221, now seen corresponding path program 1 times [2025-03-13 22:24:06,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:06,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071154887] [2025-03-13 22:24:06,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:06,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:06,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 22:24:06,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 22:24:06,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:06,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:06,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:06,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:06,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071154887] [2025-03-13 22:24:06,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071154887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:06,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:06,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:06,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346322377] [2025-03-13 22:24:06,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:06,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:06,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:06,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:06,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:06,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 196 [2025-03-13 22:24:06,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 145 transitions, 300 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-03-13 22:24:06,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:06,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 196 [2025-03-13 22:24:06,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:06,322 INFO L124 PetriNetUnfolderBase]: 16/191 cut-off events. [2025-03-13 22:24:06,323 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:24:06,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 191 events. 16/191 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 214 event pairs, 15 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 194. Up to 40 conditions per place. [2025-03-13 22:24:06,324 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 12 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2025-03-13 22:24:06,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 144 transitions, 326 flow [2025-03-13 22:24:06,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:06,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2025-03-13 22:24:06,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8112244897959183 [2025-03-13 22:24:06,326 INFO L175 Difference]: Start difference. First operand has 150 places, 145 transitions, 300 flow. Second operand 3 states and 477 transitions. [2025-03-13 22:24:06,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 144 transitions, 326 flow [2025-03-13 22:24:06,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 144 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:06,330 INFO L231 Difference]: Finished difference. Result has 149 places, 144 transitions, 298 flow [2025-03-13 22:24:06,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=149, PETRI_TRANSITIONS=144} [2025-03-13 22:24:06,331 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -32 predicate places. [2025-03-13 22:24:06,332 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 144 transitions, 298 flow [2025-03-13 22:24:06,333 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-03-13 22:24:06,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:06,333 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] [2025-03-13 22:24:06,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:24:06,333 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-03-13 22:24:06,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:06,333 INFO L85 PathProgramCache]: Analyzing trace with hash -439998759, now seen corresponding path program 1 times [2025-03-13 22:24:06,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:06,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627543610] [2025-03-13 22:24:06,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:06,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:06,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-13 22:24:06,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-13 22:24:06,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:06,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:06,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:06,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:06,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627543610] [2025-03-13 22:24:06,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627543610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:06,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:06,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:06,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77416024] [2025-03-13 22:24:06,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:06,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:06,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:06,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:06,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:06,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 196 [2025-03-13 22:24:06,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 144 transitions, 298 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-03-13 22:24:06,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:06,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 196 [2025-03-13 22:24:06,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:06,441 INFO L124 PetriNetUnfolderBase]: 16/190 cut-off events. [2025-03-13 22:24:06,442 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:24:06,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 190 events. 16/190 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 211 event pairs, 15 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 185. Up to 40 conditions per place. [2025-03-13 22:24:06,443 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 12 selfloop transitions, 2 changer transitions 0/143 dead transitions. [2025-03-13 22:24:06,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 143 transitions, 324 flow [2025-03-13 22:24:06,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:06,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:06,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2025-03-13 22:24:06,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8112244897959183 [2025-03-13 22:24:06,446 INFO L175 Difference]: Start difference. First operand has 149 places, 144 transitions, 298 flow. Second operand 3 states and 477 transitions. [2025-03-13 22:24:06,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 143 transitions, 324 flow [2025-03-13 22:24:06,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 143 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:06,449 INFO L231 Difference]: Finished difference. Result has 148 places, 143 transitions, 296 flow [2025-03-13 22:24:06,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=148, PETRI_TRANSITIONS=143} [2025-03-13 22:24:06,451 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -33 predicate places. [2025-03-13 22:24:06,452 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 143 transitions, 296 flow [2025-03-13 22:24:06,452 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-03-13 22:24:06,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:06,453 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] [2025-03-13 22:24:06,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:24:06,453 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-03-13 22:24:06,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:06,455 INFO L85 PathProgramCache]: Analyzing trace with hash -572338162, now seen corresponding path program 1 times [2025-03-13 22:24:06,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:06,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250507668] [2025-03-13 22:24:06,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:06,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:06,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-13 22:24:06,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-13 22:24:06,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:06,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:06,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-03-13 22:24:06,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:06,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250507668] [2025-03-13 22:24:06,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250507668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:06,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:06,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:06,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797825169] [2025-03-13 22:24:06,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:06,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:06,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:06,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:06,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:06,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 196 [2025-03-13 22:24:06,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 143 transitions, 296 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-03-13 22:24:06,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:06,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 196 [2025-03-13 22:24:06,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:06,571 INFO L124 PetriNetUnfolderBase]: 16/189 cut-off events. [2025-03-13 22:24:06,571 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:24:06,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 189 events. 16/189 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 209 event pairs, 15 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 176. Up to 40 conditions per place. [2025-03-13 22:24:06,572 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 12 selfloop transitions, 2 changer transitions 0/142 dead transitions. [2025-03-13 22:24:06,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 142 transitions, 322 flow [2025-03-13 22:24:06,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:06,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:06,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2025-03-13 22:24:06,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8112244897959183 [2025-03-13 22:24:06,574 INFO L175 Difference]: Start difference. First operand has 148 places, 143 transitions, 296 flow. Second operand 3 states and 477 transitions. [2025-03-13 22:24:06,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 142 transitions, 322 flow [2025-03-13 22:24:06,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 142 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:06,576 INFO L231 Difference]: Finished difference. Result has 147 places, 142 transitions, 294 flow [2025-03-13 22:24:06,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=290, 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=294, PETRI_PLACES=147, PETRI_TRANSITIONS=142} [2025-03-13 22:24:06,577 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -34 predicate places. [2025-03-13 22:24:06,577 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 142 transitions, 294 flow [2025-03-13 22:24:06,577 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-03-13 22:24:06,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:06,577 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, 1, 1, 1, 1, 1] [2025-03-13 22:24:06,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:24:06,578 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-03-13 22:24:06,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:06,578 INFO L85 PathProgramCache]: Analyzing trace with hash 2060978490, now seen corresponding path program 1 times [2025-03-13 22:24:06,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:06,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909789119] [2025-03-13 22:24:06,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:06,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:06,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-13 22:24:06,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-13 22:24:06,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:06,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:06,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:06,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:06,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909789119] [2025-03-13 22:24:06,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909789119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:06,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:06,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:06,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718789226] [2025-03-13 22:24:06,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:06,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:06,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:06,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:06,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:06,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 196 [2025-03-13 22:24:06,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 142 transitions, 294 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-03-13 22:24:06,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:06,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 196 [2025-03-13 22:24:06,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:06,684 INFO L124 PetriNetUnfolderBase]: 16/188 cut-off events. [2025-03-13 22:24:06,684 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:24:06,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 188 events. 16/188 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 207 event pairs, 15 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 168. Up to 41 conditions per place. [2025-03-13 22:24:06,685 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 13 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2025-03-13 22:24:06,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 141 transitions, 322 flow [2025-03-13 22:24:06,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:06,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:06,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2025-03-13 22:24:06,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8078231292517006 [2025-03-13 22:24:06,687 INFO L175 Difference]: Start difference. First operand has 147 places, 142 transitions, 294 flow. Second operand 3 states and 475 transitions. [2025-03-13 22:24:06,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 141 transitions, 322 flow [2025-03-13 22:24:06,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 141 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:06,689 INFO L231 Difference]: Finished difference. Result has 146 places, 141 transitions, 292 flow [2025-03-13 22:24:06,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=146, PETRI_TRANSITIONS=141} [2025-03-13 22:24:06,690 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -35 predicate places. [2025-03-13 22:24:06,690 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 141 transitions, 292 flow [2025-03-13 22:24:06,690 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-03-13 22:24:06,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:06,690 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:24:06,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:24:06,690 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-03-13 22:24:06,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:06,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1304009704, now seen corresponding path program 1 times [2025-03-13 22:24:06,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:06,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152398751] [2025-03-13 22:24:06,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:06,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:06,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-13 22:24:06,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-13 22:24:06,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:06,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:06,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:06,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:06,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152398751] [2025-03-13 22:24:06,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152398751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:06,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:06,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:06,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304132180] [2025-03-13 22:24:06,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:06,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:06,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:06,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:06,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:06,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 196 [2025-03-13 22:24:06,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 141 transitions, 292 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-03-13 22:24:06,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:06,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 196 [2025-03-13 22:24:06,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:06,805 INFO L124 PetriNetUnfolderBase]: 16/187 cut-off events. [2025-03-13 22:24:06,805 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:24:06,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 187 events. 16/187 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 205 event pairs, 15 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 159. Up to 41 conditions per place. [2025-03-13 22:24:06,809 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 13 selfloop transitions, 2 changer transitions 0/140 dead transitions. [2025-03-13 22:24:06,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 140 transitions, 320 flow [2025-03-13 22:24:06,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:06,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:06,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2025-03-13 22:24:06,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8078231292517006 [2025-03-13 22:24:06,812 INFO L175 Difference]: Start difference. First operand has 146 places, 141 transitions, 292 flow. Second operand 3 states and 475 transitions. [2025-03-13 22:24:06,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 140 transitions, 320 flow [2025-03-13 22:24:06,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 140 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:06,814 INFO L231 Difference]: Finished difference. Result has 145 places, 140 transitions, 290 flow [2025-03-13 22:24:06,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=145, PETRI_TRANSITIONS=140} [2025-03-13 22:24:06,815 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -36 predicate places. [2025-03-13 22:24:06,815 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 140 transitions, 290 flow [2025-03-13 22:24:06,815 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-03-13 22:24:06,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:06,815 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:24:06,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:24:06,815 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-03-13 22:24:06,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:06,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1159616020, now seen corresponding path program 1 times [2025-03-13 22:24:06,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:06,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147020574] [2025-03-13 22:24:06,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:06,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:06,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-13 22:24:06,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-13 22:24:06,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:06,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:06,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:06,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:06,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147020574] [2025-03-13 22:24:06,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147020574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:06,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:06,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:06,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084871846] [2025-03-13 22:24:06,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:06,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:06,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:06,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:06,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:06,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 196 [2025-03-13 22:24:06,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 140 transitions, 290 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-03-13 22:24:06,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:06,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 196 [2025-03-13 22:24:06,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:06,919 INFO L124 PetriNetUnfolderBase]: 16/186 cut-off events. [2025-03-13 22:24:06,919 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:24:06,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 186 events. 16/186 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 203 event pairs, 15 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 150. Up to 41 conditions per place. [2025-03-13 22:24:06,920 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 13 selfloop transitions, 2 changer transitions 0/139 dead transitions. [2025-03-13 22:24:06,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 139 transitions, 318 flow [2025-03-13 22:24:06,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:06,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:06,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2025-03-13 22:24:06,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8078231292517006 [2025-03-13 22:24:06,921 INFO L175 Difference]: Start difference. First operand has 145 places, 140 transitions, 290 flow. Second operand 3 states and 475 transitions. [2025-03-13 22:24:06,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 139 transitions, 318 flow [2025-03-13 22:24:06,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 139 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:06,923 INFO L231 Difference]: Finished difference. Result has 144 places, 139 transitions, 288 flow [2025-03-13 22:24:06,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=284, 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=288, PETRI_PLACES=144, PETRI_TRANSITIONS=139} [2025-03-13 22:24:06,924 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -37 predicate places. [2025-03-13 22:24:06,924 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 139 transitions, 288 flow [2025-03-13 22:24:06,924 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-03-13 22:24:06,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:06,924 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-13 22:24:06,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:24:06,924 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-03-13 22:24:06,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:06,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2071399786, now seen corresponding path program 1 times [2025-03-13 22:24:06,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:06,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179567885] [2025-03-13 22:24:06,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:06,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:06,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-13 22:24:06,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-13 22:24:06,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:06,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:07,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:07,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:07,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179567885] [2025-03-13 22:24:07,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179567885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:07,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:07,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:07,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983578436] [2025-03-13 22:24:07,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:07,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:07,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:07,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:07,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:07,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 196 [2025-03-13 22:24:07,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 139 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 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-03-13 22:24:07,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:07,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 196 [2025-03-13 22:24:07,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:07,052 INFO L124 PetriNetUnfolderBase]: 16/185 cut-off events. [2025-03-13 22:24:07,052 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:24:07,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 185 events. 16/185 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 201 event pairs, 15 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 138. Up to 38 conditions per place. [2025-03-13 22:24:07,053 INFO L140 encePairwiseOnDemand]: 194/196 looper letters, 11 selfloop transitions, 1 changer transitions 0/138 dead transitions. [2025-03-13 22:24:07,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 138 transitions, 310 flow [2025-03-13 22:24:07,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:07,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:07,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2025-03-13 22:24:07,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8231292517006803 [2025-03-13 22:24:07,054 INFO L175 Difference]: Start difference. First operand has 144 places, 139 transitions, 288 flow. Second operand 3 states and 484 transitions. [2025-03-13 22:24:07,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 138 transitions, 310 flow [2025-03-13 22:24:07,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 138 transitions, 306 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:07,056 INFO L231 Difference]: Finished difference. Result has 143 places, 138 transitions, 284 flow [2025-03-13 22:24:07,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=143, PETRI_TRANSITIONS=138} [2025-03-13 22:24:07,057 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -38 predicate places. [2025-03-13 22:24:07,057 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 138 transitions, 284 flow [2025-03-13 22:24:07,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 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-03-13 22:24:07,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:07,057 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-13 22:24:07,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:24:07,057 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-03-13 22:24:07,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:07,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1610130542, now seen corresponding path program 1 times [2025-03-13 22:24:07,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:07,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872136927] [2025-03-13 22:24:07,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:07,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:07,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-13 22:24:07,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-13 22:24:07,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:07,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:07,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:07,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:07,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872136927] [2025-03-13 22:24:07,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872136927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:07,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:07,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:07,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181928481] [2025-03-13 22:24:07,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:07,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:07,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:07,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:07,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:07,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 196 [2025-03-13 22:24:07,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 138 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 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-03-13 22:24:07,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:07,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 196 [2025-03-13 22:24:07,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:07,175 INFO L124 PetriNetUnfolderBase]: 15/188 cut-off events. [2025-03-13 22:24:07,175 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:24:07,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 188 events. 15/188 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 202 event pairs, 15 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 216. Up to 38 conditions per place. [2025-03-13 22:24:07,175 INFO L140 encePairwiseOnDemand]: 194/196 looper letters, 11 selfloop transitions, 1 changer transitions 0/137 dead transitions. [2025-03-13 22:24:07,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 137 transitions, 306 flow [2025-03-13 22:24:07,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:07,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:07,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2025-03-13 22:24:07,177 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8231292517006803 [2025-03-13 22:24:07,177 INFO L175 Difference]: Start difference. First operand has 143 places, 138 transitions, 284 flow. Second operand 3 states and 484 transitions. [2025-03-13 22:24:07,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 137 transitions, 306 flow [2025-03-13 22:24:07,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 137 transitions, 305 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:24:07,179 INFO L231 Difference]: Finished difference. Result has 143 places, 137 transitions, 283 flow [2025-03-13 22:24:07,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=283, PETRI_PLACES=143, PETRI_TRANSITIONS=137} [2025-03-13 22:24:07,179 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -38 predicate places. [2025-03-13 22:24:07,180 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 137 transitions, 283 flow [2025-03-13 22:24:07,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 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-03-13 22:24:07,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:07,180 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-13 22:24:07,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:24:07,180 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-03-13 22:24:07,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:07,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1665420476, now seen corresponding path program 1 times [2025-03-13 22:24:07,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:07,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020370690] [2025-03-13 22:24:07,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:07,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:07,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-13 22:24:07,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-13 22:24:07,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:07,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:07,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:07,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:07,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020370690] [2025-03-13 22:24:07,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020370690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:07,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:07,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:07,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917068490] [2025-03-13 22:24:07,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:07,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:07,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:07,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:07,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:07,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 196 [2025-03-13 22:24:07,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 137 transitions, 283 flow. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 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-03-13 22:24:07,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:07,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 196 [2025-03-13 22:24:07,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:07,331 INFO L124 PetriNetUnfolderBase]: 15/186 cut-off events. [2025-03-13 22:24:07,331 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:24:07,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 186 events. 15/186 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 200 event pairs, 15 based on Foata normal form. 2/183 useless extension candidates. Maximal degree in co-relation 226. Up to 38 conditions per place. [2025-03-13 22:24:07,332 INFO L140 encePairwiseOnDemand]: 194/196 looper letters, 0 selfloop transitions, 0 changer transitions 136/136 dead transitions. [2025-03-13 22:24:07,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 136 transitions, 303 flow [2025-03-13 22:24:07,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:07,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:07,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2025-03-13 22:24:07,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8214285714285714 [2025-03-13 22:24:07,334 INFO L175 Difference]: Start difference. First operand has 143 places, 137 transitions, 283 flow. Second operand 3 states and 483 transitions. [2025-03-13 22:24:07,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 136 transitions, 303 flow [2025-03-13 22:24:07,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 136 transitions, 302 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:24:07,335 INFO L231 Difference]: Finished difference. Result has 143 places, 0 transitions, 0 flow [2025-03-13 22:24:07,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=143, PETRI_TRANSITIONS=0} [2025-03-13 22:24:07,335 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -38 predicate places. [2025-03-13 22:24:07,336 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 0 transitions, 0 flow [2025-03-13 22:24:07,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 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-03-13 22:24:07,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (62 of 63 remaining) [2025-03-13 22:24:07,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (61 of 63 remaining) [2025-03-13 22:24:07,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (60 of 63 remaining) [2025-03-13 22:24:07,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (59 of 63 remaining) [2025-03-13 22:24:07,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (58 of 63 remaining) [2025-03-13 22:24:07,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (57 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (56 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (55 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (54 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (53 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (52 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (51 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (50 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (49 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (48 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (47 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (46 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (45 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (44 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (43 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (42 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (41 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (40 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (39 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (38 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (37 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (36 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (35 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (34 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (33 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (32 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (30 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (29 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (28 of 63 remaining) [2025-03-13 22:24:07,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (27 of 63 remaining) [2025-03-13 22:24:07,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 63 remaining) [2025-03-13 22:24:07,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 63 remaining) [2025-03-13 22:24:07,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 63 remaining) [2025-03-13 22:24:07,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (23 of 63 remaining) [2025-03-13 22:24:07,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (22 of 63 remaining) [2025-03-13 22:24:07,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (21 of 63 remaining) [2025-03-13 22:24:07,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (20 of 63 remaining) [2025-03-13 22:24:07,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (19 of 63 remaining) [2025-03-13 22:24:07,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (18 of 63 remaining) [2025-03-13 22:24:07,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (17 of 63 remaining) [2025-03-13 22:24:07,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (16 of 63 remaining) [2025-03-13 22:24:07,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (15 of 63 remaining) [2025-03-13 22:24:07,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (14 of 63 remaining) [2025-03-13 22:24:07,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (13 of 63 remaining) [2025-03-13 22:24:07,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 63 remaining) [2025-03-13 22:24:07,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (11 of 63 remaining) [2025-03-13 22:24:07,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (10 of 63 remaining) [2025-03-13 22:24:07,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 63 remaining) [2025-03-13 22:24:07,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (8 of 63 remaining) [2025-03-13 22:24:07,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 63 remaining) [2025-03-13 22:24:07,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 63 remaining) [2025-03-13 22:24:07,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 63 remaining) [2025-03-13 22:24:07,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 63 remaining) [2025-03-13 22:24:07,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 63 remaining) [2025-03-13 22:24:07,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 63 remaining) [2025-03-13 22:24:07,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 63 remaining) [2025-03-13 22:24:07,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 63 remaining) [2025-03-13 22:24:07,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:24:07,345 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:24:07,349 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 22:24:07,349 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:24:07,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:24:07 BasicIcfg [2025-03-13 22:24:07,353 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:24:07,354 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:24:07,354 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:24:07,354 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:24:07,354 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:24:05" (3/4) ... [2025-03-13 22:24:07,355 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 22:24:07,357 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-13 22:24:07,357 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-13 22:24:07,357 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-13 22:24:07,362 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-13 22:24:07,362 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-13 22:24:07,362 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 22:24:07,362 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 22:24:07,424 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 22:24:07,424 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 22:24:07,424 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:24:07,425 INFO L158 Benchmark]: Toolchain (without parser) took 3093.69ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 113.8MB in the beginning and 366.2MB in the end (delta: -252.4MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2025-03-13 22:24:07,425 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:24:07,425 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.40ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 101.5MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:24:07,425 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.77ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 99.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:24:07,425 INFO L158 Benchmark]: Boogie Preprocessor took 25.57ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 97.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:24:07,425 INFO L158 Benchmark]: IcfgBuilder took 882.01ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 67.4MB in the end (delta: 30.4MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2025-03-13 22:24:07,426 INFO L158 Benchmark]: TraceAbstraction took 1887.54ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 67.4MB in the beginning and 371.3MB in the end (delta: -303.9MB). Peak memory consumption was 204.3MB. Max. memory is 16.1GB. [2025-03-13 22:24:07,426 INFO L158 Benchmark]: Witness Printer took 70.51ms. Allocated memory is still 419.4MB. Free memory was 371.3MB in the beginning and 366.2MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:24:07,427 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.20ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 187.40ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 101.5MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.77ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 99.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.57ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 97.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 882.01ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 67.4MB in the end (delta: 30.4MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1887.54ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 67.4MB in the beginning and 371.3MB in the end (delta: -303.9MB). Peak memory consumption was 204.3MB. Max. memory is 16.1GB. * Witness Printer took 70.51ms. Allocated memory is still 419.4MB. Free memory was 371.3MB in the beginning and 366.2MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: 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: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: 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, 236 locations, 63 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 95 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 328 IncrementalHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 32 mSDtfsCounter, 328 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=362occurred in iteration=0, 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, 913 NumberOfCodeBlocks, 913 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 901 ConstructedInterpolants, 0 QuantifiedInterpolants, 925 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 36 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-13 22:24:07,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE