./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2a508120cc7913f10b79dda7ca65a8b88f829725798d520aee5d1c1d04a1fc13 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:52:38,382 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:52:38,442 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:52:38,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:52:38,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:52:38,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:52:38,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:52:38,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:52:38,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:52:38,470 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:52:38,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:52:38,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:52:38,471 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:52:38,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:52:38,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:52:38,472 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:52:38,472 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:52:38,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:52:38,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:52:38,472 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:52:38,472 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:52:38,472 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:52:38,472 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:52:38,472 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:52:38,472 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:52:38,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:52:38,472 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:52:38,472 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:52:38,472 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:52:38,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:52:38,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:52:38,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:52:38,473 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:52:38,473 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:52:38,473 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:52:38,473 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:52:38,473 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:52:38,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:52:38,473 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:52:38,473 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:52:38,473 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:52:38,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:52:38,473 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2a508120cc7913f10b79dda7ca65a8b88f829725798d520aee5d1c1d04a1fc13 [2025-03-04 06:52:38,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:52:38,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:52:38,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:52:38,721 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:52:38,722 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:52:38,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c [2025-03-04 06:52:39,837 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce965a942/535ce1a50ab6487791262f47322dc494/FLAG5a30ca898 [2025-03-04 06:52:40,073 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:52:40,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c [2025-03-04 06:52:40,098 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce965a942/535ce1a50ab6487791262f47322dc494/FLAG5a30ca898 [2025-03-04 06:52:40,111 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce965a942/535ce1a50ab6487791262f47322dc494 [2025-03-04 06:52:40,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:52:40,114 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:52:40,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:52:40,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:52:40,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:52:40,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:52:40" (1/1) ... [2025-03-04 06:52:40,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@387d3df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:40, skipping insertion in model container [2025-03-04 06:52:40,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:52:40" (1/1) ... [2025-03-04 06:52:40,134 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:52:40,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:52:40,274 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:52:40,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:52:40,313 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:52:40,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:40 WrapperNode [2025-03-04 06:52:40,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:52:40,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:52:40,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:52:40,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:52:40,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:40" (1/1) ... [2025-03-04 06:52:40,326 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:40" (1/1) ... [2025-03-04 06:52:40,351 INFO L138 Inliner]: procedures = 22, calls = 17, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 317 [2025-03-04 06:52:40,351 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:52:40,352 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:52:40,352 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:52:40,352 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:52:40,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:40" (1/1) ... [2025-03-04 06:52:40,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:40" (1/1) ... [2025-03-04 06:52:40,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:40" (1/1) ... [2025-03-04 06:52:40,365 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:40" (1/1) ... [2025-03-04 06:52:40,373 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:40" (1/1) ... [2025-03-04 06:52:40,374 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:40" (1/1) ... [2025-03-04 06:52:40,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:40" (1/1) ... [2025-03-04 06:52:40,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:40" (1/1) ... [2025-03-04 06:52:40,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:52:40,378 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:52:40,378 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:52:40,378 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:52:40,382 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:40" (1/1) ... [2025-03-04 06:52:40,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:52:40,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:52:40,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:52:40,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:52:40,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:52:40,429 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 06:52:40,429 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 06:52:40,429 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 06:52:40,429 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 06:52:40,429 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 06:52:40,429 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 06:52:40,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:52:40,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:52:40,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:52:40,430 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:52:40,500 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:52:40,502 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:52:40,909 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:52:40,910 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:52:40,928 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:52:40,928 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:52:40,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:52:40 BoogieIcfgContainer [2025-03-04 06:52:40,928 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:52:40,930 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:52:40,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:52:40,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:52:40,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:52:40" (1/3) ... [2025-03-04 06:52:40,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268760c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:52:40, skipping insertion in model container [2025-03-04 06:52:40,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:52:40" (2/3) ... [2025-03-04 06:52:40,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268760c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:52:40, skipping insertion in model container [2025-03-04 06:52:40,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:52:40" (3/3) ... [2025-03-04 06:52:40,935 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-exp-term-subst.wvr.c [2025-03-04 06:52:40,946 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:52:40,948 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-exp-term-subst.wvr.c that has 4 procedures, 404 locations, 1 initial locations, 0 loop locations, and 44 error locations. [2025-03-04 06:52:40,950 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:52:41,070 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 06:52:41,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 413 places, 430 transitions, 881 flow [2025-03-04 06:52:41,246 INFO L124 PetriNetUnfolderBase]: 27/427 cut-off events. [2025-03-04 06:52:41,247 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:52:41,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 427 events. 27/427 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1408 event pairs, 0 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 306. Up to 2 conditions per place. [2025-03-04 06:52:41,258 INFO L82 GeneralOperation]: Start removeDead. Operand has 413 places, 430 transitions, 881 flow [2025-03-04 06:52:41,265 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 392 places, 407 transitions, 832 flow [2025-03-04 06:52:41,271 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:52:41,278 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;@19154ca7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:52:41,279 INFO L334 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2025-03-04 06:52:41,283 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:52:41,285 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-04 06:52:41,285 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:52:41,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:41,285 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:41,286 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:52:41,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:41,290 INFO L85 PathProgramCache]: Analyzing trace with hash 2065057417, now seen corresponding path program 1 times [2025-03-04 06:52:41,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:41,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806781439] [2025-03-04 06:52:41,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:41,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:41,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 06:52:41,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 06:52:41,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:41,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:41,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:41,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:41,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806781439] [2025-03-04 06:52:41,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806781439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:41,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:41,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:41,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990288019] [2025-03-04 06:52:41,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:41,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:41,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:41,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:41,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:41,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 430 [2025-03-04 06:52:41,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 407 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:41,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:41,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 430 [2025-03-04 06:52:41,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:41,716 INFO L124 PetriNetUnfolderBase]: 98/1397 cut-off events. [2025-03-04 06:52:41,717 INFO L125 PetriNetUnfolderBase]: For 28/32 co-relation queries the response was YES. [2025-03-04 06:52:41,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 1397 events. 98/1397 cut-off events. For 28/32 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 9743 event pairs, 20 based on Foata normal form. 39/1169 useless extension candidates. Maximal degree in co-relation 1352. Up to 50 conditions per place. [2025-03-04 06:52:41,737 INFO L140 encePairwiseOnDemand]: 420/430 looper letters, 13 selfloop transitions, 2 changer transitions 1/399 dead transitions. [2025-03-04 06:52:41,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 399 transitions, 846 flow [2025-03-04 06:52:41,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:41,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:41,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1235 transitions. [2025-03-04 06:52:41,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9573643410852714 [2025-03-04 06:52:41,756 INFO L175 Difference]: Start difference. First operand has 392 places, 407 transitions, 832 flow. Second operand 3 states and 1235 transitions. [2025-03-04 06:52:41,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 399 transitions, 846 flow [2025-03-04 06:52:41,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 399 transitions, 834 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 06:52:41,804 INFO L231 Difference]: Finished difference. Result has 387 places, 398 transitions, 806 flow [2025-03-04 06:52:41,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=806, PETRI_PLACES=387, PETRI_TRANSITIONS=398} [2025-03-04 06:52:41,810 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -5 predicate places. [2025-03-04 06:52:41,812 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 398 transitions, 806 flow [2025-03-04 06:52:41,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:41,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:41,814 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:41,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:52:41,814 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:52:41,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:41,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1561166810, now seen corresponding path program 1 times [2025-03-04 06:52:41,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:41,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838939158] [2025-03-04 06:52:41,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:41,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:41,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 06:52:41,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 06:52:41,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:41,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:41,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:41,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:41,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838939158] [2025-03-04 06:52:41,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838939158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:41,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:41,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:41,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220026174] [2025-03-04 06:52:41,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:41,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:41,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:41,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:41,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:41,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 430 [2025-03-04 06:52:41,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 398 transitions, 806 flow. Second operand has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:41,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:41,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 430 [2025-03-04 06:52:41,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:42,029 INFO L124 PetriNetUnfolderBase]: 54/807 cut-off events. [2025-03-04 06:52:42,029 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-03-04 06:52:42,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 807 events. 54/807 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4629 event pairs, 12 based on Foata normal form. 0/662 useless extension candidates. Maximal degree in co-relation 824. Up to 38 conditions per place. [2025-03-04 06:52:42,037 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 13 selfloop transitions, 2 changer transitions 0/397 dead transitions. [2025-03-04 06:52:42,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 397 transitions, 834 flow [2025-03-04 06:52:42,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:42,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:42,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1228 transitions. [2025-03-04 06:52:42,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.951937984496124 [2025-03-04 06:52:42,040 INFO L175 Difference]: Start difference. First operand has 387 places, 398 transitions, 806 flow. Second operand 3 states and 1228 transitions. [2025-03-04 06:52:42,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 397 transitions, 834 flow [2025-03-04 06:52:42,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 397 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:42,045 INFO L231 Difference]: Finished difference. Result has 385 places, 397 transitions, 804 flow [2025-03-04 06:52:42,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=804, PETRI_PLACES=385, PETRI_TRANSITIONS=397} [2025-03-04 06:52:42,046 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -7 predicate places. [2025-03-04 06:52:42,046 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 397 transitions, 804 flow [2025-03-04 06:52:42,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:42,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:42,047 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:42,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:52:42,047 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:52:42,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:42,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1327145344, now seen corresponding path program 1 times [2025-03-04 06:52:42,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:42,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558502269] [2025-03-04 06:52:42,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:42,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:42,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 06:52:42,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 06:52:42,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:42,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:42,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:42,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:42,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558502269] [2025-03-04 06:52:42,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558502269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:42,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:42,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:42,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904789939] [2025-03-04 06:52:42,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:42,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:42,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:42,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:42,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:42,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 430 [2025-03-04 06:52:42,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 397 transitions, 804 flow. Second operand has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:42,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:42,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 430 [2025-03-04 06:52:42,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:42,220 INFO L124 PetriNetUnfolderBase]: 50/620 cut-off events. [2025-03-04 06:52:42,220 INFO L125 PetriNetUnfolderBase]: For 9/12 co-relation queries the response was YES. [2025-03-04 06:52:42,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 620 events. 50/620 cut-off events. For 9/12 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3150 event pairs, 20 based on Foata normal form. 0/516 useless extension candidates. Maximal degree in co-relation 639. Up to 50 conditions per place. [2025-03-04 06:52:42,231 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 13 selfloop transitions, 2 changer transitions 0/396 dead transitions. [2025-03-04 06:52:42,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 396 transitions, 832 flow [2025-03-04 06:52:42,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:42,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:42,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1228 transitions. [2025-03-04 06:52:42,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.951937984496124 [2025-03-04 06:52:42,234 INFO L175 Difference]: Start difference. First operand has 385 places, 397 transitions, 804 flow. Second operand 3 states and 1228 transitions. [2025-03-04 06:52:42,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 396 transitions, 832 flow [2025-03-04 06:52:42,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 396 transitions, 828 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:42,244 INFO L231 Difference]: Finished difference. Result has 384 places, 396 transitions, 802 flow [2025-03-04 06:52:42,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=802, PETRI_PLACES=384, PETRI_TRANSITIONS=396} [2025-03-04 06:52:42,245 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -8 predicate places. [2025-03-04 06:52:42,245 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 396 transitions, 802 flow [2025-03-04 06:52:42,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:42,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:42,246 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:42,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:52:42,247 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:52:42,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:42,247 INFO L85 PathProgramCache]: Analyzing trace with hash -26797013, now seen corresponding path program 1 times [2025-03-04 06:52:42,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:42,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593230406] [2025-03-04 06:52:42,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:42,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:42,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:52:42,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:52:42,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:42,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:42,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:42,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:42,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593230406] [2025-03-04 06:52:42,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593230406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:42,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:42,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:42,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288117865] [2025-03-04 06:52:42,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:42,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:42,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:42,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:42,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:42,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2025-03-04 06:52:42,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 396 transitions, 802 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:42,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:42,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2025-03-04 06:52:42,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:42,543 INFO L124 PetriNetUnfolderBase]: 117/1364 cut-off events. [2025-03-04 06:52:42,544 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 06:52:42,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 1364 events. 117/1364 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 9901 event pairs, 39 based on Foata normal form. 0/1100 useless extension candidates. Maximal degree in co-relation 1426. Up to 85 conditions per place. [2025-03-04 06:52:42,569 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 15 selfloop transitions, 2 changer transitions 0/395 dead transitions. [2025-03-04 06:52:42,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 395 transitions, 834 flow [2025-03-04 06:52:42,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:42,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:42,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1224 transitions. [2025-03-04 06:52:42,573 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9488372093023256 [2025-03-04 06:52:42,573 INFO L175 Difference]: Start difference. First operand has 384 places, 396 transitions, 802 flow. Second operand 3 states and 1224 transitions. [2025-03-04 06:52:42,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 395 transitions, 834 flow [2025-03-04 06:52:42,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 395 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:42,579 INFO L231 Difference]: Finished difference. Result has 383 places, 395 transitions, 800 flow [2025-03-04 06:52:42,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=800, PETRI_PLACES=383, PETRI_TRANSITIONS=395} [2025-03-04 06:52:42,580 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -9 predicate places. [2025-03-04 06:52:42,580 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 395 transitions, 800 flow [2025-03-04 06:52:42,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:42,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:42,581 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:42,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:52:42,581 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:52:42,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:42,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1901958157, now seen corresponding path program 1 times [2025-03-04 06:52:42,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:42,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931541909] [2025-03-04 06:52:42,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:42,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:42,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 06:52:42,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 06:52:42,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:42,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:42,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:42,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:42,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931541909] [2025-03-04 06:52:42,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931541909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:42,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:42,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:42,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698720327] [2025-03-04 06:52:42,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:42,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:42,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:42,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:42,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:42,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2025-03-04 06:52:42,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 395 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:42,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:42,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2025-03-04 06:52:42,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:42,778 INFO L124 PetriNetUnfolderBase]: 69/871 cut-off events. [2025-03-04 06:52:42,778 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:52:42,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 871 events. 69/871 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5291 event pairs, 21 based on Foata normal form. 0/715 useless extension candidates. Maximal degree in co-relation 886. Up to 58 conditions per place. [2025-03-04 06:52:42,793 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 15 selfloop transitions, 2 changer transitions 0/394 dead transitions. [2025-03-04 06:52:42,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 394 transitions, 832 flow [2025-03-04 06:52:42,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:42,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:42,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1224 transitions. [2025-03-04 06:52:42,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9488372093023256 [2025-03-04 06:52:42,796 INFO L175 Difference]: Start difference. First operand has 383 places, 395 transitions, 800 flow. Second operand 3 states and 1224 transitions. [2025-03-04 06:52:42,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 394 transitions, 832 flow [2025-03-04 06:52:42,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 394 transitions, 828 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:42,800 INFO L231 Difference]: Finished difference. Result has 382 places, 394 transitions, 798 flow [2025-03-04 06:52:42,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=382, PETRI_TRANSITIONS=394} [2025-03-04 06:52:42,801 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -10 predicate places. [2025-03-04 06:52:42,802 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 394 transitions, 798 flow [2025-03-04 06:52:42,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:42,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:42,802 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:42,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:52:42,803 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:52:42,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:42,803 INFO L85 PathProgramCache]: Analyzing trace with hash -565204604, now seen corresponding path program 1 times [2025-03-04 06:52:42,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:42,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461821981] [2025-03-04 06:52:42,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:42,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:42,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 06:52:42,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 06:52:42,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:42,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:42,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:42,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:42,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461821981] [2025-03-04 06:52:42,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461821981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:42,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:42,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:42,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715478259] [2025-03-04 06:52:42,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:42,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:42,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:42,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:42,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:42,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2025-03-04 06:52:42,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 394 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:42,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:42,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2025-03-04 06:52:42,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:43,003 INFO L124 PetriNetUnfolderBase]: 117/1332 cut-off events. [2025-03-04 06:52:43,003 INFO L125 PetriNetUnfolderBase]: For 21/26 co-relation queries the response was YES. [2025-03-04 06:52:43,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 1332 events. 117/1332 cut-off events. For 21/26 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 8627 event pairs, 39 based on Foata normal form. 0/1080 useless extension candidates. Maximal degree in co-relation 1363. Up to 85 conditions per place. [2025-03-04 06:52:43,019 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 15 selfloop transitions, 2 changer transitions 0/393 dead transitions. [2025-03-04 06:52:43,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 393 transitions, 830 flow [2025-03-04 06:52:43,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:43,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:43,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1224 transitions. [2025-03-04 06:52:43,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9488372093023256 [2025-03-04 06:52:43,022 INFO L175 Difference]: Start difference. First operand has 382 places, 394 transitions, 798 flow. Second operand 3 states and 1224 transitions. [2025-03-04 06:52:43,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 393 transitions, 830 flow [2025-03-04 06:52:43,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 393 transitions, 826 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:43,026 INFO L231 Difference]: Finished difference. Result has 381 places, 393 transitions, 796 flow [2025-03-04 06:52:43,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=381, PETRI_TRANSITIONS=393} [2025-03-04 06:52:43,027 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -11 predicate places. [2025-03-04 06:52:43,027 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 393 transitions, 796 flow [2025-03-04 06:52:43,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:43,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:43,028 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] [2025-03-04 06:52:43,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:52:43,029 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:52:43,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:43,029 INFO L85 PathProgramCache]: Analyzing trace with hash 78389787, now seen corresponding path program 1 times [2025-03-04 06:52:43,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:43,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9810766] [2025-03-04 06:52:43,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:43,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:43,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 06:52:43,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 06:52:43,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:43,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:43,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:43,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9810766] [2025-03-04 06:52:43,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9810766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:43,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:43,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:43,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425023137] [2025-03-04 06:52:43,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:43,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:43,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:43,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:43,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:43,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 430 [2025-03-04 06:52:43,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 393 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 397.3333333333333) internal successors, (1192), 3 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:43,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:43,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 430 [2025-03-04 06:52:43,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:43,326 INFO L124 PetriNetUnfolderBase]: 284/2636 cut-off events. [2025-03-04 06:52:43,326 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-04 06:52:43,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2953 conditions, 2636 events. 284/2636 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 24559 event pairs, 117 based on Foata normal form. 0/2193 useless extension candidates. Maximal degree in co-relation 2879. Up to 251 conditions per place. [2025-03-04 06:52:43,357 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 21 selfloop transitions, 2 changer transitions 0/391 dead transitions. [2025-03-04 06:52:43,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 391 transitions, 840 flow [2025-03-04 06:52:43,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:43,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:43,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1217 transitions. [2025-03-04 06:52:43,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9434108527131783 [2025-03-04 06:52:43,360 INFO L175 Difference]: Start difference. First operand has 381 places, 393 transitions, 796 flow. Second operand 3 states and 1217 transitions. [2025-03-04 06:52:43,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 391 transitions, 840 flow [2025-03-04 06:52:43,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 391 transitions, 836 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:43,365 INFO L231 Difference]: Finished difference. Result has 376 places, 389 transitions, 794 flow [2025-03-04 06:52:43,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=376, PETRI_TRANSITIONS=389} [2025-03-04 06:52:43,366 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -16 predicate places. [2025-03-04 06:52:43,366 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 389 transitions, 794 flow [2025-03-04 06:52:43,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 397.3333333333333) internal successors, (1192), 3 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:43,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:43,367 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] [2025-03-04 06:52:43,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:52:43,367 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:52:43,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:43,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1976799396, now seen corresponding path program 1 times [2025-03-04 06:52:43,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:43,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189631440] [2025-03-04 06:52:43,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:43,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:43,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 06:52:43,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 06:52:43,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:43,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:43,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:43,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:43,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189631440] [2025-03-04 06:52:43,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189631440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:43,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:43,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:43,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429018332] [2025-03-04 06:52:43,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:43,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:43,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:43,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:43,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:43,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 430 [2025-03-04 06:52:43,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 389 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 397.3333333333333) internal successors, (1192), 3 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:43,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:43,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 430 [2025-03-04 06:52:43,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:43,580 INFO L124 PetriNetUnfolderBase]: 151/1516 cut-off events. [2025-03-04 06:52:43,581 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-04 06:52:43,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 1516 events. 151/1516 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 11445 event pairs, 52 based on Foata normal form. 0/1274 useless extension candidates. Maximal degree in co-relation 1504. Up to 135 conditions per place. [2025-03-04 06:52:43,601 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 21 selfloop transitions, 2 changer transitions 0/387 dead transitions. [2025-03-04 06:52:43,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 387 transitions, 838 flow [2025-03-04 06:52:43,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:43,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:43,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1217 transitions. [2025-03-04 06:52:43,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9434108527131783 [2025-03-04 06:52:43,604 INFO L175 Difference]: Start difference. First operand has 376 places, 389 transitions, 794 flow. Second operand 3 states and 1217 transitions. [2025-03-04 06:52:43,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 387 transitions, 838 flow [2025-03-04 06:52:43,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 387 transitions, 838 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:43,608 INFO L231 Difference]: Finished difference. Result has 373 places, 385 transitions, 796 flow [2025-03-04 06:52:43,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=373, PETRI_TRANSITIONS=385} [2025-03-04 06:52:43,609 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -19 predicate places. [2025-03-04 06:52:43,609 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 385 transitions, 796 flow [2025-03-04 06:52:43,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 397.3333333333333) internal successors, (1192), 3 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:43,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:43,610 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:43,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:52:43,610 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:52:43,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:43,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1268876137, now seen corresponding path program 1 times [2025-03-04 06:52:43,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:43,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950797441] [2025-03-04 06:52:43,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:43,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:43,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 06:52:43,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 06:52:43,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:43,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:43,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:43,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950797441] [2025-03-04 06:52:43,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950797441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:43,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:43,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:43,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161160009] [2025-03-04 06:52:43,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:43,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:43,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:43,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:43,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:43,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 430 [2025-03-04 06:52:43,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 385 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:43,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:43,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 430 [2025-03-04 06:52:43,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:44,009 INFO L124 PetriNetUnfolderBase]: 505/4357 cut-off events. [2025-03-04 06:52:44,009 INFO L125 PetriNetUnfolderBase]: For 63/71 co-relation queries the response was YES. [2025-03-04 06:52:44,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4838 conditions, 4357 events. 505/4357 cut-off events. For 63/71 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 44534 event pairs, 126 based on Foata normal form. 0/3687 useless extension candidates. Maximal degree in co-relation 3641. Up to 445 conditions per place. [2025-03-04 06:52:44,041 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 21 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2025-03-04 06:52:44,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 383 transitions, 840 flow [2025-03-04 06:52:44,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:44,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:44,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1217 transitions. [2025-03-04 06:52:44,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9434108527131783 [2025-03-04 06:52:44,044 INFO L175 Difference]: Start difference. First operand has 373 places, 385 transitions, 796 flow. Second operand 3 states and 1217 transitions. [2025-03-04 06:52:44,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 383 transitions, 840 flow [2025-03-04 06:52:44,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 383 transitions, 840 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:44,048 INFO L231 Difference]: Finished difference. Result has 370 places, 381 transitions, 798 flow [2025-03-04 06:52:44,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=370, PETRI_TRANSITIONS=381} [2025-03-04 06:52:44,050 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -22 predicate places. [2025-03-04 06:52:44,050 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 381 transitions, 798 flow [2025-03-04 06:52:44,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:44,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:44,051 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] [2025-03-04 06:52:44,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:52:44,051 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:52:44,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:44,051 INFO L85 PathProgramCache]: Analyzing trace with hash 583088302, now seen corresponding path program 1 times [2025-03-04 06:52:44,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:44,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022582898] [2025-03-04 06:52:44,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:44,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:44,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 06:52:44,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 06:52:44,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:44,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:44,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:44,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:44,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022582898] [2025-03-04 06:52:44,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022582898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:44,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:44,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:52:44,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225656627] [2025-03-04 06:52:44,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:44,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:44,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:44,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:44,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:44,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2025-03-04 06:52:44,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 381 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 409.3333333333333) internal successors, (1228), 3 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:44,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:44,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2025-03-04 06:52:44,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:44,273 INFO L124 PetriNetUnfolderBase]: 98/1285 cut-off events. [2025-03-04 06:52:44,273 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:52:44,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1388 conditions, 1285 events. 98/1285 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 9485 event pairs, 10 based on Foata normal form. 0/1105 useless extension candidates. Maximal degree in co-relation 1124. Up to 35 conditions per place. [2025-03-04 06:52:44,290 INFO L140 encePairwiseOnDemand]: 426/430 looper letters, 14 selfloop transitions, 3 changer transitions 0/385 dead transitions. [2025-03-04 06:52:44,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 385 transitions, 842 flow [2025-03-04 06:52:44,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:44,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1242 transitions. [2025-03-04 06:52:44,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9627906976744186 [2025-03-04 06:52:44,293 INFO L175 Difference]: Start difference. First operand has 370 places, 381 transitions, 798 flow. Second operand 3 states and 1242 transitions. [2025-03-04 06:52:44,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 385 transitions, 842 flow [2025-03-04 06:52:44,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 385 transitions, 842 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:44,299 INFO L231 Difference]: Finished difference. Result has 374 places, 383 transitions, 820 flow [2025-03-04 06:52:44,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=820, PETRI_PLACES=374, PETRI_TRANSITIONS=383} [2025-03-04 06:52:44,300 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -18 predicate places. [2025-03-04 06:52:44,300 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 383 transitions, 820 flow [2025-03-04 06:52:44,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.3333333333333) internal successors, (1228), 3 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:44,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:44,301 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] [2025-03-04 06:52:44,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:52:44,301 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:52:44,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:44,302 INFO L85 PathProgramCache]: Analyzing trace with hash 261235663, now seen corresponding path program 1 times [2025-03-04 06:52:44,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:44,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133833141] [2025-03-04 06:52:44,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:44,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:44,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 06:52:44,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 06:52:44,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:44,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:44,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:44,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:44,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133833141] [2025-03-04 06:52:44,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133833141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:44,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:44,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:44,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693467482] [2025-03-04 06:52:44,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:44,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:44,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:44,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:44,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:44,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2025-03-04 06:52:44,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 383 transitions, 820 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:44,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:44,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2025-03-04 06:52:44,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:44,616 INFO L124 PetriNetUnfolderBase]: 206/2208 cut-off events. [2025-03-04 06:52:44,616 INFO L125 PetriNetUnfolderBase]: For 28/34 co-relation queries the response was YES. [2025-03-04 06:52:44,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2500 conditions, 2208 events. 206/2208 cut-off events. For 28/34 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 19294 event pairs, 16 based on Foata normal form. 1/1935 useless extension candidates. Maximal degree in co-relation 2113. Up to 166 conditions per place. [2025-03-04 06:52:44,633 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 20 selfloop transitions, 4 changer transitions 0/388 dead transitions. [2025-03-04 06:52:44,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 388 transitions, 883 flow [2025-03-04 06:52:44,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:44,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:44,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1234 transitions. [2025-03-04 06:52:44,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9565891472868217 [2025-03-04 06:52:44,635 INFO L175 Difference]: Start difference. First operand has 374 places, 383 transitions, 820 flow. Second operand 3 states and 1234 transitions. [2025-03-04 06:52:44,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 388 transitions, 883 flow [2025-03-04 06:52:44,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 388 transitions, 877 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:44,639 INFO L231 Difference]: Finished difference. Result has 371 places, 383 transitions, 834 flow [2025-03-04 06:52:44,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=371, PETRI_TRANSITIONS=383} [2025-03-04 06:52:44,640 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -21 predicate places. [2025-03-04 06:52:44,640 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 383 transitions, 834 flow [2025-03-04 06:52:44,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:44,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:44,641 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:44,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:52:44,642 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:52:44,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:44,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1939397108, now seen corresponding path program 1 times [2025-03-04 06:52:44,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:44,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884141348] [2025-03-04 06:52:44,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:44,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:44,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 06:52:44,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 06:52:44,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:44,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:44,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:44,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:44,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884141348] [2025-03-04 06:52:44,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884141348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:44,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:44,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:44,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483162785] [2025-03-04 06:52:44,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:44,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:44,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:44,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:44,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:44,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2025-03-04 06:52:44,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 383 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:44,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:44,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2025-03-04 06:52:44,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:45,023 INFO L124 PetriNetUnfolderBase]: 262/2943 cut-off events. [2025-03-04 06:52:45,024 INFO L125 PetriNetUnfolderBase]: For 34/65 co-relation queries the response was YES. [2025-03-04 06:52:45,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3279 conditions, 2943 events. 262/2943 cut-off events. For 34/65 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 26341 event pairs, 36 based on Foata normal form. 2/2571 useless extension candidates. Maximal degree in co-relation 2942. Up to 198 conditions per place. [2025-03-04 06:52:45,047 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 20 selfloop transitions, 4 changer transitions 0/388 dead transitions. [2025-03-04 06:52:45,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 388 transitions, 897 flow [2025-03-04 06:52:45,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:45,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:45,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1234 transitions. [2025-03-04 06:52:45,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9565891472868217 [2025-03-04 06:52:45,050 INFO L175 Difference]: Start difference. First operand has 371 places, 383 transitions, 834 flow. Second operand 3 states and 1234 transitions. [2025-03-04 06:52:45,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 388 transitions, 897 flow [2025-03-04 06:52:45,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 388 transitions, 897 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:45,054 INFO L231 Difference]: Finished difference. Result has 370 places, 383 transitions, 854 flow [2025-03-04 06:52:45,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=854, PETRI_PLACES=370, PETRI_TRANSITIONS=383} [2025-03-04 06:52:45,055 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -22 predicate places. [2025-03-04 06:52:45,055 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 383 transitions, 854 flow [2025-03-04 06:52:45,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:45,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:45,056 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:45,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:52:45,056 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:52:45,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:45,056 INFO L85 PathProgramCache]: Analyzing trace with hash 564984091, now seen corresponding path program 1 times [2025-03-04 06:52:45,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:45,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129601213] [2025-03-04 06:52:45,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:45,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:45,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 06:52:45,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 06:52:45,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:45,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:45,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:45,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:45,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129601213] [2025-03-04 06:52:45,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129601213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:45,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:45,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:45,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136490958] [2025-03-04 06:52:45,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:45,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:45,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:45,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:45,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:45,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 430 [2025-03-04 06:52:45,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 383 transitions, 854 flow. Second operand has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:45,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:45,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 430 [2025-03-04 06:52:45,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:45,421 INFO L124 PetriNetUnfolderBase]: 236/2977 cut-off events. [2025-03-04 06:52:45,421 INFO L125 PetriNetUnfolderBase]: For 6/35 co-relation queries the response was YES. [2025-03-04 06:52:45,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3305 conditions, 2977 events. 236/2977 cut-off events. For 6/35 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 27818 event pairs, 14 based on Foata normal form. 4/2617 useless extension candidates. Maximal degree in co-relation 2968. Up to 62 conditions per place. [2025-03-04 06:52:45,446 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 11 selfloop transitions, 2 changer transitions 0/384 dead transitions. [2025-03-04 06:52:45,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 384 transitions, 884 flow [2025-03-04 06:52:45,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:45,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:45,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1241 transitions. [2025-03-04 06:52:45,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.962015503875969 [2025-03-04 06:52:45,449 INFO L175 Difference]: Start difference. First operand has 370 places, 383 transitions, 854 flow. Second operand 3 states and 1241 transitions. [2025-03-04 06:52:45,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 384 transitions, 884 flow [2025-03-04 06:52:45,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 384 transitions, 884 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:45,455 INFO L231 Difference]: Finished difference. Result has 371 places, 382 transitions, 856 flow [2025-03-04 06:52:45,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=371, PETRI_TRANSITIONS=382} [2025-03-04 06:52:45,456 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -21 predicate places. [2025-03-04 06:52:45,457 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 382 transitions, 856 flow [2025-03-04 06:52:45,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:45,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:45,458 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] [2025-03-04 06:52:45,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:52:45,458 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:52:45,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:45,459 INFO L85 PathProgramCache]: Analyzing trace with hash -211148869, now seen corresponding path program 1 times [2025-03-04 06:52:45,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:45,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591090566] [2025-03-04 06:52:45,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:45,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:45,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 06:52:45,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 06:52:45,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:45,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:45,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:45,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:45,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591090566] [2025-03-04 06:52:45,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591090566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:45,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:45,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:52:45,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354496302] [2025-03-04 06:52:45,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:45,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:45,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:45,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:45,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:45,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2025-03-04 06:52:45,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 382 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:45,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:45,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2025-03-04 06:52:45,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:45,877 INFO L124 PetriNetUnfolderBase]: 260/2958 cut-off events. [2025-03-04 06:52:45,877 INFO L125 PetriNetUnfolderBase]: For 27/76 co-relation queries the response was YES. [2025-03-04 06:52:45,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3377 conditions, 2958 events. 260/2958 cut-off events. For 27/76 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 27968 event pairs, 42 based on Foata normal form. 0/2586 useless extension candidates. Maximal degree in co-relation 2920. Up to 136 conditions per place. [2025-03-04 06:52:45,907 INFO L140 encePairwiseOnDemand]: 426/430 looper letters, 14 selfloop transitions, 3 changer transitions 0/386 dead transitions. [2025-03-04 06:52:45,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 386 transitions, 900 flow [2025-03-04 06:52:45,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1242 transitions. [2025-03-04 06:52:45,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9627906976744186 [2025-03-04 06:52:45,910 INFO L175 Difference]: Start difference. First operand has 371 places, 382 transitions, 856 flow. Second operand 3 states and 1242 transitions. [2025-03-04 06:52:45,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 386 transitions, 900 flow [2025-03-04 06:52:45,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 386 transitions, 896 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:45,915 INFO L231 Difference]: Finished difference. Result has 373 places, 384 transitions, 874 flow [2025-03-04 06:52:45,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=874, PETRI_PLACES=373, PETRI_TRANSITIONS=384} [2025-03-04 06:52:45,916 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -19 predicate places. [2025-03-04 06:52:45,916 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 384 transitions, 874 flow [2025-03-04 06:52:45,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:45,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:45,917 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-03-04 06:52:45,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:52:45,917 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:52:45,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:45,917 INFO L85 PathProgramCache]: Analyzing trace with hash 376351144, now seen corresponding path program 1 times [2025-03-04 06:52:45,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:45,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220166958] [2025-03-04 06:52:45,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:45,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:45,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 06:52:45,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 06:52:45,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:45,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:45,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:45,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:45,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220166958] [2025-03-04 06:52:45,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220166958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:45,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:45,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:45,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314170685] [2025-03-04 06:52:45,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:45,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:45,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:45,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:45,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:45,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2025-03-04 06:52:45,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 384 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:45,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:45,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2025-03-04 06:52:45,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:46,468 INFO L124 PetriNetUnfolderBase]: 390/4199 cut-off events. [2025-03-04 06:52:46,468 INFO L125 PetriNetUnfolderBase]: For 60/116 co-relation queries the response was YES. [2025-03-04 06:52:46,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4849 conditions, 4199 events. 390/4199 cut-off events. For 60/116 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 42508 event pairs, 32 based on Foata normal form. 2/3712 useless extension candidates. Maximal degree in co-relation 3856. Up to 132 conditions per place. [2025-03-04 06:52:46,516 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 12 selfloop transitions, 2 changer transitions 0/385 dead transitions. [2025-03-04 06:52:46,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 385 transitions, 906 flow [2025-03-04 06:52:46,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:46,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:46,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1239 transitions. [2025-03-04 06:52:46,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9604651162790697 [2025-03-04 06:52:46,518 INFO L175 Difference]: Start difference. First operand has 373 places, 384 transitions, 874 flow. Second operand 3 states and 1239 transitions. [2025-03-04 06:52:46,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 385 transitions, 906 flow [2025-03-04 06:52:46,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 385 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:46,523 INFO L231 Difference]: Finished difference. Result has 372 places, 383 transitions, 870 flow [2025-03-04 06:52:46,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=870, PETRI_PLACES=372, PETRI_TRANSITIONS=383} [2025-03-04 06:52:46,524 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -20 predicate places. [2025-03-04 06:52:46,524 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 383 transitions, 870 flow [2025-03-04 06:52:46,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:46,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:46,525 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-03-04 06:52:46,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:52:46,525 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:52:46,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:46,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1750764161, now seen corresponding path program 1 times [2025-03-04 06:52:46,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:46,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224549074] [2025-03-04 06:52:46,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:46,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:46,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 06:52:46,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 06:52:46,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:46,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:46,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:46,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:46,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224549074] [2025-03-04 06:52:46,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224549074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:46,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:46,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:46,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528143864] [2025-03-04 06:52:46,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:46,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:46,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:46,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:46,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:46,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2025-03-04 06:52:46,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 383 transitions, 870 flow. Second operand has 3 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:46,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:46,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2025-03-04 06:52:46,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:47,071 INFO L124 PetriNetUnfolderBase]: 648/5839 cut-off events. [2025-03-04 06:52:47,072 INFO L125 PetriNetUnfolderBase]: For 74/82 co-relation queries the response was YES. [2025-03-04 06:52:47,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6872 conditions, 5839 events. 648/5839 cut-off events. For 74/82 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 64494 event pairs, 68 based on Foata normal form. 1/5262 useless extension candidates. Maximal degree in co-relation 5944. Up to 585 conditions per place. [2025-03-04 06:52:47,130 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 19 selfloop transitions, 4 changer transitions 0/387 dead transitions. [2025-03-04 06:52:47,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 387 transitions, 928 flow [2025-03-04 06:52:47,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:47,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1233 transitions. [2025-03-04 06:52:47,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9558139534883721 [2025-03-04 06:52:47,132 INFO L175 Difference]: Start difference. First operand has 372 places, 383 transitions, 870 flow. Second operand 3 states and 1233 transitions. [2025-03-04 06:52:47,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 387 transitions, 928 flow [2025-03-04 06:52:47,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 387 transitions, 924 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:47,138 INFO L231 Difference]: Finished difference. Result has 369 places, 383 transitions, 886 flow [2025-03-04 06:52:47,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=886, PETRI_PLACES=369, PETRI_TRANSITIONS=383} [2025-03-04 06:52:47,139 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -23 predicate places. [2025-03-04 06:52:47,139 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 383 transitions, 886 flow [2025-03-04 06:52:47,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:47,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:47,140 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:47,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:52:47,140 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:52:47,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:47,141 INFO L85 PathProgramCache]: Analyzing trace with hash 80605662, now seen corresponding path program 1 times [2025-03-04 06:52:47,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:47,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87918143] [2025-03-04 06:52:47,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:47,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:47,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 06:52:47,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 06:52:47,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:47,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:47,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:47,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:47,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87918143] [2025-03-04 06:52:47,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87918143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:47,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:47,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:52:47,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541737799] [2025-03-04 06:52:47,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:47,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:47,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:47,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:47,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:47,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2025-03-04 06:52:47,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 383 transitions, 886 flow. Second operand has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:47,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:47,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2025-03-04 06:52:47,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:47,559 INFO L124 PetriNetUnfolderBase]: 413/3953 cut-off events. [2025-03-04 06:52:47,559 INFO L125 PetriNetUnfolderBase]: For 107/136 co-relation queries the response was YES. [2025-03-04 06:52:47,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4768 conditions, 3953 events. 413/3953 cut-off events. For 107/136 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 39227 event pairs, 64 based on Foata normal form. 2/3510 useless extension candidates. Maximal degree in co-relation 4191. Up to 287 conditions per place. [2025-03-04 06:52:47,609 INFO L140 encePairwiseOnDemand]: 426/430 looper letters, 14 selfloop transitions, 3 changer transitions 0/387 dead transitions. [2025-03-04 06:52:47,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 387 transitions, 930 flow [2025-03-04 06:52:47,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:47,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1242 transitions. [2025-03-04 06:52:47,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9627906976744186 [2025-03-04 06:52:47,611 INFO L175 Difference]: Start difference. First operand has 369 places, 383 transitions, 886 flow. Second operand 3 states and 1242 transitions. [2025-03-04 06:52:47,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 387 transitions, 930 flow [2025-03-04 06:52:47,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 387 transitions, 930 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:52:47,615 INFO L231 Difference]: Finished difference. Result has 373 places, 385 transitions, 908 flow [2025-03-04 06:52:47,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=908, PETRI_PLACES=373, PETRI_TRANSITIONS=385} [2025-03-04 06:52:47,616 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -19 predicate places. [2025-03-04 06:52:47,616 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 385 transitions, 908 flow [2025-03-04 06:52:47,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:47,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:47,617 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-03-04 06:52:47,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:52:47,617 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:52:47,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:47,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1337182795, now seen corresponding path program 1 times [2025-03-04 06:52:47,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:47,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132176121] [2025-03-04 06:52:47,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:47,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:47,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 06:52:47,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 06:52:47,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:47,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:47,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:47,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:47,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132176121] [2025-03-04 06:52:47,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132176121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:47,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:47,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:47,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889007391] [2025-03-04 06:52:47,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:47,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:47,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:47,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:47,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:47,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2025-03-04 06:52:47,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 385 transitions, 908 flow. Second operand has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:47,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:47,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2025-03-04 06:52:47,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:47,983 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1073] L56-10-->L56-9: Formula: true InVars {} OutVars{thread3Thread1of1ForFork1_#t~nondet24#1=|v_thread3Thread1of1ForFork1_#t~nondet24#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet24#1][258], [Black: 448#(not |thread1Thread1of1ForFork0_#t~short3#1|), 436#(= |#race~sort_label_is_null_1~0| 0), Black: 451#true, 457#(= |#race~sort_label_2~0| 0), 479#true, Black: 455#true, 440#(= |#race~sort_label_is_null_3~0| 0), Black: 464#(not |thread2Thread1of1ForFork2_#t~short11#1|), 474#true, Black: 434#true, 444#(= |#race~sort_label_is_null_5~0| 0), 472#(= |#race~sort_label_4~0| 0), Black: 470#true, Black: 438#true, 367#L56-9true, Black: 442#true, Black: 476#(not |thread3Thread1of1ForFork1_#t~short19#1|), 163#L77true, 453#(= |#race~sort_label_0~0| 0)]) [2025-03-04 06:52:47,984 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2025-03-04 06:52:47,984 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-03-04 06:52:47,984 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-03-04 06:52:47,984 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-03-04 06:52:48,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1073] L56-10-->L56-9: Formula: true InVars {} OutVars{thread3Thread1of1ForFork1_#t~nondet24#1=|v_thread3Thread1of1ForFork1_#t~nondet24#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet24#1][258], [Black: 448#(not |thread1Thread1of1ForFork0_#t~short3#1|), 436#(= |#race~sort_label_is_null_1~0| 0), Black: 451#true, 457#(= |#race~sort_label_2~0| 0), 479#true, Black: 455#true, 440#(= |#race~sort_label_is_null_3~0| 0), Black: 464#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 434#true, 444#(= |#race~sort_label_is_null_5~0| 0), 472#(= |#race~sort_label_4~0| 0), Black: 470#true, Black: 438#true, 367#L56-9true, Black: 442#true, Black: 474#true, 163#L77true, 476#(not |thread3Thread1of1ForFork1_#t~short19#1|), 453#(= |#race~sort_label_0~0| 0)]) [2025-03-04 06:52:48,006 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is not cut-off event [2025-03-04 06:52:48,006 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is not cut-off event [2025-03-04 06:52:48,006 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2025-03-04 06:52:48,006 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2025-03-04 06:52:48,014 INFO L124 PetriNetUnfolderBase]: 392/3250 cut-off events. [2025-03-04 06:52:48,015 INFO L125 PetriNetUnfolderBase]: For 208/236 co-relation queries the response was YES. [2025-03-04 06:52:48,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4302 conditions, 3250 events. 392/3250 cut-off events. For 208/236 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 31553 event pairs, 48 based on Foata normal form. 2/2986 useless extension candidates. Maximal degree in co-relation 3700. Up to 248 conditions per place. [2025-03-04 06:52:48,054 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 12 selfloop transitions, 2 changer transitions 0/386 dead transitions. [2025-03-04 06:52:48,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 386 transitions, 940 flow [2025-03-04 06:52:48,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:48,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1239 transitions. [2025-03-04 06:52:48,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9604651162790697 [2025-03-04 06:52:48,057 INFO L175 Difference]: Start difference. First operand has 373 places, 385 transitions, 908 flow. Second operand 3 states and 1239 transitions. [2025-03-04 06:52:48,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 386 transitions, 940 flow [2025-03-04 06:52:48,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 386 transitions, 934 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:48,064 INFO L231 Difference]: Finished difference. Result has 372 places, 384 transitions, 904 flow [2025-03-04 06:52:48,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=904, PETRI_PLACES=372, PETRI_TRANSITIONS=384} [2025-03-04 06:52:48,065 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -20 predicate places. [2025-03-04 06:52:48,065 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 384 transitions, 904 flow [2025-03-04 06:52:48,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:48,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:48,065 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:48,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:52:48,066 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:52:48,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:48,066 INFO L85 PathProgramCache]: Analyzing trace with hash -440044797, now seen corresponding path program 1 times [2025-03-04 06:52:48,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:48,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214053257] [2025-03-04 06:52:48,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:48,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:48,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 06:52:48,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 06:52:48,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:48,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:48,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:48,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:48,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214053257] [2025-03-04 06:52:48,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214053257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:48,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:48,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:48,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908243847] [2025-03-04 06:52:48,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:48,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:48,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:48,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:48,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:48,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 430 [2025-03-04 06:52:48,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 384 transitions, 904 flow. Second operand has 3 states, 3 states have (on average 414.0) internal successors, (1242), 3 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:48,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:48,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 430 [2025-03-04 06:52:48,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:48,609 INFO L124 PetriNetUnfolderBase]: 388/4741 cut-off events. [2025-03-04 06:52:48,610 INFO L125 PetriNetUnfolderBase]: For 7/17 co-relation queries the response was YES. [2025-03-04 06:52:48,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5737 conditions, 4741 events. 388/4741 cut-off events. For 7/17 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 50268 event pairs, 11 based on Foata normal form. 0/4355 useless extension candidates. Maximal degree in co-relation 5160. Up to 210 conditions per place. [2025-03-04 06:52:48,656 INFO L140 encePairwiseOnDemand]: 428/430 looper letters, 8 selfloop transitions, 1 changer transitions 0/383 dead transitions. [2025-03-04 06:52:48,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 383 transitions, 920 flow [2025-03-04 06:52:48,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:48,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:48,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1243 transitions. [2025-03-04 06:52:48,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9635658914728682 [2025-03-04 06:52:48,658 INFO L175 Difference]: Start difference. First operand has 372 places, 384 transitions, 904 flow. Second operand 3 states and 1243 transitions. [2025-03-04 06:52:48,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 383 transitions, 920 flow [2025-03-04 06:52:48,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 383 transitions, 916 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:48,665 INFO L231 Difference]: Finished difference. Result has 371 places, 383 transitions, 900 flow [2025-03-04 06:52:48,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=900, PETRI_PLACES=371, PETRI_TRANSITIONS=383} [2025-03-04 06:52:48,666 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -21 predicate places. [2025-03-04 06:52:48,666 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 383 transitions, 900 flow [2025-03-04 06:52:48,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.0) internal successors, (1242), 3 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:48,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:48,667 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:48,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:52:48,667 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:52:48,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:48,668 INFO L85 PathProgramCache]: Analyzing trace with hash -893090630, now seen corresponding path program 1 times [2025-03-04 06:52:48,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:48,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309303934] [2025-03-04 06:52:48,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:48,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:48,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 06:52:48,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 06:52:48,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:48,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:48,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:48,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309303934] [2025-03-04 06:52:48,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309303934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:48,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:48,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:48,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384941517] [2025-03-04 06:52:48,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:48,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:48,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:48,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:48,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:48,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2025-03-04 06:52:48,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 383 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:48,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:48,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2025-03-04 06:52:48,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:49,340 INFO L124 PetriNetUnfolderBase]: 447/5342 cut-off events. [2025-03-04 06:52:49,341 INFO L125 PetriNetUnfolderBase]: For 11/35 co-relation queries the response was YES. [2025-03-04 06:52:49,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6362 conditions, 5342 events. 447/5342 cut-off events. For 11/35 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 58415 event pairs, 25 based on Foata normal form. 0/4912 useless extension candidates. Maximal degree in co-relation 6230. Up to 193 conditions per place. [2025-03-04 06:52:49,390 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 10 selfloop transitions, 1 changer transitions 0/381 dead transitions. [2025-03-04 06:52:49,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 381 transitions, 918 flow [2025-03-04 06:52:49,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:49,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:49,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1237 transitions. [2025-03-04 06:52:49,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9589147286821705 [2025-03-04 06:52:49,393 INFO L175 Difference]: Start difference. First operand has 371 places, 383 transitions, 900 flow. Second operand 3 states and 1237 transitions. [2025-03-04 06:52:49,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 381 transitions, 918 flow [2025-03-04 06:52:49,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 381 transitions, 917 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:52:49,398 INFO L231 Difference]: Finished difference. Result has 370 places, 381 transitions, 897 flow [2025-03-04 06:52:49,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=897, PETRI_PLACES=370, PETRI_TRANSITIONS=381} [2025-03-04 06:52:49,399 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -22 predicate places. [2025-03-04 06:52:49,399 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 381 transitions, 897 flow [2025-03-04 06:52:49,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:49,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:49,400 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:49,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:52:49,400 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-04 06:52:49,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:49,401 INFO L85 PathProgramCache]: Analyzing trace with hash 290312664, now seen corresponding path program 1 times [2025-03-04 06:52:49,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:49,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106831774] [2025-03-04 06:52:49,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:49,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:49,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-04 06:52:49,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-04 06:52:49,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:49,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:49,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:52:49,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:49,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106831774] [2025-03-04 06:52:49,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106831774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:49,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:49,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:52:49,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287737614] [2025-03-04 06:52:49,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:49,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:49,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:49,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:49,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:49,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2025-03-04 06:52:49,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 381 transitions, 897 flow. Second operand has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:49,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:49,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2025-03-04 06:52:49,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:49,817 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1078] L56-9-->L56-7: Formula: (= |v_#race~result_8~0_3| |v_thread3Thread1of1ForFork1_#t~nondet24#1_3|) InVars {thread3Thread1of1ForFork1_#t~nondet24#1=|v_thread3Thread1of1ForFork1_#t~nondet24#1_3|} OutVars{#race~result_8~0=|v_#race~result_8~0_3|, thread3Thread1of1ForFork1_#t~nondet24#1=|v_thread3Thread1of1ForFork1_#t~nondet24#1_3|} AuxVars[] AssignedVars[#race~result_8~0][267], [Black: 448#(not |thread1Thread1of1ForFork0_#t~short3#1|), 436#(= |#race~sort_label_is_null_1~0| 0), 485#true, Black: 451#true, 457#(= |#race~sort_label_2~0| 0), Black: 455#true, 440#(= |#race~sort_label_is_null_3~0| 0), 112#L56-7true, Black: 464#(not |thread2Thread1of1ForFork2_#t~short11#1|), 488#true, Black: 434#true, 444#(= |#race~sort_label_is_null_5~0| 0), 472#(= |#race~sort_label_4~0| 0), Black: 470#true, Black: 438#true, Black: 442#true, 163#L77true, Black: 476#(not |thread3Thread1of1ForFork1_#t~short19#1|), 453#(= |#race~sort_label_0~0| 0)]) [2025-03-04 06:52:49,817 INFO L294 olderBase$Statistics]: this new event has 182 ancestors and is cut-off event [2025-03-04 06:52:49,817 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2025-03-04 06:52:49,817 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-03-04 06:52:49,817 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2025-03-04 06:52:49,822 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1078] L56-9-->L56-7: Formula: (= |v_#race~result_8~0_3| |v_thread3Thread1of1ForFork1_#t~nondet24#1_3|) InVars {thread3Thread1of1ForFork1_#t~nondet24#1=|v_thread3Thread1of1ForFork1_#t~nondet24#1_3|} OutVars{#race~result_8~0=|v_#race~result_8~0_3|, thread3Thread1of1ForFork1_#t~nondet24#1=|v_thread3Thread1of1ForFork1_#t~nondet24#1_3|} AuxVars[] AssignedVars[#race~result_8~0][267], [Black: 448#(not |thread1Thread1of1ForFork0_#t~short3#1|), 436#(= |#race~sort_label_is_null_1~0| 0), 485#true, Black: 451#true, 457#(= |#race~sort_label_2~0| 0), Black: 455#true, 440#(= |#race~sort_label_is_null_3~0| 0), 112#L56-7true, Black: 464#(not |thread2Thread1of1ForFork2_#t~short11#1|), 488#true, Black: 434#true, 444#(= |#race~sort_label_is_null_5~0| 0), 472#(= |#race~sort_label_4~0| 0), Black: 438#true, Black: 470#true, Black: 474#true, Black: 442#true, 163#L77true, 453#(= |#race~sort_label_0~0| 0)]) [2025-03-04 06:52:49,822 INFO L294 olderBase$Statistics]: this new event has 174 ancestors and is not cut-off event [2025-03-04 06:52:49,822 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2025-03-04 06:52:49,822 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2025-03-04 06:52:49,822 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-03-04 06:52:49,829 INFO L124 PetriNetUnfolderBase]: 285/2989 cut-off events. [2025-03-04 06:52:49,829 INFO L125 PetriNetUnfolderBase]: For 38/52 co-relation queries the response was YES. [2025-03-04 06:52:49,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3652 conditions, 2989 events. 285/2989 cut-off events. For 38/52 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 27847 event pairs, 33 based on Foata normal form. 5/2739 useless extension candidates. Maximal degree in co-relation 3575. Up to 150 conditions per place. [2025-03-04 06:52:49,859 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 0 selfloop transitions, 0 changer transitions 379/379 dead transitions. [2025-03-04 06:52:49,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 379 transitions, 913 flow [2025-03-04 06:52:49,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:49,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:49,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1236 transitions. [2025-03-04 06:52:49,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.958139534883721 [2025-03-04 06:52:49,861 INFO L175 Difference]: Start difference. First operand has 370 places, 381 transitions, 897 flow. Second operand 3 states and 1236 transitions. [2025-03-04 06:52:49,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 379 transitions, 913 flow [2025-03-04 06:52:49,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 379 transitions, 912 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:52:49,865 INFO L231 Difference]: Finished difference. Result has 369 places, 0 transitions, 0 flow [2025-03-04 06:52:49,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=369, PETRI_TRANSITIONS=0} [2025-03-04 06:52:49,865 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -23 predicate places. [2025-03-04 06:52:49,866 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 0 transitions, 0 flow [2025-03-04 06:52:49,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:49,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (79 of 80 remaining) [2025-03-04 06:52:49,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (78 of 80 remaining) [2025-03-04 06:52:49,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (77 of 80 remaining) [2025-03-04 06:52:49,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (76 of 80 remaining) [2025-03-04 06:52:49,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (75 of 80 remaining) [2025-03-04 06:52:49,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (74 of 80 remaining) [2025-03-04 06:52:49,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (73 of 80 remaining) [2025-03-04 06:52:49,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (72 of 80 remaining) [2025-03-04 06:52:49,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (71 of 80 remaining) [2025-03-04 06:52:49,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (70 of 80 remaining) [2025-03-04 06:52:49,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (69 of 80 remaining) [2025-03-04 06:52:49,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (68 of 80 remaining) [2025-03-04 06:52:49,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (67 of 80 remaining) [2025-03-04 06:52:49,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (66 of 80 remaining) [2025-03-04 06:52:49,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (65 of 80 remaining) [2025-03-04 06:52:49,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (64 of 80 remaining) [2025-03-04 06:52:49,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (63 of 80 remaining) [2025-03-04 06:52:49,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (62 of 80 remaining) [2025-03-04 06:52:49,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (61 of 80 remaining) [2025-03-04 06:52:49,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (60 of 80 remaining) [2025-03-04 06:52:49,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (59 of 80 remaining) [2025-03-04 06:52:49,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (58 of 80 remaining) [2025-03-04 06:52:49,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (57 of 80 remaining) [2025-03-04 06:52:49,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (56 of 80 remaining) [2025-03-04 06:52:49,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (55 of 80 remaining) [2025-03-04 06:52:49,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (54 of 80 remaining) [2025-03-04 06:52:49,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (53 of 80 remaining) [2025-03-04 06:52:49,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (52 of 80 remaining) [2025-03-04 06:52:49,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (51 of 80 remaining) [2025-03-04 06:52:49,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (50 of 80 remaining) [2025-03-04 06:52:49,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (49 of 80 remaining) [2025-03-04 06:52:49,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (48 of 80 remaining) [2025-03-04 06:52:49,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (47 of 80 remaining) [2025-03-04 06:52:49,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (46 of 80 remaining) [2025-03-04 06:52:49,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (45 of 80 remaining) [2025-03-04 06:52:49,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (44 of 80 remaining) [2025-03-04 06:52:49,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (43 of 80 remaining) [2025-03-04 06:52:49,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (42 of 80 remaining) [2025-03-04 06:52:49,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (41 of 80 remaining) [2025-03-04 06:52:49,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (40 of 80 remaining) [2025-03-04 06:52:49,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (39 of 80 remaining) [2025-03-04 06:52:49,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (38 of 80 remaining) [2025-03-04 06:52:49,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (37 of 80 remaining) [2025-03-04 06:52:49,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (36 of 80 remaining) [2025-03-04 06:52:49,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 80 remaining) [2025-03-04 06:52:49,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 80 remaining) [2025-03-04 06:52:49,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 80 remaining) [2025-03-04 06:52:49,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (32 of 80 remaining) [2025-03-04 06:52:49,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (31 of 80 remaining) [2025-03-04 06:52:49,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (30 of 80 remaining) [2025-03-04 06:52:49,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (29 of 80 remaining) [2025-03-04 06:52:49,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (28 of 80 remaining) [2025-03-04 06:52:49,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (27 of 80 remaining) [2025-03-04 06:52:49,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (26 of 80 remaining) [2025-03-04 06:52:49,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (25 of 80 remaining) [2025-03-04 06:52:49,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (24 of 80 remaining) [2025-03-04 06:52:49,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 80 remaining) [2025-03-04 06:52:49,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (22 of 80 remaining) [2025-03-04 06:52:49,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (21 of 80 remaining) [2025-03-04 06:52:49,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (20 of 80 remaining) [2025-03-04 06:52:49,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (19 of 80 remaining) [2025-03-04 06:52:49,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (18 of 80 remaining) [2025-03-04 06:52:49,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (17 of 80 remaining) [2025-03-04 06:52:49,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (16 of 80 remaining) [2025-03-04 06:52:49,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (15 of 80 remaining) [2025-03-04 06:52:49,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (14 of 80 remaining) [2025-03-04 06:52:49,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (13 of 80 remaining) [2025-03-04 06:52:49,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (12 of 80 remaining) [2025-03-04 06:52:49,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (11 of 80 remaining) [2025-03-04 06:52:49,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 80 remaining) [2025-03-04 06:52:49,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 80 remaining) [2025-03-04 06:52:49,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 80 remaining) [2025-03-04 06:52:49,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (7 of 80 remaining) [2025-03-04 06:52:49,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (6 of 80 remaining) [2025-03-04 06:52:49,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 80 remaining) [2025-03-04 06:52:49,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (4 of 80 remaining) [2025-03-04 06:52:49,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (3 of 80 remaining) [2025-03-04 06:52:49,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 80 remaining) [2025-03-04 06:52:49,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (1 of 80 remaining) [2025-03-04 06:52:49,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (0 of 80 remaining) [2025-03-04 06:52:49,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 06:52:49,874 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] [2025-03-04 06:52:49,878 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:52:49,879 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:52:49,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:52:49 BasicIcfg [2025-03-04 06:52:49,883 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:52:49,883 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:52:49,883 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:52:49,883 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:52:49,884 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:52:40" (3/4) ... [2025-03-04 06:52:49,885 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:52:49,887 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 06:52:49,887 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 06:52:49,887 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 06:52:49,890 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-04 06:52:49,890 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 06:52:49,891 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 06:52:49,891 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:52:49,951 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:52:49,952 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:52:49,952 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:52:49,953 INFO L158 Benchmark]: Toolchain (without parser) took 9838.43ms. Allocated memory was 142.6MB in the beginning and 906.0MB in the end (delta: 763.4MB). Free memory was 111.8MB in the beginning and 429.6MB in the end (delta: -317.7MB). Peak memory consumption was 441.3MB. Max. memory is 16.1GB. [2025-03-04 06:52:49,953 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:52:49,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.50ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 100.0MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:52:49,953 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.10ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 97.0MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:52:49,953 INFO L158 Benchmark]: Boogie Preprocessor took 25.43ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 96.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:52:49,953 INFO L158 Benchmark]: IcfgBuilder took 550.84ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 68.7MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 06:52:49,954 INFO L158 Benchmark]: TraceAbstraction took 8952.63ms. Allocated memory was 142.6MB in the beginning and 906.0MB in the end (delta: 763.4MB). Free memory was 67.7MB in the beginning and 438.0MB in the end (delta: -370.3MB). Peak memory consumption was 391.0MB. Max. memory is 16.1GB. [2025-03-04 06:52:49,954 INFO L158 Benchmark]: Witness Printer took 68.93ms. Allocated memory is still 906.0MB. Free memory was 438.0MB in the beginning and 429.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:52:49,955 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.26ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.50ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 100.0MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.10ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 97.0MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.43ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 96.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 550.84ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 68.7MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8952.63ms. Allocated memory was 142.6MB in the beginning and 906.0MB in the end (delta: 763.4MB). Free memory was 67.7MB in the beginning and 438.0MB in the end (delta: -370.3MB). Peak memory consumption was 391.0MB. Max. memory is 16.1GB. * Witness Printer took 68.93ms. Allocated memory is still 906.0MB. Free memory was 438.0MB in the beginning and 429.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: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: 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: 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: 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: 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: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 674 locations, 80 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.8s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 550 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 131 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 648 IncrementalHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 131 mSDtfsCounter, 648 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=908occurred in iteration=17, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1874 NumberOfCodeBlocks, 1874 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1853 ConstructedInterpolants, 0 QuantifiedInterpolants, 1892 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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 44 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:52:49,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE