./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8cea87724a542982ff884c708bfc22195aa1904db80300e5b965108c3d86cb2f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:39:18,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:39:18,557 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:39:18,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:39:18,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:39:18,575 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:39:18,576 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:39:18,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:39:18,577 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:39:18,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:39:18,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:39:18,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:39:18,577 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:39:18,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:39:18,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:39:18,577 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:39:18,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:39:18,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:39:18,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:39:18,578 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:39:18,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:39:18,578 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:39:18,578 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:39:18,578 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:39:18,578 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:39:18,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:39:18,578 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:39:18,579 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:39:18,579 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:39:18,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:39:18,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:39:18,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:18,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:39:18,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:39:18,579 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:39:18,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:39:18,579 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:39:18,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:39:18,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:39:18,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:39:18,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:39:18,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:39:18,580 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8cea87724a542982ff884c708bfc22195aa1904db80300e5b965108c3d86cb2f [2025-02-08 05:39:18,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:39:18,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:39:18,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:39:18,800 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:39:18,800 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:39:18,802 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c [2025-02-08 05:39:19,976 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2c9e153b/6a0303dacba442cdab3f15a04bd6eb3e/FLAG8c4fc5382 [2025-02-08 05:39:20,242 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:39:20,247 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c [2025-02-08 05:39:20,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2c9e153b/6a0303dacba442cdab3f15a04bd6eb3e/FLAG8c4fc5382 [2025-02-08 05:39:20,276 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2c9e153b/6a0303dacba442cdab3f15a04bd6eb3e [2025-02-08 05:39:20,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:39:20,280 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:39:20,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:20,281 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:39:20,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:39:20,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:20" (1/1) ... [2025-02-08 05:39:20,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17658864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:20, skipping insertion in model container [2025-02-08 05:39:20,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:20" (1/1) ... [2025-02-08 05:39:20,299 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:39:20,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:20,441 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:39:20,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:20,474 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:39:20,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:20 WrapperNode [2025-02-08 05:39:20,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:20,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:20,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:39:20,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:39:20,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:20" (1/1) ... [2025-02-08 05:39:20,487 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:20" (1/1) ... [2025-02-08 05:39:20,501 INFO L138 Inliner]: procedures = 19, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 78 [2025-02-08 05:39:20,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:20,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:39:20,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:39:20,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:39:20,509 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:20" (1/1) ... [2025-02-08 05:39:20,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:20" (1/1) ... [2025-02-08 05:39:20,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:20" (1/1) ... [2025-02-08 05:39:20,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:20" (1/1) ... [2025-02-08 05:39:20,524 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:20" (1/1) ... [2025-02-08 05:39:20,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:20" (1/1) ... [2025-02-08 05:39:20,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:20" (1/1) ... [2025-02-08 05:39:20,526 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:20" (1/1) ... [2025-02-08 05:39:20,531 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:39:20,532 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:39:20,532 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:39:20,532 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:39:20,532 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:20" (1/1) ... [2025-02-08 05:39:20,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:20,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:39:20,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:39:20,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:39:20,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:39:20,590 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:39:20,590 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:39:20,590 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:39:20,590 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:39:20,590 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:39:20,590 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:39:20,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:39:20,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:39:20,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:39:20,591 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:39:20,671 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:39:20,673 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:39:20,938 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:39:20,940 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:39:20,970 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:39:20,970 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:39:20,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:20 BoogieIcfgContainer [2025-02-08 05:39:20,971 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:39:20,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:39:20,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:39:20,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:39:20,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:39:20" (1/3) ... [2025-02-08 05:39:20,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48377380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:20, skipping insertion in model container [2025-02-08 05:39:20,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:20" (2/3) ... [2025-02-08 05:39:20,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48377380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:20, skipping insertion in model container [2025-02-08 05:39:20,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:20" (3/3) ... [2025-02-08 05:39:20,977 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-3-extended.wvr.c [2025-02-08 05:39:20,986 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:39:20,987 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-3-extended.wvr.c that has 4 procedures, 207 locations, 1 initial locations, 3 loop locations, and 24 error locations. [2025-02-08 05:39:20,987 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:39:21,064 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:39:21,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 216 places, 222 transitions, 465 flow [2025-02-08 05:39:21,170 INFO L124 PetriNetUnfolderBase]: 16/219 cut-off events. [2025-02-08 05:39:21,172 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:39:21,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 219 events. 16/219 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 480 event pairs, 0 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 159. Up to 4 conditions per place. [2025-02-08 05:39:21,179 INFO L82 GeneralOperation]: Start removeDead. Operand has 216 places, 222 transitions, 465 flow [2025-02-08 05:39:21,186 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 202 transitions, 419 flow [2025-02-08 05:39:21,192 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:39:21,203 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;@2f5291c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:39:21,204 INFO L334 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2025-02-08 05:39:21,209 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:39:21,212 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-02-08 05:39:21,212 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:39:21,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:21,212 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:21,213 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-02-08 05:39:21,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:21,218 INFO L85 PathProgramCache]: Analyzing trace with hash 718379139, now seen corresponding path program 1 times [2025-02-08 05:39:21,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:21,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62563803] [2025-02-08 05:39:21,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:21,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:21,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:39:21,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:39:21,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:21,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:21,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:21,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:21,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62563803] [2025-02-08 05:39:21,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62563803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:21,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:21,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:21,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390744063] [2025-02-08 05:39:21,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:21,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:21,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:21,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:21,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:21,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 222 [2025-02-08 05:39:21,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 202 transitions, 419 flow. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:21,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:21,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 222 [2025-02-08 05:39:21,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:21,564 INFO L124 PetriNetUnfolderBase]: 148/774 cut-off events. [2025-02-08 05:39:21,564 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-08 05:39:21,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 774 events. 148/774 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4281 event pairs, 55 based on Foata normal form. 53/674 useless extension candidates. Maximal degree in co-relation 878. Up to 164 conditions per place. [2025-02-08 05:39:21,574 INFO L140 encePairwiseOnDemand]: 216/222 looper letters, 18 selfloop transitions, 2 changer transitions 0/198 dead transitions. [2025-02-08 05:39:21,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 198 transitions, 451 flow [2025-02-08 05:39:21,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:21,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 606 transitions. [2025-02-08 05:39:21,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2025-02-08 05:39:21,585 INFO L175 Difference]: Start difference. First operand has 197 places, 202 transitions, 419 flow. Second operand 3 states and 606 transitions. [2025-02-08 05:39:21,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 198 transitions, 451 flow [2025-02-08 05:39:21,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 198 transitions, 442 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:39:21,592 INFO L231 Difference]: Finished difference. Result has 193 places, 198 transitions, 406 flow [2025-02-08 05:39:21,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=193, PETRI_TRANSITIONS=198} [2025-02-08 05:39:21,596 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -4 predicate places. [2025-02-08 05:39:21,596 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 198 transitions, 406 flow [2025-02-08 05:39:21,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:21,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:21,597 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] [2025-02-08 05:39:21,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:39:21,597 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-02-08 05:39:21,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:21,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1169100107, now seen corresponding path program 1 times [2025-02-08 05:39:21,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:21,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854271639] [2025-02-08 05:39:21,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:21,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:21,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 05:39:21,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 05:39:21,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:21,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:21,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:21,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:21,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854271639] [2025-02-08 05:39:21,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854271639] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:21,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:21,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:21,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282681033] [2025-02-08 05:39:21,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:21,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:21,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:21,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:21,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:21,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 222 [2025-02-08 05:39:21,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 198 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:21,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:21,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 222 [2025-02-08 05:39:21,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:21,772 INFO L124 PetriNetUnfolderBase]: 167/812 cut-off events. [2025-02-08 05:39:21,772 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 05:39:21,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1062 conditions, 812 events. 167/812 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5001 event pairs, 83 based on Foata normal form. 0/652 useless extension candidates. Maximal degree in co-relation 1033. Up to 204 conditions per place. [2025-02-08 05:39:21,780 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 18 selfloop transitions, 2 changer transitions 0/197 dead transitions. [2025-02-08 05:39:21,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 197 transitions, 444 flow [2025-02-08 05:39:21,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:21,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:21,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 603 transitions. [2025-02-08 05:39:21,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9054054054054054 [2025-02-08 05:39:21,787 INFO L175 Difference]: Start difference. First operand has 193 places, 198 transitions, 406 flow. Second operand 3 states and 603 transitions. [2025-02-08 05:39:21,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 197 transitions, 444 flow [2025-02-08 05:39:21,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 197 transitions, 440 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:21,789 INFO L231 Difference]: Finished difference. Result has 192 places, 197 transitions, 404 flow [2025-02-08 05:39:21,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=404, PETRI_PLACES=192, PETRI_TRANSITIONS=197} [2025-02-08 05:39:21,791 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -5 predicate places. [2025-02-08 05:39:21,791 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 197 transitions, 404 flow [2025-02-08 05:39:21,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:21,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:21,792 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-02-08 05:39:21,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:39:21,792 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-02-08 05:39:21,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:21,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1317798804, now seen corresponding path program 1 times [2025-02-08 05:39:21,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:21,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802883082] [2025-02-08 05:39:21,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:21,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:21,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 05:39:21,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 05:39:21,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:21,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:21,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:21,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:21,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802883082] [2025-02-08 05:39:21,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802883082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:21,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:21,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:21,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381359844] [2025-02-08 05:39:21,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:21,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:21,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:21,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:21,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:21,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 222 [2025-02-08 05:39:21,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 197 transitions, 404 flow. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:21,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:21,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 222 [2025-02-08 05:39:21,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:21,981 INFO L124 PetriNetUnfolderBase]: 141/683 cut-off events. [2025-02-08 05:39:21,981 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-08 05:39:21,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 683 events. 141/683 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3773 event pairs, 67 based on Foata normal form. 0/556 useless extension candidates. Maximal degree in co-relation 844. Up to 173 conditions per place. [2025-02-08 05:39:21,989 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 18 selfloop transitions, 2 changer transitions 0/196 dead transitions. [2025-02-08 05:39:21,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 196 transitions, 442 flow [2025-02-08 05:39:21,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:21,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:21,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 603 transitions. [2025-02-08 05:39:21,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9054054054054054 [2025-02-08 05:39:21,992 INFO L175 Difference]: Start difference. First operand has 192 places, 197 transitions, 404 flow. Second operand 3 states and 603 transitions. [2025-02-08 05:39:21,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 196 transitions, 442 flow [2025-02-08 05:39:21,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 196 transitions, 438 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:21,997 INFO L231 Difference]: Finished difference. Result has 191 places, 196 transitions, 402 flow [2025-02-08 05:39:21,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=191, PETRI_TRANSITIONS=196} [2025-02-08 05:39:21,998 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -6 predicate places. [2025-02-08 05:39:21,999 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 196 transitions, 402 flow [2025-02-08 05:39:21,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:21,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:21,999 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] [2025-02-08 05:39:22,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:39:22,000 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-02-08 05:39:22,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:22,001 INFO L85 PathProgramCache]: Analyzing trace with hash 168335953, now seen corresponding path program 1 times [2025-02-08 05:39:22,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:22,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727249484] [2025-02-08 05:39:22,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:22,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:22,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 05:39:22,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 05:39:22,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:22,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:22,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:22,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:22,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727249484] [2025-02-08 05:39:22,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727249484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:22,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:22,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:22,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895916516] [2025-02-08 05:39:22,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:22,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:22,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:22,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:22,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:22,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 222 [2025-02-08 05:39:22,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 196 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:22,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:22,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 222 [2025-02-08 05:39:22,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:22,160 INFO L124 PetriNetUnfolderBase]: 112/655 cut-off events. [2025-02-08 05:39:22,160 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:39:22,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 655 events. 112/655 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3315 event pairs, 39 based on Foata normal form. 0/520 useless extension candidates. Maximal degree in co-relation 768. Up to 120 conditions per place. [2025-02-08 05:39:22,167 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 16 selfloop transitions, 2 changer transitions 0/195 dead transitions. [2025-02-08 05:39:22,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 195 transitions, 436 flow [2025-02-08 05:39:22,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:22,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:22,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 607 transitions. [2025-02-08 05:39:22,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9114114114114115 [2025-02-08 05:39:22,170 INFO L175 Difference]: Start difference. First operand has 191 places, 196 transitions, 402 flow. Second operand 3 states and 607 transitions. [2025-02-08 05:39:22,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 195 transitions, 436 flow [2025-02-08 05:39:22,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 195 transitions, 432 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:22,173 INFO L231 Difference]: Finished difference. Result has 190 places, 195 transitions, 400 flow [2025-02-08 05:39:22,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=190, PETRI_TRANSITIONS=195} [2025-02-08 05:39:22,174 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -7 predicate places. [2025-02-08 05:39:22,174 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 195 transitions, 400 flow [2025-02-08 05:39:22,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:22,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:22,174 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:22,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:39:22,175 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-02-08 05:39:22,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:22,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1684811499, now seen corresponding path program 1 times [2025-02-08 05:39:22,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:22,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283934068] [2025-02-08 05:39:22,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:22,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:22,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:39:22,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:39:22,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:22,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:22,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:22,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:22,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283934068] [2025-02-08 05:39:22,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283934068] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:22,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:22,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:22,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344600074] [2025-02-08 05:39:22,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:22,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:22,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:22,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:22,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:22,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 222 [2025-02-08 05:39:22,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 195 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:22,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:22,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 222 [2025-02-08 05:39:22,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:22,338 INFO L124 PetriNetUnfolderBase]: 125/737 cut-off events. [2025-02-08 05:39:22,338 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 05:39:22,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 913 conditions, 737 events. 125/737 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4463 event pairs, 53 based on Foata normal form. 0/582 useless extension candidates. Maximal degree in co-relation 869. Up to 142 conditions per place. [2025-02-08 05:39:22,345 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 16 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2025-02-08 05:39:22,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 194 transitions, 434 flow [2025-02-08 05:39:22,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:22,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:22,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 607 transitions. [2025-02-08 05:39:22,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9114114114114115 [2025-02-08 05:39:22,348 INFO L175 Difference]: Start difference. First operand has 190 places, 195 transitions, 400 flow. Second operand 3 states and 607 transitions. [2025-02-08 05:39:22,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 194 transitions, 434 flow [2025-02-08 05:39:22,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 194 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:22,350 INFO L231 Difference]: Finished difference. Result has 189 places, 194 transitions, 398 flow [2025-02-08 05:39:22,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=398, PETRI_PLACES=189, PETRI_TRANSITIONS=194} [2025-02-08 05:39:22,353 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -8 predicate places. [2025-02-08 05:39:22,354 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 194 transitions, 398 flow [2025-02-08 05:39:22,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:22,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:22,355 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] [2025-02-08 05:39:22,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:39:22,356 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-02-08 05:39:22,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:22,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1579892488, now seen corresponding path program 1 times [2025-02-08 05:39:22,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:22,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688728318] [2025-02-08 05:39:22,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:22,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:22,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 05:39:22,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:39:22,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:22,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:22,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:22,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:22,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688728318] [2025-02-08 05:39:22,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688728318] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:22,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:22,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:22,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159961577] [2025-02-08 05:39:22,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:22,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:22,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:22,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:22,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:22,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 222 [2025-02-08 05:39:22,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 194 transitions, 398 flow. Second operand has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:22,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:22,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 222 [2025-02-08 05:39:22,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:22,496 INFO L124 PetriNetUnfolderBase]: 111/656 cut-off events. [2025-02-08 05:39:22,496 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 05:39:22,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 803 conditions, 656 events. 111/656 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3657 event pairs, 45 based on Foata normal form. 0/524 useless extension candidates. Maximal degree in co-relation 754. Up to 125 conditions per place. [2025-02-08 05:39:22,502 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 16 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2025-02-08 05:39:22,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 193 transitions, 432 flow [2025-02-08 05:39:22,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:22,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:22,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 607 transitions. [2025-02-08 05:39:22,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9114114114114115 [2025-02-08 05:39:22,504 INFO L175 Difference]: Start difference. First operand has 189 places, 194 transitions, 398 flow. Second operand 3 states and 607 transitions. [2025-02-08 05:39:22,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 193 transitions, 432 flow [2025-02-08 05:39:22,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 193 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:22,507 INFO L231 Difference]: Finished difference. Result has 188 places, 193 transitions, 396 flow [2025-02-08 05:39:22,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=396, PETRI_PLACES=188, PETRI_TRANSITIONS=193} [2025-02-08 05:39:22,508 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -9 predicate places. [2025-02-08 05:39:22,509 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 193 transitions, 396 flow [2025-02-08 05:39:22,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:22,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:22,510 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:22,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:39:22,510 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-02-08 05:39:22,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:22,511 INFO L85 PathProgramCache]: Analyzing trace with hash 189865213, now seen corresponding path program 1 times [2025-02-08 05:39:22,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:22,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614493590] [2025-02-08 05:39:22,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:22,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:22,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:39:22,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:39:22,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:22,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:22,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:22,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:22,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614493590] [2025-02-08 05:39:22,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614493590] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:22,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:22,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:22,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31726929] [2025-02-08 05:39:22,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:22,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:22,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:22,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:22,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:22,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 222 [2025-02-08 05:39:22,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 193 transitions, 396 flow. Second operand has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:22,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:22,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 222 [2025-02-08 05:39:22,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:22,646 INFO L124 PetriNetUnfolderBase]: 148/907 cut-off events. [2025-02-08 05:39:22,646 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:39:22,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 907 events. 148/907 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5068 event pairs, 35 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 1039. Up to 109 conditions per place. [2025-02-08 05:39:22,655 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 20 selfloop transitions, 2 changer transitions 0/199 dead transitions. [2025-02-08 05:39:22,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 199 transitions, 455 flow [2025-02-08 05:39:22,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:22,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 623 transitions. [2025-02-08 05:39:22,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354354354354354 [2025-02-08 05:39:22,658 INFO L175 Difference]: Start difference. First operand has 188 places, 193 transitions, 396 flow. Second operand 3 states and 623 transitions. [2025-02-08 05:39:22,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 199 transitions, 455 flow [2025-02-08 05:39:22,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 199 transitions, 451 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:22,661 INFO L231 Difference]: Finished difference. Result has 188 places, 193 transitions, 400 flow [2025-02-08 05:39:22,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=188, PETRI_TRANSITIONS=193} [2025-02-08 05:39:22,663 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -9 predicate places. [2025-02-08 05:39:22,663 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 193 transitions, 400 flow [2025-02-08 05:39:22,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:22,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:22,664 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:22,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:39:22,664 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-02-08 05:39:22,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:22,665 INFO L85 PathProgramCache]: Analyzing trace with hash -196941262, now seen corresponding path program 1 times [2025-02-08 05:39:22,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:22,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284650472] [2025-02-08 05:39:22,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:22,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:22,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 05:39:22,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 05:39:22,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:22,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:22,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:22,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:22,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284650472] [2025-02-08 05:39:22,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284650472] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:22,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:22,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:22,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175223651] [2025-02-08 05:39:22,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:22,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:22,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:22,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:22,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:22,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 222 [2025-02-08 05:39:22,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 193 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:22,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:22,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 222 [2025-02-08 05:39:22,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:22,806 INFO L124 PetriNetUnfolderBase]: 184/667 cut-off events. [2025-02-08 05:39:22,807 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-08 05:39:22,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 985 conditions, 667 events. 184/667 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3509 event pairs, 15 based on Foata normal form. 0/576 useless extension candidates. Maximal degree in co-relation 867. Up to 183 conditions per place. [2025-02-08 05:39:22,814 INFO L140 encePairwiseOnDemand]: 216/222 looper letters, 25 selfloop transitions, 3 changer transitions 0/199 dead transitions. [2025-02-08 05:39:22,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 199 transitions, 473 flow [2025-02-08 05:39:22,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:22,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:22,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 613 transitions. [2025-02-08 05:39:22,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9204204204204204 [2025-02-08 05:39:22,816 INFO L175 Difference]: Start difference. First operand has 188 places, 193 transitions, 400 flow. Second operand 3 states and 613 transitions. [2025-02-08 05:39:22,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 199 transitions, 473 flow [2025-02-08 05:39:22,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 199 transitions, 471 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:22,821 INFO L231 Difference]: Finished difference. Result has 187 places, 191 transitions, 405 flow [2025-02-08 05:39:22,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=405, PETRI_PLACES=187, PETRI_TRANSITIONS=191} [2025-02-08 05:39:22,822 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -10 predicate places. [2025-02-08 05:39:22,822 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 191 transitions, 405 flow [2025-02-08 05:39:22,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:22,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:22,824 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:22,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:39:22,824 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-02-08 05:39:22,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:22,825 INFO L85 PathProgramCache]: Analyzing trace with hash 997704952, now seen corresponding path program 1 times [2025-02-08 05:39:22,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:22,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753320657] [2025-02-08 05:39:22,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:22,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:22,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 05:39:22,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 05:39:22,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:22,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:22,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:22,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753320657] [2025-02-08 05:39:22,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753320657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:22,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:22,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:22,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162587252] [2025-02-08 05:39:22,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:22,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:22,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:22,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:22,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:22,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 222 [2025-02-08 05:39:22,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 191 transitions, 405 flow. Second operand has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:22,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:22,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 222 [2025-02-08 05:39:22,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:22,992 INFO L124 PetriNetUnfolderBase]: 221/1341 cut-off events. [2025-02-08 05:39:22,992 INFO L125 PetriNetUnfolderBase]: For 24/37 co-relation queries the response was YES. [2025-02-08 05:39:22,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1627 conditions, 1341 events. 221/1341 cut-off events. For 24/37 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 8901 event pairs, 44 based on Foata normal form. 0/1057 useless extension candidates. Maximal degree in co-relation 1190. Up to 160 conditions per place. [2025-02-08 05:39:23,002 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 20 selfloop transitions, 2 changer transitions 0/197 dead transitions. [2025-02-08 05:39:23,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 197 transitions, 464 flow [2025-02-08 05:39:23,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 623 transitions. [2025-02-08 05:39:23,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354354354354354 [2025-02-08 05:39:23,004 INFO L175 Difference]: Start difference. First operand has 187 places, 191 transitions, 405 flow. Second operand 3 states and 623 transitions. [2025-02-08 05:39:23,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 197 transitions, 464 flow [2025-02-08 05:39:23,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 197 transitions, 461 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:23,006 INFO L231 Difference]: Finished difference. Result has 188 places, 191 transitions, 410 flow [2025-02-08 05:39:23,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=188, PETRI_TRANSITIONS=191} [2025-02-08 05:39:23,008 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -9 predicate places. [2025-02-08 05:39:23,008 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 191 transitions, 410 flow [2025-02-08 05:39:23,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:23,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:23,008 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:23,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:39:23,008 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-02-08 05:39:23,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:23,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1455007491, now seen corresponding path program 1 times [2025-02-08 05:39:23,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:23,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058402792] [2025-02-08 05:39:23,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:23,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:23,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:39:23,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:39:23,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:23,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:23,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:23,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058402792] [2025-02-08 05:39:23,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058402792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:23,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:23,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:23,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664196036] [2025-02-08 05:39:23,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:23,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:23,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:23,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:23,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:23,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 222 [2025-02-08 05:39:23,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 191 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:23,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:23,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 222 [2025-02-08 05:39:23,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:23,197 INFO L124 PetriNetUnfolderBase]: 351/1577 cut-off events. [2025-02-08 05:39:23,198 INFO L125 PetriNetUnfolderBase]: For 54/61 co-relation queries the response was YES. [2025-02-08 05:39:23,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2108 conditions, 1577 events. 351/1577 cut-off events. For 54/61 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 11548 event pairs, 74 based on Foata normal form. 1/1297 useless extension candidates. Maximal degree in co-relation 1703. Up to 314 conditions per place. [2025-02-08 05:39:23,208 INFO L140 encePairwiseOnDemand]: 216/222 looper letters, 24 selfloop transitions, 3 changer transitions 0/196 dead transitions. [2025-02-08 05:39:23,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 196 transitions, 478 flow [2025-02-08 05:39:23,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:23,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 612 transitions. [2025-02-08 05:39:23,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.918918918918919 [2025-02-08 05:39:23,213 INFO L175 Difference]: Start difference. First operand has 188 places, 191 transitions, 410 flow. Second operand 3 states and 612 transitions. [2025-02-08 05:39:23,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 196 transitions, 478 flow [2025-02-08 05:39:23,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 196 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:23,216 INFO L231 Difference]: Finished difference. Result has 187 places, 189 transitions, 415 flow [2025-02-08 05:39:23,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=415, PETRI_PLACES=187, PETRI_TRANSITIONS=189} [2025-02-08 05:39:23,216 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -10 predicate places. [2025-02-08 05:39:23,217 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 189 transitions, 415 flow [2025-02-08 05:39:23,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:23,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:23,217 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] [2025-02-08 05:39:23,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:39:23,217 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-02-08 05:39:23,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:23,218 INFO L85 PathProgramCache]: Analyzing trace with hash -994847993, now seen corresponding path program 1 times [2025-02-08 05:39:23,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:23,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234886190] [2025-02-08 05:39:23,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:23,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:23,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 05:39:23,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 05:39:23,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:23,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:23,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:23,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:23,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234886190] [2025-02-08 05:39:23,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234886190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:23,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:23,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:23,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653620547] [2025-02-08 05:39:23,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:23,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:23,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:23,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:23,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:23,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 222 [2025-02-08 05:39:23,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 189 transitions, 415 flow. Second operand has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:23,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:23,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 222 [2025-02-08 05:39:23,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:23,382 INFO L124 PetriNetUnfolderBase]: 198/828 cut-off events. [2025-02-08 05:39:23,382 INFO L125 PetriNetUnfolderBase]: For 26/39 co-relation queries the response was YES. [2025-02-08 05:39:23,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1187 conditions, 828 events. 198/828 cut-off events. For 26/39 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4985 event pairs, 70 based on Foata normal form. 1/704 useless extension candidates. Maximal degree in co-relation 1000. Up to 203 conditions per place. [2025-02-08 05:39:23,388 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 24 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2025-02-08 05:39:23,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 194 transitions, 480 flow [2025-02-08 05:39:23,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:23,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:23,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 614 transitions. [2025-02-08 05:39:23,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9219219219219219 [2025-02-08 05:39:23,390 INFO L175 Difference]: Start difference. First operand has 187 places, 189 transitions, 415 flow. Second operand 3 states and 614 transitions. [2025-02-08 05:39:23,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 194 transitions, 480 flow [2025-02-08 05:39:23,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 194 transitions, 477 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:23,395 INFO L231 Difference]: Finished difference. Result has 187 places, 188 transitions, 414 flow [2025-02-08 05:39:23,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=187, PETRI_TRANSITIONS=188} [2025-02-08 05:39:23,396 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -10 predicate places. [2025-02-08 05:39:23,396 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 188 transitions, 414 flow [2025-02-08 05:39:23,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:23,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:23,396 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] [2025-02-08 05:39:23,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:39:23,396 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-02-08 05:39:23,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:23,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1018722913, now seen corresponding path program 1 times [2025-02-08 05:39:23,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:23,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679523989] [2025-02-08 05:39:23,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:23,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:23,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 05:39:23,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 05:39:23,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:23,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:23,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:23,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:23,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679523989] [2025-02-08 05:39:23,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679523989] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:23,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:23,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:23,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951486841] [2025-02-08 05:39:23,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:23,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:23,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:23,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:23,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:23,439 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 222 [2025-02-08 05:39:23,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 188 transitions, 414 flow. Second operand has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:23,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:23,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 222 [2025-02-08 05:39:23,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:23,541 INFO L124 PetriNetUnfolderBase]: 178/956 cut-off events. [2025-02-08 05:39:23,541 INFO L125 PetriNetUnfolderBase]: For 38/46 co-relation queries the response was YES. [2025-02-08 05:39:23,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1238 conditions, 956 events. 178/956 cut-off events. For 38/46 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 5928 event pairs, 30 based on Foata normal form. 1/797 useless extension candidates. Maximal degree in co-relation 947. Up to 144 conditions per place. [2025-02-08 05:39:23,548 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 20 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2025-02-08 05:39:23,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 194 transitions, 472 flow [2025-02-08 05:39:23,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:23,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:23,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 623 transitions. [2025-02-08 05:39:23,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354354354354354 [2025-02-08 05:39:23,550 INFO L175 Difference]: Start difference. First operand has 187 places, 188 transitions, 414 flow. Second operand 3 states and 623 transitions. [2025-02-08 05:39:23,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 194 transitions, 472 flow [2025-02-08 05:39:23,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 194 transitions, 468 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:23,553 INFO L231 Difference]: Finished difference. Result has 187 places, 188 transitions, 418 flow [2025-02-08 05:39:23,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=187, PETRI_TRANSITIONS=188} [2025-02-08 05:39:23,554 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -10 predicate places. [2025-02-08 05:39:23,554 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 188 transitions, 418 flow [2025-02-08 05:39:23,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:23,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:23,554 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-02-08 05:39:23,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:39:23,554 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-02-08 05:39:23,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:23,555 INFO L85 PathProgramCache]: Analyzing trace with hash -534875162, now seen corresponding path program 1 times [2025-02-08 05:39:23,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:23,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349592865] [2025-02-08 05:39:23,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:23,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:23,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-08 05:39:23,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 05:39:23,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:23,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:23,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:23,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349592865] [2025-02-08 05:39:23,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349592865] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:23,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:23,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:23,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785113375] [2025-02-08 05:39:23,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:23,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:23,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:23,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:23,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:23,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 222 [2025-02-08 05:39:23,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 188 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:23,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:23,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 222 [2025-02-08 05:39:23,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:23,712 INFO L124 PetriNetUnfolderBase]: 266/1035 cut-off events. [2025-02-08 05:39:23,713 INFO L125 PetriNetUnfolderBase]: For 81/90 co-relation queries the response was YES. [2025-02-08 05:39:23,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1519 conditions, 1035 events. 266/1035 cut-off events. For 81/90 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6764 event pairs, 30 based on Foata normal form. 1/916 useless extension candidates. Maximal degree in co-relation 1125. Up to 280 conditions per place. [2025-02-08 05:39:23,719 INFO L140 encePairwiseOnDemand]: 216/222 looper letters, 23 selfloop transitions, 3 changer transitions 0/192 dead transitions. [2025-02-08 05:39:23,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 192 transitions, 480 flow [2025-02-08 05:39:23,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:23,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:23,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 611 transitions. [2025-02-08 05:39:23,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9174174174174174 [2025-02-08 05:39:23,720 INFO L175 Difference]: Start difference. First operand has 187 places, 188 transitions, 418 flow. Second operand 3 states and 611 transitions. [2025-02-08 05:39:23,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 192 transitions, 480 flow [2025-02-08 05:39:23,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 192 transitions, 478 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:23,723 INFO L231 Difference]: Finished difference. Result has 186 places, 186 transitions, 423 flow [2025-02-08 05:39:23,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=423, PETRI_PLACES=186, PETRI_TRANSITIONS=186} [2025-02-08 05:39:23,724 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -11 predicate places. [2025-02-08 05:39:23,724 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 186 transitions, 423 flow [2025-02-08 05:39:23,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:23,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:23,724 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] [2025-02-08 05:39:23,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:39:23,725 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-02-08 05:39:23,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:23,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1541373880, now seen corresponding path program 1 times [2025-02-08 05:39:23,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:23,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76063011] [2025-02-08 05:39:23,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:23,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:23,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 05:39:23,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 05:39:23,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:23,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:23,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:23,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:23,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76063011] [2025-02-08 05:39:23,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76063011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:23,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:23,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:23,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015479651] [2025-02-08 05:39:23,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:23,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:23,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:23,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:23,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:23,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 222 [2025-02-08 05:39:23,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 186 transitions, 423 flow. Second operand has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:23,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:23,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 222 [2025-02-08 05:39:23,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:23,866 INFO L124 PetriNetUnfolderBase]: 304/1203 cut-off events. [2025-02-08 05:39:23,866 INFO L125 PetriNetUnfolderBase]: For 79/84 co-relation queries the response was YES. [2025-02-08 05:39:23,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1825 conditions, 1203 events. 304/1203 cut-off events. For 79/84 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 7711 event pairs, 120 based on Foata normal form. 0/1055 useless extension candidates. Maximal degree in co-relation 1256. Up to 307 conditions per place. [2025-02-08 05:39:23,874 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 24 selfloop transitions, 2 changer transitions 0/191 dead transitions. [2025-02-08 05:39:23,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 191 transitions, 488 flow [2025-02-08 05:39:23,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:23,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:23,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 614 transitions. [2025-02-08 05:39:23,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9219219219219219 [2025-02-08 05:39:23,875 INFO L175 Difference]: Start difference. First operand has 186 places, 186 transitions, 423 flow. Second operand 3 states and 614 transitions. [2025-02-08 05:39:23,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 191 transitions, 488 flow [2025-02-08 05:39:23,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 191 transitions, 485 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:23,878 INFO L231 Difference]: Finished difference. Result has 186 places, 185 transitions, 422 flow [2025-02-08 05:39:23,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=186, PETRI_TRANSITIONS=185} [2025-02-08 05:39:23,879 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -11 predicate places. [2025-02-08 05:39:23,879 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 185 transitions, 422 flow [2025-02-08 05:39:23,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:23,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:23,879 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] [2025-02-08 05:39:23,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:39:23,880 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-02-08 05:39:23,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:23,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1922175189, now seen corresponding path program 1 times [2025-02-08 05:39:23,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:23,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289124066] [2025-02-08 05:39:23,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:23,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:23,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 05:39:23,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 05:39:23,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:23,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:23,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:23,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:23,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289124066] [2025-02-08 05:39:23,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289124066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:23,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:23,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:23,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211874877] [2025-02-08 05:39:23,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:23,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:23,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:23,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:23,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:23,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 222 [2025-02-08 05:39:23,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 185 transitions, 422 flow. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:23,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:23,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 222 [2025-02-08 05:39:23,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:24,019 INFO L124 PetriNetUnfolderBase]: 266/1014 cut-off events. [2025-02-08 05:39:24,020 INFO L125 PetriNetUnfolderBase]: For 98/106 co-relation queries the response was YES. [2025-02-08 05:39:24,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1542 conditions, 1014 events. 266/1014 cut-off events. For 98/106 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 6400 event pairs, 115 based on Foata normal form. 0/911 useless extension candidates. Maximal degree in co-relation 1287. Up to 290 conditions per place. [2025-02-08 05:39:24,026 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 24 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2025-02-08 05:39:24,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 190 transitions, 486 flow [2025-02-08 05:39:24,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:24,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:24,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 614 transitions. [2025-02-08 05:39:24,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9219219219219219 [2025-02-08 05:39:24,028 INFO L175 Difference]: Start difference. First operand has 186 places, 185 transitions, 422 flow. Second operand 3 states and 614 transitions. [2025-02-08 05:39:24,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 190 transitions, 486 flow [2025-02-08 05:39:24,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 190 transitions, 482 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:24,030 INFO L231 Difference]: Finished difference. Result has 185 places, 184 transitions, 420 flow [2025-02-08 05:39:24,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=185, PETRI_TRANSITIONS=184} [2025-02-08 05:39:24,032 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -12 predicate places. [2025-02-08 05:39:24,032 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 184 transitions, 420 flow [2025-02-08 05:39:24,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:24,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:24,032 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] [2025-02-08 05:39:24,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:39:24,032 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-02-08 05:39:24,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:24,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1943587313, now seen corresponding path program 1 times [2025-02-08 05:39:24,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:24,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773358257] [2025-02-08 05:39:24,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:24,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:24,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 05:39:24,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 05:39:24,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:24,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:24,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:24,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:24,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773358257] [2025-02-08 05:39:24,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773358257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:24,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:24,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:24,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845618960] [2025-02-08 05:39:24,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:24,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:24,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:24,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:24,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:24,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 222 [2025-02-08 05:39:24,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 184 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:24,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:24,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 222 [2025-02-08 05:39:24,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:24,149 INFO L124 PetriNetUnfolderBase]: 181/808 cut-off events. [2025-02-08 05:39:24,149 INFO L125 PetriNetUnfolderBase]: For 32/41 co-relation queries the response was YES. [2025-02-08 05:39:24,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1211 conditions, 808 events. 181/808 cut-off events. For 32/41 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4509 event pairs, 62 based on Foata normal form. 0/716 useless extension candidates. Maximal degree in co-relation 1019. Up to 183 conditions per place. [2025-02-08 05:39:24,154 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 22 selfloop transitions, 2 changer transitions 0/189 dead transitions. [2025-02-08 05:39:24,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 189 transitions, 481 flow [2025-02-08 05:39:24,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:24,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 618 transitions. [2025-02-08 05:39:24,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9279279279279279 [2025-02-08 05:39:24,157 INFO L175 Difference]: Start difference. First operand has 185 places, 184 transitions, 420 flow. Second operand 3 states and 618 transitions. [2025-02-08 05:39:24,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 189 transitions, 481 flow [2025-02-08 05:39:24,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 189 transitions, 477 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:24,160 INFO L231 Difference]: Finished difference. Result has 184 places, 183 transitions, 418 flow [2025-02-08 05:39:24,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=184, PETRI_TRANSITIONS=183} [2025-02-08 05:39:24,161 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -13 predicate places. [2025-02-08 05:39:24,162 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 183 transitions, 418 flow [2025-02-08 05:39:24,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:24,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:24,162 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] [2025-02-08 05:39:24,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:39:24,162 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-02-08 05:39:24,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:24,163 INFO L85 PathProgramCache]: Analyzing trace with hash -554403504, now seen corresponding path program 1 times [2025-02-08 05:39:24,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:24,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668703541] [2025-02-08 05:39:24,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:24,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:24,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 05:39:24,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 05:39:24,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:24,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:24,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:24,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668703541] [2025-02-08 05:39:24,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668703541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:24,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:24,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:24,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680392772] [2025-02-08 05:39:24,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:24,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:24,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:24,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:24,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:24,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 222 [2025-02-08 05:39:24,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 183 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:24,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:24,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 222 [2025-02-08 05:39:24,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:24,317 INFO L124 PetriNetUnfolderBase]: 277/1193 cut-off events. [2025-02-08 05:39:24,317 INFO L125 PetriNetUnfolderBase]: For 67/71 co-relation queries the response was YES. [2025-02-08 05:39:24,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1770 conditions, 1193 events. 277/1193 cut-off events. For 67/71 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 7494 event pairs, 102 based on Foata normal form. 0/1059 useless extension candidates. Maximal degree in co-relation 1753. Up to 269 conditions per place. [2025-02-08 05:39:24,325 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 22 selfloop transitions, 2 changer transitions 0/188 dead transitions. [2025-02-08 05:39:24,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 188 transitions, 479 flow [2025-02-08 05:39:24,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:24,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:24,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 618 transitions. [2025-02-08 05:39:24,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9279279279279279 [2025-02-08 05:39:24,327 INFO L175 Difference]: Start difference. First operand has 184 places, 183 transitions, 418 flow. Second operand 3 states and 618 transitions. [2025-02-08 05:39:24,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 188 transitions, 479 flow [2025-02-08 05:39:24,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 188 transitions, 475 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:24,329 INFO L231 Difference]: Finished difference. Result has 183 places, 182 transitions, 416 flow [2025-02-08 05:39:24,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=416, PETRI_PLACES=183, PETRI_TRANSITIONS=182} [2025-02-08 05:39:24,330 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -14 predicate places. [2025-02-08 05:39:24,330 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 182 transitions, 416 flow [2025-02-08 05:39:24,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:24,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:24,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:24,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:39:24,331 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-02-08 05:39:24,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:24,332 INFO L85 PathProgramCache]: Analyzing trace with hash 577968947, now seen corresponding path program 1 times [2025-02-08 05:39:24,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:24,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543787732] [2025-02-08 05:39:24,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:24,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:24,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-08 05:39:24,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 05:39:24,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:24,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:24,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:24,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:24,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543787732] [2025-02-08 05:39:24,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543787732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:24,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:24,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:24,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346990047] [2025-02-08 05:39:24,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:24,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:24,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:24,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:24,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:24,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 222 [2025-02-08 05:39:24,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 182 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:24,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:24,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 222 [2025-02-08 05:39:24,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:24,462 INFO L124 PetriNetUnfolderBase]: 240/975 cut-off events. [2025-02-08 05:39:24,463 INFO L125 PetriNetUnfolderBase]: For 94/101 co-relation queries the response was YES. [2025-02-08 05:39:24,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1467 conditions, 975 events. 240/975 cut-off events. For 94/101 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 6260 event pairs, 98 based on Foata normal form. 0/882 useless extension candidates. Maximal degree in co-relation 1434. Up to 254 conditions per place. [2025-02-08 05:39:24,466 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 0 selfloop transitions, 0 changer transitions 187/187 dead transitions. [2025-02-08 05:39:24,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 187 transitions, 476 flow [2025-02-08 05:39:24,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:24,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:24,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 618 transitions. [2025-02-08 05:39:24,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9279279279279279 [2025-02-08 05:39:24,467 INFO L175 Difference]: Start difference. First operand has 183 places, 182 transitions, 416 flow. Second operand 3 states and 618 transitions. [2025-02-08 05:39:24,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 187 transitions, 476 flow [2025-02-08 05:39:24,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 187 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:24,469 INFO L231 Difference]: Finished difference. Result has 182 places, 0 transitions, 0 flow [2025-02-08 05:39:24,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=182, PETRI_TRANSITIONS=0} [2025-02-08 05:39:24,469 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -15 predicate places. [2025-02-08 05:39:24,469 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 0 transitions, 0 flow [2025-02-08 05:39:24,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:24,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (44 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (43 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (42 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (41 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (40 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (39 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (38 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (37 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (36 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (35 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (34 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (33 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (32 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (31 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (30 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (29 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (28 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (27 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (17 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (16 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (15 of 45 remaining) [2025-02-08 05:39:24,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (14 of 45 remaining) [2025-02-08 05:39:24,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (13 of 45 remaining) [2025-02-08 05:39:24,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (12 of 45 remaining) [2025-02-08 05:39:24,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 45 remaining) [2025-02-08 05:39:24,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (10 of 45 remaining) [2025-02-08 05:39:24,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (9 of 45 remaining) [2025-02-08 05:39:24,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 45 remaining) [2025-02-08 05:39:24,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (7 of 45 remaining) [2025-02-08 05:39:24,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (6 of 45 remaining) [2025-02-08 05:39:24,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 45 remaining) [2025-02-08 05:39:24,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 45 remaining) [2025-02-08 05:39:24,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 45 remaining) [2025-02-08 05:39:24,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 45 remaining) [2025-02-08 05:39:24,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 45 remaining) [2025-02-08 05:39:24,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 45 remaining) [2025-02-08 05:39:24,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:39:24,473 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:24,477 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:39:24,477 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:39:24,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:39:24 BasicIcfg [2025-02-08 05:39:24,481 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:39:24,481 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:39:24,481 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:39:24,481 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:39:24,482 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:20" (3/4) ... [2025-02-08 05:39:24,483 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:39:24,485 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:39:24,485 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:39:24,485 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:39:24,487 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-08 05:39:24,488 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:39:24,488 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:39:24,488 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:39:24,545 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:39:24,545 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:39:24,546 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:39:24,546 INFO L158 Benchmark]: Toolchain (without parser) took 4266.57ms. Allocated memory was 142.6MB in the beginning and 234.9MB in the end (delta: 92.3MB). Free memory was 113.0MB in the beginning and 183.9MB in the end (delta: -70.9MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:24,547 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 122.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:24,547 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.27ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 100.7MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:24,547 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.47ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:24,548 INFO L158 Benchmark]: Boogie Preprocessor took 28.95ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 98.8MB in the end (delta: 881.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:24,548 INFO L158 Benchmark]: IcfgBuilder took 439.00ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 78.8MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:39:24,548 INFO L158 Benchmark]: TraceAbstraction took 3508.62ms. Allocated memory was 142.6MB in the beginning and 234.9MB in the end (delta: 92.3MB). Free memory was 77.9MB in the beginning and 187.9MB in the end (delta: -110.0MB). Peak memory consumption was 77.1MB. Max. memory is 16.1GB. [2025-02-08 05:39:24,548 INFO L158 Benchmark]: Witness Printer took 64.55ms. Allocated memory is still 234.9MB. Free memory was 187.9MB in the beginning and 183.9MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:24,549 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 122.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.27ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 100.7MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.47ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.95ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 98.8MB in the end (delta: 881.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 439.00ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 78.8MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3508.62ms. Allocated memory was 142.6MB in the beginning and 234.9MB in the end (delta: 92.3MB). Free memory was 77.9MB in the beginning and 187.9MB in the end (delta: -110.0MB). Peak memory consumption was 77.1MB. Max. memory is 16.1GB. * Witness Printer took 64.55ms. Allocated memory is still 234.9MB. Free memory was 187.9MB in the beginning and 183.9MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 65]: 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: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: 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: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 326 locations, 45 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: 3.4s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 502 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 206 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 798 IncrementalHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 26 mSDtfsCounter, 798 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=423occurred in iteration=13, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1052 NumberOfCodeBlocks, 1052 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1034 ConstructedInterpolants, 0 QuantifiedInterpolants, 1070 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 24 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:39:24,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE