./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/bench-exp2x6.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/bench-exp2x6.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 1f93f8af6c620ba8dc44e82cf4c30bbca874545f3e3802e43ba4e1345a3afed4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:36:57,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:36:57,385 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:36:57,388 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:36:57,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:36:57,403 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:36:57,404 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:36:57,404 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:36:57,404 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:36:57,404 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:36:57,405 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:36:57,405 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:36:57,405 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:36:57,405 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:36:57,405 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:36:57,405 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:36:57,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:36:57,405 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:36:57,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:36:57,405 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:36:57,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:36:57,406 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:36:57,406 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:36:57,406 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:36:57,406 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:36:57,406 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:36:57,406 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:36:57,406 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:36:57,406 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:36:57,406 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:36:57,406 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:36:57,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:36:57,407 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:36:57,407 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:36:57,407 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:36:57,407 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:36:57,407 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:36:57,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:36:57,407 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:36:57,407 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:36:57,407 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:36:57,407 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:36:57,407 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 -> 1f93f8af6c620ba8dc44e82cf4c30bbca874545f3e3802e43ba4e1345a3afed4 [2025-02-08 05:36:57,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:36:57,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:36:57,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:36:57,598 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:36:57,598 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:36:57,600 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp2x6.wvr.c [2025-02-08 05:36:58,832 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61d2ff387/04dd4aa898a04a698ea7f57d754cca34/FLAGf45fb6e84 [2025-02-08 05:36:59,133 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:36:59,135 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x6.wvr.c [2025-02-08 05:36:59,151 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61d2ff387/04dd4aa898a04a698ea7f57d754cca34/FLAGf45fb6e84 [2025-02-08 05:36:59,189 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61d2ff387/04dd4aa898a04a698ea7f57d754cca34 [2025-02-08 05:36:59,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:36:59,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:36:59,195 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:36:59,195 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:36:59,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:36:59,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:36:59" (1/1) ... [2025-02-08 05:36:59,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68830355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:59, skipping insertion in model container [2025-02-08 05:36:59,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:36:59" (1/1) ... [2025-02-08 05:36:59,217 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:36:59,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:36:59,362 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:36:59,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:36:59,401 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:36:59,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:59 WrapperNode [2025-02-08 05:36:59,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:36:59,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:36:59,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:36:59,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:36:59,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:59" (1/1) ... [2025-02-08 05:36:59,415 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:59" (1/1) ... [2025-02-08 05:36:59,429 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2025-02-08 05:36:59,429 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:36:59,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:36:59,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:36:59,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:36:59,435 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:59" (1/1) ... [2025-02-08 05:36:59,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:59" (1/1) ... [2025-02-08 05:36:59,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:59" (1/1) ... [2025-02-08 05:36:59,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:59" (1/1) ... [2025-02-08 05:36:59,441 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:59" (1/1) ... [2025-02-08 05:36:59,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:59" (1/1) ... [2025-02-08 05:36:59,445 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:59" (1/1) ... [2025-02-08 05:36:59,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:59" (1/1) ... [2025-02-08 05:36:59,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:36:59,453 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:36:59,453 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:36:59,453 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:36:59,454 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:59" (1/1) ... [2025-02-08 05:36:59,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:36:59,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:36:59,488 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:36:59,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:36:59,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:36:59,520 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:36:59,520 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:36:59,520 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:36:59,520 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:36:59,520 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:36:59,520 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:36:59,520 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-08 05:36:59,520 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-08 05:36:59,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:36:59,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:36:59,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:36:59,522 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:36:59,587 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:36:59,588 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:37:00,011 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:37:00,012 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:37:00,037 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:37:00,037 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:37:00,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:00 BoogieIcfgContainer [2025-02-08 05:37:00,038 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:37:00,043 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:37:00,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:37:00,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:37:00,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:36:59" (1/3) ... [2025-02-08 05:37:00,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ec460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:00, skipping insertion in model container [2025-02-08 05:37:00,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:59" (2/3) ... [2025-02-08 05:37:00,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ec460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:00, skipping insertion in model container [2025-02-08 05:37:00,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:00" (3/3) ... [2025-02-08 05:37:00,053 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp2x6.wvr.c [2025-02-08 05:37:00,072 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:37:00,074 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp2x6.wvr.c that has 5 procedures, 390 locations, 1 initial locations, 4 loop locations, and 71 error locations. [2025-02-08 05:37:00,077 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:37:00,186 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 05:37:00,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 402 places, 403 transitions, 834 flow [2025-02-08 05:37:00,382 INFO L124 PetriNetUnfolderBase]: 14/399 cut-off events. [2025-02-08 05:37:00,384 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:37:00,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 399 events. 14/399 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1194 event pairs, 0 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 305. Up to 2 conditions per place. [2025-02-08 05:37:00,392 INFO L82 GeneralOperation]: Start removeDead. Operand has 402 places, 403 transitions, 834 flow [2025-02-08 05:37:00,399 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 380 places, 379 transitions, 782 flow [2025-02-08 05:37:00,405 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:37:00,412 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;@3e1de2eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:37:00,413 INFO L334 AbstractCegarLoop]: Starting to check reachability of 131 error locations. [2025-02-08 05:37:00,419 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:37:00,419 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-02-08 05:37:00,419 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:37:00,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:00,419 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:37:00,420 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-08 05:37:00,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:00,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1861703983, now seen corresponding path program 1 times [2025-02-08 05:37:00,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:00,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384829566] [2025-02-08 05:37:00,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:00,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:00,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:37:00,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:37:00,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:00,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:00,526 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:37:00,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:00,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384829566] [2025-02-08 05:37:00,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384829566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:00,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:00,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:00,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761836598] [2025-02-08 05:37:00,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:00,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:00,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:00,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:00,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:00,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 403 [2025-02-08 05:37:00,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 379 transitions, 782 flow. Second operand has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:00,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:00,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 403 [2025-02-08 05:37:00,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:00,781 INFO L124 PetriNetUnfolderBase]: 49/589 cut-off events. [2025-02-08 05:37:00,784 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-02-08 05:37:00,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 795 conditions, 589 events. 49/589 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2913 event pairs, 39 based on Foata normal form. 91/555 useless extension candidates. Maximal degree in co-relation 653. Up to 109 conditions per place. [2025-02-08 05:37:00,809 INFO L140 encePairwiseOnDemand]: 395/403 looper letters, 27 selfloop transitions, 2 changer transitions 1/373 dead transitions. [2025-02-08 05:37:00,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 373 transitions, 828 flow [2025-02-08 05:37:00,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:00,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:00,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2025-02-08 05:37:00,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9346567411083541 [2025-02-08 05:37:00,828 INFO L175 Difference]: Start difference. First operand has 380 places, 379 transitions, 782 flow. Second operand 3 states and 1130 transitions. [2025-02-08 05:37:00,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 373 transitions, 828 flow [2025-02-08 05:37:00,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 373 transitions, 812 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-08 05:37:00,841 INFO L231 Difference]: Finished difference. Result has 373 places, 372 transitions, 756 flow [2025-02-08 05:37:00,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=373, PETRI_TRANSITIONS=372} [2025-02-08 05:37:00,848 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -7 predicate places. [2025-02-08 05:37:00,850 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 372 transitions, 756 flow [2025-02-08 05:37:00,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:00,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:00,851 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:00,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:37:00,852 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-08 05:37:00,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:00,853 INFO L85 PathProgramCache]: Analyzing trace with hash -882295140, now seen corresponding path program 1 times [2025-02-08 05:37:00,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:00,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731274292] [2025-02-08 05:37:00,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:00,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:00,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 05:37:00,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 05:37:00,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:00,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:00,914 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:37:00,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:00,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731274292] [2025-02-08 05:37:00,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731274292] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:00,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:00,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:00,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008636429] [2025-02-08 05:37:00,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:00,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:00,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:00,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:00,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:00,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 403 [2025-02-08 05:37:00,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 372 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:00,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:00,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 403 [2025-02-08 05:37:00,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:01,121 INFO L124 PetriNetUnfolderBase]: 49/587 cut-off events. [2025-02-08 05:37:01,121 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-08 05:37:01,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 587 events. 49/587 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2982 event pairs, 39 based on Foata normal form. 0/464 useless extension candidates. Maximal degree in co-relation 701. Up to 108 conditions per place. [2025-02-08 05:37:01,133 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 26 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2025-02-08 05:37:01,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 371 transitions, 810 flow [2025-02-08 05:37:01,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:01,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:01,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1127 transitions. [2025-02-08 05:37:01,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9321753515301903 [2025-02-08 05:37:01,140 INFO L175 Difference]: Start difference. First operand has 373 places, 372 transitions, 756 flow. Second operand 3 states and 1127 transitions. [2025-02-08 05:37:01,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 371 transitions, 810 flow [2025-02-08 05:37:01,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 371 transitions, 806 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:01,148 INFO L231 Difference]: Finished difference. Result has 371 places, 371 transitions, 754 flow [2025-02-08 05:37:01,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=371, PETRI_TRANSITIONS=371} [2025-02-08 05:37:01,149 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -9 predicate places. [2025-02-08 05:37:01,149 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 371 transitions, 754 flow [2025-02-08 05:37:01,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:01,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:01,151 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:01,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:37:01,152 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-08 05:37:01,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:01,153 INFO L85 PathProgramCache]: Analyzing trace with hash -503242068, now seen corresponding path program 1 times [2025-02-08 05:37:01,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:01,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563595775] [2025-02-08 05:37:01,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:01,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:01,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:37:01,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:37:01,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:01,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:01,215 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:37:01,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:01,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563595775] [2025-02-08 05:37:01,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563595775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:01,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:01,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:01,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359492820] [2025-02-08 05:37:01,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:01,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:01,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:01,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:01,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:01,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 403 [2025-02-08 05:37:01,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 371 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:01,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:01,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 403 [2025-02-08 05:37:01,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:01,399 INFO L124 PetriNetUnfolderBase]: 49/541 cut-off events. [2025-02-08 05:37:01,399 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-02-08 05:37:01,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 541 events. 49/541 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2574 event pairs, 39 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 636. Up to 109 conditions per place. [2025-02-08 05:37:01,411 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2025-02-08 05:37:01,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 370 transitions, 810 flow [2025-02-08 05:37:01,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:01,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:01,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1125 transitions. [2025-02-08 05:37:01,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9305210918114144 [2025-02-08 05:37:01,414 INFO L175 Difference]: Start difference. First operand has 371 places, 371 transitions, 754 flow. Second operand 3 states and 1125 transitions. [2025-02-08 05:37:01,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 370 transitions, 810 flow [2025-02-08 05:37:01,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 370 transitions, 806 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:01,419 INFO L231 Difference]: Finished difference. Result has 370 places, 370 transitions, 752 flow [2025-02-08 05:37:01,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=370, PETRI_TRANSITIONS=370} [2025-02-08 05:37:01,420 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -10 predicate places. [2025-02-08 05:37:01,421 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 370 transitions, 752 flow [2025-02-08 05:37:01,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:01,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:01,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:01,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:37:01,422 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-08 05:37:01,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:01,422 INFO L85 PathProgramCache]: Analyzing trace with hash -941412984, now seen corresponding path program 1 times [2025-02-08 05:37:01,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:01,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499922291] [2025-02-08 05:37:01,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:01,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:01,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 05:37:01,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 05:37:01,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:01,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:01,449 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:37:01,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:01,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499922291] [2025-02-08 05:37:01,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499922291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:01,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:01,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:01,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822812210] [2025-02-08 05:37:01,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:01,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:01,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:01,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:01,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:01,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 403 [2025-02-08 05:37:01,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 370 transitions, 752 flow. Second operand has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:01,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:01,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 403 [2025-02-08 05:37:01,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:01,612 INFO L124 PetriNetUnfolderBase]: 49/495 cut-off events. [2025-02-08 05:37:01,612 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-02-08 05:37:01,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 495 events. 49/495 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2087 event pairs, 39 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 569. Up to 108 conditions per place. [2025-02-08 05:37:01,620 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 26 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2025-02-08 05:37:01,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 369 transitions, 806 flow [2025-02-08 05:37:01,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:01,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:01,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1127 transitions. [2025-02-08 05:37:01,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9321753515301903 [2025-02-08 05:37:01,625 INFO L175 Difference]: Start difference. First operand has 370 places, 370 transitions, 752 flow. Second operand 3 states and 1127 transitions. [2025-02-08 05:37:01,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 369 transitions, 806 flow [2025-02-08 05:37:01,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 369 transitions, 802 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:01,630 INFO L231 Difference]: Finished difference. Result has 369 places, 369 transitions, 750 flow [2025-02-08 05:37:01,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=750, PETRI_PLACES=369, PETRI_TRANSITIONS=369} [2025-02-08 05:37:01,631 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -11 predicate places. [2025-02-08 05:37:01,631 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 369 transitions, 750 flow [2025-02-08 05:37:01,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:01,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:01,632 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:01,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:37:01,632 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-08 05:37:01,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:01,633 INFO L85 PathProgramCache]: Analyzing trace with hash 711113429, now seen corresponding path program 1 times [2025-02-08 05:37:01,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:01,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061091296] [2025-02-08 05:37:01,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:01,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:01,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:37:01,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:37:01,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:01,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:01,661 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:37:01,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:01,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061091296] [2025-02-08 05:37:01,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061091296] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:01,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:01,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:01,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227330879] [2025-02-08 05:37:01,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:01,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:01,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:01,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:01,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:01,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 403 [2025-02-08 05:37:01,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 369 transitions, 750 flow. Second operand has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:01,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:01,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 403 [2025-02-08 05:37:01,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:02,018 INFO L124 PetriNetUnfolderBase]: 102/2206 cut-off events. [2025-02-08 05:37:02,018 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 05:37:02,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2371 conditions, 2206 events. 102/2206 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 18735 event pairs, 51 based on Foata normal form. 0/1664 useless extension candidates. Maximal degree in co-relation 2320. Up to 144 conditions per place. [2025-02-08 05:37:02,039 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 15 selfloop transitions, 2 changer transitions 0/368 dead transitions. [2025-02-08 05:37:02,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 368 transitions, 782 flow [2025-02-08 05:37:02,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:02,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:02,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1149 transitions. [2025-02-08 05:37:02,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9503722084367245 [2025-02-08 05:37:02,042 INFO L175 Difference]: Start difference. First operand has 369 places, 369 transitions, 750 flow. Second operand 3 states and 1149 transitions. [2025-02-08 05:37:02,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 368 transitions, 782 flow [2025-02-08 05:37:02,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 368 transitions, 778 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:02,046 INFO L231 Difference]: Finished difference. Result has 368 places, 368 transitions, 748 flow [2025-02-08 05:37:02,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=368, PETRI_TRANSITIONS=368} [2025-02-08 05:37:02,047 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -12 predicate places. [2025-02-08 05:37:02,047 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 368 transitions, 748 flow [2025-02-08 05:37:02,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:02,048 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:02,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:37:02,048 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-08 05:37:02,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:02,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1929117834, now seen corresponding path program 1 times [2025-02-08 05:37:02,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:02,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727709373] [2025-02-08 05:37:02,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:02,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:02,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 05:37:02,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 05:37:02,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:02,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:02,077 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:37:02,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:02,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727709373] [2025-02-08 05:37:02,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727709373] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:02,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:02,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:02,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166859574] [2025-02-08 05:37:02,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:02,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:02,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:02,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:02,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:02,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 403 [2025-02-08 05:37:02,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 368 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 348.0) internal successors, (1044), 3 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:02,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 403 [2025-02-08 05:37:02,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:02,209 INFO L124 PetriNetUnfolderBase]: 76/573 cut-off events. [2025-02-08 05:37:02,209 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:37:02,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 821 conditions, 573 events. 76/573 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3017 event pairs, 54 based on Foata normal form. 0/489 useless extension candidates. Maximal degree in co-relation 763. Up to 144 conditions per place. [2025-02-08 05:37:02,219 INFO L140 encePairwiseOnDemand]: 382/403 looper letters, 32 selfloop transitions, 9 changer transitions 0/360 dead transitions. [2025-02-08 05:37:02,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 360 transitions, 817 flow [2025-02-08 05:37:02,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:02,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:02,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1094 transitions. [2025-02-08 05:37:02,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9048800661703887 [2025-02-08 05:37:02,221 INFO L175 Difference]: Start difference. First operand has 368 places, 368 transitions, 748 flow. Second operand 3 states and 1094 transitions. [2025-02-08 05:37:02,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 360 transitions, 817 flow [2025-02-08 05:37:02,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 360 transitions, 813 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:02,228 INFO L231 Difference]: Finished difference. Result has 357 places, 357 transitions, 751 flow [2025-02-08 05:37:02,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=751, PETRI_PLACES=357, PETRI_TRANSITIONS=357} [2025-02-08 05:37:02,229 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -23 predicate places. [2025-02-08 05:37:02,230 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 357 transitions, 751 flow [2025-02-08 05:37:02,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.0) internal successors, (1044), 3 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:02,230 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] [2025-02-08 05:37:02,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:37:02,231 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-08 05:37:02,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:02,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1543613862, now seen corresponding path program 1 times [2025-02-08 05:37:02,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:02,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425962210] [2025-02-08 05:37:02,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:02,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:02,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 05:37:02,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 05:37:02,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:02,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:02,263 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:37:02,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:02,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425962210] [2025-02-08 05:37:02,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425962210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:02,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:02,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:02,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164355440] [2025-02-08 05:37:02,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:02,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:02,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:02,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:02,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:02,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 403 [2025-02-08 05:37:02,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 357 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 351.0) internal successors, (1053), 3 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:02,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 403 [2025-02-08 05:37:02,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:02,412 INFO L124 PetriNetUnfolderBase]: 76/563 cut-off events. [2025-02-08 05:37:02,412 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-02-08 05:37:02,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 563 events. 76/563 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3008 event pairs, 54 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 694. Up to 142 conditions per place. [2025-02-08 05:37:02,422 INFO L140 encePairwiseOnDemand]: 383/403 looper letters, 30 selfloop transitions, 9 changer transitions 0/350 dead transitions. [2025-02-08 05:37:02,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 350 transitions, 818 flow [2025-02-08 05:37:02,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2025-02-08 05:37:02,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9098428453267163 [2025-02-08 05:37:02,425 INFO L175 Difference]: Start difference. First operand has 357 places, 357 transitions, 751 flow. Second operand 3 states and 1100 transitions. [2025-02-08 05:37:02,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 350 transitions, 818 flow [2025-02-08 05:37:02,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 350 transitions, 809 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:02,431 INFO L231 Difference]: Finished difference. Result has 348 places, 347 transitions, 751 flow [2025-02-08 05:37:02,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=751, PETRI_PLACES=348, PETRI_TRANSITIONS=347} [2025-02-08 05:37:02,433 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -32 predicate places. [2025-02-08 05:37:02,433 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 347 transitions, 751 flow [2025-02-08 05:37:02,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 351.0) internal successors, (1053), 3 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:02,434 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] [2025-02-08 05:37:02,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:37:02,434 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-08 05:37:02,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:02,435 INFO L85 PathProgramCache]: Analyzing trace with hash -555462144, now seen corresponding path program 1 times [2025-02-08 05:37:02,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:02,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701704909] [2025-02-08 05:37:02,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:02,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:02,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 05:37:02,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 05:37:02,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:02,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:02,495 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:37:02,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:02,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701704909] [2025-02-08 05:37:02,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701704909] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:02,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:02,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:02,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566556169] [2025-02-08 05:37:02,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:02,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:02,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:02,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:02,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:02,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 403 [2025-02-08 05:37:02,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 347 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 348.0) internal successors, (1044), 3 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:02,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 403 [2025-02-08 05:37:02,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:02,634 INFO L124 PetriNetUnfolderBase]: 83/744 cut-off events. [2025-02-08 05:37:02,635 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-02-08 05:37:02,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 744 events. 83/744 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4314 event pairs, 12 based on Foata normal form. 0/664 useless extension candidates. Maximal degree in co-relation 851. Up to 148 conditions per place. [2025-02-08 05:37:02,644 INFO L140 encePairwiseOnDemand]: 381/403 looper letters, 35 selfloop transitions, 10 changer transitions 0/343 dead transitions. [2025-02-08 05:37:02,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 343 transitions, 839 flow [2025-02-08 05:37:02,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:02,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:02,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1098 transitions. [2025-02-08 05:37:02,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9081885856079405 [2025-02-08 05:37:02,647 INFO L175 Difference]: Start difference. First operand has 348 places, 347 transitions, 751 flow. Second operand 3 states and 1098 transitions. [2025-02-08 05:37:02,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 343 transitions, 839 flow [2025-02-08 05:37:02,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 343 transitions, 830 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:02,651 INFO L231 Difference]: Finished difference. Result has 338 places, 337 transitions, 756 flow [2025-02-08 05:37:02,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=338, PETRI_TRANSITIONS=337} [2025-02-08 05:37:02,651 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -42 predicate places. [2025-02-08 05:37:02,652 INFO L471 AbstractCegarLoop]: Abstraction has has 338 places, 337 transitions, 756 flow [2025-02-08 05:37:02,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.0) internal successors, (1044), 3 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:02,652 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:37:02,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:37:02,652 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-08 05:37:02,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:02,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1223153841, now seen corresponding path program 1 times [2025-02-08 05:37:02,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:02,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476707458] [2025-02-08 05:37:02,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:02,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:02,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:37:02,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:37:02,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:02,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:02,702 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:37:02,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:02,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476707458] [2025-02-08 05:37:02,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476707458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:02,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:02,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:37:02,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912017732] [2025-02-08 05:37:02,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:02,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:37:02,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:02,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:37:02,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:37:02,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 403 [2025-02-08 05:37:02,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 337 transitions, 756 flow. Second operand has 4 states, 4 states have (on average 377.25) internal successors, (1509), 4 states have internal predecessors, (1509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:02,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 403 [2025-02-08 05:37:02,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:02,786 INFO L124 PetriNetUnfolderBase]: 12/569 cut-off events. [2025-02-08 05:37:02,786 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:37:02,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 569 events. 12/569 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2418 event pairs, 0 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 474. Up to 26 conditions per place. [2025-02-08 05:37:02,790 INFO L140 encePairwiseOnDemand]: 397/403 looper letters, 19 selfloop transitions, 5 changer transitions 0/342 dead transitions. [2025-02-08 05:37:02,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 342 transitions, 814 flow [2025-02-08 05:37:02,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:37:02,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:37:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1905 transitions. [2025-02-08 05:37:02,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9454094292803971 [2025-02-08 05:37:02,793 INFO L175 Difference]: Start difference. First operand has 338 places, 337 transitions, 756 flow. Second operand 5 states and 1905 transitions. [2025-02-08 05:37:02,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 342 transitions, 814 flow [2025-02-08 05:37:02,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 342 transitions, 804 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:02,797 INFO L231 Difference]: Finished difference. Result has 345 places, 341 transitions, 784 flow [2025-02-08 05:37:02,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=784, PETRI_PLACES=345, PETRI_TRANSITIONS=341} [2025-02-08 05:37:02,798 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -35 predicate places. [2025-02-08 05:37:02,798 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 341 transitions, 784 flow [2025-02-08 05:37:02,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 377.25) internal successors, (1509), 4 states have internal predecessors, (1509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:02,799 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:37:02,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:37:02,799 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-08 05:37:02,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:02,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1227721018, now seen corresponding path program 1 times [2025-02-08 05:37:02,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:02,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821160600] [2025-02-08 05:37:02,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:02,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:02,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 05:37:02,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 05:37:02,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:02,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:02,832 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:37:02,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:02,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821160600] [2025-02-08 05:37:02,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821160600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:02,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:02,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:02,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539879178] [2025-02-08 05:37:02,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:02,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:02,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:02,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:02,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:02,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 403 [2025-02-08 05:37:02,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 341 transitions, 784 flow. Second operand has 3 states, 3 states have (on average 351.0) internal successors, (1053), 3 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:02,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 403 [2025-02-08 05:37:02,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:03,010 INFO L124 PetriNetUnfolderBase]: 133/1059 cut-off events. [2025-02-08 05:37:03,010 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2025-02-08 05:37:03,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1477 conditions, 1059 events. 133/1059 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 7197 event pairs, 20 based on Foata normal form. 1/979 useless extension candidates. Maximal degree in co-relation 1115. Up to 236 conditions per place. [2025-02-08 05:37:03,024 INFO L140 encePairwiseOnDemand]: 383/403 looper letters, 31 selfloop transitions, 9 changer transitions 10/338 dead transitions. [2025-02-08 05:37:03,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 338 transitions, 869 flow [2025-02-08 05:37:03,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:03,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:03,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1103 transitions. [2025-02-08 05:37:03,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.91232423490488 [2025-02-08 05:37:03,027 INFO L175 Difference]: Start difference. First operand has 345 places, 341 transitions, 784 flow. Second operand 3 states and 1103 transitions. [2025-02-08 05:37:03,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 338 transitions, 869 flow [2025-02-08 05:37:03,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 338 transitions, 869 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:03,031 INFO L231 Difference]: Finished difference. Result has 337 places, 321 transitions, 772 flow [2025-02-08 05:37:03,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=337, PETRI_TRANSITIONS=321} [2025-02-08 05:37:03,032 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -43 predicate places. [2025-02-08 05:37:03,032 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 321 transitions, 772 flow [2025-02-08 05:37:03,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 351.0) internal successors, (1053), 3 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:03,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:03,033 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:03,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:37:03,033 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-08 05:37:03,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:03,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1657046201, now seen corresponding path program 1 times [2025-02-08 05:37:03,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:03,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876265278] [2025-02-08 05:37:03,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:03,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:03,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-08 05:37:03,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 05:37:03,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:03,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:03,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:37:03,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:03,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876265278] [2025-02-08 05:37:03,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876265278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:03,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:03,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:03,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227734944] [2025-02-08 05:37:03,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:03,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:03,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:03,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:03,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:03,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 403 [2025-02-08 05:37:03,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 321 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:03,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:03,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 403 [2025-02-08 05:37:03,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:03,980 INFO L124 PetriNetUnfolderBase]: 751/9298 cut-off events. [2025-02-08 05:37:03,981 INFO L125 PetriNetUnfolderBase]: For 280/280 co-relation queries the response was YES. [2025-02-08 05:37:04,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12087 conditions, 9298 events. 751/9298 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 115212 event pairs, 349 based on Foata normal form. 0/8257 useless extension candidates. Maximal degree in co-relation 9115. Up to 1015 conditions per place. [2025-02-08 05:37:04,054 INFO L140 encePairwiseOnDemand]: 395/403 looper letters, 19 selfloop transitions, 4 changer transitions 0/324 dead transitions. [2025-02-08 05:37:04,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 324 transitions, 827 flow [2025-02-08 05:37:04,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:04,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:04,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1152 transitions. [2025-02-08 05:37:04,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9528535980148883 [2025-02-08 05:37:04,057 INFO L175 Difference]: Start difference. First operand has 337 places, 321 transitions, 772 flow. Second operand 3 states and 1152 transitions. [2025-02-08 05:37:04,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 324 transitions, 827 flow [2025-02-08 05:37:04,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 324 transitions, 818 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:04,073 INFO L231 Difference]: Finished difference. Result has 325 places, 321 transitions, 783 flow [2025-02-08 05:37:04,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=783, PETRI_PLACES=325, PETRI_TRANSITIONS=321} [2025-02-08 05:37:04,077 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -55 predicate places. [2025-02-08 05:37:04,077 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 321 transitions, 783 flow [2025-02-08 05:37:04,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:04,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:04,078 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:04,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:37:04,078 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-08 05:37:04,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:04,079 INFO L85 PathProgramCache]: Analyzing trace with hash 646215, now seen corresponding path program 1 times [2025-02-08 05:37:04,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:04,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887481404] [2025-02-08 05:37:04,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:04,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:04,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-08 05:37:04,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-08 05:37:04,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:04,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:04,144 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:37:04,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:04,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887481404] [2025-02-08 05:37:04,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887481404] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:04,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:04,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:04,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432145099] [2025-02-08 05:37:04,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:04,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:04,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:04,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:04,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:04,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2025-02-08 05:37:04,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 321 transitions, 783 flow. Second operand has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:04,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:04,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2025-02-08 05:37:04,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:04,830 INFO L124 PetriNetUnfolderBase]: 284/2834 cut-off events. [2025-02-08 05:37:04,830 INFO L125 PetriNetUnfolderBase]: For 95/107 co-relation queries the response was YES. [2025-02-08 05:37:04,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4016 conditions, 2834 events. 284/2834 cut-off events. For 95/107 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 26432 event pairs, 145 based on Foata normal form. 0/2549 useless extension candidates. Maximal degree in co-relation 2727. Up to 339 conditions per place. [2025-02-08 05:37:04,890 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 28 selfloop transitions, 2 changer transitions 0/323 dead transitions. [2025-02-08 05:37:04,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 323 transitions, 850 flow [2025-02-08 05:37:04,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:04,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:04,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-02-08 05:37:04,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-02-08 05:37:04,893 INFO L175 Difference]: Start difference. First operand has 325 places, 321 transitions, 783 flow. Second operand 3 states and 1131 transitions. [2025-02-08 05:37:04,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 323 transitions, 850 flow [2025-02-08 05:37:04,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 323 transitions, 850 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:04,900 INFO L231 Difference]: Finished difference. Result has 326 places, 320 transitions, 785 flow [2025-02-08 05:37:04,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=785, PETRI_PLACES=326, PETRI_TRANSITIONS=320} [2025-02-08 05:37:04,901 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -54 predicate places. [2025-02-08 05:37:04,902 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 320 transitions, 785 flow [2025-02-08 05:37:04,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:04,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:04,903 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:04,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:37:04,904 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-08 05:37:04,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:04,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2047089305, now seen corresponding path program 1 times [2025-02-08 05:37:04,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:04,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651107141] [2025-02-08 05:37:04,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:04,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:04,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 05:37:04,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 05:37:04,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:04,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:04,967 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:37:04,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:04,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651107141] [2025-02-08 05:37:04,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651107141] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:04,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:04,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:04,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905376993] [2025-02-08 05:37:04,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:04,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:04,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:04,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:04,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:05,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2025-02-08 05:37:05,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 320 transitions, 785 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:05,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:05,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2025-02-08 05:37:05,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:05,646 INFO L124 PetriNetUnfolderBase]: 503/3658 cut-off events. [2025-02-08 05:37:05,646 INFO L125 PetriNetUnfolderBase]: For 337/345 co-relation queries the response was YES. [2025-02-08 05:37:05,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5557 conditions, 3658 events. 503/3658 cut-off events. For 337/345 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 36653 event pairs, 310 based on Foata normal form. 0/3316 useless extension candidates. Maximal degree in co-relation 5356. Up to 766 conditions per place. [2025-02-08 05:37:05,678 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/322 dead transitions. [2025-02-08 05:37:05,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 322 transitions, 850 flow [2025-02-08 05:37:05,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:05,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:05,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-02-08 05:37:05,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2025-02-08 05:37:05,686 INFO L175 Difference]: Start difference. First operand has 326 places, 320 transitions, 785 flow. Second operand 3 states and 1133 transitions. [2025-02-08 05:37:05,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 322 transitions, 850 flow [2025-02-08 05:37:05,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 322 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:05,699 INFO L231 Difference]: Finished difference. Result has 325 places, 319 transitions, 783 flow [2025-02-08 05:37:05,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=783, PETRI_PLACES=325, PETRI_TRANSITIONS=319} [2025-02-08 05:37:05,700 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -55 predicate places. [2025-02-08 05:37:05,700 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 319 transitions, 783 flow [2025-02-08 05:37:05,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:05,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:05,704 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:05,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:37:05,704 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-08 05:37:05,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:05,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1361836972, now seen corresponding path program 1 times [2025-02-08 05:37:05,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:05,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124592265] [2025-02-08 05:37:05,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:05,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:05,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 05:37:05,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 05:37:05,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:05,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:05,779 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:37:05,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:05,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124592265] [2025-02-08 05:37:05,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124592265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:05,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:05,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:05,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588380371] [2025-02-08 05:37:05,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:05,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:05,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:05,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:05,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:05,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2025-02-08 05:37:05,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 319 transitions, 783 flow. Second operand has 3 states, 3 states have (on average 371.0) internal successors, (1113), 3 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:05,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:05,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2025-02-08 05:37:05,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:06,095 INFO L124 PetriNetUnfolderBase]: 284/2810 cut-off events. [2025-02-08 05:37:06,095 INFO L125 PetriNetUnfolderBase]: For 107/116 co-relation queries the response was YES. [2025-02-08 05:37:06,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4017 conditions, 2810 events. 284/2810 cut-off events. For 107/116 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 26111 event pairs, 145 based on Foata normal form. 0/2549 useless extension candidates. Maximal degree in co-relation 3417. Up to 339 conditions per place. [2025-02-08 05:37:06,129 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 28 selfloop transitions, 2 changer transitions 0/321 dead transitions. [2025-02-08 05:37:06,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 321 transitions, 850 flow [2025-02-08 05:37:06,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:06,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:06,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-02-08 05:37:06,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-02-08 05:37:06,132 INFO L175 Difference]: Start difference. First operand has 325 places, 319 transitions, 783 flow. Second operand 3 states and 1131 transitions. [2025-02-08 05:37:06,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 321 transitions, 850 flow [2025-02-08 05:37:06,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 321 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:06,138 INFO L231 Difference]: Finished difference. Result has 324 places, 318 transitions, 781 flow [2025-02-08 05:37:06,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=781, PETRI_PLACES=324, PETRI_TRANSITIONS=318} [2025-02-08 05:37:06,138 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -56 predicate places. [2025-02-08 05:37:06,139 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 318 transitions, 781 flow [2025-02-08 05:37:06,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.0) internal successors, (1113), 3 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:06,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:06,139 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:06,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:37:06,140 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-08 05:37:06,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:06,140 INFO L85 PathProgramCache]: Analyzing trace with hash 931209622, now seen corresponding path program 1 times [2025-02-08 05:37:06,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:06,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394746723] [2025-02-08 05:37:06,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:06,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:06,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 05:37:06,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 05:37:06,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:06,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:06,188 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:37:06,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:06,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394746723] [2025-02-08 05:37:06,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394746723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:06,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:06,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:06,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216641914] [2025-02-08 05:37:06,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:06,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:06,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:06,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:06,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:06,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2025-02-08 05:37:06,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 318 transitions, 781 flow. Second operand has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:06,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:06,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2025-02-08 05:37:06,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:06,552 INFO L124 PetriNetUnfolderBase]: 345/2824 cut-off events. [2025-02-08 05:37:06,553 INFO L125 PetriNetUnfolderBase]: For 279/282 co-relation queries the response was YES. [2025-02-08 05:37:06,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4170 conditions, 2824 events. 345/2824 cut-off events. For 279/282 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 26118 event pairs, 197 based on Foata normal form. 0/2565 useless extension candidates. Maximal degree in co-relation 4019. Up to 538 conditions per place. [2025-02-08 05:37:06,580 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 29 selfloop transitions, 2 changer transitions 0/320 dead transitions. [2025-02-08 05:37:06,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 320 transitions, 850 flow [2025-02-08 05:37:06,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:06,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:06,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-02-08 05:37:06,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-02-08 05:37:06,582 INFO L175 Difference]: Start difference. First operand has 324 places, 318 transitions, 781 flow. Second operand 3 states and 1131 transitions. [2025-02-08 05:37:06,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 320 transitions, 850 flow [2025-02-08 05:37:06,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 320 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:06,586 INFO L231 Difference]: Finished difference. Result has 323 places, 317 transitions, 779 flow [2025-02-08 05:37:06,586 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=779, PETRI_PLACES=323, PETRI_TRANSITIONS=317} [2025-02-08 05:37:06,587 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -57 predicate places. [2025-02-08 05:37:06,587 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 317 transitions, 779 flow [2025-02-08 05:37:06,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:06,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:06,588 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:06,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:37:06,588 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-08 05:37:06,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:06,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1076027024, now seen corresponding path program 1 times [2025-02-08 05:37:06,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:06,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043285267] [2025-02-08 05:37:06,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:06,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:06,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 05:37:06,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 05:37:06,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:06,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:06,618 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:37:06,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:06,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043285267] [2025-02-08 05:37:06,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043285267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:06,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:06,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:06,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789189830] [2025-02-08 05:37:06,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:06,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:06,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:06,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:06,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:06,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2025-02-08 05:37:06,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 317 transitions, 779 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:06,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:06,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2025-02-08 05:37:06,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:07,106 INFO L124 PetriNetUnfolderBase]: 515/3745 cut-off events. [2025-02-08 05:37:07,106 INFO L125 PetriNetUnfolderBase]: For 346/352 co-relation queries the response was YES. [2025-02-08 05:37:07,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5702 conditions, 3745 events. 515/3745 cut-off events. For 346/352 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 37208 event pairs, 310 based on Foata normal form. 0/3433 useless extension candidates. Maximal degree in co-relation 5010. Up to 766 conditions per place. [2025-02-08 05:37:07,155 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/319 dead transitions. [2025-02-08 05:37:07,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 319 transitions, 844 flow [2025-02-08 05:37:07,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:07,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:07,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-02-08 05:37:07,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2025-02-08 05:37:07,157 INFO L175 Difference]: Start difference. First operand has 323 places, 317 transitions, 779 flow. Second operand 3 states and 1133 transitions. [2025-02-08 05:37:07,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 319 transitions, 844 flow [2025-02-08 05:37:07,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 319 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:07,162 INFO L231 Difference]: Finished difference. Result has 322 places, 316 transitions, 777 flow [2025-02-08 05:37:07,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=777, PETRI_PLACES=322, PETRI_TRANSITIONS=316} [2025-02-08 05:37:07,163 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -58 predicate places. [2025-02-08 05:37:07,163 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 316 transitions, 777 flow [2025-02-08 05:37:07,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:07,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:07,164 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:07,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:37:07,164 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread4Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-08 05:37:07,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:07,164 INFO L85 PathProgramCache]: Analyzing trace with hash 713073575, now seen corresponding path program 1 times [2025-02-08 05:37:07,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:07,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141148371] [2025-02-08 05:37:07,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:07,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:07,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 05:37:07,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 05:37:07,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:07,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:07,191 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:37:07,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:07,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141148371] [2025-02-08 05:37:07,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141148371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:07,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:07,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:07,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227574686] [2025-02-08 05:37:07,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:07,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:07,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:07,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:07,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:07,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2025-02-08 05:37:07,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 316 transitions, 777 flow. Second operand has 3 states, 3 states have (on average 371.6666666666667) internal successors, (1115), 3 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:07,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:07,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2025-02-08 05:37:07,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:07,457 INFO L124 PetriNetUnfolderBase]: 190/2162 cut-off events. [2025-02-08 05:37:07,457 INFO L125 PetriNetUnfolderBase]: For 192/199 co-relation queries the response was YES. [2025-02-08 05:37:07,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3017 conditions, 2162 events. 190/2162 cut-off events. For 192/199 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 18293 event pairs, 84 based on Foata normal form. 1/1976 useless extension candidates. Maximal degree in co-relation 2571. Up to 282 conditions per place. [2025-02-08 05:37:07,480 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/318 dead transitions. [2025-02-08 05:37:07,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 318 transitions, 842 flow [2025-02-08 05:37:07,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:07,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:07,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-02-08 05:37:07,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2025-02-08 05:37:07,482 INFO L175 Difference]: Start difference. First operand has 322 places, 316 transitions, 777 flow. Second operand 3 states and 1133 transitions. [2025-02-08 05:37:07,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 318 transitions, 842 flow [2025-02-08 05:37:07,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 318 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:07,486 INFO L231 Difference]: Finished difference. Result has 321 places, 315 transitions, 775 flow [2025-02-08 05:37:07,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=775, PETRI_PLACES=321, PETRI_TRANSITIONS=315} [2025-02-08 05:37:07,487 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -59 predicate places. [2025-02-08 05:37:07,487 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 315 transitions, 775 flow [2025-02-08 05:37:07,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.6666666666667) internal successors, (1115), 3 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:07,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:07,487 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:07,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:37:07,488 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-08 05:37:07,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:07,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1181258995, now seen corresponding path program 1 times [2025-02-08 05:37:07,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:07,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007619532] [2025-02-08 05:37:07,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:07,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:07,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 05:37:07,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 05:37:07,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:07,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:07,512 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:37:07,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:07,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007619532] [2025-02-08 05:37:07,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007619532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:07,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:07,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:07,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935200983] [2025-02-08 05:37:07,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:07,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:07,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:07,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:07,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:07,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2025-02-08 05:37:07,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 315 transitions, 775 flow. Second operand has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:07,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:07,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2025-02-08 05:37:07,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:07,813 INFO L124 PetriNetUnfolderBase]: 284/2762 cut-off events. [2025-02-08 05:37:07,813 INFO L125 PetriNetUnfolderBase]: For 106/115 co-relation queries the response was YES. [2025-02-08 05:37:07,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3967 conditions, 2762 events. 284/2762 cut-off events. For 106/115 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 25467 event pairs, 145 based on Foata normal form. 0/2549 useless extension candidates. Maximal degree in co-relation 3436. Up to 339 conditions per place. [2025-02-08 05:37:07,842 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 28 selfloop transitions, 2 changer transitions 0/317 dead transitions. [2025-02-08 05:37:07,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 317 transitions, 842 flow [2025-02-08 05:37:07,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:07,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:07,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-02-08 05:37:07,844 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-02-08 05:37:07,844 INFO L175 Difference]: Start difference. First operand has 321 places, 315 transitions, 775 flow. Second operand 3 states and 1131 transitions. [2025-02-08 05:37:07,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 317 transitions, 842 flow [2025-02-08 05:37:07,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 317 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:07,848 INFO L231 Difference]: Finished difference. Result has 320 places, 314 transitions, 773 flow [2025-02-08 05:37:07,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=773, PETRI_PLACES=320, PETRI_TRANSITIONS=314} [2025-02-08 05:37:07,849 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -60 predicate places. [2025-02-08 05:37:07,849 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 314 transitions, 773 flow [2025-02-08 05:37:07,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:07,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:07,849 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:07,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:37:07,849 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-08 05:37:07,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:07,850 INFO L85 PathProgramCache]: Analyzing trace with hash -326497187, now seen corresponding path program 1 times [2025-02-08 05:37:07,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:07,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768217596] [2025-02-08 05:37:07,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:07,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:07,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-08 05:37:07,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-08 05:37:07,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:07,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:07,873 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:37:07,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:07,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768217596] [2025-02-08 05:37:07,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768217596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:07,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:07,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:07,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255296103] [2025-02-08 05:37:07,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:07,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:07,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:07,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:07,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:07,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2025-02-08 05:37:07,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 314 transitions, 773 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:07,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:07,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2025-02-08 05:37:07,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:08,210 INFO L124 PetriNetUnfolderBase]: 345/2764 cut-off events. [2025-02-08 05:37:08,210 INFO L125 PetriNetUnfolderBase]: For 276/279 co-relation queries the response was YES. [2025-02-08 05:37:08,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4110 conditions, 2764 events. 345/2764 cut-off events. For 276/279 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 25314 event pairs, 197 based on Foata normal form. 0/2553 useless extension candidates. Maximal degree in co-relation 3995. Up to 538 conditions per place. [2025-02-08 05:37:08,237 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 29 selfloop transitions, 2 changer transitions 0/316 dead transitions. [2025-02-08 05:37:08,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 316 transitions, 842 flow [2025-02-08 05:37:08,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:08,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:08,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-02-08 05:37:08,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-02-08 05:37:08,239 INFO L175 Difference]: Start difference. First operand has 320 places, 314 transitions, 773 flow. Second operand 3 states and 1131 transitions. [2025-02-08 05:37:08,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 316 transitions, 842 flow [2025-02-08 05:37:08,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 316 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:08,243 INFO L231 Difference]: Finished difference. Result has 319 places, 313 transitions, 771 flow [2025-02-08 05:37:08,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=771, PETRI_PLACES=319, PETRI_TRANSITIONS=313} [2025-02-08 05:37:08,244 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -61 predicate places. [2025-02-08 05:37:08,244 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 313 transitions, 771 flow [2025-02-08 05:37:08,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:08,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:08,245 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:08,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:37:08,245 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-08 05:37:08,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:08,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1105942931, now seen corresponding path program 1 times [2025-02-08 05:37:08,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:08,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181880893] [2025-02-08 05:37:08,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:08,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:08,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-08 05:37:08,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-08 05:37:08,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:08,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:08,270 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:37:08,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:08,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181880893] [2025-02-08 05:37:08,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181880893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:08,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:08,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:08,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065778653] [2025-02-08 05:37:08,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:08,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:08,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:08,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:08,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:08,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2025-02-08 05:37:08,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 313 transitions, 771 flow. Second operand has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:08,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:08,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2025-02-08 05:37:08,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:08,848 INFO L124 PetriNetUnfolderBase]: 527/3812 cut-off events. [2025-02-08 05:37:08,849 INFO L125 PetriNetUnfolderBase]: For 346/352 co-relation queries the response was YES. [2025-02-08 05:37:08,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5805 conditions, 3812 events. 527/3812 cut-off events. For 346/352 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 37498 event pairs, 310 based on Foata normal form. 0/3550 useless extension candidates. Maximal degree in co-relation 5275. Up to 766 conditions per place. [2025-02-08 05:37:08,887 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/315 dead transitions. [2025-02-08 05:37:08,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 315 transitions, 836 flow [2025-02-08 05:37:08,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:08,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:08,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-02-08 05:37:08,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2025-02-08 05:37:08,889 INFO L175 Difference]: Start difference. First operand has 319 places, 313 transitions, 771 flow. Second operand 3 states and 1133 transitions. [2025-02-08 05:37:08,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 315 transitions, 836 flow [2025-02-08 05:37:08,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 315 transitions, 832 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:08,899 INFO L231 Difference]: Finished difference. Result has 318 places, 312 transitions, 769 flow [2025-02-08 05:37:08,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=769, PETRI_PLACES=318, PETRI_TRANSITIONS=312} [2025-02-08 05:37:08,903 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -62 predicate places. [2025-02-08 05:37:08,903 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 312 transitions, 769 flow [2025-02-08 05:37:08,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:08,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:08,904 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:08,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:37:08,904 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread4Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-08 05:37:08,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:08,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1431318440, now seen corresponding path program 1 times [2025-02-08 05:37:08,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:08,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919515750] [2025-02-08 05:37:08,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:08,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:08,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-08 05:37:08,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 05:37:08,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:08,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:08,957 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:37:08,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:08,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919515750] [2025-02-08 05:37:08,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919515750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:08,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:08,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:08,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41551373] [2025-02-08 05:37:08,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:08,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:08,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:08,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:08,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:09,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2025-02-08 05:37:09,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 312 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 372.6666666666667) internal successors, (1118), 3 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:09,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:09,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2025-02-08 05:37:09,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:09,327 INFO L124 PetriNetUnfolderBase]: 190/2139 cut-off events. [2025-02-08 05:37:09,327 INFO L125 PetriNetUnfolderBase]: For 192/196 co-relation queries the response was YES. [2025-02-08 05:37:09,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2994 conditions, 2139 events. 190/2139 cut-off events. For 192/196 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 17890 event pairs, 84 based on Foata normal form. 0/1987 useless extension candidates. Maximal degree in co-relation 2692. Up to 282 conditions per place. [2025-02-08 05:37:09,353 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/314 dead transitions. [2025-02-08 05:37:09,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 314 transitions, 834 flow [2025-02-08 05:37:09,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:09,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-02-08 05:37:09,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2025-02-08 05:37:09,356 INFO L175 Difference]: Start difference. First operand has 318 places, 312 transitions, 769 flow. Second operand 3 states and 1133 transitions. [2025-02-08 05:37:09,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 314 transitions, 834 flow [2025-02-08 05:37:09,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 314 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:09,362 INFO L231 Difference]: Finished difference. Result has 317 places, 311 transitions, 767 flow [2025-02-08 05:37:09,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=767, PETRI_PLACES=317, PETRI_TRANSITIONS=311} [2025-02-08 05:37:09,363 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -63 predicate places. [2025-02-08 05:37:09,363 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 311 transitions, 767 flow [2025-02-08 05:37:09,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.6666666666667) internal successors, (1118), 3 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:09,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:09,364 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:09,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:37:09,364 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-08 05:37:09,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:09,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1615479104, now seen corresponding path program 1 times [2025-02-08 05:37:09,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:09,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049320598] [2025-02-08 05:37:09,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:09,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:09,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-08 05:37:09,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 05:37:09,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:09,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:09,396 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:37:09,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:09,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049320598] [2025-02-08 05:37:09,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049320598] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:09,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:09,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:09,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203803025] [2025-02-08 05:37:09,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:09,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:09,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:09,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:09,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:09,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2025-02-08 05:37:09,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 311 transitions, 767 flow. Second operand has 3 states, 3 states have (on average 373.0) internal successors, (1119), 3 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:09,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:09,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2025-02-08 05:37:09,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:09,801 INFO L124 PetriNetUnfolderBase]: 284/2714 cut-off events. [2025-02-08 05:37:09,802 INFO L125 PetriNetUnfolderBase]: For 106/115 co-relation queries the response was YES. [2025-02-08 05:37:09,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3919 conditions, 2714 events. 284/2714 cut-off events. For 106/115 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 24746 event pairs, 145 based on Foata normal form. 0/2549 useless extension candidates. Maximal degree in co-relation 3520. Up to 339 conditions per place. [2025-02-08 05:37:09,830 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 28 selfloop transitions, 2 changer transitions 0/313 dead transitions. [2025-02-08 05:37:09,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 313 transitions, 834 flow [2025-02-08 05:37:09,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:09,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:09,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-02-08 05:37:09,832 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-02-08 05:37:09,832 INFO L175 Difference]: Start difference. First operand has 317 places, 311 transitions, 767 flow. Second operand 3 states and 1131 transitions. [2025-02-08 05:37:09,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 313 transitions, 834 flow [2025-02-08 05:37:09,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 313 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:09,836 INFO L231 Difference]: Finished difference. Result has 316 places, 310 transitions, 765 flow [2025-02-08 05:37:09,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=765, PETRI_PLACES=316, PETRI_TRANSITIONS=310} [2025-02-08 05:37:09,837 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -64 predicate places. [2025-02-08 05:37:09,837 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 310 transitions, 765 flow [2025-02-08 05:37:09,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.0) internal successors, (1119), 3 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:09,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:09,842 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:09,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:37:09,843 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-08 05:37:09,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:09,843 INFO L85 PathProgramCache]: Analyzing trace with hash -927577214, now seen corresponding path program 1 times [2025-02-08 05:37:09,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:09,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418675892] [2025-02-08 05:37:09,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:09,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:09,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-08 05:37:09,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-08 05:37:09,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:09,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:09,882 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:37:09,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:09,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418675892] [2025-02-08 05:37:09,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418675892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:09,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:09,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:09,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254696926] [2025-02-08 05:37:09,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:09,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:09,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:09,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:09,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:09,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2025-02-08 05:37:09,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 310 transitions, 765 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:09,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:09,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2025-02-08 05:37:09,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:10,250 INFO L124 PetriNetUnfolderBase]: 345/2704 cut-off events. [2025-02-08 05:37:10,250 INFO L125 PetriNetUnfolderBase]: For 273/276 co-relation queries the response was YES. [2025-02-08 05:37:10,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4050 conditions, 2704 events. 345/2704 cut-off events. For 273/276 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 24451 event pairs, 197 based on Foata normal form. 0/2541 useless extension candidates. Maximal degree in co-relation 3971. Up to 538 conditions per place. [2025-02-08 05:37:10,268 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 29 selfloop transitions, 2 changer transitions 0/312 dead transitions. [2025-02-08 05:37:10,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 312 transitions, 834 flow [2025-02-08 05:37:10,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:10,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:10,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-02-08 05:37:10,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-02-08 05:37:10,270 INFO L175 Difference]: Start difference. First operand has 316 places, 310 transitions, 765 flow. Second operand 3 states and 1131 transitions. [2025-02-08 05:37:10,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 312 transitions, 834 flow [2025-02-08 05:37:10,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 312 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:10,274 INFO L231 Difference]: Finished difference. Result has 315 places, 309 transitions, 763 flow [2025-02-08 05:37:10,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=763, PETRI_PLACES=315, PETRI_TRANSITIONS=309} [2025-02-08 05:37:10,274 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -65 predicate places. [2025-02-08 05:37:10,274 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 309 transitions, 763 flow [2025-02-08 05:37:10,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:10,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:10,275 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:10,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:37:10,275 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-08 05:37:10,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:10,276 INFO L85 PathProgramCache]: Analyzing trace with hash 136155868, now seen corresponding path program 1 times [2025-02-08 05:37:10,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:10,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778110243] [2025-02-08 05:37:10,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:10,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:10,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 05:37:10,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 05:37:10,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:10,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:10,298 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:37:10,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:10,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778110243] [2025-02-08 05:37:10,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778110243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:10,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:10,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:10,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462555894] [2025-02-08 05:37:10,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:10,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:10,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:10,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:10,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:10,356 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2025-02-08 05:37:10,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 309 transitions, 763 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:10,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:10,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2025-02-08 05:37:10,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:10,779 INFO L124 PetriNetUnfolderBase]: 539/3873 cut-off events. [2025-02-08 05:37:10,779 INFO L125 PetriNetUnfolderBase]: For 346/352 co-relation queries the response was YES. [2025-02-08 05:37:10,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5902 conditions, 3873 events. 539/3873 cut-off events. For 346/352 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 37419 event pairs, 310 based on Foata normal form. 0/3671 useless extension candidates. Maximal degree in co-relation 5534. Up to 766 conditions per place. [2025-02-08 05:37:10,830 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/311 dead transitions. [2025-02-08 05:37:10,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 311 transitions, 828 flow [2025-02-08 05:37:10,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:10,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-02-08 05:37:10,832 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2025-02-08 05:37:10,832 INFO L175 Difference]: Start difference. First operand has 315 places, 309 transitions, 763 flow. Second operand 3 states and 1133 transitions. [2025-02-08 05:37:10,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 311 transitions, 828 flow [2025-02-08 05:37:10,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 311 transitions, 824 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:10,837 INFO L231 Difference]: Finished difference. Result has 314 places, 308 transitions, 761 flow [2025-02-08 05:37:10,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=761, PETRI_PLACES=314, PETRI_TRANSITIONS=308} [2025-02-08 05:37:10,837 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -66 predicate places. [2025-02-08 05:37:10,837 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 308 transitions, 761 flow [2025-02-08 05:37:10,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:10,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:10,838 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:10,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:37:10,838 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread4Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-08 05:37:10,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:10,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1665044179, now seen corresponding path program 1 times [2025-02-08 05:37:10,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:10,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295288309] [2025-02-08 05:37:10,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:10,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:10,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-08 05:37:10,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-08 05:37:10,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:10,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:10,868 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:37:10,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:10,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295288309] [2025-02-08 05:37:10,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295288309] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:10,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:10,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:10,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395408843] [2025-02-08 05:37:10,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:10,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:10,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:10,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:10,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:10,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2025-02-08 05:37:10,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 308 transitions, 761 flow. Second operand has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:10,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:10,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2025-02-08 05:37:10,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:11,104 INFO L124 PetriNetUnfolderBase]: 190/2095 cut-off events. [2025-02-08 05:37:11,104 INFO L125 PetriNetUnfolderBase]: For 191/195 co-relation queries the response was YES. [2025-02-08 05:37:11,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2950 conditions, 2095 events. 190/2095 cut-off events. For 191/195 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 17394 event pairs, 84 based on Foata normal form. 0/1981 useless extension candidates. Maximal degree in co-relation 2792. Up to 282 conditions per place. [2025-02-08 05:37:11,124 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/310 dead transitions. [2025-02-08 05:37:11,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 310 transitions, 826 flow [2025-02-08 05:37:11,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:11,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:11,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-02-08 05:37:11,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2025-02-08 05:37:11,126 INFO L175 Difference]: Start difference. First operand has 314 places, 308 transitions, 761 flow. Second operand 3 states and 1133 transitions. [2025-02-08 05:37:11,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 310 transitions, 826 flow [2025-02-08 05:37:11,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 310 transitions, 822 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:11,129 INFO L231 Difference]: Finished difference. Result has 313 places, 307 transitions, 759 flow [2025-02-08 05:37:11,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=759, PETRI_PLACES=313, PETRI_TRANSITIONS=307} [2025-02-08 05:37:11,130 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -67 predicate places. [2025-02-08 05:37:11,130 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 307 transitions, 759 flow [2025-02-08 05:37:11,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:11,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:11,131 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:11,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 05:37:11,131 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-08 05:37:11,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:11,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1590345719, now seen corresponding path program 1 times [2025-02-08 05:37:11,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:11,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936076931] [2025-02-08 05:37:11,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:11,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:11,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-08 05:37:11,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-08 05:37:11,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:11,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:11,164 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:37:11,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:11,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936076931] [2025-02-08 05:37:11,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936076931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:11,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:11,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:11,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919339362] [2025-02-08 05:37:11,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:11,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:11,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:11,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:11,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:11,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2025-02-08 05:37:11,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 307 transitions, 759 flow. Second operand has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:11,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:11,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2025-02-08 05:37:11,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:11,516 INFO L124 PetriNetUnfolderBase]: 345/2647 cut-off events. [2025-02-08 05:37:11,516 INFO L125 PetriNetUnfolderBase]: For 276/279 co-relation queries the response was YES. [2025-02-08 05:37:11,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4005 conditions, 2647 events. 345/2647 cut-off events. For 276/279 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 23727 event pairs, 197 based on Foata normal form. 0/2529 useless extension candidates. Maximal degree in co-relation 3774. Up to 538 conditions per place. [2025-02-08 05:37:11,541 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 29 selfloop transitions, 2 changer transitions 0/309 dead transitions. [2025-02-08 05:37:11,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 309 transitions, 828 flow [2025-02-08 05:37:11,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:11,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:11,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-02-08 05:37:11,543 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-02-08 05:37:11,543 INFO L175 Difference]: Start difference. First operand has 313 places, 307 transitions, 759 flow. Second operand 3 states and 1131 transitions. [2025-02-08 05:37:11,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 309 transitions, 828 flow [2025-02-08 05:37:11,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 309 transitions, 824 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:11,547 INFO L231 Difference]: Finished difference. Result has 312 places, 306 transitions, 757 flow [2025-02-08 05:37:11,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=757, PETRI_PLACES=312, PETRI_TRANSITIONS=306} [2025-02-08 05:37:11,548 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -68 predicate places. [2025-02-08 05:37:11,548 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 306 transitions, 757 flow [2025-02-08 05:37:11,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:11,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:11,549 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:11,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 05:37:11,549 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread4Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-08 05:37:11,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:11,549 INFO L85 PathProgramCache]: Analyzing trace with hash -870839788, now seen corresponding path program 1 times [2025-02-08 05:37:11,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:11,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255176023] [2025-02-08 05:37:11,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:11,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:11,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-08 05:37:11,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-08 05:37:11,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:11,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:11,574 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:37:11,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:11,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255176023] [2025-02-08 05:37:11,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255176023] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:11,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:11,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:11,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706142935] [2025-02-08 05:37:11,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:11,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:11,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:11,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:11,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:11,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2025-02-08 05:37:11,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 306 transitions, 757 flow. Second operand has 3 states, 3 states have (on average 374.6666666666667) internal successors, (1124), 3 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:11,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:11,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2025-02-08 05:37:11,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:11,816 INFO L124 PetriNetUnfolderBase]: 190/2066 cut-off events. [2025-02-08 05:37:11,816 INFO L125 PetriNetUnfolderBase]: For 190/194 co-relation queries the response was YES. [2025-02-08 05:37:11,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2919 conditions, 2066 events. 190/2066 cut-off events. For 190/194 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 17101 event pairs, 84 based on Foata normal form. 0/1975 useless extension candidates. Maximal degree in co-relation 2780. Up to 282 conditions per place. [2025-02-08 05:37:11,834 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 0 selfloop transitions, 0 changer transitions 308/308 dead transitions. [2025-02-08 05:37:11,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 308 transitions, 822 flow [2025-02-08 05:37:11,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:11,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:11,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-02-08 05:37:11,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2025-02-08 05:37:11,836 INFO L175 Difference]: Start difference. First operand has 312 places, 306 transitions, 757 flow. Second operand 3 states and 1133 transitions. [2025-02-08 05:37:11,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 308 transitions, 822 flow [2025-02-08 05:37:11,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 308 transitions, 818 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:11,840 INFO L231 Difference]: Finished difference. Result has 311 places, 0 transitions, 0 flow [2025-02-08 05:37:11,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=311, PETRI_TRANSITIONS=0} [2025-02-08 05:37:11,840 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -69 predicate places. [2025-02-08 05:37:11,840 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 0 transitions, 0 flow [2025-02-08 05:37:11,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.6666666666667) internal successors, (1124), 3 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:11,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (130 of 131 remaining) [2025-02-08 05:37:11,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (129 of 131 remaining) [2025-02-08 05:37:11,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (128 of 131 remaining) [2025-02-08 05:37:11,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (127 of 131 remaining) [2025-02-08 05:37:11,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (126 of 131 remaining) [2025-02-08 05:37:11,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (125 of 131 remaining) [2025-02-08 05:37:11,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (124 of 131 remaining) [2025-02-08 05:37:11,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (123 of 131 remaining) [2025-02-08 05:37:11,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (122 of 131 remaining) [2025-02-08 05:37:11,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (121 of 131 remaining) [2025-02-08 05:37:11,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (120 of 131 remaining) [2025-02-08 05:37:11,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (119 of 131 remaining) [2025-02-08 05:37:11,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (118 of 131 remaining) [2025-02-08 05:37:11,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (117 of 131 remaining) [2025-02-08 05:37:11,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (116 of 131 remaining) [2025-02-08 05:37:11,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (115 of 131 remaining) [2025-02-08 05:37:11,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (114 of 131 remaining) [2025-02-08 05:37:11,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (113 of 131 remaining) [2025-02-08 05:37:11,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (112 of 131 remaining) [2025-02-08 05:37:11,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (111 of 131 remaining) [2025-02-08 05:37:11,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (110 of 131 remaining) [2025-02-08 05:37:11,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (109 of 131 remaining) [2025-02-08 05:37:11,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (108 of 131 remaining) [2025-02-08 05:37:11,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (107 of 131 remaining) [2025-02-08 05:37:11,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (106 of 131 remaining) [2025-02-08 05:37:11,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (105 of 131 remaining) [2025-02-08 05:37:11,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (104 of 131 remaining) [2025-02-08 05:37:11,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (103 of 131 remaining) [2025-02-08 05:37:11,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (102 of 131 remaining) [2025-02-08 05:37:11,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (101 of 131 remaining) [2025-02-08 05:37:11,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (100 of 131 remaining) [2025-02-08 05:37:11,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (99 of 131 remaining) [2025-02-08 05:37:11,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (98 of 131 remaining) [2025-02-08 05:37:11,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (97 of 131 remaining) [2025-02-08 05:37:11,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (96 of 131 remaining) [2025-02-08 05:37:11,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (95 of 131 remaining) [2025-02-08 05:37:11,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (94 of 131 remaining) [2025-02-08 05:37:11,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (93 of 131 remaining) [2025-02-08 05:37:11,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (92 of 131 remaining) [2025-02-08 05:37:11,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (91 of 131 remaining) [2025-02-08 05:37:11,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (90 of 131 remaining) [2025-02-08 05:37:11,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (89 of 131 remaining) [2025-02-08 05:37:11,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (88 of 131 remaining) [2025-02-08 05:37:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (87 of 131 remaining) [2025-02-08 05:37:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (86 of 131 remaining) [2025-02-08 05:37:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (85 of 131 remaining) [2025-02-08 05:37:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (84 of 131 remaining) [2025-02-08 05:37:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (83 of 131 remaining) [2025-02-08 05:37:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (82 of 131 remaining) [2025-02-08 05:37:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (81 of 131 remaining) [2025-02-08 05:37:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (80 of 131 remaining) [2025-02-08 05:37:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (79 of 131 remaining) [2025-02-08 05:37:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (78 of 131 remaining) [2025-02-08 05:37:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (77 of 131 remaining) [2025-02-08 05:37:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (76 of 131 remaining) [2025-02-08 05:37:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (75 of 131 remaining) [2025-02-08 05:37:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (74 of 131 remaining) [2025-02-08 05:37:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (73 of 131 remaining) [2025-02-08 05:37:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (72 of 131 remaining) [2025-02-08 05:37:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (71 of 131 remaining) [2025-02-08 05:37:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (70 of 131 remaining) [2025-02-08 05:37:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (69 of 131 remaining) [2025-02-08 05:37:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (68 of 131 remaining) [2025-02-08 05:37:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (67 of 131 remaining) [2025-02-08 05:37:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (66 of 131 remaining) [2025-02-08 05:37:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (65 of 131 remaining) [2025-02-08 05:37:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (64 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (63 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (62 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (61 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (60 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (59 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (58 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (57 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (56 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (55 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (54 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (53 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (52 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (51 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (50 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (49 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (48 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (47 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (46 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (45 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (44 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (43 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (42 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (41 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (40 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (39 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (38 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (37 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (36 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (35 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (34 of 131 remaining) [2025-02-08 05:37:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (33 of 131 remaining) [2025-02-08 05:37:11,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (32 of 131 remaining) [2025-02-08 05:37:11,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (31 of 131 remaining) [2025-02-08 05:37:11,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (30 of 131 remaining) [2025-02-08 05:37:11,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (29 of 131 remaining) [2025-02-08 05:37:11,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (28 of 131 remaining) [2025-02-08 05:37:11,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (27 of 131 remaining) [2025-02-08 05:37:11,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (26 of 131 remaining) [2025-02-08 05:37:11,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (25 of 131 remaining) [2025-02-08 05:37:11,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (24 of 131 remaining) [2025-02-08 05:37:11,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (23 of 131 remaining) [2025-02-08 05:37:11,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (22 of 131 remaining) [2025-02-08 05:37:11,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (21 of 131 remaining) [2025-02-08 05:37:11,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (20 of 131 remaining) [2025-02-08 05:37:11,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (19 of 131 remaining) [2025-02-08 05:37:11,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (18 of 131 remaining) [2025-02-08 05:37:11,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (17 of 131 remaining) [2025-02-08 05:37:11,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (16 of 131 remaining) [2025-02-08 05:37:11,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (15 of 131 remaining) [2025-02-08 05:37:11,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (14 of 131 remaining) [2025-02-08 05:37:11,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (13 of 131 remaining) [2025-02-08 05:37:11,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (12 of 131 remaining) [2025-02-08 05:37:11,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (11 of 131 remaining) [2025-02-08 05:37:11,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (10 of 131 remaining) [2025-02-08 05:37:11,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (9 of 131 remaining) [2025-02-08 05:37:11,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (8 of 131 remaining) [2025-02-08 05:37:11,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (7 of 131 remaining) [2025-02-08 05:37:11,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (6 of 131 remaining) [2025-02-08 05:37:11,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (5 of 131 remaining) [2025-02-08 05:37:11,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (4 of 131 remaining) [2025-02-08 05:37:11,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (3 of 131 remaining) [2025-02-08 05:37:11,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (2 of 131 remaining) [2025-02-08 05:37:11,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (1 of 131 remaining) [2025-02-08 05:37:11,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (0 of 131 remaining) [2025-02-08 05:37:11,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 05:37:11,850 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:11,855 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:37:11,855 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:37:11,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:37:11 BasicIcfg [2025-02-08 05:37:11,859 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:37:11,859 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:37:11,859 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:37:11,860 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:37:11,860 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:00" (3/4) ... [2025-02-08 05:37:11,861 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:37:11,863 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:37:11,863 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:37:11,863 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:37:11,863 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-02-08 05:37:11,866 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-08 05:37:11,867 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:37:11,867 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 05:37:11,867 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:37:11,918 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:37:11,919 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:37:11,919 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:37:11,920 INFO L158 Benchmark]: Toolchain (without parser) took 12725.35ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 906.0MB). Free memory was 107.0MB in the beginning and 647.6MB in the end (delta: -540.6MB). Peak memory consumption was 363.8MB. Max. memory is 16.1GB. [2025-02-08 05:37:11,920 INFO L158 Benchmark]: CDTParser took 0.58ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:11,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.87ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 94.0MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:11,921 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.00ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:11,922 INFO L158 Benchmark]: Boogie Preprocessor took 21.96ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 91.5MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:11,922 INFO L158 Benchmark]: IcfgBuilder took 585.07ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 65.1MB in the end (delta: 26.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 05:37:11,923 INFO L158 Benchmark]: TraceAbstraction took 11815.49ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 906.0MB). Free memory was 64.5MB in the beginning and 656.0MB in the end (delta: -591.5MB). Peak memory consumption was 313.5MB. Max. memory is 16.1GB. [2025-02-08 05:37:11,923 INFO L158 Benchmark]: Witness Printer took 59.55ms. Allocated memory is still 1.0GB. Free memory was 656.0MB in the beginning and 647.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:11,924 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.58ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.87ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 94.0MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.00ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.96ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 91.5MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 585.07ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 65.1MB in the end (delta: 26.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11815.49ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 906.0MB). Free memory was 64.5MB in the beginning and 656.0MB in the end (delta: -591.5MB). Peak memory consumption was 313.5MB. Max. memory is 16.1GB. * Witness Printer took 59.55ms. Allocated memory is still 1.0GB. Free memory was 656.0MB in the beginning and 647.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - 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: 41]: 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: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 630 locations, 131 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: 11.6s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2566 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 824 mSDsluCounter, 544 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 166 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2581 IncrementalHoareTripleChecker+Invalid, 2747 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 166 mSolverCounterUnsat, 536 mSDtfsCounter, 2581 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=785occurred in iteration=12, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 2347 NumberOfCodeBlocks, 2347 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2320 ConstructedInterpolants, 0 QuantifiedInterpolants, 2374 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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 71 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:37:11,948 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