./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/array-eq-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/array-eq-symm.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6897befed0dbbae24492a1e82d50fcd0be6b3857b241d882a904d02a513d7a6d --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:36:52,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:36:52,530 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:36:52,537 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:36:52,539 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:36:52,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:36:52,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:36:52,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:36:52,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:36:52,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:36:52,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:36:52,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:36:52,569 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:36:52,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:36:52,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:36:52,570 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:36:52,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:36:52,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:36:52,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:36:52,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:36:52,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:36:52,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:36:52,570 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:36:52,570 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:36:52,570 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:36:52,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:36:52,570 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:36:52,571 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:36:52,571 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:36:52,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:36:52,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:36:52,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:36:52,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:36:52,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:36:52,571 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:36:52,572 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:36:52,572 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:36:52,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:36:52,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:36:52,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:36:52,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:36:52,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:36:52,572 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6897befed0dbbae24492a1e82d50fcd0be6b3857b241d882a904d02a513d7a6d [2025-02-08 05:36:52,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:36:52,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:36:52,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:36:52,771 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:36:52,771 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:36:52,772 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/array-eq-symm.wvr.c [2025-02-08 05:36:54,024 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10c431b06/9442281a550f4393b8919dff0836d087/FLAG7c82f903f [2025-02-08 05:36:54,320 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:36:54,320 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/array-eq-symm.wvr.c [2025-02-08 05:36:54,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10c431b06/9442281a550f4393b8919dff0836d087/FLAG7c82f903f [2025-02-08 05:36:54,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10c431b06/9442281a550f4393b8919dff0836d087 [2025-02-08 05:36:54,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:36:54,607 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:36:54,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:36:54,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:36:54,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:36:54,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:36:54" (1/1) ... [2025-02-08 05:36:54,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b328b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:54, skipping insertion in model container [2025-02-08 05:36:54,613 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:36:54" (1/1) ... [2025-02-08 05:36:54,630 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:36:54,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:36:54,774 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:36:54,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:36:54,818 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:36:54,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:54 WrapperNode [2025-02-08 05:36:54,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:36:54,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:36:54,820 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:36:54,820 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:36:54,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:54" (1/1) ... [2025-02-08 05:36:54,835 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:54" (1/1) ... [2025-02-08 05:36:54,855 INFO L138 Inliner]: procedures = 22, calls = 20, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 139 [2025-02-08 05:36:54,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:36:54,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:36:54,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:36:54,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:36:54,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:54" (1/1) ... [2025-02-08 05:36:54,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:54" (1/1) ... [2025-02-08 05:36:54,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:54" (1/1) ... [2025-02-08 05:36:54,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:54" (1/1) ... [2025-02-08 05:36:54,879 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:54" (1/1) ... [2025-02-08 05:36:54,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:54" (1/1) ... [2025-02-08 05:36:54,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:54" (1/1) ... [2025-02-08 05:36:54,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:54" (1/1) ... [2025-02-08 05:36:54,892 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:36:54,893 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:36:54,893 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:36:54,893 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:36:54,894 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:54" (1/1) ... [2025-02-08 05:36:54,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:36:54,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:36:54,923 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:36:54,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:36:54,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:36:54,944 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:36:54,944 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:36:54,944 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:36:54,944 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:36:54,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:36:54,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:36:54,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:36:54,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:36:54,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:36:54,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:36:54,946 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:36:55,022 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:36:55,027 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:36:55,419 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:36:55,419 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:36:55,438 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:36:55,438 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:36:55,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:36:55 BoogieIcfgContainer [2025-02-08 05:36:55,438 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:36:55,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:36:55,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:36:55,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:36:55,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:36:54" (1/3) ... [2025-02-08 05:36:55,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c704a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:36:55, skipping insertion in model container [2025-02-08 05:36:55,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:54" (2/3) ... [2025-02-08 05:36:55,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c704a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:36:55, skipping insertion in model container [2025-02-08 05:36:55,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:36:55" (3/3) ... [2025-02-08 05:36:55,447 INFO L128 eAbstractionObserver]: Analyzing ICFG array-eq-symm.wvr.c [2025-02-08 05:36:55,459 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:36:55,461 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array-eq-symm.wvr.c that has 3 procedures, 304 locations, 1 initial locations, 4 loop locations, and 34 error locations. [2025-02-08 05:36:55,461 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:36:55,525 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:36:55,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 310 places, 318 transitions, 650 flow [2025-02-08 05:36:55,658 INFO L124 PetriNetUnfolderBase]: 15/316 cut-off events. [2025-02-08 05:36:55,660 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:36:55,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 316 events. 15/316 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 562 event pairs, 0 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 224. Up to 3 conditions per place. [2025-02-08 05:36:55,677 INFO L82 GeneralOperation]: Start removeDead. Operand has 310 places, 318 transitions, 650 flow [2025-02-08 05:36:55,687 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 292 places, 299 transitions, 610 flow [2025-02-08 05:36:55,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:36:55,708 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;@503aa47e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:36:55,709 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2025-02-08 05:36:55,713 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:36:55,713 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-02-08 05:36:55,713 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:36:55,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:55,714 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:36:55,714 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:36:55,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:55,717 INFO L85 PathProgramCache]: Analyzing trace with hash 794704670, now seen corresponding path program 1 times [2025-02-08 05:36:55,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:55,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23180263] [2025-02-08 05:36:55,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:55,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:55,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:36:55,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:36:55,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:55,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:55,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:36:55,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:55,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23180263] [2025-02-08 05:36:55,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23180263] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:55,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:55,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:36:55,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495233946] [2025-02-08 05:36:55,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:55,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:36:55,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:55,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:36:55,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:36:55,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 318 [2025-02-08 05:36:55,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 299 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:55,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:55,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 318 [2025-02-08 05:36:55,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:55,952 INFO L124 PetriNetUnfolderBase]: 17/428 cut-off events. [2025-02-08 05:36:55,952 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 05:36:55,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 428 events. 17/428 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1221 event pairs, 3 based on Foata normal form. 12/364 useless extension candidates. Maximal degree in co-relation 287. Up to 19 conditions per place. [2025-02-08 05:36:55,956 INFO L140 encePairwiseOnDemand]: 309/318 looper letters, 10 selfloop transitions, 2 changer transitions 4/292 dead transitions. [2025-02-08 05:36:55,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 292 transitions, 620 flow [2025-02-08 05:36:55,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:36:55,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:36:55,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 907 transitions. [2025-02-08 05:36:55,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950733752620545 [2025-02-08 05:36:55,980 INFO L175 Difference]: Start difference. First operand has 292 places, 299 transitions, 610 flow. Second operand 3 states and 907 transitions. [2025-02-08 05:36:55,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 292 transitions, 620 flow [2025-02-08 05:36:55,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 292 transitions, 612 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:36:55,990 INFO L231 Difference]: Finished difference. Result has 289 places, 288 transitions, 584 flow [2025-02-08 05:36:55,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=584, PETRI_PLACES=289, PETRI_TRANSITIONS=288} [2025-02-08 05:36:55,996 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -3 predicate places. [2025-02-08 05:36:55,996 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 288 transitions, 584 flow [2025-02-08 05:36:55,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:55,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:55,997 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] [2025-02-08 05:36:55,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:36:55,998 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:36:55,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:55,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1499805292, now seen corresponding path program 1 times [2025-02-08 05:36:55,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:55,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30262348] [2025-02-08 05:36:55,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:55,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:56,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:36:56,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:36:56,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:56,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:56,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:36:56,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:56,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30262348] [2025-02-08 05:36:56,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30262348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:56,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:56,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:36:56,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969904499] [2025-02-08 05:36:56,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:56,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:36:56,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:56,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:36:56,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:36:56,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 318 [2025-02-08 05:36:56,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 288 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:56,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:56,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 318 [2025-02-08 05:36:56,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:56,129 INFO L124 PetriNetUnfolderBase]: 17/425 cut-off events. [2025-02-08 05:36:56,129 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:36:56,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 425 events. 17/425 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1173 event pairs, 3 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 422. Up to 18 conditions per place. [2025-02-08 05:36:56,132 INFO L140 encePairwiseOnDemand]: 315/318 looper letters, 10 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2025-02-08 05:36:56,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 287 transitions, 606 flow [2025-02-08 05:36:56,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:36:56,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:36:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 901 transitions. [2025-02-08 05:36:56,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2025-02-08 05:36:56,134 INFO L175 Difference]: Start difference. First operand has 289 places, 288 transitions, 584 flow. Second operand 3 states and 901 transitions. [2025-02-08 05:36:56,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 287 transitions, 606 flow [2025-02-08 05:36:56,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 287 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:36:56,138 INFO L231 Difference]: Finished difference. Result has 284 places, 287 transitions, 582 flow [2025-02-08 05:36:56,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=284, PETRI_TRANSITIONS=287} [2025-02-08 05:36:56,139 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -8 predicate places. [2025-02-08 05:36:56,139 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 287 transitions, 582 flow [2025-02-08 05:36:56,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:56,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:56,140 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-02-08 05:36:56,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:36:56,140 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:36:56,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:56,141 INFO L85 PathProgramCache]: Analyzing trace with hash 512287078, now seen corresponding path program 1 times [2025-02-08 05:36:56,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:56,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219287163] [2025-02-08 05:36:56,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:56,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:56,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:36:56,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:36:56,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:56,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:56,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:36:56,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:56,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219287163] [2025-02-08 05:36:56,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219287163] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:56,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:56,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:36:56,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116832927] [2025-02-08 05:36:56,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:56,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:36:56,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:56,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:36:56,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:36:56,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 318 [2025-02-08 05:36:56,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 287 transitions, 582 flow. Second operand has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:56,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:56,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 318 [2025-02-08 05:36:56,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:56,259 INFO L124 PetriNetUnfolderBase]: 33/617 cut-off events. [2025-02-08 05:36:56,260 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:36:56,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 617 events. 33/617 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2359 event pairs, 8 based on Foata normal form. 0/505 useless extension candidates. Maximal degree in co-relation 622. Up to 33 conditions per place. [2025-02-08 05:36:56,263 INFO L140 encePairwiseOnDemand]: 314/318 looper letters, 10 selfloop transitions, 1 changer transitions 0/284 dead transitions. [2025-02-08 05:36:56,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 284 transitions, 598 flow [2025-02-08 05:36:56,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:36:56,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:36:56,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 902 transitions. [2025-02-08 05:36:56,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9454926624737946 [2025-02-08 05:36:56,265 INFO L175 Difference]: Start difference. First operand has 284 places, 287 transitions, 582 flow. Second operand 3 states and 902 transitions. [2025-02-08 05:36:56,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 284 transitions, 598 flow [2025-02-08 05:36:56,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 284 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:36:56,269 INFO L231 Difference]: Finished difference. Result has 281 places, 284 transitions, 574 flow [2025-02-08 05:36:56,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=281, PETRI_TRANSITIONS=284} [2025-02-08 05:36:56,270 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -11 predicate places. [2025-02-08 05:36:56,270 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 284 transitions, 574 flow [2025-02-08 05:36:56,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:56,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:56,271 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] [2025-02-08 05:36:56,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:36:56,271 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:36:56,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:56,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1132598982, now seen corresponding path program 1 times [2025-02-08 05:36:56,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:56,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634679318] [2025-02-08 05:36:56,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:56,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:56,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:36:56,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:36:56,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:56,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:56,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:36:56,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:56,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634679318] [2025-02-08 05:36:56,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634679318] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:56,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:56,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:36:56,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648360198] [2025-02-08 05:36:56,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:56,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:36:56,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:56,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:36:56,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:36:56,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 318 [2025-02-08 05:36:56,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 284 transitions, 574 flow. Second operand has 6 states, 6 states have (on average 263.5) internal successors, (1581), 6 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:56,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:56,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 318 [2025-02-08 05:36:56,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:57,171 INFO L124 PetriNetUnfolderBase]: 146/1249 cut-off events. [2025-02-08 05:36:57,171 INFO L125 PetriNetUnfolderBase]: For 19/20 co-relation queries the response was YES. [2025-02-08 05:36:57,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1496 conditions, 1249 events. 146/1249 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7422 event pairs, 80 based on Foata normal form. 0/1005 useless extension candidates. Maximal degree in co-relation 1459. Up to 224 conditions per place. [2025-02-08 05:36:57,178 INFO L140 encePairwiseOnDemand]: 306/318 looper letters, 36 selfloop transitions, 10 changer transitions 0/282 dead transitions. [2025-02-08 05:36:57,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 282 transitions, 662 flow [2025-02-08 05:36:57,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:36:57,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:36:57,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1620 transitions. [2025-02-08 05:36:57,182 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8490566037735849 [2025-02-08 05:36:57,182 INFO L175 Difference]: Start difference. First operand has 281 places, 284 transitions, 574 flow. Second operand 6 states and 1620 transitions. [2025-02-08 05:36:57,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 282 transitions, 662 flow [2025-02-08 05:36:57,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 282 transitions, 661 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:36:57,186 INFO L231 Difference]: Finished difference. Result has 283 places, 282 transitions, 589 flow [2025-02-08 05:36:57,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=589, PETRI_PLACES=283, PETRI_TRANSITIONS=282} [2025-02-08 05:36:57,186 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -9 predicate places. [2025-02-08 05:36:57,187 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 282 transitions, 589 flow [2025-02-08 05:36:57,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 263.5) internal successors, (1581), 6 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:57,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:57,188 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] [2025-02-08 05:36:57,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:36:57,188 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:36:57,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:57,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1315854692, now seen corresponding path program 1 times [2025-02-08 05:36:57,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:57,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882002833] [2025-02-08 05:36:57,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:57,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:57,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:36:57,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:36:57,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:57,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:57,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:36:57,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:57,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882002833] [2025-02-08 05:36:57,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882002833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:57,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:57,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:36:57,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564484333] [2025-02-08 05:36:57,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:57,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:36:57,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:57,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:36:57,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:36:57,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 318 [2025-02-08 05:36:57,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 282 transitions, 589 flow. Second operand has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:57,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:57,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 318 [2025-02-08 05:36:57,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:57,290 INFO L124 PetriNetUnfolderBase]: 14/353 cut-off events. [2025-02-08 05:36:57,290 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-02-08 05:36:57,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 353 events. 14/353 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 838 event pairs, 3 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 354. Up to 16 conditions per place. [2025-02-08 05:36:57,292 INFO L140 encePairwiseOnDemand]: 315/318 looper letters, 9 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2025-02-08 05:36:57,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 281 transitions, 609 flow [2025-02-08 05:36:57,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:36:57,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:36:57,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 903 transitions. [2025-02-08 05:36:57,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9465408805031447 [2025-02-08 05:36:57,294 INFO L175 Difference]: Start difference. First operand has 283 places, 282 transitions, 589 flow. Second operand 3 states and 903 transitions. [2025-02-08 05:36:57,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 281 transitions, 609 flow [2025-02-08 05:36:57,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 281 transitions, 589 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:36:57,298 INFO L231 Difference]: Finished difference. Result has 279 places, 281 transitions, 571 flow [2025-02-08 05:36:57,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=279, PETRI_TRANSITIONS=281} [2025-02-08 05:36:57,299 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -13 predicate places. [2025-02-08 05:36:57,299 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 281 transitions, 571 flow [2025-02-08 05:36:57,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:57,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:57,300 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] [2025-02-08 05:36:57,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:36:57,300 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:36:57,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:57,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1406959879, now seen corresponding path program 1 times [2025-02-08 05:36:57,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:57,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345868011] [2025-02-08 05:36:57,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:57,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:57,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 05:36:57,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 05:36:57,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:57,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:57,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:36:57,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:57,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345868011] [2025-02-08 05:36:57,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345868011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:57,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:57,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:36:57,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687604357] [2025-02-08 05:36:57,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:57,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:36:57,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:57,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:36:57,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:36:57,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 318 [2025-02-08 05:36:57,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 281 transitions, 571 flow. Second operand has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:57,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:57,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 318 [2025-02-08 05:36:57,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:57,409 INFO L124 PetriNetUnfolderBase]: 35/610 cut-off events. [2025-02-08 05:36:57,409 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-02-08 05:36:57,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 610 events. 35/610 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2436 event pairs, 8 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 617. Up to 34 conditions per place. [2025-02-08 05:36:57,413 INFO L140 encePairwiseOnDemand]: 314/318 looper letters, 10 selfloop transitions, 1 changer transitions 0/278 dead transitions. [2025-02-08 05:36:57,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 278 transitions, 587 flow [2025-02-08 05:36:57,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:36:57,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:36:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 902 transitions. [2025-02-08 05:36:57,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9454926624737946 [2025-02-08 05:36:57,416 INFO L175 Difference]: Start difference. First operand has 279 places, 281 transitions, 571 flow. Second operand 3 states and 902 transitions. [2025-02-08 05:36:57,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 278 transitions, 587 flow [2025-02-08 05:36:57,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 278 transitions, 583 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:36:57,419 INFO L231 Difference]: Finished difference. Result has 276 places, 278 transitions, 563 flow [2025-02-08 05:36:57,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=563, PETRI_PLACES=276, PETRI_TRANSITIONS=278} [2025-02-08 05:36:57,420 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -16 predicate places. [2025-02-08 05:36:57,420 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 278 transitions, 563 flow [2025-02-08 05:36:57,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:57,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:57,421 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] [2025-02-08 05:36:57,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:36:57,421 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:36:57,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:57,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1987051880, now seen corresponding path program 1 times [2025-02-08 05:36:57,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:57,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443705552] [2025-02-08 05:36:57,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:57,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:57,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 05:36:57,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 05:36:57,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:57,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:57,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:36:57,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:57,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443705552] [2025-02-08 05:36:57,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443705552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:57,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:57,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:36:57,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812088487] [2025-02-08 05:36:57,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:57,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:36:57,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:57,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:36:57,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:36:57,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 318 [2025-02-08 05:36:57,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 278 transitions, 563 flow. Second operand has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:57,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:57,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 318 [2025-02-08 05:36:57,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:57,551 INFO L124 PetriNetUnfolderBase]: 14/348 cut-off events. [2025-02-08 05:36:57,551 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-02-08 05:36:57,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 348 events. 14/348 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 732 event pairs, 3 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 335. Up to 16 conditions per place. [2025-02-08 05:36:57,557 INFO L140 encePairwiseOnDemand]: 315/318 looper letters, 9 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2025-02-08 05:36:57,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 277 transitions, 583 flow [2025-02-08 05:36:57,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:36:57,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:36:57,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 903 transitions. [2025-02-08 05:36:57,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9465408805031447 [2025-02-08 05:36:57,560 INFO L175 Difference]: Start difference. First operand has 276 places, 278 transitions, 563 flow. Second operand 3 states and 903 transitions. [2025-02-08 05:36:57,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 277 transitions, 583 flow [2025-02-08 05:36:57,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 277 transitions, 582 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:36:57,566 INFO L231 Difference]: Finished difference. Result has 276 places, 277 transitions, 564 flow [2025-02-08 05:36:57,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=276, PETRI_TRANSITIONS=277} [2025-02-08 05:36:57,570 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -16 predicate places. [2025-02-08 05:36:57,570 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 277 transitions, 564 flow [2025-02-08 05:36:57,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:57,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:57,571 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] [2025-02-08 05:36:57,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:36:57,571 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:36:57,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:57,573 INFO L85 PathProgramCache]: Analyzing trace with hash -2012809956, now seen corresponding path program 1 times [2025-02-08 05:36:57,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:57,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521167517] [2025-02-08 05:36:57,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:57,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:57,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 05:36:57,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 05:36:57,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:57,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:57,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:36:57,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:57,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521167517] [2025-02-08 05:36:57,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521167517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:57,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:57,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:36:57,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277086985] [2025-02-08 05:36:57,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:57,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:36:57,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:57,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:36:57,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:36:57,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 318 [2025-02-08 05:36:57,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 277 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:57,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:57,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 318 [2025-02-08 05:36:57,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:57,702 INFO L124 PetriNetUnfolderBase]: 22/341 cut-off events. [2025-02-08 05:36:57,703 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:36:57,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 341 events. 22/341 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 869 event pairs, 1 based on Foata normal form. 0/309 useless extension candidates. Maximal degree in co-relation 364. Up to 35 conditions per place. [2025-02-08 05:36:57,705 INFO L140 encePairwiseOnDemand]: 310/318 looper letters, 16 selfloop transitions, 2 changer transitions 0/272 dead transitions. [2025-02-08 05:36:57,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 272 transitions, 591 flow [2025-02-08 05:36:57,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:36:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:36:57,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 885 transitions. [2025-02-08 05:36:57,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9276729559748428 [2025-02-08 05:36:57,707 INFO L175 Difference]: Start difference. First operand has 276 places, 277 transitions, 564 flow. Second operand 3 states and 885 transitions. [2025-02-08 05:36:57,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 272 transitions, 591 flow [2025-02-08 05:36:57,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 272 transitions, 587 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:36:57,714 INFO L231 Difference]: Finished difference. Result has 270 places, 271 transitions, 552 flow [2025-02-08 05:36:57,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=270, PETRI_TRANSITIONS=271} [2025-02-08 05:36:57,715 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -22 predicate places. [2025-02-08 05:36:57,717 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 271 transitions, 552 flow [2025-02-08 05:36:57,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:57,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:57,717 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] [2025-02-08 05:36:57,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:36:57,718 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:36:57,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:57,718 INFO L85 PathProgramCache]: Analyzing trace with hash 168581383, now seen corresponding path program 1 times [2025-02-08 05:36:57,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:57,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138374463] [2025-02-08 05:36:57,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:57,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:57,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-08 05:36:57,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-08 05:36:57,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:57,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:57,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:36:57,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:57,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138374463] [2025-02-08 05:36:57,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138374463] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:57,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:57,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:36:57,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214127276] [2025-02-08 05:36:57,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:57,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:36:57,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:57,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:36:57,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:36:57,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 318 [2025-02-08 05:36:57,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 271 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 288.3333333333333) internal successors, (865), 3 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:57,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:57,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 318 [2025-02-08 05:36:57,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:57,824 INFO L124 PetriNetUnfolderBase]: 22/335 cut-off events. [2025-02-08 05:36:57,824 INFO L125 PetriNetUnfolderBase]: For 13/14 co-relation queries the response was YES. [2025-02-08 05:36:57,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 383 conditions, 335 events. 22/335 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 881 event pairs, 1 based on Foata normal form. 1/309 useless extension candidates. Maximal degree in co-relation 346. Up to 33 conditions per place. [2025-02-08 05:36:57,826 INFO L140 encePairwiseOnDemand]: 310/318 looper letters, 13 selfloop transitions, 2 changer transitions 4/266 dead transitions. [2025-02-08 05:36:57,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 266 transitions, 577 flow [2025-02-08 05:36:57,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:36:57,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:36:57,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 884 transitions. [2025-02-08 05:36:57,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9266247379454927 [2025-02-08 05:36:57,829 INFO L175 Difference]: Start difference. First operand has 270 places, 271 transitions, 552 flow. Second operand 3 states and 884 transitions. [2025-02-08 05:36:57,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 266 transitions, 577 flow [2025-02-08 05:36:57,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 266 transitions, 573 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:36:57,834 INFO L231 Difference]: Finished difference. Result has 264 places, 261 transitions, 531 flow [2025-02-08 05:36:57,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=531, PETRI_PLACES=264, PETRI_TRANSITIONS=261} [2025-02-08 05:36:57,835 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -28 predicate places. [2025-02-08 05:36:57,835 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 261 transitions, 531 flow [2025-02-08 05:36:57,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 288.3333333333333) internal successors, (865), 3 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:57,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:57,836 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] [2025-02-08 05:36:57,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:36:57,836 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:36:57,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:57,839 INFO L85 PathProgramCache]: Analyzing trace with hash -765099769, now seen corresponding path program 1 times [2025-02-08 05:36:57,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:57,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405663389] [2025-02-08 05:36:57,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:57,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:57,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-08 05:36:57,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-08 05:36:57,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:57,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:57,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:36:57,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:57,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405663389] [2025-02-08 05:36:57,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405663389] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:57,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:57,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:36:57,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753713451] [2025-02-08 05:36:57,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:57,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:36:57,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:57,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:36:57,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:36:57,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 318 [2025-02-08 05:36:57,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 261 transitions, 531 flow. Second operand has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:57,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:57,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 318 [2025-02-08 05:36:57,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:57,918 INFO L124 PetriNetUnfolderBase]: 22/391 cut-off events. [2025-02-08 05:36:57,918 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:36:57,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 391 events. 22/391 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1019 event pairs, 6 based on Foata normal form. 0/357 useless extension candidates. Maximal degree in co-relation 403. Up to 23 conditions per place. [2025-02-08 05:36:57,920 INFO L140 encePairwiseOnDemand]: 314/318 looper letters, 10 selfloop transitions, 3 changer transitions 0/263 dead transitions. [2025-02-08 05:36:57,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 263 transitions, 562 flow [2025-02-08 05:36:57,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:36:57,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:36:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 908 transitions. [2025-02-08 05:36:57,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9517819706498952 [2025-02-08 05:36:57,922 INFO L175 Difference]: Start difference. First operand has 264 places, 261 transitions, 531 flow. Second operand 3 states and 908 transitions. [2025-02-08 05:36:57,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 263 transitions, 562 flow [2025-02-08 05:36:57,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 263 transitions, 558 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:36:57,928 INFO L231 Difference]: Finished difference. Result has 262 places, 262 transitions, 545 flow [2025-02-08 05:36:57,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=545, PETRI_PLACES=262, PETRI_TRANSITIONS=262} [2025-02-08 05:36:57,929 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -30 predicate places. [2025-02-08 05:36:57,929 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 262 transitions, 545 flow [2025-02-08 05:36:57,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:57,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:57,930 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] [2025-02-08 05:36:57,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:36:57,930 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:36:57,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:57,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1528301737, now seen corresponding path program 1 times [2025-02-08 05:36:57,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:57,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479096716] [2025-02-08 05:36:57,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:57,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:57,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-08 05:36:57,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-08 05:36:57,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:57,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:57,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:36:57,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:57,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479096716] [2025-02-08 05:36:57,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479096716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:57,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:57,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:36:57,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285317740] [2025-02-08 05:36:57,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:57,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:36:57,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:57,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:36:57,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:36:57,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 318 [2025-02-08 05:36:57,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 262 transitions, 545 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:57,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:57,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 318 [2025-02-08 05:36:57,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:58,092 INFO L124 PetriNetUnfolderBase]: 37/614 cut-off events. [2025-02-08 05:36:58,092 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2025-02-08 05:36:58,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 614 events. 37/614 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2189 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 654. Up to 32 conditions per place. [2025-02-08 05:36:58,116 INFO L140 encePairwiseOnDemand]: 314/318 looper letters, 10 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2025-02-08 05:36:58,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 264 transitions, 575 flow [2025-02-08 05:36:58,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:36:58,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:36:58,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 911 transitions. [2025-02-08 05:36:58,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9549266247379455 [2025-02-08 05:36:58,118 INFO L175 Difference]: Start difference. First operand has 262 places, 262 transitions, 545 flow. Second operand 3 states and 911 transitions. [2025-02-08 05:36:58,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 264 transitions, 575 flow [2025-02-08 05:36:58,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 264 transitions, 569 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:36:58,122 INFO L231 Difference]: Finished difference. Result has 261 places, 262 transitions, 549 flow [2025-02-08 05:36:58,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=549, PETRI_PLACES=261, PETRI_TRANSITIONS=262} [2025-02-08 05:36:58,123 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -31 predicate places. [2025-02-08 05:36:58,123 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 262 transitions, 549 flow [2025-02-08 05:36:58,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:58,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:58,124 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] [2025-02-08 05:36:58,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:36:58,124 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:36:58,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:58,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1887544462, now seen corresponding path program 1 times [2025-02-08 05:36:58,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:58,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416764850] [2025-02-08 05:36:58,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:58,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:58,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-08 05:36:58,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-08 05:36:58,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:58,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:58,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:36:58,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:58,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416764850] [2025-02-08 05:36:58,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416764850] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:58,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:58,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:36:58,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909956544] [2025-02-08 05:36:58,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:58,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:36:58,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:58,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:36:58,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:36:58,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 318 [2025-02-08 05:36:58,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 262 transitions, 549 flow. Second operand has 3 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:58,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:58,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 318 [2025-02-08 05:36:58,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:58,215 INFO L124 PetriNetUnfolderBase]: 50/492 cut-off events. [2025-02-08 05:36:58,215 INFO L125 PetriNetUnfolderBase]: For 32/34 co-relation queries the response was YES. [2025-02-08 05:36:58,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 492 events. 50/492 cut-off events. For 32/34 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1497 event pairs, 11 based on Foata normal form. 0/446 useless extension candidates. Maximal degree in co-relation 565. Up to 58 conditions per place. [2025-02-08 05:36:58,218 INFO L140 encePairwiseOnDemand]: 314/318 looper letters, 9 selfloop transitions, 3 changer transitions 1/264 dead transitions. [2025-02-08 05:36:58,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 264 transitions, 580 flow [2025-02-08 05:36:58,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:36:58,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:36:58,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 908 transitions. [2025-02-08 05:36:58,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9517819706498952 [2025-02-08 05:36:58,220 INFO L175 Difference]: Start difference. First operand has 261 places, 262 transitions, 549 flow. Second operand 3 states and 908 transitions. [2025-02-08 05:36:58,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 264 transitions, 580 flow [2025-02-08 05:36:58,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 264 transitions, 580 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:36:58,223 INFO L231 Difference]: Finished difference. Result has 265 places, 263 transitions, 567 flow [2025-02-08 05:36:58,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=567, PETRI_PLACES=265, PETRI_TRANSITIONS=263} [2025-02-08 05:36:58,225 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -27 predicate places. [2025-02-08 05:36:58,225 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 263 transitions, 567 flow [2025-02-08 05:36:58,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:58,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:58,226 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] [2025-02-08 05:36:58,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:36:58,227 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:36:58,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:58,227 INFO L85 PathProgramCache]: Analyzing trace with hash 296585039, now seen corresponding path program 1 times [2025-02-08 05:36:58,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:58,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988937009] [2025-02-08 05:36:58,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:58,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:58,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-08 05:36:58,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-08 05:36:58,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:58,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:58,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-02-08 05:36:58,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:58,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988937009] [2025-02-08 05:36:58,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988937009] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:58,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:58,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:36:58,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735191767] [2025-02-08 05:36:58,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:58,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:36:58,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:58,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:36:58,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:36:58,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 318 [2025-02-08 05:36:58,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 263 transitions, 567 flow. Second operand has 3 states, 3 states have (on average 300.6666666666667) internal successors, (902), 3 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:58,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:58,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 318 [2025-02-08 05:36:58,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:58,322 INFO L124 PetriNetUnfolderBase]: 45/676 cut-off events. [2025-02-08 05:36:58,322 INFO L125 PetriNetUnfolderBase]: For 18/19 co-relation queries the response was YES. [2025-02-08 05:36:58,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 676 events. 45/676 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2648 event pairs, 3 based on Foata normal form. 0/630 useless extension candidates. Maximal degree in co-relation 771. Up to 38 conditions per place. [2025-02-08 05:36:58,326 INFO L140 encePairwiseOnDemand]: 314/318 looper letters, 10 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2025-02-08 05:36:58,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 265 transitions, 597 flow [2025-02-08 05:36:58,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:36:58,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:36:58,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 911 transitions. [2025-02-08 05:36:58,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9549266247379455 [2025-02-08 05:36:58,328 INFO L175 Difference]: Start difference. First operand has 265 places, 263 transitions, 567 flow. Second operand 3 states and 911 transitions. [2025-02-08 05:36:58,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 265 transitions, 597 flow [2025-02-08 05:36:58,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 265 transitions, 591 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:36:58,333 INFO L231 Difference]: Finished difference. Result has 264 places, 263 transitions, 571 flow [2025-02-08 05:36:58,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=264, PETRI_TRANSITIONS=263} [2025-02-08 05:36:58,335 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -28 predicate places. [2025-02-08 05:36:58,335 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 263 transitions, 571 flow [2025-02-08 05:36:58,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.6666666666667) internal successors, (902), 3 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:58,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:58,335 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] [2025-02-08 05:36:58,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:36:58,336 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:36:58,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:58,336 INFO L85 PathProgramCache]: Analyzing trace with hash -40600773, now seen corresponding path program 1 times [2025-02-08 05:36:58,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:58,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044491248] [2025-02-08 05:36:58,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:58,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:58,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-08 05:36:58,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-08 05:36:58,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:58,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:58,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:36:58,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:58,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044491248] [2025-02-08 05:36:58,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044491248] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:58,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:58,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:36:58,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388071058] [2025-02-08 05:36:58,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:58,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:36:58,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:58,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:36:58,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:36:58,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 318 [2025-02-08 05:36:58,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 263 transitions, 571 flow. Second operand has 8 states, 8 states have (on average 279.125) internal successors, (2233), 8 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:58,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:58,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 318 [2025-02-08 05:36:58,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:59,075 INFO L124 PetriNetUnfolderBase]: 64/1040 cut-off events. [2025-02-08 05:36:59,075 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:36:59,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 1040 events. 64/1040 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4313 event pairs, 8 based on Foata normal form. 2/977 useless extension candidates. Maximal degree in co-relation 1288. Up to 35 conditions per place. [2025-02-08 05:36:59,080 INFO L140 encePairwiseOnDemand]: 301/318 looper letters, 48 selfloop transitions, 22 changer transitions 0/299 dead transitions. [2025-02-08 05:36:59,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 299 transitions, 807 flow [2025-02-08 05:36:59,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 05:36:59,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 05:36:59,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 3659 transitions. [2025-02-08 05:36:59,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8850991775520077 [2025-02-08 05:36:59,086 INFO L175 Difference]: Start difference. First operand has 264 places, 263 transitions, 571 flow. Second operand 13 states and 3659 transitions. [2025-02-08 05:36:59,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 299 transitions, 807 flow [2025-02-08 05:36:59,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 299 transitions, 807 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:36:59,090 INFO L231 Difference]: Finished difference. Result has 281 places, 275 transitions, 684 flow [2025-02-08 05:36:59,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=684, PETRI_PLACES=281, PETRI_TRANSITIONS=275} [2025-02-08 05:36:59,090 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -11 predicate places. [2025-02-08 05:36:59,090 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 275 transitions, 684 flow [2025-02-08 05:36:59,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 279.125) internal successors, (2233), 8 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:59,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:59,092 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, 1] [2025-02-08 05:36:59,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:36:59,092 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:36:59,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:59,093 INFO L85 PathProgramCache]: Analyzing trace with hash 804988083, now seen corresponding path program 1 times [2025-02-08 05:36:59,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:59,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986796075] [2025-02-08 05:36:59,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:59,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:59,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-08 05:36:59,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-08 05:36:59,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:59,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:36:59,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:59,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986796075] [2025-02-08 05:36:59,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986796075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:59,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:59,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:36:59,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842166344] [2025-02-08 05:36:59,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:59,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:36:59,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:59,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:36:59,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:36:59,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 318 [2025-02-08 05:36:59,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 275 transitions, 684 flow. Second operand has 8 states, 8 states have (on average 279.25) internal successors, (2234), 8 states have internal predecessors, (2234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:59,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:59,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 318 [2025-02-08 05:36:59,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:59,714 INFO L124 PetriNetUnfolderBase]: 106/1071 cut-off events. [2025-02-08 05:36:59,714 INFO L125 PetriNetUnfolderBase]: For 90/94 co-relation queries the response was YES. [2025-02-08 05:36:59,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 1071 events. 106/1071 cut-off events. For 90/94 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5170 event pairs, 25 based on Foata normal form. 0/988 useless extension candidates. Maximal degree in co-relation 1422. Up to 86 conditions per place. [2025-02-08 05:36:59,721 INFO L140 encePairwiseOnDemand]: 301/318 looper letters, 33 selfloop transitions, 13 changer transitions 28/307 dead transitions. [2025-02-08 05:36:59,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 307 transitions, 914 flow [2025-02-08 05:36:59,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 05:36:59,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 05:36:59,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3382 transitions. [2025-02-08 05:36:59,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8862683438155137 [2025-02-08 05:36:59,727 INFO L175 Difference]: Start difference. First operand has 281 places, 275 transitions, 684 flow. Second operand 12 states and 3382 transitions. [2025-02-08 05:36:59,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 307 transitions, 914 flow [2025-02-08 05:36:59,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 307 transitions, 914 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:36:59,731 INFO L231 Difference]: Finished difference. Result has 296 places, 272 transitions, 714 flow [2025-02-08 05:36:59,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=714, PETRI_PLACES=296, PETRI_TRANSITIONS=272} [2025-02-08 05:36:59,732 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, 4 predicate places. [2025-02-08 05:36:59,732 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 272 transitions, 714 flow [2025-02-08 05:36:59,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 279.25) internal successors, (2234), 8 states have internal predecessors, (2234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:59,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:59,733 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:36:59,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:36:59,734 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:36:59,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:59,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1417877267, now seen corresponding path program 1 times [2025-02-08 05:36:59,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:59,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93832444] [2025-02-08 05:36:59,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:59,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:59,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-08 05:36:59,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-08 05:36:59,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:59,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:59,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:36:59,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:59,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93832444] [2025-02-08 05:36:59,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93832444] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:59,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:59,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:36:59,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430136546] [2025-02-08 05:36:59,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:59,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:36:59,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:59,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:36:59,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:37:00,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 318 [2025-02-08 05:37:00,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 272 transitions, 714 flow. Second operand has 8 states, 8 states have (on average 279.25) internal successors, (2234), 8 states have internal predecessors, (2234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:00,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:00,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 318 [2025-02-08 05:37:00,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:00,387 INFO L124 PetriNetUnfolderBase]: 72/1239 cut-off events. [2025-02-08 05:37:00,388 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2025-02-08 05:37:00,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1747 conditions, 1239 events. 72/1239 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 5489 event pairs, 14 based on Foata normal form. 2/1172 useless extension candidates. Maximal degree in co-relation 1683. Up to 57 conditions per place. [2025-02-08 05:37:00,394 INFO L140 encePairwiseOnDemand]: 301/318 looper letters, 44 selfloop transitions, 20 changer transitions 0/297 dead transitions. [2025-02-08 05:37:00,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 297 transitions, 928 flow [2025-02-08 05:37:00,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 05:37:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 05:37:00,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3374 transitions. [2025-02-08 05:37:00,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8841719077568134 [2025-02-08 05:37:00,399 INFO L175 Difference]: Start difference. First operand has 296 places, 272 transitions, 714 flow. Second operand 12 states and 3374 transitions. [2025-02-08 05:37:00,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 297 transitions, 928 flow [2025-02-08 05:37:00,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 297 transitions, 878 flow, removed 11 selfloop flow, removed 13 redundant places. [2025-02-08 05:37:00,404 INFO L231 Difference]: Finished difference. Result has 291 places, 281 transitions, 780 flow [2025-02-08 05:37:00,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=780, PETRI_PLACES=291, PETRI_TRANSITIONS=281} [2025-02-08 05:37:00,405 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -1 predicate places. [2025-02-08 05:37:00,405 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 281 transitions, 780 flow [2025-02-08 05:37:00,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 279.25) internal successors, (2234), 8 states have internal predecessors, (2234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:00,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:00,406 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:00,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:37:00,406 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:37:00,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:00,407 INFO L85 PathProgramCache]: Analyzing trace with hash 613121675, now seen corresponding path program 1 times [2025-02-08 05:37:00,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:00,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139673234] [2025-02-08 05:37:00,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:00,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:00,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-08 05:37:00,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-08 05:37:00,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:00,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:00,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:37:00,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:00,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139673234] [2025-02-08 05:37:00,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139673234] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:00,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:00,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:37:00,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250863637] [2025-02-08 05:37:00,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:00,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:37:00,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:00,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:37:00,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:37:00,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 318 [2025-02-08 05:37:00,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 281 transitions, 780 flow. Second operand has 8 states, 8 states have (on average 279.375) internal successors, (2235), 8 states have internal predecessors, (2235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:00,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:00,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 318 [2025-02-08 05:37:00,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:01,074 INFO L124 PetriNetUnfolderBase]: 102/1027 cut-off events. [2025-02-08 05:37:01,075 INFO L125 PetriNetUnfolderBase]: For 192/196 co-relation queries the response was YES. [2025-02-08 05:37:01,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1509 conditions, 1027 events. 102/1027 cut-off events. For 192/196 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4964 event pairs, 24 based on Foata normal form. 2/956 useless extension candidates. Maximal degree in co-relation 1444. Up to 65 conditions per place. [2025-02-08 05:37:01,079 INFO L140 encePairwiseOnDemand]: 301/318 looper letters, 31 selfloop transitions, 16 changer transitions 18/298 dead transitions. [2025-02-08 05:37:01,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 298 transitions, 961 flow [2025-02-08 05:37:01,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 05:37:01,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 05:37:01,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 3649 transitions. [2025-02-08 05:37:01,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8826802128688921 [2025-02-08 05:37:01,085 INFO L175 Difference]: Start difference. First operand has 291 places, 281 transitions, 780 flow. Second operand 13 states and 3649 transitions. [2025-02-08 05:37:01,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 298 transitions, 961 flow [2025-02-08 05:37:01,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 298 transitions, 959 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:01,089 INFO L231 Difference]: Finished difference. Result has 304 places, 273 transitions, 759 flow [2025-02-08 05:37:01,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=759, PETRI_PLACES=304, PETRI_TRANSITIONS=273} [2025-02-08 05:37:01,090 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, 12 predicate places. [2025-02-08 05:37:01,090 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 273 transitions, 759 flow [2025-02-08 05:37:01,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 279.375) internal successors, (2235), 8 states have internal predecessors, (2235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:01,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:01,091 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:01,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:37:01,091 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:37:01,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:01,092 INFO L85 PathProgramCache]: Analyzing trace with hash 2023364641, now seen corresponding path program 1 times [2025-02-08 05:37:01,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:01,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084295654] [2025-02-08 05:37:01,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:01,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:01,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-08 05:37:01,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-08 05:37:01,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:01,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:01,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:01,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:01,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084295654] [2025-02-08 05:37:01,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084295654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:01,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:01,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:01,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411794849] [2025-02-08 05:37:01,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:01,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:01,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:01,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:01,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:01,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 318 [2025-02-08 05:37:01,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 273 transitions, 759 flow. Second operand has 6 states, 6 states have (on average 290.8333333333333) internal successors, (1745), 6 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:01,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:01,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 318 [2025-02-08 05:37:01,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:01,777 INFO L124 PetriNetUnfolderBase]: 42/812 cut-off events. [2025-02-08 05:37:01,777 INFO L125 PetriNetUnfolderBase]: For 128/130 co-relation queries the response was YES. [2025-02-08 05:37:01,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 812 events. 42/812 cut-off events. For 128/130 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2618 event pairs, 6 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 1075. Up to 35 conditions per place. [2025-02-08 05:37:01,783 INFO L140 encePairwiseOnDemand]: 312/318 looper letters, 20 selfloop transitions, 6 changer transitions 0/277 dead transitions. [2025-02-08 05:37:01,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 277 transitions, 824 flow [2025-02-08 05:37:01,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:01,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:01,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1754 transitions. [2025-02-08 05:37:01,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9192872117400419 [2025-02-08 05:37:01,786 INFO L175 Difference]: Start difference. First operand has 304 places, 273 transitions, 759 flow. Second operand 6 states and 1754 transitions. [2025-02-08 05:37:01,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 277 transitions, 824 flow [2025-02-08 05:37:01,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 277 transitions, 768 flow, removed 6 selfloop flow, removed 16 redundant places. [2025-02-08 05:37:01,790 INFO L231 Difference]: Finished difference. Result has 284 places, 272 transitions, 713 flow [2025-02-08 05:37:01,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=713, PETRI_PLACES=284, PETRI_TRANSITIONS=272} [2025-02-08 05:37:01,790 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -8 predicate places. [2025-02-08 05:37:01,790 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 272 transitions, 713 flow [2025-02-08 05:37:01,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 290.8333333333333) internal successors, (1745), 6 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:01,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:01,791 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:01,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:37:01,791 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:37:01,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:01,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1714748697, now seen corresponding path program 1 times [2025-02-08 05:37:01,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:01,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089638667] [2025-02-08 05:37:01,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:01,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:01,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 05:37:01,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 05:37:01,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:01,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:02,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:02,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:02,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089638667] [2025-02-08 05:37:02,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089638667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:02,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:02,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:02,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660567248] [2025-02-08 05:37:02,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:02,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:02,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:02,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:02,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:02,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 318 [2025-02-08 05:37:02,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 272 transitions, 713 flow. Second operand has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:02,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 318 [2025-02-08 05:37:02,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:02,459 INFO L124 PetriNetUnfolderBase]: 79/1071 cut-off events. [2025-02-08 05:37:02,459 INFO L125 PetriNetUnfolderBase]: For 159/163 co-relation queries the response was YES. [2025-02-08 05:37:02,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1458 conditions, 1071 events. 79/1071 cut-off events. For 159/163 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4760 event pairs, 12 based on Foata normal form. 0/1009 useless extension candidates. Maximal degree in co-relation 1399. Up to 54 conditions per place. [2025-02-08 05:37:02,465 INFO L140 encePairwiseOnDemand]: 312/318 looper letters, 19 selfloop transitions, 6 changer transitions 0/275 dead transitions. [2025-02-08 05:37:02,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 275 transitions, 773 flow [2025-02-08 05:37:02,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:02,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1753 transitions. [2025-02-08 05:37:02,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9187631027253669 [2025-02-08 05:37:02,472 INFO L175 Difference]: Start difference. First operand has 284 places, 272 transitions, 713 flow. Second operand 6 states and 1753 transitions. [2025-02-08 05:37:02,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 275 transitions, 773 flow [2025-02-08 05:37:02,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 275 transitions, 761 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:02,477 INFO L231 Difference]: Finished difference. Result has 283 places, 271 transitions, 711 flow [2025-02-08 05:37:02,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=711, PETRI_PLACES=283, PETRI_TRANSITIONS=271} [2025-02-08 05:37:02,481 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -9 predicate places. [2025-02-08 05:37:02,481 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 271 transitions, 711 flow [2025-02-08 05:37:02,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:02,482 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:02,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:37:02,482 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:37:02,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:02,483 INFO L85 PathProgramCache]: Analyzing trace with hash -484678874, now seen corresponding path program 1 times [2025-02-08 05:37:02,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:02,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949854988] [2025-02-08 05:37:02,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:02,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:02,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-08 05:37:02,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-08 05:37:02,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:02,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:03,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:03,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:03,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949854988] [2025-02-08 05:37:03,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949854988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:03,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:03,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:03,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238771512] [2025-02-08 05:37:03,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:03,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:03,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:03,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:03,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:03,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 318 [2025-02-08 05:37:03,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 271 transitions, 711 flow. Second operand has 6 states, 6 states have (on average 290.8333333333333) internal successors, (1745), 6 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:03,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:03,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 318 [2025-02-08 05:37:03,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:03,322 INFO L124 PetriNetUnfolderBase]: 39/787 cut-off events. [2025-02-08 05:37:03,323 INFO L125 PetriNetUnfolderBase]: For 90/92 co-relation queries the response was YES. [2025-02-08 05:37:03,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1088 conditions, 787 events. 39/787 cut-off events. For 90/92 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2502 event pairs, 6 based on Foata normal form. 0/755 useless extension candidates. Maximal degree in co-relation 1029. Up to 35 conditions per place. [2025-02-08 05:37:03,327 INFO L140 encePairwiseOnDemand]: 312/318 looper letters, 20 selfloop transitions, 6 changer transitions 0/275 dead transitions. [2025-02-08 05:37:03,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 275 transitions, 776 flow [2025-02-08 05:37:03,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:03,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:03,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1754 transitions. [2025-02-08 05:37:03,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9192872117400419 [2025-02-08 05:37:03,329 INFO L175 Difference]: Start difference. First operand has 283 places, 271 transitions, 711 flow. Second operand 6 states and 1754 transitions. [2025-02-08 05:37:03,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 275 transitions, 776 flow [2025-02-08 05:37:03,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 275 transitions, 764 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:03,332 INFO L231 Difference]: Finished difference. Result has 282 places, 270 transitions, 709 flow [2025-02-08 05:37:03,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=709, PETRI_PLACES=282, PETRI_TRANSITIONS=270} [2025-02-08 05:37:03,333 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -10 predicate places. [2025-02-08 05:37:03,333 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 270 transitions, 709 flow [2025-02-08 05:37:03,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 290.8333333333333) internal successors, (1745), 6 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:03,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:03,334 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:03,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:37:03,334 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:37:03,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:03,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1080929278, now seen corresponding path program 1 times [2025-02-08 05:37:03,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:03,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454001726] [2025-02-08 05:37:03,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:03,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:03,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-08 05:37:03,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-08 05:37:03,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:03,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:03,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:03,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:03,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454001726] [2025-02-08 05:37:03,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454001726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:03,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:03,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:03,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544720889] [2025-02-08 05:37:03,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:03,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:03,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:03,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:03,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:03,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 318 [2025-02-08 05:37:03,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 270 transitions, 709 flow. Second operand has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:03,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:03,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 318 [2025-02-08 05:37:03,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:03,913 INFO L124 PetriNetUnfolderBase]: 79/971 cut-off events. [2025-02-08 05:37:03,913 INFO L125 PetriNetUnfolderBase]: For 159/163 co-relation queries the response was YES. [2025-02-08 05:37:03,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1372 conditions, 971 events. 79/971 cut-off events. For 159/163 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4549 event pairs, 12 based on Foata normal form. 0/929 useless extension candidates. Maximal degree in co-relation 1313. Up to 54 conditions per place. [2025-02-08 05:37:03,919 INFO L140 encePairwiseOnDemand]: 312/318 looper letters, 19 selfloop transitions, 6 changer transitions 0/273 dead transitions. [2025-02-08 05:37:03,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 273 transitions, 769 flow [2025-02-08 05:37:03,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:03,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:03,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1753 transitions. [2025-02-08 05:37:03,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9187631027253669 [2025-02-08 05:37:03,922 INFO L175 Difference]: Start difference. First operand has 282 places, 270 transitions, 709 flow. Second operand 6 states and 1753 transitions. [2025-02-08 05:37:03,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 273 transitions, 769 flow [2025-02-08 05:37:03,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 273 transitions, 757 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:03,926 INFO L231 Difference]: Finished difference. Result has 281 places, 269 transitions, 707 flow [2025-02-08 05:37:03,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=707, PETRI_PLACES=281, PETRI_TRANSITIONS=269} [2025-02-08 05:37:03,927 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -11 predicate places. [2025-02-08 05:37:03,927 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 269 transitions, 707 flow [2025-02-08 05:37:03,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:03,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:03,927 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:03,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:37:03,928 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:37:03,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:03,928 INFO L85 PathProgramCache]: Analyzing trace with hash -537301362, now seen corresponding path program 1 times [2025-02-08 05:37:03,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:03,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623904320] [2025-02-08 05:37:03,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:03,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:03,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-08 05:37:03,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-08 05:37:03,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:03,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:03,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:03,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:03,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623904320] [2025-02-08 05:37:03,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623904320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:03,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:03,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:03,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924572276] [2025-02-08 05:37:03,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:03,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:03,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:03,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:03,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:03,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 318 [2025-02-08 05:37:03,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 269 transitions, 707 flow. Second operand has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:03,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:03,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 318 [2025-02-08 05:37:03,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:04,073 INFO L124 PetriNetUnfolderBase]: 46/820 cut-off events. [2025-02-08 05:37:04,073 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-02-08 05:37:04,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1132 conditions, 820 events. 46/820 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2615 event pairs, 17 based on Foata normal form. 0/798 useless extension candidates. Maximal degree in co-relation 1075. Up to 64 conditions per place. [2025-02-08 05:37:04,079 INFO L140 encePairwiseOnDemand]: 315/318 looper letters, 11 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2025-02-08 05:37:04,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 269 transitions, 734 flow [2025-02-08 05:37:04,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:04,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:04,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 899 transitions. [2025-02-08 05:37:04,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423480083857443 [2025-02-08 05:37:04,080 INFO L175 Difference]: Start difference. First operand has 281 places, 269 transitions, 707 flow. Second operand 3 states and 899 transitions. [2025-02-08 05:37:04,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 269 transitions, 734 flow [2025-02-08 05:37:04,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 269 transitions, 722 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:04,084 INFO L231 Difference]: Finished difference. Result has 277 places, 268 transitions, 697 flow [2025-02-08 05:37:04,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=277, PETRI_TRANSITIONS=268} [2025-02-08 05:37:04,085 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -15 predicate places. [2025-02-08 05:37:04,085 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 268 transitions, 697 flow [2025-02-08 05:37:04,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:04,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:04,085 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:04,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:37:04,086 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-08 05:37:04,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:04,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1161968826, now seen corresponding path program 1 times [2025-02-08 05:37:04,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:04,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634384023] [2025-02-08 05:37:04,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:04,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:04,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-08 05:37:04,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-08 05:37:04,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:04,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:04,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:37:04,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:04,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634384023] [2025-02-08 05:37:04,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634384023] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:04,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:04,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:04,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376935903] [2025-02-08 05:37:04,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:04,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:04,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:04,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:04,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:04,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 318 [2025-02-08 05:37:04,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 268 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:04,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:04,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 318 [2025-02-08 05:37:04,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:04,229 INFO L124 PetriNetUnfolderBase]: 89/968 cut-off events. [2025-02-08 05:37:04,229 INFO L125 PetriNetUnfolderBase]: For 135/138 co-relation queries the response was YES. [2025-02-08 05:37:04,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 968 events. 89/968 cut-off events. For 135/138 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4215 event pairs, 33 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1272. Up to 102 conditions per place. [2025-02-08 05:37:04,233 INFO L140 encePairwiseOnDemand]: 315/318 looper letters, 0 selfloop transitions, 0 changer transitions 268/268 dead transitions. [2025-02-08 05:37:04,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 268 transitions, 724 flow [2025-02-08 05:37:04,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:04,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:04,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 899 transitions. [2025-02-08 05:37:04,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423480083857443 [2025-02-08 05:37:04,235 INFO L175 Difference]: Start difference. First operand has 277 places, 268 transitions, 697 flow. Second operand 3 states and 899 transitions. [2025-02-08 05:37:04,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 268 transitions, 724 flow [2025-02-08 05:37:04,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 268 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:04,238 INFO L231 Difference]: Finished difference. Result has 276 places, 0 transitions, 0 flow [2025-02-08 05:37:04,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=276, PETRI_TRANSITIONS=0} [2025-02-08 05:37:04,238 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -16 predicate places. [2025-02-08 05:37:04,238 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 0 transitions, 0 flow [2025-02-08 05:37:04,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:04,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (59 of 60 remaining) [2025-02-08 05:37:04,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (58 of 60 remaining) [2025-02-08 05:37:04,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (57 of 60 remaining) [2025-02-08 05:37:04,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (56 of 60 remaining) [2025-02-08 05:37:04,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (55 of 60 remaining) [2025-02-08 05:37:04,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (54 of 60 remaining) [2025-02-08 05:37:04,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (53 of 60 remaining) [2025-02-08 05:37:04,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (52 of 60 remaining) [2025-02-08 05:37:04,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (51 of 60 remaining) [2025-02-08 05:37:04,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (50 of 60 remaining) [2025-02-08 05:37:04,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (49 of 60 remaining) [2025-02-08 05:37:04,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (48 of 60 remaining) [2025-02-08 05:37:04,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (47 of 60 remaining) [2025-02-08 05:37:04,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (46 of 60 remaining) [2025-02-08 05:37:04,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (45 of 60 remaining) [2025-02-08 05:37:04,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (44 of 60 remaining) [2025-02-08 05:37:04,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (43 of 60 remaining) [2025-02-08 05:37:04,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (42 of 60 remaining) [2025-02-08 05:37:04,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (41 of 60 remaining) [2025-02-08 05:37:04,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (40 of 60 remaining) [2025-02-08 05:37:04,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (39 of 60 remaining) [2025-02-08 05:37:04,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (38 of 60 remaining) [2025-02-08 05:37:04,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (37 of 60 remaining) [2025-02-08 05:37:04,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (36 of 60 remaining) [2025-02-08 05:37:04,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (35 of 60 remaining) [2025-02-08 05:37:04,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (34 of 60 remaining) [2025-02-08 05:37:04,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (33 of 60 remaining) [2025-02-08 05:37:04,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (32 of 60 remaining) [2025-02-08 05:37:04,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (31 of 60 remaining) [2025-02-08 05:37:04,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (30 of 60 remaining) [2025-02-08 05:37:04,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (29 of 60 remaining) [2025-02-08 05:37:04,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (28 of 60 remaining) [2025-02-08 05:37:04,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (27 of 60 remaining) [2025-02-08 05:37:04,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (26 of 60 remaining) [2025-02-08 05:37:04,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 60 remaining) [2025-02-08 05:37:04,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 60 remaining) [2025-02-08 05:37:04,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (23 of 60 remaining) [2025-02-08 05:37:04,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (22 of 60 remaining) [2025-02-08 05:37:04,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (21 of 60 remaining) [2025-02-08 05:37:04,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (20 of 60 remaining) [2025-02-08 05:37:04,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (19 of 60 remaining) [2025-02-08 05:37:04,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (18 of 60 remaining) [2025-02-08 05:37:04,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (17 of 60 remaining) [2025-02-08 05:37:04,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (16 of 60 remaining) [2025-02-08 05:37:04,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (15 of 60 remaining) [2025-02-08 05:37:04,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (14 of 60 remaining) [2025-02-08 05:37:04,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (13 of 60 remaining) [2025-02-08 05:37:04,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (12 of 60 remaining) [2025-02-08 05:37:04,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (11 of 60 remaining) [2025-02-08 05:37:04,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (10 of 60 remaining) [2025-02-08 05:37:04,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 60 remaining) [2025-02-08 05:37:04,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 60 remaining) [2025-02-08 05:37:04,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 60 remaining) [2025-02-08 05:37:04,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (6 of 60 remaining) [2025-02-08 05:37:04,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 60 remaining) [2025-02-08 05:37:04,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 60 remaining) [2025-02-08 05:37:04,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 60 remaining) [2025-02-08 05:37:04,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 60 remaining) [2025-02-08 05:37:04,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 60 remaining) [2025-02-08 05:37:04,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (0 of 60 remaining) [2025-02-08 05:37:04,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:37:04,245 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:04,249 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:37:04,249 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:37:04,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:37:04 BasicIcfg [2025-02-08 05:37:04,253 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:37:04,253 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:37:04,253 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:37:04,254 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:37:04,254 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:36:55" (3/4) ... [2025-02-08 05:37:04,255 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:37:04,258 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:37:04,259 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:37:04,262 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-02-08 05:37:04,263 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:37:04,263 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:37:04,263 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:37:04,347 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:37:04,347 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:37:04,347 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:37:04,347 INFO L158 Benchmark]: Toolchain (without parser) took 9740.16ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 109.2MB in the beginning and 184.9MB in the end (delta: -75.7MB). Peak memory consumption was 248.6MB. Max. memory is 16.1GB. [2025-02-08 05:37:04,348 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:04,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.00ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 97.0MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:37:04,348 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.96ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 95.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:04,348 INFO L158 Benchmark]: Boogie Preprocessor took 36.27ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 94.4MB in the end (delta: 890.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:04,348 INFO L158 Benchmark]: IcfgBuilder took 546.11ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 67.4MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 05:37:04,348 INFO L158 Benchmark]: TraceAbstraction took 8812.43ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 67.4MB in the beginning and 189.1MB in the end (delta: -121.7MB). Peak memory consumption was 206.6MB. Max. memory is 16.1GB. [2025-02-08 05:37:04,348 INFO L158 Benchmark]: Witness Printer took 93.54ms. Allocated memory is still 469.8MB. Free memory was 189.1MB in the beginning and 184.9MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:04,353 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.19ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.00ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 97.0MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.96ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 95.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.27ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 94.4MB in the end (delta: 890.8kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 546.11ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 67.4MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8812.43ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 67.4MB in the beginning and 189.1MB in the end (delta: -121.7MB). Peak memory consumption was 206.6MB. Max. memory is 16.1GB. * Witness Printer took 93.54ms. Allocated memory is still 469.8MB. Free memory was 189.1MB in the beginning and 184.9MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: 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: 96]: 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: 96]: 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: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: 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 5 procedures, 434 locations, 60 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: 8.7s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2641 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1739 mSDsluCounter, 1891 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1677 mSDsCounter, 343 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4183 IncrementalHoareTripleChecker+Invalid, 4526 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 343 mSolverCounterUnsat, 214 mSDtfsCounter, 4183 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=780occurred in iteration=16, InterpolantAutomatonStates: 122, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2662 NumberOfCodeBlocks, 2662 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2639 ConstructedInterpolants, 0 QuantifiedInterpolants, 5200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 15/15 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 34 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:37:04,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE