./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/unroll-cond-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/unroll-cond-3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9fb4c28a8a216c266c6ae14d377c8e26c68bb16bf7c2fe2809f039d12d6c4b55 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:26:44,301 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:26:44,346 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:26:44,352 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:26:44,353 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:26:44,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:26:44,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:26:44,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:26:44,370 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:26:44,370 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:26:44,371 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:26:44,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:26:44,371 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:26:44,371 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:26:44,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:26:44,372 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:26:44,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:26:44,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:26:44,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:26:44,372 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:26:44,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:26:44,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:26:44,372 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:26:44,372 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:26:44,373 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:26:44,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:26:44,373 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:26:44,373 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:26:44,373 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:26:44,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:26:44,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:26:44,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:26:44,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:26:44,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:26:44,374 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:26:44,374 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:26:44,374 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:26:44,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:26:44,374 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:26:44,374 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:26:44,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:26:44,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:26:44,374 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9fb4c28a8a216c266c6ae14d377c8e26c68bb16bf7c2fe2809f039d12d6c4b55 [2025-03-13 22:26:44,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:26:44,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:26:44,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:26:44,606 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:26:44,606 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:26:44,608 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-cond-3.wvr.c [2025-03-13 22:26:45,737 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2801c2484/5d83e9a066eb43098d7e96cef7c8ac63/FLAG89c78ea1d [2025-03-13 22:26:45,971 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:26:45,972 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-3.wvr.c [2025-03-13 22:26:45,979 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2801c2484/5d83e9a066eb43098d7e96cef7c8ac63/FLAG89c78ea1d [2025-03-13 22:26:46,301 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2801c2484/5d83e9a066eb43098d7e96cef7c8ac63 [2025-03-13 22:26:46,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:26:46,304 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:26:46,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:26:46,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:26:46,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:26:46,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:26:46" (1/1) ... [2025-03-13 22:26:46,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25bc82d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:46, skipping insertion in model container [2025-03-13 22:26:46,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:26:46" (1/1) ... [2025-03-13 22:26:46,328 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:26:46,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:26:46,463 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:26:46,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:26:46,506 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:26:46,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:46 WrapperNode [2025-03-13 22:26:46,507 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:26:46,508 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:26:46,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:26:46,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:26:46,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:46" (1/1) ... [2025-03-13 22:26:46,524 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:46" (1/1) ... [2025-03-13 22:26:46,544 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 325 [2025-03-13 22:26:46,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:26:46,550 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:26:46,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:26:46,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:26:46,557 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:46" (1/1) ... [2025-03-13 22:26:46,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:46" (1/1) ... [2025-03-13 22:26:46,561 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:46" (1/1) ... [2025-03-13 22:26:46,561 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:46" (1/1) ... [2025-03-13 22:26:46,572 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:46" (1/1) ... [2025-03-13 22:26:46,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:46" (1/1) ... [2025-03-13 22:26:46,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:46" (1/1) ... [2025-03-13 22:26:46,576 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:46" (1/1) ... [2025-03-13 22:26:46,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:26:46,584 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:26:46,584 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:26:46,584 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:26:46,585 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:46" (1/1) ... [2025-03-13 22:26:46,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:26:46,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:26:46,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:26:46,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:26:46,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:26:46,631 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 22:26:46,631 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 22:26:46,631 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 22:26:46,631 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 22:26:46,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:26:46,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:26:46,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:26:46,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:26:46,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:26:46,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:26:46,633 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:26:46,717 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:26:46,719 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:26:47,189 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:26:47,190 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:26:47,190 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:26:47,206 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:26:47,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:26:47 BoogieIcfgContainer [2025-03-13 22:26:47,209 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:26:47,211 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:26:47,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:26:47,213 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:26:47,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:26:46" (1/3) ... [2025-03-13 22:26:47,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37cb5b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:26:47, skipping insertion in model container [2025-03-13 22:26:47,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:46" (2/3) ... [2025-03-13 22:26:47,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37cb5b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:26:47, skipping insertion in model container [2025-03-13 22:26:47,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:26:47" (3/3) ... [2025-03-13 22:26:47,216 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-3.wvr.c [2025-03-13 22:26:47,225 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:26:47,226 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-3.wvr.c that has 3 procedures, 415 locations, 1 initial locations, 3 loop locations, and 54 error locations. [2025-03-13 22:26:47,226 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:26:47,335 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 22:26:47,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 421 places, 437 transitions, 888 flow [2025-03-13 22:26:47,462 INFO L124 PetriNetUnfolderBase]: 23/435 cut-off events. [2025-03-13 22:26:47,463 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:26:47,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 435 events. 23/435 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1114 event pairs, 0 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 310. Up to 2 conditions per place. [2025-03-13 22:26:47,470 INFO L82 GeneralOperation]: Start removeDead. Operand has 421 places, 437 transitions, 888 flow [2025-03-13 22:26:47,478 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 403 places, 418 transitions, 848 flow [2025-03-13 22:26:47,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:26:47,498 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;@77a353a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:26:47,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 102 error locations. [2025-03-13 22:26:47,502 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:26:47,502 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-13 22:26:47,502 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:26:47,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:47,503 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] [2025-03-13 22:26:47,503 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-13 22:26:47,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:47,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1621702478, now seen corresponding path program 1 times [2025-03-13 22:26:47,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:47,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403108855] [2025-03-13 22:26:47,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:47,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:47,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 22:26:47,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 22:26:47,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:47,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:47,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:47,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:47,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403108855] [2025-03-13 22:26:47,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403108855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:47,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:47,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:47,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456543927] [2025-03-13 22:26:47,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:47,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:47,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:47,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:47,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:47,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 437 [2025-03-13 22:26:47,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 418 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:47,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:47,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 437 [2025-03-13 22:26:47,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:47,782 INFO L124 PetriNetUnfolderBase]: 26/624 cut-off events. [2025-03-13 22:26:47,783 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 22:26:47,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 624 events. 26/624 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2632 event pairs, 7 based on Foata normal form. 13/520 useless extension candidates. Maximal degree in co-relation 533. Up to 30 conditions per place. [2025-03-13 22:26:47,790 INFO L140 encePairwiseOnDemand]: 423/437 looper letters, 11 selfloop transitions, 2 changer transitions 3/406 dead transitions. [2025-03-13 22:26:47,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 406 transitions, 850 flow [2025-03-13 22:26:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:47,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:47,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1252 transitions. [2025-03-13 22:26:47,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9549961861174676 [2025-03-13 22:26:47,804 INFO L175 Difference]: Start difference. First operand has 403 places, 418 transitions, 848 flow. Second operand 3 states and 1252 transitions. [2025-03-13 22:26:47,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 406 transitions, 850 flow [2025-03-13 22:26:47,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 406 transitions, 842 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 22:26:47,817 INFO L231 Difference]: Finished difference. Result has 400 places, 403 transitions, 814 flow [2025-03-13 22:26:47,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=814, PETRI_PLACES=400, PETRI_TRANSITIONS=403} [2025-03-13 22:26:47,822 INFO L279 CegarLoopForPetriNet]: 403 programPoint places, -3 predicate places. [2025-03-13 22:26:47,822 INFO L471 AbstractCegarLoop]: Abstraction has has 400 places, 403 transitions, 814 flow [2025-03-13 22:26:47,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:47,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:47,823 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] [2025-03-13 22:26:47,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:26:47,824 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-13 22:26:47,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:47,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1705913954, now seen corresponding path program 1 times [2025-03-13 22:26:47,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:47,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233648672] [2025-03-13 22:26:47,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:47,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:47,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 22:26:47,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 22:26:47,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:47,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:47,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-03-13 22:26:47,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:47,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233648672] [2025-03-13 22:26:47,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233648672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:47,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:47,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:47,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535866293] [2025-03-13 22:26:47,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:47,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:47,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:47,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:47,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:47,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 437 [2025-03-13 22:26:47,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 403 transitions, 814 flow. Second operand has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:47,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:47,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 437 [2025-03-13 22:26:47,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:47,996 INFO L124 PetriNetUnfolderBase]: 30/660 cut-off events. [2025-03-13 22:26:47,996 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-03-13 22:26:47,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 660 events. 30/660 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2643 event pairs, 11 based on Foata normal form. 0/535 useless extension candidates. Maximal degree in co-relation 679. Up to 38 conditions per place. [2025-03-13 22:26:48,002 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 15 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2025-03-13 22:26:48,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 402 transitions, 846 flow [2025-03-13 22:26:48,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:48,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:48,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1233 transitions. [2025-03-13 22:26:48,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9405034324942791 [2025-03-13 22:26:48,004 INFO L175 Difference]: Start difference. First operand has 400 places, 403 transitions, 814 flow. Second operand 3 states and 1233 transitions. [2025-03-13 22:26:48,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 402 transitions, 846 flow [2025-03-13 22:26:48,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 402 transitions, 842 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:48,011 INFO L231 Difference]: Finished difference. Result has 396 places, 402 transitions, 812 flow [2025-03-13 22:26:48,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=396, PETRI_TRANSITIONS=402} [2025-03-13 22:26:48,012 INFO L279 CegarLoopForPetriNet]: 403 programPoint places, -7 predicate places. [2025-03-13 22:26:48,012 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 402 transitions, 812 flow [2025-03-13 22:26:48,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:48,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:48,013 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] [2025-03-13 22:26:48,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:26:48,013 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-13 22:26:48,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:48,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1835825056, now seen corresponding path program 1 times [2025-03-13 22:26:48,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:48,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979509740] [2025-03-13 22:26:48,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:48,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:48,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-13 22:26:48,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-13 22:26:48,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:48,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:48,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:48,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:48,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979509740] [2025-03-13 22:26:48,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979509740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:48,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:48,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:48,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083765789] [2025-03-13 22:26:48,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:48,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:48,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:48,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:48,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:48,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 437 [2025-03-13 22:26:48,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 402 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:48,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:48,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 437 [2025-03-13 22:26:48,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:48,290 INFO L124 PetriNetUnfolderBase]: 104/1449 cut-off events. [2025-03-13 22:26:48,290 INFO L125 PetriNetUnfolderBase]: For 25/26 co-relation queries the response was YES. [2025-03-13 22:26:48,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1576 conditions, 1449 events. 104/1449 cut-off events. For 25/26 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 8418 event pairs, 32 based on Foata normal form. 0/1170 useless extension candidates. Maximal degree in co-relation 1540. Up to 117 conditions per place. [2025-03-13 22:26:48,302 INFO L140 encePairwiseOnDemand]: 428/437 looper letters, 20 selfloop transitions, 1 changer transitions 0/394 dead transitions. [2025-03-13 22:26:48,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 394 transitions, 838 flow [2025-03-13 22:26:48,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:48,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:48,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1214 transitions. [2025-03-13 22:26:48,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9260106788710908 [2025-03-13 22:26:48,305 INFO L175 Difference]: Start difference. First operand has 396 places, 402 transitions, 812 flow. Second operand 3 states and 1214 transitions. [2025-03-13 22:26:48,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 394 transitions, 838 flow [2025-03-13 22:26:48,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 394 transitions, 834 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:48,310 INFO L231 Difference]: Finished difference. Result has 388 places, 394 transitions, 794 flow [2025-03-13 22:26:48,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=388, PETRI_TRANSITIONS=394} [2025-03-13 22:26:48,311 INFO L279 CegarLoopForPetriNet]: 403 programPoint places, -15 predicate places. [2025-03-13 22:26:48,311 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 394 transitions, 794 flow [2025-03-13 22:26:48,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:48,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:48,312 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] [2025-03-13 22:26:48,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:26:48,312 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-13 22:26:48,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:48,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1428639900, now seen corresponding path program 1 times [2025-03-13 22:26:48,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:48,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71183544] [2025-03-13 22:26:48,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:48,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:48,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-13 22:26:48,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-13 22:26:48,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:48,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:48,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:48,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:48,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71183544] [2025-03-13 22:26:48,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71183544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:48,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:48,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:48,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211638367] [2025-03-13 22:26:48,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:48,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:48,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:48,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:48,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:48,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 437 [2025-03-13 22:26:48,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 394 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:48,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:48,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 437 [2025-03-13 22:26:48,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:48,499 INFO L124 PetriNetUnfolderBase]: 30/646 cut-off events. [2025-03-13 22:26:48,500 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-03-13 22:26:48,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 646 events. 30/646 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2547 event pairs, 11 based on Foata normal form. 0/535 useless extension candidates. Maximal degree in co-relation 654. Up to 36 conditions per place. [2025-03-13 22:26:48,504 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 13 selfloop transitions, 2 changer transitions 0/393 dead transitions. [2025-03-13 22:26:48,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 393 transitions, 822 flow [2025-03-13 22:26:48,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:48,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:48,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1237 transitions. [2025-03-13 22:26:48,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9435545385202135 [2025-03-13 22:26:48,506 INFO L175 Difference]: Start difference. First operand has 388 places, 394 transitions, 794 flow. Second operand 3 states and 1237 transitions. [2025-03-13 22:26:48,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 393 transitions, 822 flow [2025-03-13 22:26:48,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 393 transitions, 821 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:26:48,511 INFO L231 Difference]: Finished difference. Result has 388 places, 393 transitions, 795 flow [2025-03-13 22:26:48,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=795, PETRI_PLACES=388, PETRI_TRANSITIONS=393} [2025-03-13 22:26:48,512 INFO L279 CegarLoopForPetriNet]: 403 programPoint places, -15 predicate places. [2025-03-13 22:26:48,512 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 393 transitions, 795 flow [2025-03-13 22:26:48,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:48,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:48,513 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] [2025-03-13 22:26:48,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:26:48,513 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-13 22:26:48,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:48,513 INFO L85 PathProgramCache]: Analyzing trace with hash 19666844, now seen corresponding path program 1 times [2025-03-13 22:26:48,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:48,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148488061] [2025-03-13 22:26:48,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:48,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:48,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-13 22:26:48,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-13 22:26:48,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:48,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:48,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:48,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:48,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148488061] [2025-03-13 22:26:48,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148488061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:48,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:48,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:26:48,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522015764] [2025-03-13 22:26:48,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:48,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:26:48,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:48,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:26:48,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:26:49,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 437 [2025-03-13 22:26:49,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 393 transitions, 795 flow. Second operand has 6 states, 6 states have (on average 383.5) internal successors, (2301), 6 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:49,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:49,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 437 [2025-03-13 22:26:49,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:49,341 INFO L124 PetriNetUnfolderBase]: 210/1903 cut-off events. [2025-03-13 22:26:49,341 INFO L125 PetriNetUnfolderBase]: For 44/45 co-relation queries the response was YES. [2025-03-13 22:26:49,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2219 conditions, 1903 events. 210/1903 cut-off events. For 44/45 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 11918 event pairs, 104 based on Foata normal form. 0/1544 useless extension candidates. Maximal degree in co-relation 2184. Up to 300 conditions per place. [2025-03-13 22:26:49,351 INFO L140 encePairwiseOnDemand]: 431/437 looper letters, 36 selfloop transitions, 5 changer transitions 0/392 dead transitions. [2025-03-13 22:26:49,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 392 transitions, 875 flow [2025-03-13 22:26:49,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:26:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:26:49,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2334 transitions. [2025-03-13 22:26:49,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8901601830663616 [2025-03-13 22:26:49,355 INFO L175 Difference]: Start difference. First operand has 388 places, 393 transitions, 795 flow. Second operand 6 states and 2334 transitions. [2025-03-13 22:26:49,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 392 transitions, 875 flow [2025-03-13 22:26:49,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 392 transitions, 871 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:49,359 INFO L231 Difference]: Finished difference. Result has 390 places, 392 transitions, 799 flow [2025-03-13 22:26:49,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=799, PETRI_PLACES=390, PETRI_TRANSITIONS=392} [2025-03-13 22:26:49,360 INFO L279 CegarLoopForPetriNet]: 403 programPoint places, -13 predicate places. [2025-03-13 22:26:49,360 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 392 transitions, 799 flow [2025-03-13 22:26:49,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 383.5) internal successors, (2301), 6 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:49,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:49,362 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] [2025-03-13 22:26:49,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:26:49,362 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-13 22:26:49,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:49,362 INFO L85 PathProgramCache]: Analyzing trace with hash 809879519, now seen corresponding path program 1 times [2025-03-13 22:26:49,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:49,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752763391] [2025-03-13 22:26:49,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:49,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:49,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-13 22:26:49,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-13 22:26:49,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:49,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:49,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:49,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:49,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752763391] [2025-03-13 22:26:49,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752763391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:49,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:49,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:49,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287211814] [2025-03-13 22:26:49,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:49,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:49,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:49,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:49,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:49,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 437 [2025-03-13 22:26:49,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 392 transitions, 799 flow. Second operand has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:49,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:49,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 437 [2025-03-13 22:26:49,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:49,490 INFO L124 PetriNetUnfolderBase]: 64/1203 cut-off events. [2025-03-13 22:26:49,490 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-13 22:26:49,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 1203 events. 64/1203 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6890 event pairs, 12 based on Foata normal form. 0/995 useless extension candidates. Maximal degree in co-relation 1263. Up to 62 conditions per place. [2025-03-13 22:26:49,495 INFO L140 encePairwiseOnDemand]: 431/437 looper letters, 14 selfloop transitions, 2 changer transitions 0/391 dead transitions. [2025-03-13 22:26:49,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 391 transitions, 830 flow [2025-03-13 22:26:49,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:49,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:49,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1241 transitions. [2025-03-13 22:26:49,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9466056445461479 [2025-03-13 22:26:49,498 INFO L175 Difference]: Start difference. First operand has 390 places, 392 transitions, 799 flow. Second operand 3 states and 1241 transitions. [2025-03-13 22:26:49,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 391 transitions, 830 flow [2025-03-13 22:26:49,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 391 transitions, 820 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:26:49,504 INFO L231 Difference]: Finished difference. Result has 384 places, 390 transitions, 795 flow [2025-03-13 22:26:49,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=795, PETRI_PLACES=384, PETRI_TRANSITIONS=390} [2025-03-13 22:26:49,505 INFO L279 CegarLoopForPetriNet]: 403 programPoint places, -19 predicate places. [2025-03-13 22:26:49,505 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 390 transitions, 795 flow [2025-03-13 22:26:49,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:49,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:49,506 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] [2025-03-13 22:26:49,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:26:49,506 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-13 22:26:49,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:49,507 INFO L85 PathProgramCache]: Analyzing trace with hash -2004675245, now seen corresponding path program 1 times [2025-03-13 22:26:49,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:49,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80946528] [2025-03-13 22:26:49,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:49,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:49,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-13 22:26:49,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-13 22:26:49,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:49,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:49,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:49,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:49,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80946528] [2025-03-13 22:26:49,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80946528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:49,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:49,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:49,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397481382] [2025-03-13 22:26:49,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:49,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:49,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:49,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:49,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:49,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 437 [2025-03-13 22:26:49,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 390 transitions, 795 flow. Second operand has 3 states, 3 states have (on average 408.0) internal successors, (1224), 3 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:49,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:49,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 437 [2025-03-13 22:26:49,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:49,626 INFO L124 PetriNetUnfolderBase]: 32/674 cut-off events. [2025-03-13 22:26:49,626 INFO L125 PetriNetUnfolderBase]: For 3/8 co-relation queries the response was YES. [2025-03-13 22:26:49,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 674 events. 32/674 cut-off events. For 3/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2695 event pairs, 1 based on Foata normal form. 1/575 useless extension candidates. Maximal degree in co-relation 693. Up to 21 conditions per place. [2025-03-13 22:26:49,629 INFO L140 encePairwiseOnDemand]: 430/437 looper letters, 11 selfloop transitions, 3 changer transitions 0/387 dead transitions. [2025-03-13 22:26:49,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 387 transitions, 818 flow [2025-03-13 22:26:49,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:49,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:49,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1239 transitions. [2025-03-13 22:26:49,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9450800915331807 [2025-03-13 22:26:49,632 INFO L175 Difference]: Start difference. First operand has 384 places, 390 transitions, 795 flow. Second operand 3 states and 1239 transitions. [2025-03-13 22:26:49,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 387 transitions, 818 flow [2025-03-13 22:26:49,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 387 transitions, 818 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:49,637 INFO L231 Difference]: Finished difference. Result has 382 places, 386 transitions, 793 flow [2025-03-13 22:26:49,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=793, PETRI_PLACES=382, PETRI_TRANSITIONS=386} [2025-03-13 22:26:49,638 INFO L279 CegarLoopForPetriNet]: 403 programPoint places, -21 predicate places. [2025-03-13 22:26:49,639 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 386 transitions, 793 flow [2025-03-13 22:26:49,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 408.0) internal successors, (1224), 3 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:49,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:49,640 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] [2025-03-13 22:26:49,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:26:49,640 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err36ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-13 22:26:49,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:49,642 INFO L85 PathProgramCache]: Analyzing trace with hash -45154111, now seen corresponding path program 1 times [2025-03-13 22:26:49,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:49,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760414607] [2025-03-13 22:26:49,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:49,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:49,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-13 22:26:49,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-13 22:26:49,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:49,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:49,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:49,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:49,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760414607] [2025-03-13 22:26:49,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760414607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:49,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:49,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:49,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279705748] [2025-03-13 22:26:49,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:49,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:49,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:49,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:49,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:49,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 437 [2025-03-13 22:26:49,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 386 transitions, 793 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:49,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:49,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 437 [2025-03-13 22:26:49,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:49,801 INFO L124 PetriNetUnfolderBase]: 61/787 cut-off events. [2025-03-13 22:26:49,801 INFO L125 PetriNetUnfolderBase]: For 37/38 co-relation queries the response was YES. [2025-03-13 22:26:49,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 952 conditions, 787 events. 61/787 cut-off events. For 37/38 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3753 event pairs, 5 based on Foata normal form. 1/702 useless extension candidates. Maximal degree in co-relation 916. Up to 121 conditions per place. [2025-03-13 22:26:49,807 INFO L140 encePairwiseOnDemand]: 410/437 looper letters, 29 selfloop transitions, 10 changer transitions 4/371 dead transitions. [2025-03-13 22:26:49,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 371 transitions, 846 flow [2025-03-13 22:26:49,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:49,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:49,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1158 transitions. [2025-03-13 22:26:49,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8832951945080092 [2025-03-13 22:26:49,812 INFO L175 Difference]: Start difference. First operand has 382 places, 386 transitions, 793 flow. Second operand 3 states and 1158 transitions. [2025-03-13 22:26:49,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 371 transitions, 846 flow [2025-03-13 22:26:49,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 371 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:49,817 INFO L231 Difference]: Finished difference. Result has 366 places, 366 transitions, 766 flow [2025-03-13 22:26:49,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=366, PETRI_TRANSITIONS=366} [2025-03-13 22:26:49,818 INFO L279 CegarLoopForPetriNet]: 403 programPoint places, -37 predicate places. [2025-03-13 22:26:49,819 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 366 transitions, 766 flow [2025-03-13 22:26:49,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:49,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:49,819 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] [2025-03-13 22:26:49,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:26:49,820 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-13 22:26:49,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:49,820 INFO L85 PathProgramCache]: Analyzing trace with hash 134920141, now seen corresponding path program 1 times [2025-03-13 22:26:49,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:49,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662534507] [2025-03-13 22:26:49,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:49,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:49,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-13 22:26:49,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-13 22:26:49,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:49,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:49,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:49,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662534507] [2025-03-13 22:26:49,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662534507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:49,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:49,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:49,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447934813] [2025-03-13 22:26:49,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:49,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:49,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:49,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:49,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:49,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 437 [2025-03-13 22:26:49,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 366 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:49,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:49,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 437 [2025-03-13 22:26:49,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:50,010 INFO L124 PetriNetUnfolderBase]: 104/1516 cut-off events. [2025-03-13 22:26:50,011 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-13 22:26:50,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1711 conditions, 1516 events. 104/1516 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 8945 event pairs, 11 based on Foata normal form. 0/1353 useless extension candidates. Maximal degree in co-relation 1675. Up to 106 conditions per place. [2025-03-13 22:26:50,019 INFO L140 encePairwiseOnDemand]: 427/437 looper letters, 18 selfloop transitions, 4 changer transitions 0/366 dead transitions. [2025-03-13 22:26:50,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 366 transitions, 812 flow [2025-03-13 22:26:50,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:50,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:50,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1231 transitions. [2025-03-13 22:26:50,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.938977879481312 [2025-03-13 22:26:50,022 INFO L175 Difference]: Start difference. First operand has 366 places, 366 transitions, 766 flow. Second operand 3 states and 1231 transitions. [2025-03-13 22:26:50,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 366 transitions, 812 flow [2025-03-13 22:26:50,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 366 transitions, 792 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:50,028 INFO L231 Difference]: Finished difference. Result has 357 places, 364 transitions, 762 flow [2025-03-13 22:26:50,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=357, PETRI_TRANSITIONS=364} [2025-03-13 22:26:50,029 INFO L279 CegarLoopForPetriNet]: 403 programPoint places, -46 predicate places. [2025-03-13 22:26:50,029 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 364 transitions, 762 flow [2025-03-13 22:26:50,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:50,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:50,030 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] [2025-03-13 22:26:50,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:26:50,030 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-13 22:26:50,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:50,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1610375601, now seen corresponding path program 1 times [2025-03-13 22:26:50,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:50,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090350757] [2025-03-13 22:26:50,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:50,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:50,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-13 22:26:50,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-13 22:26:50,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:50,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:50,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:50,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:50,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090350757] [2025-03-13 22:26:50,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090350757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:50,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:50,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 22:26:50,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356502754] [2025-03-13 22:26:50,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:50,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 22:26:50,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:50,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 22:26:50,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 22:26:50,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 437 [2025-03-13 22:26:50,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 364 transitions, 762 flow. Second operand has 4 states, 4 states have (on average 414.25) internal successors, (1657), 4 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:50,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:50,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 437 [2025-03-13 22:26:50,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:50,292 INFO L124 PetriNetUnfolderBase]: 97/1874 cut-off events. [2025-03-13 22:26:50,293 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:26:50,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2010 conditions, 1874 events. 97/1874 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 11592 event pairs, 6 based on Foata normal form. 0/1673 useless extension candidates. Maximal degree in co-relation 1973. Up to 45 conditions per place. [2025-03-13 22:26:50,301 INFO L140 encePairwiseOnDemand]: 431/437 looper letters, 13 selfloop transitions, 6 changer transitions 0/373 dead transitions. [2025-03-13 22:26:50,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 373 transitions, 822 flow [2025-03-13 22:26:50,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:26:50,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:26:50,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2085 transitions. [2025-03-13 22:26:50,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.954233409610984 [2025-03-13 22:26:50,304 INFO L175 Difference]: Start difference. First operand has 357 places, 364 transitions, 762 flow. Second operand 5 states and 2085 transitions. [2025-03-13 22:26:50,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 373 transitions, 822 flow [2025-03-13 22:26:50,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 373 transitions, 822 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:50,309 INFO L231 Difference]: Finished difference. Result has 364 places, 368 transitions, 800 flow [2025-03-13 22:26:50,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=800, PETRI_PLACES=364, PETRI_TRANSITIONS=368} [2025-03-13 22:26:50,310 INFO L279 CegarLoopForPetriNet]: 403 programPoint places, -39 predicate places. [2025-03-13 22:26:50,310 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 368 transitions, 800 flow [2025-03-13 22:26:50,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 414.25) internal successors, (1657), 4 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:50,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:50,312 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-03-13 22:26:50,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:26:50,312 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-13 22:26:50,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:50,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1644754471, now seen corresponding path program 1 times [2025-03-13 22:26:50,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:50,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706719388] [2025-03-13 22:26:50,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:50,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:50,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-13 22:26:50,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-13 22:26:50,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:50,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:50,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:50,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:50,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706719388] [2025-03-13 22:26:50,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706719388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:50,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:50,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:26:50,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124934284] [2025-03-13 22:26:50,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:50,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:26:50,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:50,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:26:50,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:26:50,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 437 [2025-03-13 22:26:50,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 368 transitions, 800 flow. Second operand has 6 states, 6 states have (on average 407.5) internal successors, (2445), 6 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:50,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:50,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 437 [2025-03-13 22:26:50,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:51,095 INFO L124 PetriNetUnfolderBase]: 79/1443 cut-off events. [2025-03-13 22:26:51,096 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-13 22:26:51,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1606 conditions, 1443 events. 79/1443 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7980 event pairs, 5 based on Foata normal form. 0/1299 useless extension candidates. Maximal degree in co-relation 1563. Up to 35 conditions per place. [2025-03-13 22:26:51,105 INFO L140 encePairwiseOnDemand]: 431/437 looper letters, 15 selfloop transitions, 6 changer transitions 0/371 dead transitions. [2025-03-13 22:26:51,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 371 transitions, 852 flow [2025-03-13 22:26:51,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:26:51,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:26:51,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2457 transitions. [2025-03-13 22:26:51,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.937070938215103 [2025-03-13 22:26:51,109 INFO L175 Difference]: Start difference. First operand has 364 places, 368 transitions, 800 flow. Second operand 6 states and 2457 transitions. [2025-03-13 22:26:51,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 371 transitions, 852 flow [2025-03-13 22:26:51,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 371 transitions, 852 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:51,129 INFO L231 Difference]: Finished difference. Result has 368 places, 367 transitions, 810 flow [2025-03-13 22:26:51,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=810, PETRI_PLACES=368, PETRI_TRANSITIONS=367} [2025-03-13 22:26:51,130 INFO L279 CegarLoopForPetriNet]: 403 programPoint places, -35 predicate places. [2025-03-13 22:26:51,130 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 367 transitions, 810 flow [2025-03-13 22:26:51,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 407.5) internal successors, (2445), 6 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:51,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:51,131 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] [2025-03-13 22:26:51,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:26:51,132 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err31ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-13 22:26:51,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:51,133 INFO L85 PathProgramCache]: Analyzing trace with hash -753775648, now seen corresponding path program 1 times [2025-03-13 22:26:51,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:51,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269267583] [2025-03-13 22:26:51,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:51,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:51,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-13 22:26:51,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-13 22:26:51,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:51,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:51,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:51,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:51,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269267583] [2025-03-13 22:26:51,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269267583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:51,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:51,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 22:26:51,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720940865] [2025-03-13 22:26:51,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:51,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 22:26:51,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:51,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 22:26:51,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 22:26:51,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 437 [2025-03-13 22:26:51,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 367 transitions, 810 flow. Second operand has 4 states, 4 states have (on average 410.5) internal successors, (1642), 4 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:51,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:51,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 437 [2025-03-13 22:26:51,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:51,504 INFO L124 PetriNetUnfolderBase]: 118/1973 cut-off events. [2025-03-13 22:26:51,504 INFO L125 PetriNetUnfolderBase]: For 42/43 co-relation queries the response was YES. [2025-03-13 22:26:51,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2255 conditions, 1973 events. 118/1973 cut-off events. For 42/43 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 11556 event pairs, 12 based on Foata normal form. 0/1772 useless extension candidates. Maximal degree in co-relation 2212. Up to 89 conditions per place. [2025-03-13 22:26:51,512 INFO L140 encePairwiseOnDemand]: 429/437 looper letters, 16 selfloop transitions, 8 changer transitions 0/377 dead transitions. [2025-03-13 22:26:51,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 377 transitions, 881 flow [2025-03-13 22:26:51,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:26:51,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:26:51,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2070 transitions. [2025-03-13 22:26:51,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9473684210526315 [2025-03-13 22:26:51,516 INFO L175 Difference]: Start difference. First operand has 368 places, 367 transitions, 810 flow. Second operand 5 states and 2070 transitions. [2025-03-13 22:26:51,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 377 transitions, 881 flow [2025-03-13 22:26:51,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 377 transitions, 869 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:26:51,522 INFO L231 Difference]: Finished difference. Result has 370 places, 373 transitions, 852 flow [2025-03-13 22:26:51,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=852, PETRI_PLACES=370, PETRI_TRANSITIONS=373} [2025-03-13 22:26:51,524 INFO L279 CegarLoopForPetriNet]: 403 programPoint places, -33 predicate places. [2025-03-13 22:26:51,525 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 373 transitions, 852 flow [2025-03-13 22:26:51,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 410.5) internal successors, (1642), 4 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:51,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:51,526 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] [2025-03-13 22:26:51,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:26:51,526 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-13 22:26:51,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:51,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1373607113, now seen corresponding path program 1 times [2025-03-13 22:26:51,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:51,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348695161] [2025-03-13 22:26:51,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:51,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:51,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-13 22:26:51,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-13 22:26:51,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:51,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:51,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:51,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:51,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348695161] [2025-03-13 22:26:51,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348695161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:51,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:51,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 22:26:51,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936166770] [2025-03-13 22:26:51,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:51,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 22:26:51,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:51,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 22:26:51,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 22:26:51,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 437 [2025-03-13 22:26:51,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 373 transitions, 852 flow. Second operand has 4 states, 4 states have (on average 410.5) internal successors, (1642), 4 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:51,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:51,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 437 [2025-03-13 22:26:51,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:51,881 INFO L124 PetriNetUnfolderBase]: 115/1970 cut-off events. [2025-03-13 22:26:51,881 INFO L125 PetriNetUnfolderBase]: For 120/121 co-relation queries the response was YES. [2025-03-13 22:26:51,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2315 conditions, 1970 events. 115/1970 cut-off events. For 120/121 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 11489 event pairs, 12 based on Foata normal form. 0/1778 useless extension candidates. Maximal degree in co-relation 2268. Up to 89 conditions per place. [2025-03-13 22:26:51,891 INFO L140 encePairwiseOnDemand]: 429/437 looper letters, 16 selfloop transitions, 8 changer transitions 0/380 dead transitions. [2025-03-13 22:26:51,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 380 transitions, 917 flow [2025-03-13 22:26:51,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:26:51,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:26:51,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2070 transitions. [2025-03-13 22:26:51,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9473684210526315 [2025-03-13 22:26:51,895 INFO L175 Difference]: Start difference. First operand has 370 places, 373 transitions, 852 flow. Second operand 5 states and 2070 transitions. [2025-03-13 22:26:51,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 380 transitions, 917 flow [2025-03-13 22:26:51,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 380 transitions, 917 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:51,903 INFO L231 Difference]: Finished difference. Result has 377 places, 376 transitions, 894 flow [2025-03-13 22:26:51,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=894, PETRI_PLACES=377, PETRI_TRANSITIONS=376} [2025-03-13 22:26:51,904 INFO L279 CegarLoopForPetriNet]: 403 programPoint places, -26 predicate places. [2025-03-13 22:26:51,904 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 376 transitions, 894 flow [2025-03-13 22:26:51,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 410.5) internal successors, (1642), 4 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:51,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:51,905 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] [2025-03-13 22:26:51,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:26:51,905 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-13 22:26:51,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:51,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1457331995, now seen corresponding path program 1 times [2025-03-13 22:26:51,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:51,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315277471] [2025-03-13 22:26:51,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:51,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:51,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-13 22:26:51,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-13 22:26:51,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:51,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:51,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:26:51,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:51,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315277471] [2025-03-13 22:26:51,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315277471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:51,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:51,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:51,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777678911] [2025-03-13 22:26:51,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:51,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:51,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:51,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:51,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:51,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 437 [2025-03-13 22:26:51,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 376 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:51,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:51,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 437 [2025-03-13 22:26:51,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:52,155 INFO L124 PetriNetUnfolderBase]: 81/1578 cut-off events. [2025-03-13 22:26:52,156 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2025-03-13 22:26:52,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1913 conditions, 1578 events. 81/1578 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 8210 event pairs, 16 based on Foata normal form. 0/1446 useless extension candidates. Maximal degree in co-relation 1862. Up to 47 conditions per place. [2025-03-13 22:26:52,167 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 9 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2025-03-13 22:26:52,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 376 transitions, 917 flow [2025-03-13 22:26:52,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:52,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:52,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1245 transitions. [2025-03-13 22:26:52,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9496567505720824 [2025-03-13 22:26:52,170 INFO L175 Difference]: Start difference. First operand has 377 places, 376 transitions, 894 flow. Second operand 3 states and 1245 transitions. [2025-03-13 22:26:52,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 376 transitions, 917 flow [2025-03-13 22:26:52,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 376 transitions, 917 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:52,174 INFO L231 Difference]: Finished difference. Result has 378 places, 375 transitions, 896 flow [2025-03-13 22:26:52,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=896, PETRI_PLACES=378, PETRI_TRANSITIONS=375} [2025-03-13 22:26:52,175 INFO L279 CegarLoopForPetriNet]: 403 programPoint places, -25 predicate places. [2025-03-13 22:26:52,175 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 375 transitions, 896 flow [2025-03-13 22:26:52,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:52,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:52,176 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-03-13 22:26:52,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:26:52,176 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err31ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-13 22:26:52,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:52,177 INFO L85 PathProgramCache]: Analyzing trace with hash 412176448, now seen corresponding path program 1 times [2025-03-13 22:26:52,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:52,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498412337] [2025-03-13 22:26:52,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:52,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:52,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-13 22:26:52,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-13 22:26:52,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:52,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:52,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:52,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:52,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498412337] [2025-03-13 22:26:52,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498412337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:52,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:52,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:26:52,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839003240] [2025-03-13 22:26:52,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:52,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:26:52,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:52,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:26:52,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:26:52,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 437 [2025-03-13 22:26:52,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 375 transitions, 896 flow. Second operand has 6 states, 6 states have (on average 379.6666666666667) internal successors, (2278), 6 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:52,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:52,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 437 [2025-03-13 22:26:52,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:52,924 INFO L124 PetriNetUnfolderBase]: 165/1651 cut-off events. [2025-03-13 22:26:52,925 INFO L125 PetriNetUnfolderBase]: For 235/236 co-relation queries the response was YES. [2025-03-13 22:26:52,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2329 conditions, 1651 events. 165/1651 cut-off events. For 235/236 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9106 event pairs, 18 based on Foata normal form. 0/1538 useless extension candidates. Maximal degree in co-relation 2275. Up to 128 conditions per place. [2025-03-13 22:26:52,932 INFO L140 encePairwiseOnDemand]: 407/437 looper letters, 19 selfloop transitions, 28 changer transitions 0/374 dead transitions. [2025-03-13 22:26:52,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 374 transitions, 992 flow [2025-03-13 22:26:52,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:26:52,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:26:52,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2317 transitions. [2025-03-13 22:26:52,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8836765827612509 [2025-03-13 22:26:52,936 INFO L175 Difference]: Start difference. First operand has 378 places, 375 transitions, 896 flow. Second operand 6 states and 2317 transitions. [2025-03-13 22:26:52,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 374 transitions, 992 flow [2025-03-13 22:26:52,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 374 transitions, 988 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:52,941 INFO L231 Difference]: Finished difference. Result has 376 places, 370 transitions, 938 flow [2025-03-13 22:26:52,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=938, PETRI_PLACES=376, PETRI_TRANSITIONS=370} [2025-03-13 22:26:52,942 INFO L279 CegarLoopForPetriNet]: 403 programPoint places, -27 predicate places. [2025-03-13 22:26:52,942 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 370 transitions, 938 flow [2025-03-13 22:26:52,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 379.6666666666667) internal successors, (2278), 6 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:52,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:52,943 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] [2025-03-13 22:26:52,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:26:52,943 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err30ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-13 22:26:52,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:52,943 INFO L85 PathProgramCache]: Analyzing trace with hash -724826649, now seen corresponding path program 1 times [2025-03-13 22:26:52,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:52,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719437543] [2025-03-13 22:26:52,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:52,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:52,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-13 22:26:52,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-13 22:26:52,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:52,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:52,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:52,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:52,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719437543] [2025-03-13 22:26:52,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719437543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:52,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:52,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:52,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150378611] [2025-03-13 22:26:52,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:52,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:52,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:52,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:52,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:53,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 437 [2025-03-13 22:26:53,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 370 transitions, 938 flow. Second operand has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:53,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:53,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 437 [2025-03-13 22:26:53,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:53,199 INFO L124 PetriNetUnfolderBase]: 147/1897 cut-off events. [2025-03-13 22:26:53,199 INFO L125 PetriNetUnfolderBase]: For 249/250 co-relation queries the response was YES. [2025-03-13 22:26:53,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2646 conditions, 1897 events. 147/1897 cut-off events. For 249/250 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 11224 event pairs, 68 based on Foata normal form. 0/1763 useless extension candidates. Maximal degree in co-relation 2594. Up to 244 conditions per place. [2025-03-13 22:26:53,215 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 25 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2025-03-13 22:26:53,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 370 transitions, 993 flow [2025-03-13 22:26:53,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:53,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:53,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2025-03-13 22:26:53,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9252479023646072 [2025-03-13 22:26:53,217 INFO L175 Difference]: Start difference. First operand has 376 places, 370 transitions, 938 flow. Second operand 3 states and 1213 transitions. [2025-03-13 22:26:53,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 370 transitions, 993 flow [2025-03-13 22:26:53,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 370 transitions, 937 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:26:53,224 INFO L231 Difference]: Finished difference. Result has 372 places, 369 transitions, 884 flow [2025-03-13 22:26:53,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=372, PETRI_TRANSITIONS=369} [2025-03-13 22:26:53,225 INFO L279 CegarLoopForPetriNet]: 403 programPoint places, -31 predicate places. [2025-03-13 22:26:53,225 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 369 transitions, 884 flow [2025-03-13 22:26:53,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:53,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:53,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] [2025-03-13 22:26:53,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:26:53,226 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-13 22:26:53,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:53,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1056653356, now seen corresponding path program 1 times [2025-03-13 22:26:53,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:53,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743120555] [2025-03-13 22:26:53,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:53,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:53,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-13 22:26:53,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-13 22:26:53,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:53,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:53,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:53,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:53,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743120555] [2025-03-13 22:26:53,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743120555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:53,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:53,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:53,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189886618] [2025-03-13 22:26:53,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:53,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:53,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:53,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:53,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:53,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 437 [2025-03-13 22:26:53,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 369 transitions, 884 flow. Second operand has 3 states, 3 states have (on average 397.3333333333333) internal successors, (1192), 3 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:53,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:53,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 437 [2025-03-13 22:26:53,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:53,482 INFO L124 PetriNetUnfolderBase]: 141/1764 cut-off events. [2025-03-13 22:26:53,482 INFO L125 PetriNetUnfolderBase]: For 185/186 co-relation queries the response was YES. [2025-03-13 22:26:53,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2301 conditions, 1764 events. 141/1764 cut-off events. For 185/186 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 10107 event pairs, 68 based on Foata normal form. 0/1637 useless extension candidates. Maximal degree in co-relation 2249. Up to 241 conditions per place. [2025-03-13 22:26:53,493 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 24 selfloop transitions, 2 changer transitions 1/369 dead transitions. [2025-03-13 22:26:53,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 369 transitions, 939 flow [2025-03-13 22:26:53,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:53,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:53,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2025-03-13 22:26:53,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9252479023646072 [2025-03-13 22:26:53,499 INFO L175 Difference]: Start difference. First operand has 372 places, 369 transitions, 884 flow. Second operand 3 states and 1213 transitions. [2025-03-13 22:26:53,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 369 transitions, 939 flow [2025-03-13 22:26:53,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 369 transitions, 935 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:53,503 INFO L231 Difference]: Finished difference. Result has 371 places, 368 transitions, 882 flow [2025-03-13 22:26:53,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=882, PETRI_PLACES=371, PETRI_TRANSITIONS=368} [2025-03-13 22:26:53,504 INFO L279 CegarLoopForPetriNet]: 403 programPoint places, -32 predicate places. [2025-03-13 22:26:53,504 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 368 transitions, 882 flow [2025-03-13 22:26:53,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 397.3333333333333) internal successors, (1192), 3 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:53,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:53,505 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-03-13 22:26:53,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:26:53,505 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-13 22:26:53,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:53,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1444880880, now seen corresponding path program 1 times [2025-03-13 22:26:53,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:53,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105552255] [2025-03-13 22:26:53,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:53,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:53,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-13 22:26:53,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-13 22:26:53,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:53,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:53,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:53,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:53,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105552255] [2025-03-13 22:26:53,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105552255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:53,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:53,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:53,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122114580] [2025-03-13 22:26:53,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:53,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:53,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:53,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:53,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:53,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 437 [2025-03-13 22:26:53,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 368 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:53,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:53,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 437 [2025-03-13 22:26:53,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:53,767 INFO L124 PetriNetUnfolderBase]: 144/1818 cut-off events. [2025-03-13 22:26:53,767 INFO L125 PetriNetUnfolderBase]: For 187/188 co-relation queries the response was YES. [2025-03-13 22:26:53,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2361 conditions, 1818 events. 144/1818 cut-off events. For 187/188 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 10604 event pairs, 68 based on Foata normal form. 0/1694 useless extension candidates. Maximal degree in co-relation 2309. Up to 242 conditions per place. [2025-03-13 22:26:53,775 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 24 selfloop transitions, 2 changer transitions 1/368 dead transitions. [2025-03-13 22:26:53,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 368 transitions, 937 flow [2025-03-13 22:26:53,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:53,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:53,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2025-03-13 22:26:53,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9252479023646072 [2025-03-13 22:26:53,779 INFO L175 Difference]: Start difference. First operand has 371 places, 368 transitions, 882 flow. Second operand 3 states and 1213 transitions. [2025-03-13 22:26:53,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 368 transitions, 937 flow [2025-03-13 22:26:53,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 368 transitions, 933 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:53,785 INFO L231 Difference]: Finished difference. Result has 370 places, 367 transitions, 880 flow [2025-03-13 22:26:53,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=370, PETRI_TRANSITIONS=367} [2025-03-13 22:26:53,786 INFO L279 CegarLoopForPetriNet]: 403 programPoint places, -33 predicate places. [2025-03-13 22:26:53,786 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 367 transitions, 880 flow [2025-03-13 22:26:53,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:53,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:53,787 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] [2025-03-13 22:26:53,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:26:53,787 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-13 22:26:53,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:53,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1574269756, now seen corresponding path program 1 times [2025-03-13 22:26:53,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:53,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558707401] [2025-03-13 22:26:53,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:53,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:53,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-13 22:26:53,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-13 22:26:53,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:53,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:53,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:53,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558707401] [2025-03-13 22:26:53,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558707401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:53,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:53,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:53,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758631005] [2025-03-13 22:26:53,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:53,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:53,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:53,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:53,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:53,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 437 [2025-03-13 22:26:53,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 367 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:53,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:53,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 437 [2025-03-13 22:26:53,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:54,099 INFO L124 PetriNetUnfolderBase]: 146/1851 cut-off events. [2025-03-13 22:26:54,100 INFO L125 PetriNetUnfolderBase]: For 189/190 co-relation queries the response was YES. [2025-03-13 22:26:54,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2407 conditions, 1851 events. 146/1851 cut-off events. For 189/190 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 10801 event pairs, 68 based on Foata normal form. 0/1731 useless extension candidates. Maximal degree in co-relation 2355. Up to 244 conditions per place. [2025-03-13 22:26:54,112 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 25 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2025-03-13 22:26:54,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 367 transitions, 935 flow [2025-03-13 22:26:54,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:54,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:54,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2025-03-13 22:26:54,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9252479023646072 [2025-03-13 22:26:54,114 INFO L175 Difference]: Start difference. First operand has 370 places, 367 transitions, 880 flow. Second operand 3 states and 1213 transitions. [2025-03-13 22:26:54,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 367 transitions, 935 flow [2025-03-13 22:26:54,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 367 transitions, 931 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:54,119 INFO L231 Difference]: Finished difference. Result has 369 places, 366 transitions, 878 flow [2025-03-13 22:26:54,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=878, PETRI_PLACES=369, PETRI_TRANSITIONS=366} [2025-03-13 22:26:54,120 INFO L279 CegarLoopForPetriNet]: 403 programPoint places, -34 predicate places. [2025-03-13 22:26:54,120 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 366 transitions, 878 flow [2025-03-13 22:26:54,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:54,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:54,121 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] [2025-03-13 22:26:54,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:26:54,121 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-13 22:26:54,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:54,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1103750264, now seen corresponding path program 1 times [2025-03-13 22:26:54,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:54,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466212732] [2025-03-13 22:26:54,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:54,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:54,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-13 22:26:54,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-13 22:26:54,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:54,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:54,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:54,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466212732] [2025-03-13 22:26:54,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466212732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:54,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:54,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:54,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905975665] [2025-03-13 22:26:54,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:54,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:54,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:54,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:54,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:54,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 437 [2025-03-13 22:26:54,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 366 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 399.6666666666667) internal successors, (1199), 3 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:54,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:54,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 437 [2025-03-13 22:26:54,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:54,403 INFO L124 PetriNetUnfolderBase]: 145/1812 cut-off events. [2025-03-13 22:26:54,404 INFO L125 PetriNetUnfolderBase]: For 187/188 co-relation queries the response was YES. [2025-03-13 22:26:54,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2367 conditions, 1812 events. 145/1812 cut-off events. For 187/188 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 10409 event pairs, 68 based on Foata normal form. 0/1698 useless extension candidates. Maximal degree in co-relation 2315. Up to 244 conditions per place. [2025-03-13 22:26:54,411 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 0 selfloop transitions, 0 changer transitions 366/366 dead transitions. [2025-03-13 22:26:54,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 366 transitions, 933 flow [2025-03-13 22:26:54,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:54,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:54,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2025-03-13 22:26:54,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9252479023646072 [2025-03-13 22:26:54,413 INFO L175 Difference]: Start difference. First operand has 369 places, 366 transitions, 878 flow. Second operand 3 states and 1213 transitions. [2025-03-13 22:26:54,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 366 transitions, 933 flow [2025-03-13 22:26:54,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 366 transitions, 929 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:54,416 INFO L231 Difference]: Finished difference. Result has 368 places, 0 transitions, 0 flow [2025-03-13 22:26:54,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=368, PETRI_TRANSITIONS=0} [2025-03-13 22:26:54,417 INFO L279 CegarLoopForPetriNet]: 403 programPoint places, -35 predicate places. [2025-03-13 22:26:54,417 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 0 transitions, 0 flow [2025-03-13 22:26:54,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.6666666666667) internal successors, (1199), 3 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:54,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (101 of 102 remaining) [2025-03-13 22:26:54,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (100 of 102 remaining) [2025-03-13 22:26:54,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (99 of 102 remaining) [2025-03-13 22:26:54,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (98 of 102 remaining) [2025-03-13 22:26:54,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (97 of 102 remaining) [2025-03-13 22:26:54,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (96 of 102 remaining) [2025-03-13 22:26:54,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (95 of 102 remaining) [2025-03-13 22:26:54,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (94 of 102 remaining) [2025-03-13 22:26:54,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err37ASSERT_VIOLATIONDATA_RACE (93 of 102 remaining) [2025-03-13 22:26:54,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (92 of 102 remaining) [2025-03-13 22:26:54,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err36ASSERT_VIOLATIONDATA_RACE (91 of 102 remaining) [2025-03-13 22:26:54,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (90 of 102 remaining) [2025-03-13 22:26:54,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (89 of 102 remaining) [2025-03-13 22:26:54,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (88 of 102 remaining) [2025-03-13 22:26:54,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (87 of 102 remaining) [2025-03-13 22:26:54,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (86 of 102 remaining) [2025-03-13 22:26:54,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (85 of 102 remaining) [2025-03-13 22:26:54,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (84 of 102 remaining) [2025-03-13 22:26:54,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (83 of 102 remaining) [2025-03-13 22:26:54,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (82 of 102 remaining) [2025-03-13 22:26:54,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (81 of 102 remaining) [2025-03-13 22:26:54,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (80 of 102 remaining) [2025-03-13 22:26:54,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (79 of 102 remaining) [2025-03-13 22:26:54,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (78 of 102 remaining) [2025-03-13 22:26:54,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (77 of 102 remaining) [2025-03-13 22:26:54,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (76 of 102 remaining) [2025-03-13 22:26:54,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (75 of 102 remaining) [2025-03-13 22:26:54,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (74 of 102 remaining) [2025-03-13 22:26:54,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (73 of 102 remaining) [2025-03-13 22:26:54,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (72 of 102 remaining) [2025-03-13 22:26:54,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (71 of 102 remaining) [2025-03-13 22:26:54,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (70 of 102 remaining) [2025-03-13 22:26:54,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (69 of 102 remaining) [2025-03-13 22:26:54,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (68 of 102 remaining) [2025-03-13 22:26:54,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (67 of 102 remaining) [2025-03-13 22:26:54,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (66 of 102 remaining) [2025-03-13 22:26:54,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (65 of 102 remaining) [2025-03-13 22:26:54,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (64 of 102 remaining) [2025-03-13 22:26:54,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (63 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (62 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (61 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (60 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (59 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (58 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (57 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (56 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (55 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (54 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (53 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (52 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (51 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (50 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (49 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (48 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (45 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (44 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (43 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (42 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (41 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (40 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (39 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (38 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err37ASSERT_VIOLATIONDATA_RACE (37 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (36 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err36ASSERT_VIOLATIONDATA_RACE (35 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (34 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (33 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (32 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (31 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (30 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (29 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (28 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (27 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (26 of 102 remaining) [2025-03-13 22:26:54,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (25 of 102 remaining) [2025-03-13 22:26:54,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (24 of 102 remaining) [2025-03-13 22:26:54,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (23 of 102 remaining) [2025-03-13 22:26:54,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (22 of 102 remaining) [2025-03-13 22:26:54,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 102 remaining) [2025-03-13 22:26:54,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (20 of 102 remaining) [2025-03-13 22:26:54,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (19 of 102 remaining) [2025-03-13 22:26:54,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (18 of 102 remaining) [2025-03-13 22:26:54,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (17 of 102 remaining) [2025-03-13 22:26:54,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 102 remaining) [2025-03-13 22:26:54,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (15 of 102 remaining) [2025-03-13 22:26:54,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (14 of 102 remaining) [2025-03-13 22:26:54,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (13 of 102 remaining) [2025-03-13 22:26:54,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (12 of 102 remaining) [2025-03-13 22:26:54,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (11 of 102 remaining) [2025-03-13 22:26:54,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (10 of 102 remaining) [2025-03-13 22:26:54,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (9 of 102 remaining) [2025-03-13 22:26:54,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (8 of 102 remaining) [2025-03-13 22:26:54,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (7 of 102 remaining) [2025-03-13 22:26:54,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (6 of 102 remaining) [2025-03-13 22:26:54,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (5 of 102 remaining) [2025-03-13 22:26:54,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (4 of 102 remaining) [2025-03-13 22:26:54,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (3 of 102 remaining) [2025-03-13 22:26:54,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (2 of 102 remaining) [2025-03-13 22:26:54,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (1 of 102 remaining) [2025-03-13 22:26:54,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (0 of 102 remaining) [2025-03-13 22:26:54,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 22:26:54,427 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] [2025-03-13 22:26:54,433 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 22:26:54,433 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:26:54,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:26:54 BasicIcfg [2025-03-13 22:26:54,438 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:26:54,438 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:26:54,439 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:26:54,439 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:26:54,439 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:26:47" (3/4) ... [2025-03-13 22:26:54,441 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 22:26:54,443 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-13 22:26:54,443 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-13 22:26:54,448 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-13 22:26:54,448 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-13 22:26:54,448 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 22:26:54,448 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 22:26:54,515 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 22:26:54,515 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 22:26:54,515 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:26:54,516 INFO L158 Benchmark]: Toolchain (without parser) took 8211.50ms. Allocated memory was 201.3MB in the beginning and 419.4MB in the end (delta: 218.1MB). Free memory was 155.4MB in the beginning and 327.2MB in the end (delta: -171.7MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2025-03-13 22:26:54,516 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:26:54,516 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.24ms. Allocated memory is still 201.3MB. Free memory was 155.1MB in the beginning and 142.3MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:26:54,516 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.31ms. Allocated memory is still 201.3MB. Free memory was 142.3MB in the beginning and 139.5MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:26:54,516 INFO L158 Benchmark]: Boogie Preprocessor took 29.81ms. Allocated memory is still 201.3MB. Free memory was 139.5MB in the beginning and 137.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:26:54,516 INFO L158 Benchmark]: IcfgBuilder took 625.56ms. Allocated memory is still 201.3MB. Free memory was 137.6MB in the beginning and 105.2MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-13 22:26:54,517 INFO L158 Benchmark]: TraceAbstraction took 7227.39ms. Allocated memory was 201.3MB in the beginning and 419.4MB in the end (delta: 218.1MB). Free memory was 104.5MB in the beginning and 331.3MB in the end (delta: -226.8MB). Peak memory consumption was 193.5MB. Max. memory is 16.1GB. [2025-03-13 22:26:54,517 INFO L158 Benchmark]: Witness Printer took 76.51ms. Allocated memory is still 419.4MB. Free memory was 331.3MB in the beginning and 327.2MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:26:54,518 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.24ms. Allocated memory is still 201.3MB. Free memory was 155.1MB in the beginning and 142.3MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.31ms. Allocated memory is still 201.3MB. Free memory was 142.3MB in the beginning and 139.5MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.81ms. Allocated memory is still 201.3MB. Free memory was 139.5MB in the beginning and 137.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 625.56ms. Allocated memory is still 201.3MB. Free memory was 137.6MB in the beginning and 105.2MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7227.39ms. Allocated memory was 201.3MB in the beginning and 419.4MB in the end (delta: 218.1MB). Free memory was 104.5MB in the beginning and 331.3MB in the end (delta: -226.8MB). Peak memory consumption was 193.5MB. Max. memory is 16.1GB. * Witness Printer took 76.51ms. Allocated memory is still 419.4MB. Free memory was 331.3MB in the beginning and 327.2MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: 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: 70]: 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: 71]: 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: 60]: 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: 71]: 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: 71]: 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: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: 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, 701 locations, 102 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: 7.1s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2027 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 834 mSDsluCounter, 292 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 325 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2252 IncrementalHoareTripleChecker+Invalid, 2577 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 325 mSolverCounterUnsat, 221 mSDtfsCounter, 2252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=938occurred in iteration=15, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1897 NumberOfCodeBlocks, 1897 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1877 ConstructedInterpolants, 0 QuantifiedInterpolants, 2732 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 54 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-13 22:26:54,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE