./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/unroll-cond-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/unroll-cond-2.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 4f5c6e2b4939ff0e3b5a44ab7f8c3e5d18f7e9fd12beb8fad487ea501e8fa48b --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:26:43,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:26:43,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:26:43,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:26:43,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:26:43,213 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:26:43,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:26:43,214 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:26:43,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:26:43,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:26:43,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:26:43,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:26:43,215 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:26:43,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:26:43,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:26:43,215 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:26:43,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:26:43,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:26:43,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:26:43,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:26:43,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:26:43,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:26:43,216 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:26:43,216 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:26:43,216 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:26:43,216 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:26:43,216 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:26:43,216 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:26:43,216 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:26:43,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:26:43,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:26:43,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:26:43,217 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:26:43,217 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:26:43,217 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:26:43,217 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:26:43,217 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:26:43,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:26:43,217 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:26:43,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:26:43,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:26:43,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:26:43,217 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 -> 4f5c6e2b4939ff0e3b5a44ab7f8c3e5d18f7e9fd12beb8fad487ea501e8fa48b [2025-03-13 22:26:43,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:26:43,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:26:43,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:26:43,452 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:26:43,453 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:26:43,454 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-cond-2.wvr.c [2025-03-13 22:26:44,633 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bba2a9a8d/062aa87687c04af5996daefc68b2ecbc/FLAGbe43e4443 [2025-03-13 22:26:44,870 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:26:44,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-2.wvr.c [2025-03-13 22:26:44,878 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bba2a9a8d/062aa87687c04af5996daefc68b2ecbc/FLAGbe43e4443 [2025-03-13 22:26:45,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bba2a9a8d/062aa87687c04af5996daefc68b2ecbc [2025-03-13 22:26:45,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:26:45,191 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:26:45,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:26:45,192 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:26:45,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:26:45,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:26:45" (1/1) ... [2025-03-13 22:26:45,199 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1706b74f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:45, skipping insertion in model container [2025-03-13 22:26:45,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:26:45" (1/1) ... [2025-03-13 22:26:45,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:26:45,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:26:45,354 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:26:45,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:26:45,391 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:26:45,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:45 WrapperNode [2025-03-13 22:26:45,392 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:26:45,393 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:26:45,393 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:26:45,393 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:26:45,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:45" (1/1) ... [2025-03-13 22:26:45,407 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:45" (1/1) ... [2025-03-13 22:26:45,426 INFO L138 Inliner]: procedures = 23, calls = 24, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 256 [2025-03-13 22:26:45,427 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:26:45,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:26:45,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:26:45,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:26:45,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:45" (1/1) ... [2025-03-13 22:26:45,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:45" (1/1) ... [2025-03-13 22:26:45,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:45" (1/1) ... [2025-03-13 22:26:45,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:45" (1/1) ... [2025-03-13 22:26:45,449 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:45" (1/1) ... [2025-03-13 22:26:45,454 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:45" (1/1) ... [2025-03-13 22:26:45,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:45" (1/1) ... [2025-03-13 22:26:45,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:45" (1/1) ... [2025-03-13 22:26:45,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:26:45,463 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:26:45,464 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:26:45,464 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:26:45,465 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:45" (1/1) ... [2025-03-13 22:26:45,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:26:45,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:26:45,498 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:26:45,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:26:45,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:26:45,520 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 22:26:45,520 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 22:26:45,520 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 22:26:45,520 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 22:26:45,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:26:45,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:26:45,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:26:45,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:26:45,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:26:45,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:26:45,521 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:26:45,595 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:26:45,596 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:26:45,974 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:26:45,975 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:26:45,975 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:26:45,990 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:26:45,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:26:45 BoogieIcfgContainer [2025-03-13 22:26:45,991 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:26:45,992 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:26:45,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:26:45,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:26:45,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:26:45" (1/3) ... [2025-03-13 22:26:45,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf2472d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:26:45, skipping insertion in model container [2025-03-13 22:26:45,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:45" (2/3) ... [2025-03-13 22:26:45,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf2472d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:26:45, skipping insertion in model container [2025-03-13 22:26:45,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:26:45" (3/3) ... [2025-03-13 22:26:45,999 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-2.wvr.c [2025-03-13 22:26:46,011 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:26:46,014 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-2.wvr.c that has 3 procedures, 325 locations, 1 initial locations, 3 loop locations, and 39 error locations. [2025-03-13 22:26:46,014 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:26:46,105 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 22:26:46,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 331 places, 342 transitions, 698 flow [2025-03-13 22:26:46,259 INFO L124 PetriNetUnfolderBase]: 18/340 cut-off events. [2025-03-13 22:26:46,262 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:26:46,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 340 events. 18/340 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 754 event pairs, 0 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 215. Up to 2 conditions per place. [2025-03-13 22:26:46,270 INFO L82 GeneralOperation]: Start removeDead. Operand has 331 places, 342 transitions, 698 flow [2025-03-13 22:26:46,277 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 313 places, 323 transitions, 658 flow [2025-03-13 22:26:46,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:26:46,299 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;@7d4d9c12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:26:46,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2025-03-13 22:26:46,307 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:26:46,310 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-13 22:26:46,311 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:26:46,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:46,311 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:46,312 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-13 22:26:46,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:46,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1596505495, now seen corresponding path program 1 times [2025-03-13 22:26:46,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:46,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715579578] [2025-03-13 22:26:46,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:46,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:46,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 22:26:46,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 22:26:46,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:46,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:46,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:46,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:46,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715579578] [2025-03-13 22:26:46,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715579578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:46,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:46,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:46,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100461947] [2025-03-13 22:26:46,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:46,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:46,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:46,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:46,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:46,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 342 [2025-03-13 22:26:46,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 323 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:46,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:46,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 342 [2025-03-13 22:26:46,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:46,652 INFO L124 PetriNetUnfolderBase]: 19/476 cut-off events. [2025-03-13 22:26:46,652 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-13 22:26:46,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 476 events. 19/476 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1782 event pairs, 5 based on Foata normal form. 10/400 useless extension candidates. Maximal degree in co-relation 383. Up to 24 conditions per place. [2025-03-13 22:26:46,659 INFO L140 encePairwiseOnDemand]: 330/342 looper letters, 10 selfloop transitions, 2 changer transitions 3/313 dead transitions. [2025-03-13 22:26:46,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 313 transitions, 662 flow [2025-03-13 22:26:46,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:46,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:46,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 973 transitions. [2025-03-13 22:26:46,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9483430799220273 [2025-03-13 22:26:46,675 INFO L175 Difference]: Start difference. First operand has 313 places, 323 transitions, 658 flow. Second operand 3 states and 973 transitions. [2025-03-13 22:26:46,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 313 transitions, 662 flow [2025-03-13 22:26:46,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 313 transitions, 654 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 22:26:46,688 INFO L231 Difference]: Finished difference. Result has 310 places, 310 transitions, 628 flow [2025-03-13 22:26:46,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=310, PETRI_TRANSITIONS=310} [2025-03-13 22:26:46,694 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -3 predicate places. [2025-03-13 22:26:46,694 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 310 transitions, 628 flow [2025-03-13 22:26:46,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:46,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:46,695 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:46,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:26:46,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-13 22:26:46,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:46,697 INFO L85 PathProgramCache]: Analyzing trace with hash -561032109, now seen corresponding path program 1 times [2025-03-13 22:26:46,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:46,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822889326] [2025-03-13 22:26:46,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:46,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:46,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 22:26:46,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 22:26:46,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:46,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:46,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:46,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:46,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822889326] [2025-03-13 22:26:46,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822889326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:46,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:46,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:46,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779815973] [2025-03-13 22:26:46,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:46,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:46,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:46,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:46,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:46,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 342 [2025-03-13 22:26:46,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 310 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:46,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:46,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 342 [2025-03-13 22:26:46,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:46,848 INFO L124 PetriNetUnfolderBase]: 20/468 cut-off events. [2025-03-13 22:26:46,848 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-13 22:26:46,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 468 events. 20/468 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1601 event pairs, 7 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 477. Up to 28 conditions per place. [2025-03-13 22:26:46,852 INFO L140 encePairwiseOnDemand]: 339/342 looper letters, 13 selfloop transitions, 2 changer transitions 0/309 dead transitions. [2025-03-13 22:26:46,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 309 transitions, 656 flow [2025-03-13 22:26:46,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:46,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:46,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 958 transitions. [2025-03-13 22:26:46,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9337231968810916 [2025-03-13 22:26:46,854 INFO L175 Difference]: Start difference. First operand has 310 places, 310 transitions, 628 flow. Second operand 3 states and 958 transitions. [2025-03-13 22:26:46,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 309 transitions, 656 flow [2025-03-13 22:26:46,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 309 transitions, 652 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:46,859 INFO L231 Difference]: Finished difference. Result has 306 places, 309 transitions, 626 flow [2025-03-13 22:26:46,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=306, PETRI_TRANSITIONS=309} [2025-03-13 22:26:46,860 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -7 predicate places. [2025-03-13 22:26:46,860 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 309 transitions, 626 flow [2025-03-13 22:26:46,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:46,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:46,861 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:46,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:26:46,861 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-13 22:26:46,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:46,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1544256989, now seen corresponding path program 1 times [2025-03-13 22:26:46,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:46,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741054676] [2025-03-13 22:26:46,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:46,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:46,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-13 22:26:46,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-13 22:26:46,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:46,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:46,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:46,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:46,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741054676] [2025-03-13 22:26:46,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741054676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:46,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:46,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:46,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87427789] [2025-03-13 22:26:46,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:46,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:46,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:46,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:46,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:46,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 342 [2025-03-13 22:26:46,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 309 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:46,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:46,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 342 [2025-03-13 22:26:46,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:47,058 INFO L124 PetriNetUnfolderBase]: 66/965 cut-off events. [2025-03-13 22:26:47,058 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2025-03-13 22:26:47,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 965 events. 66/965 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4919 event pairs, 20 based on Foata normal form. 0/786 useless extension candidates. Maximal degree in co-relation 1016. Up to 77 conditions per place. [2025-03-13 22:26:47,069 INFO L140 encePairwiseOnDemand]: 335/342 looper letters, 16 selfloop transitions, 1 changer transitions 0/303 dead transitions. [2025-03-13 22:26:47,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 303 transitions, 648 flow [2025-03-13 22:26:47,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:47,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:47,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 947 transitions. [2025-03-13 22:26:47,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9230019493177388 [2025-03-13 22:26:47,073 INFO L175 Difference]: Start difference. First operand has 306 places, 309 transitions, 626 flow. Second operand 3 states and 947 transitions. [2025-03-13 22:26:47,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 303 transitions, 648 flow [2025-03-13 22:26:47,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 303 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:47,079 INFO L231 Difference]: Finished difference. Result has 300 places, 303 transitions, 612 flow [2025-03-13 22:26:47,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=300, PETRI_TRANSITIONS=303} [2025-03-13 22:26:47,081 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -13 predicate places. [2025-03-13 22:26:47,081 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 303 transitions, 612 flow [2025-03-13 22:26:47,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:47,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:47,082 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:47,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:26:47,082 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-13 22:26:47,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:47,083 INFO L85 PathProgramCache]: Analyzing trace with hash 814559261, now seen corresponding path program 1 times [2025-03-13 22:26:47,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:47,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517254449] [2025-03-13 22:26:47,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:47,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:47,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-13 22:26:47,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-13 22:26:47,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:47,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:47,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:47,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:47,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517254449] [2025-03-13 22:26:47,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517254449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:47,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:47,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:47,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431154757] [2025-03-13 22:26:47,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:47,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:47,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:47,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:47,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:47,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 342 [2025-03-13 22:26:47,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 303 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:47,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:47,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 342 [2025-03-13 22:26:47,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:47,258 INFO L124 PetriNetUnfolderBase]: 20/458 cut-off events. [2025-03-13 22:26:47,258 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-13 22:26:47,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 458 events. 20/458 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1529 event pairs, 7 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 456. Up to 26 conditions per place. [2025-03-13 22:26:47,263 INFO L140 encePairwiseOnDemand]: 339/342 looper letters, 11 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2025-03-13 22:26:47,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 302 transitions, 636 flow [2025-03-13 22:26:47,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:47,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:47,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2025-03-13 22:26:47,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9376218323586745 [2025-03-13 22:26:47,265 INFO L175 Difference]: Start difference. First operand has 300 places, 303 transitions, 612 flow. Second operand 3 states and 962 transitions. [2025-03-13 22:26:47,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 302 transitions, 636 flow [2025-03-13 22:26:47,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 302 transitions, 635 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:26:47,271 INFO L231 Difference]: Finished difference. Result has 300 places, 302 transitions, 613 flow [2025-03-13 22:26:47,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=613, PETRI_PLACES=300, PETRI_TRANSITIONS=302} [2025-03-13 22:26:47,273 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -13 predicate places. [2025-03-13 22:26:47,274 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 302 transitions, 613 flow [2025-03-13 22:26:47,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:47,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:47,275 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:47,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:26:47,275 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-13 22:26:47,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:47,276 INFO L85 PathProgramCache]: Analyzing trace with hash -2135581595, now seen corresponding path program 1 times [2025-03-13 22:26:47,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:47,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174084288] [2025-03-13 22:26:47,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:47,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:47,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-13 22:26:47,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-13 22:26:47,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:47,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:47,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:47,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:47,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174084288] [2025-03-13 22:26:47,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174084288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:47,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:47,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:26:47,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700282800] [2025-03-13 22:26:47,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:47,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:26:47,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:47,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:26:47,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:26:47,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 342 [2025-03-13 22:26:47,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 302 transitions, 613 flow. Second operand has 6 states, 6 states have (on average 298.5) internal successors, (1791), 6 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:47,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:47,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 342 [2025-03-13 22:26:47,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:48,115 INFO L124 PetriNetUnfolderBase]: 131/1251 cut-off events. [2025-03-13 22:26:48,115 INFO L125 PetriNetUnfolderBase]: For 28/29 co-relation queries the response was YES. [2025-03-13 22:26:48,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1459 conditions, 1251 events. 131/1251 cut-off events. For 28/29 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 6944 event pairs, 64 based on Foata normal form. 0/1020 useless extension candidates. Maximal degree in co-relation 1424. Up to 192 conditions per place. [2025-03-13 22:26:48,122 INFO L140 encePairwiseOnDemand]: 336/342 looper letters, 28 selfloop transitions, 5 changer transitions 0/301 dead transitions. [2025-03-13 22:26:48,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 301 transitions, 677 flow [2025-03-13 22:26:48,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:26:48,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:26:48,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1816 transitions. [2025-03-13 22:26:48,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.884990253411306 [2025-03-13 22:26:48,125 INFO L175 Difference]: Start difference. First operand has 300 places, 302 transitions, 613 flow. Second operand 6 states and 1816 transitions. [2025-03-13 22:26:48,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 301 transitions, 677 flow [2025-03-13 22:26:48,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 301 transitions, 673 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:48,129 INFO L231 Difference]: Finished difference. Result has 302 places, 301 transitions, 617 flow [2025-03-13 22:26:48,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=617, PETRI_PLACES=302, PETRI_TRANSITIONS=301} [2025-03-13 22:26:48,130 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -11 predicate places. [2025-03-13 22:26:48,130 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 301 transitions, 617 flow [2025-03-13 22:26:48,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 298.5) internal successors, (1791), 6 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:48,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:48,131 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:48,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:26:48,132 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-13 22:26:48,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:48,132 INFO L85 PathProgramCache]: Analyzing trace with hash 503013522, now seen corresponding path program 1 times [2025-03-13 22:26:48,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:48,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367147570] [2025-03-13 22:26:48,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:48,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:48,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-13 22:26:48,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-13 22:26:48,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:48,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:48,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:48,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:48,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367147570] [2025-03-13 22:26:48,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367147570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:48,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:48,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:48,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413407482] [2025-03-13 22:26:48,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:48,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:48,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:48,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:48,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:48,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 342 [2025-03-13 22:26:48,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 301 transitions, 617 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:48,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:48,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 342 [2025-03-13 22:26:48,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:48,269 INFO L124 PetriNetUnfolderBase]: 44/838 cut-off events. [2025-03-13 22:26:48,269 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:26:48,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 899 conditions, 838 events. 44/838 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4348 event pairs, 9 based on Foata normal form. 0/699 useless extension candidates. Maximal degree in co-relation 881. Up to 45 conditions per place. [2025-03-13 22:26:48,274 INFO L140 encePairwiseOnDemand]: 337/342 looper letters, 12 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2025-03-13 22:26:48,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 301 transitions, 646 flow [2025-03-13 22:26:48,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:48,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:48,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-03-13 22:26:48,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9434697855750487 [2025-03-13 22:26:48,277 INFO L175 Difference]: Start difference. First operand has 302 places, 301 transitions, 617 flow. Second operand 3 states and 968 transitions. [2025-03-13 22:26:48,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 301 transitions, 646 flow [2025-03-13 22:26:48,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 301 transitions, 636 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:26:48,282 INFO L231 Difference]: Finished difference. Result has 297 places, 300 transitions, 615 flow [2025-03-13 22:26:48,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=615, PETRI_PLACES=297, PETRI_TRANSITIONS=300} [2025-03-13 22:26:48,285 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -16 predicate places. [2025-03-13 22:26:48,285 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 300 transitions, 615 flow [2025-03-13 22:26:48,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:48,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:48,286 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:48,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:26:48,287 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-13 22:26:48,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:48,288 INFO L85 PathProgramCache]: Analyzing trace with hash 135592642, now seen corresponding path program 1 times [2025-03-13 22:26:48,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:48,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013159821] [2025-03-13 22:26:48,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:48,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:48,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-13 22:26:48,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-13 22:26:48,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:48,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:48,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:48,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:48,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013159821] [2025-03-13 22:26:48,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013159821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:48,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:48,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:48,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437437144] [2025-03-13 22:26:48,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:48,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:48,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:48,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:48,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:48,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 342 [2025-03-13 22:26:48,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 300 transitions, 615 flow. Second operand has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:48,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:48,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 342 [2025-03-13 22:26:48,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:48,390 INFO L124 PetriNetUnfolderBase]: 26/494 cut-off events. [2025-03-13 22:26:48,391 INFO L125 PetriNetUnfolderBase]: For 3/8 co-relation queries the response was YES. [2025-03-13 22:26:48,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 494 events. 26/494 cut-off events. For 3/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1793 event pairs, 1 based on Foata normal form. 1/429 useless extension candidates. Maximal degree in co-relation 513. Up to 21 conditions per place. [2025-03-13 22:26:48,393 INFO L140 encePairwiseOnDemand]: 335/342 looper letters, 11 selfloop transitions, 3 changer transitions 0/297 dead transitions. [2025-03-13 22:26:48,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 297 transitions, 638 flow [2025-03-13 22:26:48,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:48,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:48,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2025-03-13 22:26:48,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.935672514619883 [2025-03-13 22:26:48,396 INFO L175 Difference]: Start difference. First operand has 297 places, 300 transitions, 615 flow. Second operand 3 states and 960 transitions. [2025-03-13 22:26:48,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 297 transitions, 638 flow [2025-03-13 22:26:48,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 297 transitions, 638 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:48,400 INFO L231 Difference]: Finished difference. Result has 295 places, 296 transitions, 613 flow [2025-03-13 22:26:48,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=613, PETRI_PLACES=295, PETRI_TRANSITIONS=296} [2025-03-13 22:26:48,402 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -18 predicate places. [2025-03-13 22:26:48,402 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 296 transitions, 613 flow [2025-03-13 22:26:48,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:48,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:48,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:48,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:26:48,404 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-13 22:26:48,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:48,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1974854362, now seen corresponding path program 1 times [2025-03-13 22:26:48,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:48,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383073823] [2025-03-13 22:26:48,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:48,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:48,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-13 22:26:48,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-13 22:26:48,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:48,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:48,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:48,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:48,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383073823] [2025-03-13 22:26:48,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383073823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:48,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:48,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:48,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220336314] [2025-03-13 22:26:48,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:48,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:48,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:48,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:48,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:48,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 342 [2025-03-13 22:26:48,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 296 transitions, 613 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:48,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:48,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 342 [2025-03-13 22:26:48,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:48,541 INFO L124 PetriNetUnfolderBase]: 39/539 cut-off events. [2025-03-13 22:26:48,542 INFO L125 PetriNetUnfolderBase]: For 23/24 co-relation queries the response was YES. [2025-03-13 22:26:48,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 648 conditions, 539 events. 39/539 cut-off events. For 23/24 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2200 event pairs, 3 based on Foata normal form. 1/485 useless extension candidates. Maximal degree in co-relation 612. Up to 73 conditions per place. [2025-03-13 22:26:48,544 INFO L140 encePairwiseOnDemand]: 325/342 looper letters, 19 selfloop transitions, 6 changer transitions 4/287 dead transitions. [2025-03-13 22:26:48,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 287 transitions, 650 flow [2025-03-13 22:26:48,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:48,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:48,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 919 transitions. [2025-03-13 22:26:48,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8957115009746589 [2025-03-13 22:26:48,546 INFO L175 Difference]: Start difference. First operand has 295 places, 296 transitions, 613 flow. Second operand 3 states and 919 transitions. [2025-03-13 22:26:48,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 287 transitions, 650 flow [2025-03-13 22:26:48,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 287 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:48,549 INFO L231 Difference]: Finished difference. Result has 285 places, 282 transitions, 590 flow [2025-03-13 22:26:48,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=285, PETRI_TRANSITIONS=282} [2025-03-13 22:26:48,550 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -28 predicate places. [2025-03-13 22:26:48,550 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 282 transitions, 590 flow [2025-03-13 22:26:48,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:48,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:48,552 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:48,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:26:48,552 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-13 22:26:48,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:48,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1933662976, now seen corresponding path program 1 times [2025-03-13 22:26:48,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:48,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642778986] [2025-03-13 22:26:48,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:48,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:48,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-13 22:26:48,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-13 22:26:48,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:48,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:48,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:48,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642778986] [2025-03-13 22:26:48,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642778986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:48,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:48,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:48,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173282033] [2025-03-13 22:26:48,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:48,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:48,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:48,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:48,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:48,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 342 [2025-03-13 22:26:48,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 282 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:48,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:48,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 342 [2025-03-13 22:26:48,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:48,678 INFO L124 PetriNetUnfolderBase]: 69/1025 cut-off events. [2025-03-13 22:26:48,678 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-13 22:26:48,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 1025 events. 69/1025 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5276 event pairs, 7 based on Foata normal form. 0/917 useless extension candidates. Maximal degree in co-relation 1124. Up to 69 conditions per place. [2025-03-13 22:26:48,684 INFO L140 encePairwiseOnDemand]: 335/342 looper letters, 14 selfloop transitions, 3 changer transitions 0/283 dead transitions. [2025-03-13 22:26:48,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 283 transitions, 628 flow [2025-03-13 22:26:48,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:48,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:48,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 963 transitions. [2025-03-13 22:26:48,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9385964912280702 [2025-03-13 22:26:48,686 INFO L175 Difference]: Start difference. First operand has 285 places, 282 transitions, 590 flow. Second operand 3 states and 963 transitions. [2025-03-13 22:26:48,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 283 transitions, 628 flow [2025-03-13 22:26:48,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 283 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:48,692 INFO L231 Difference]: Finished difference. Result has 278 places, 281 transitions, 591 flow [2025-03-13 22:26:48,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=591, PETRI_PLACES=278, PETRI_TRANSITIONS=281} [2025-03-13 22:26:48,693 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -35 predicate places. [2025-03-13 22:26:48,693 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 281 transitions, 591 flow [2025-03-13 22:26:48,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:48,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:48,694 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:48,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:26:48,694 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-13 22:26:48,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:48,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1156666140, now seen corresponding path program 1 times [2025-03-13 22:26:48,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:48,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477358267] [2025-03-13 22:26:48,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:48,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:48,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-13 22:26:48,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-13 22:26:48,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:48,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:48,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:48,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:48,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477358267] [2025-03-13 22:26:48,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477358267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:48,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:48,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 22:26:48,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268310962] [2025-03-13 22:26:48,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:48,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 22:26:48,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:48,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 22:26:48,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 22:26:48,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 342 [2025-03-13 22:26:48,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 281 transitions, 591 flow. Second operand has 4 states, 4 states have (on average 321.25) internal successors, (1285), 4 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:48,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:48,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 342 [2025-03-13 22:26:48,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:48,928 INFO L124 PetriNetUnfolderBase]: 67/1265 cut-off events. [2025-03-13 22:26:48,928 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:26:48,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1381 conditions, 1265 events. 67/1265 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 7000 event pairs, 5 based on Foata normal form. 0/1133 useless extension candidates. Maximal degree in co-relation 1344. Up to 31 conditions per place. [2025-03-13 22:26:48,935 INFO L140 encePairwiseOnDemand]: 336/342 looper letters, 13 selfloop transitions, 6 changer transitions 0/290 dead transitions. [2025-03-13 22:26:48,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 290 transitions, 651 flow [2025-03-13 22:26:48,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:26:48,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:26:48,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1620 transitions. [2025-03-13 22:26:48,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9473684210526315 [2025-03-13 22:26:48,938 INFO L175 Difference]: Start difference. First operand has 278 places, 281 transitions, 591 flow. Second operand 5 states and 1620 transitions. [2025-03-13 22:26:48,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 290 transitions, 651 flow [2025-03-13 22:26:48,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 290 transitions, 651 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:48,941 INFO L231 Difference]: Finished difference. Result has 285 places, 285 transitions, 629 flow [2025-03-13 22:26:48,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=629, PETRI_PLACES=285, PETRI_TRANSITIONS=285} [2025-03-13 22:26:48,943 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -28 predicate places. [2025-03-13 22:26:48,943 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 285 transitions, 629 flow [2025-03-13 22:26:48,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 321.25) internal successors, (1285), 4 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:48,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:48,944 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:48,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:26:48,944 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-13 22:26:48,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:48,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1512827576, now seen corresponding path program 1 times [2025-03-13 22:26:48,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:48,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212804387] [2025-03-13 22:26:48,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:48,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:48,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-13 22:26:48,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-13 22:26:48,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:48,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:49,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:49,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212804387] [2025-03-13 22:26:49,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212804387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:49,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:49,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:26:49,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266590523] [2025-03-13 22:26:49,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:49,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:26:49,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:49,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:26:49,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:26:49,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 342 [2025-03-13 22:26:49,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 285 transitions, 629 flow. Second operand has 6 states, 6 states have (on average 314.5) internal successors, (1887), 6 states have internal predecessors, (1887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:49,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:49,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 342 [2025-03-13 22:26:49,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:49,576 INFO L124 PetriNetUnfolderBase]: 56/973 cut-off events. [2025-03-13 22:26:49,577 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-13 22:26:49,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 973 events. 56/973 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4780 event pairs, 4 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 1073. Up to 24 conditions per place. [2025-03-13 22:26:49,582 INFO L140 encePairwiseOnDemand]: 336/342 looper letters, 15 selfloop transitions, 6 changer transitions 0/288 dead transitions. [2025-03-13 22:26:49,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 288 transitions, 681 flow [2025-03-13 22:26:49,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:26:49,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:26:49,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1899 transitions. [2025-03-13 22:26:49,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9254385964912281 [2025-03-13 22:26:49,586 INFO L175 Difference]: Start difference. First operand has 285 places, 285 transitions, 629 flow. Second operand 6 states and 1899 transitions. [2025-03-13 22:26:49,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 288 transitions, 681 flow [2025-03-13 22:26:49,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 288 transitions, 681 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:49,591 INFO L231 Difference]: Finished difference. Result has 289 places, 284 transitions, 639 flow [2025-03-13 22:26:49,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=639, PETRI_PLACES=289, PETRI_TRANSITIONS=284} [2025-03-13 22:26:49,592 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -24 predicate places. [2025-03-13 22:26:49,592 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 284 transitions, 639 flow [2025-03-13 22:26:49,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 314.5) internal successors, (1887), 6 states have internal predecessors, (1887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:49,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:49,593 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:49,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:26:49,593 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-13 22:26:49,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:49,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1849030519, now seen corresponding path program 1 times [2025-03-13 22:26:49,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:49,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550135232] [2025-03-13 22:26:49,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:49,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:49,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-13 22:26:49,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-13 22:26:49,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:49,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:49,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:49,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:49,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550135232] [2025-03-13 22:26:49,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550135232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:49,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:49,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 22:26:49,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15632671] [2025-03-13 22:26:49,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:49,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 22:26:49,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:49,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 22:26:49,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 22:26:49,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 342 [2025-03-13 22:26:49,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 284 transitions, 639 flow. Second operand has 4 states, 4 states have (on average 319.5) internal successors, (1278), 4 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:49,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:49,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 342 [2025-03-13 22:26:49,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:49,875 INFO L124 PetriNetUnfolderBase]: 81/1315 cut-off events. [2025-03-13 22:26:49,875 INFO L125 PetriNetUnfolderBase]: For 36/37 co-relation queries the response was YES. [2025-03-13 22:26:49,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1543 conditions, 1315 events. 81/1315 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6692 event pairs, 10 based on Foata normal form. 0/1187 useless extension candidates. Maximal degree in co-relation 1500. Up to 67 conditions per place. [2025-03-13 22:26:49,880 INFO L140 encePairwiseOnDemand]: 335/342 looper letters, 14 selfloop transitions, 7 changer transitions 0/293 dead transitions. [2025-03-13 22:26:49,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 293 transitions, 702 flow [2025-03-13 22:26:49,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:26:49,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:26:49,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1612 transitions. [2025-03-13 22:26:49,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9426900584795321 [2025-03-13 22:26:49,883 INFO L175 Difference]: Start difference. First operand has 289 places, 284 transitions, 639 flow. Second operand 5 states and 1612 transitions. [2025-03-13 22:26:49,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 293 transitions, 702 flow [2025-03-13 22:26:49,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 293 transitions, 690 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:26:49,887 INFO L231 Difference]: Finished difference. Result has 291 places, 289 transitions, 673 flow [2025-03-13 22:26:49,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=673, PETRI_PLACES=291, PETRI_TRANSITIONS=289} [2025-03-13 22:26:49,888 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -22 predicate places. [2025-03-13 22:26:49,888 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 289 transitions, 673 flow [2025-03-13 22:26:49,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 319.5) internal successors, (1278), 4 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:49,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:49,889 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:49,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:26:49,889 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-13 22:26:49,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:49,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1235416991, now seen corresponding path program 1 times [2025-03-13 22:26:49,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:49,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78211166] [2025-03-13 22:26:49,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:49,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:49,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-13 22:26:49,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-13 22:26:49,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:49,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:49,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:49,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:49,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78211166] [2025-03-13 22:26:49,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78211166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:49,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:49,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 22:26:49,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129318027] [2025-03-13 22:26:49,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:49,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 22:26:49,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:49,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 22:26:49,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 22:26:50,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 342 [2025-03-13 22:26:50,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 289 transitions, 673 flow. Second operand has 4 states, 4 states have (on average 319.5) internal successors, (1278), 4 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:50,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:50,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 342 [2025-03-13 22:26:50,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:50,154 INFO L124 PetriNetUnfolderBase]: 78/1312 cut-off events. [2025-03-13 22:26:50,154 INFO L125 PetriNetUnfolderBase]: For 92/93 co-relation queries the response was YES. [2025-03-13 22:26:50,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1595 conditions, 1312 events. 78/1312 cut-off events. For 92/93 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 6717 event pairs, 10 based on Foata normal form. 0/1193 useless extension candidates. Maximal degree in co-relation 1548. Up to 67 conditions per place. [2025-03-13 22:26:50,163 INFO L140 encePairwiseOnDemand]: 335/342 looper letters, 14 selfloop transitions, 7 changer transitions 0/296 dead transitions. [2025-03-13 22:26:50,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 296 transitions, 732 flow [2025-03-13 22:26:50,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:26:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:26:50,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1612 transitions. [2025-03-13 22:26:50,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9426900584795321 [2025-03-13 22:26:50,166 INFO L175 Difference]: Start difference. First operand has 291 places, 289 transitions, 673 flow. Second operand 5 states and 1612 transitions. [2025-03-13 22:26:50,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 296 transitions, 732 flow [2025-03-13 22:26:50,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 296 transitions, 732 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:50,170 INFO L231 Difference]: Finished difference. Result has 298 places, 292 transitions, 711 flow [2025-03-13 22:26:50,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=711, PETRI_PLACES=298, PETRI_TRANSITIONS=292} [2025-03-13 22:26:50,171 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -15 predicate places. [2025-03-13 22:26:50,171 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 292 transitions, 711 flow [2025-03-13 22:26:50,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 319.5) internal successors, (1278), 4 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:50,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:50,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:50,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:26:50,173 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-13 22:26:50,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:50,173 INFO L85 PathProgramCache]: Analyzing trace with hash -922772598, now seen corresponding path program 1 times [2025-03-13 22:26:50,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:50,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759077855] [2025-03-13 22:26:50,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:50,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:50,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-13 22:26:50,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-13 22:26:50,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:50,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:50,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:26:50,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:50,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759077855] [2025-03-13 22:26:50,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759077855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:50,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:50,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:50,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722161127] [2025-03-13 22:26:50,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:50,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:50,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:50,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:50,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:50,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 342 [2025-03-13 22:26:50,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 292 transitions, 711 flow. Second operand has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:50,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:50,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 342 [2025-03-13 22:26:50,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:50,331 INFO L124 PetriNetUnfolderBase]: 56/1092 cut-off events. [2025-03-13 22:26:50,331 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-13 22:26:50,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1377 conditions, 1092 events. 56/1092 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4971 event pairs, 14 based on Foata normal form. 0/1011 useless extension candidates. Maximal degree in co-relation 1326. Up to 41 conditions per place. [2025-03-13 22:26:50,338 INFO L140 encePairwiseOnDemand]: 339/342 looper letters, 9 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2025-03-13 22:26:50,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 292 transitions, 734 flow [2025-03-13 22:26:50,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:50,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2025-03-13 22:26:50,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9415204678362573 [2025-03-13 22:26:50,340 INFO L175 Difference]: Start difference. First operand has 298 places, 292 transitions, 711 flow. Second operand 3 states and 966 transitions. [2025-03-13 22:26:50,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 292 transitions, 734 flow [2025-03-13 22:26:50,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 292 transitions, 734 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:50,346 INFO L231 Difference]: Finished difference. Result has 299 places, 291 transitions, 713 flow [2025-03-13 22:26:50,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=713, PETRI_PLACES=299, PETRI_TRANSITIONS=291} [2025-03-13 22:26:50,347 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -14 predicate places. [2025-03-13 22:26:50,347 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 291 transitions, 713 flow [2025-03-13 22:26:50,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:50,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:50,349 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:50,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:26:50,349 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-13 22:26:50,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:50,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2139844365, now seen corresponding path program 1 times [2025-03-13 22:26:50,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:50,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767782540] [2025-03-13 22:26:50,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:50,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:50,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-13 22:26:50,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-13 22:26:50,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:50,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:50,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:50,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:50,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767782540] [2025-03-13 22:26:50,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767782540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:50,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:50,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:26:50,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843958012] [2025-03-13 22:26:50,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:50,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:26:50,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:50,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:26:50,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:26:50,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 342 [2025-03-13 22:26:50,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 291 transitions, 713 flow. Second operand has 6 states, 6 states have (on average 300.6666666666667) internal successors, (1804), 6 states have internal predecessors, (1804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:50,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:50,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 342 [2025-03-13 22:26:50,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:50,977 INFO L124 PetriNetUnfolderBase]: 104/1107 cut-off events. [2025-03-13 22:26:50,977 INFO L125 PetriNetUnfolderBase]: For 165/166 co-relation queries the response was YES. [2025-03-13 22:26:50,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1589 conditions, 1107 events. 104/1107 cut-off events. For 165/166 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 5305 event pairs, 12 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1535. Up to 80 conditions per place. [2025-03-13 22:26:50,985 INFO L140 encePairwiseOnDemand]: 324/342 looper letters, 17 selfloop transitions, 17 changer transitions 0/292 dead transitions. [2025-03-13 22:26:50,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 292 transitions, 787 flow [2025-03-13 22:26:50,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:26:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:26:50,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1829 transitions. [2025-03-13 22:26:50,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8913255360623782 [2025-03-13 22:26:50,989 INFO L175 Difference]: Start difference. First operand has 299 places, 291 transitions, 713 flow. Second operand 6 states and 1829 transitions. [2025-03-13 22:26:50,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 292 transitions, 787 flow [2025-03-13 22:26:50,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 292 transitions, 783 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:50,994 INFO L231 Difference]: Finished difference. Result has 299 places, 288 transitions, 737 flow [2025-03-13 22:26:50,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=737, PETRI_PLACES=299, PETRI_TRANSITIONS=288} [2025-03-13 22:26:50,995 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -14 predicate places. [2025-03-13 22:26:50,995 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 288 transitions, 737 flow [2025-03-13 22:26:50,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 300.6666666666667) internal successors, (1804), 6 states have internal predecessors, (1804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:50,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:50,996 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:50,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:26:50,996 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-13 22:26:50,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:50,997 INFO L85 PathProgramCache]: Analyzing trace with hash -530169358, now seen corresponding path program 1 times [2025-03-13 22:26:50,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:50,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198840225] [2025-03-13 22:26:50,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:50,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:51,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-13 22:26:51,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-13 22:26:51,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:51,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:51,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:51,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:51,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198840225] [2025-03-13 22:26:51,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198840225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:51,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:51,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:51,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976886530] [2025-03-13 22:26:51,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:51,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:51,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:51,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:51,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:51,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 342 [2025-03-13 22:26:51,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 288 transitions, 737 flow. Second operand has 3 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:51,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:51,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 342 [2025-03-13 22:26:51,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:51,192 INFO L124 PetriNetUnfolderBase]: 96/1301 cut-off events. [2025-03-13 22:26:51,193 INFO L125 PetriNetUnfolderBase]: For 183/184 co-relation queries the response was YES. [2025-03-13 22:26:51,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 1301 events. 96/1301 cut-off events. For 183/184 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 6794 event pairs, 44 based on Foata normal form. 0/1224 useless extension candidates. Maximal degree in co-relation 1800. Up to 156 conditions per place. [2025-03-13 22:26:51,200 INFO L140 encePairwiseOnDemand]: 339/342 looper letters, 17 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2025-03-13 22:26:51,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 288 transitions, 776 flow [2025-03-13 22:26:51,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:51,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 950 transitions. [2025-03-13 22:26:51,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9259259259259259 [2025-03-13 22:26:51,202 INFO L175 Difference]: Start difference. First operand has 299 places, 288 transitions, 737 flow. Second operand 3 states and 950 transitions. [2025-03-13 22:26:51,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 288 transitions, 776 flow [2025-03-13 22:26:51,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 288 transitions, 742 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:26:51,207 INFO L231 Difference]: Finished difference. Result has 295 places, 287 transitions, 705 flow [2025-03-13 22:26:51,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=705, PETRI_PLACES=295, PETRI_TRANSITIONS=287} [2025-03-13 22:26:51,207 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -18 predicate places. [2025-03-13 22:26:51,207 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 287 transitions, 705 flow [2025-03-13 22:26:51,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:51,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:51,208 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:51,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:26:51,208 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-13 22:26:51,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:51,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1101189705, now seen corresponding path program 1 times [2025-03-13 22:26:51,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:51,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593881940] [2025-03-13 22:26:51,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:51,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:51,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-13 22:26:51,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-13 22:26:51,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:51,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:51,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:51,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593881940] [2025-03-13 22:26:51,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593881940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:51,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:51,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:51,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109068203] [2025-03-13 22:26:51,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:51,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:51,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:51,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:51,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:51,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 342 [2025-03-13 22:26:51,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 287 transitions, 705 flow. Second operand has 3 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:51,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:51,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 342 [2025-03-13 22:26:51,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:51,395 INFO L124 PetriNetUnfolderBase]: 92/1206 cut-off events. [2025-03-13 22:26:51,396 INFO L125 PetriNetUnfolderBase]: For 139/140 co-relation queries the response was YES. [2025-03-13 22:26:51,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1616 conditions, 1206 events. 92/1206 cut-off events. For 139/140 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6028 event pairs, 44 based on Foata normal form. 0/1134 useless extension candidates. Maximal degree in co-relation 1564. Up to 154 conditions per place. [2025-03-13 22:26:51,403 INFO L140 encePairwiseOnDemand]: 339/342 looper letters, 16 selfloop transitions, 2 changer transitions 1/287 dead transitions. [2025-03-13 22:26:51,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 287 transitions, 744 flow [2025-03-13 22:26:51,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:51,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:51,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 950 transitions. [2025-03-13 22:26:51,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9259259259259259 [2025-03-13 22:26:51,405 INFO L175 Difference]: Start difference. First operand has 295 places, 287 transitions, 705 flow. Second operand 3 states and 950 transitions. [2025-03-13 22:26:51,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 287 transitions, 744 flow [2025-03-13 22:26:51,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 287 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:51,410 INFO L231 Difference]: Finished difference. Result has 294 places, 286 transitions, 703 flow [2025-03-13 22:26:51,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=703, PETRI_PLACES=294, PETRI_TRANSITIONS=286} [2025-03-13 22:26:51,410 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -19 predicate places. [2025-03-13 22:26:51,410 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 286 transitions, 703 flow [2025-03-13 22:26:51,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:51,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:51,411 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:51,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:26:51,411 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-13 22:26:51,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:51,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1831402474, now seen corresponding path program 1 times [2025-03-13 22:26:51,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:51,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683293092] [2025-03-13 22:26:51,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:51,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:51,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-13 22:26:51,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-13 22:26:51,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:51,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:51,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:51,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:51,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683293092] [2025-03-13 22:26:51,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683293092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:51,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:51,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:51,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955890367] [2025-03-13 22:26:51,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:51,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:51,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:51,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:51,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:51,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 342 [2025-03-13 22:26:51,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 286 transitions, 703 flow. Second operand has 3 states, 3 states have (on average 313.6666666666667) internal successors, (941), 3 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:51,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:51,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 342 [2025-03-13 22:26:51,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:51,598 INFO L124 PetriNetUnfolderBase]: 95/1259 cut-off events. [2025-03-13 22:26:51,599 INFO L125 PetriNetUnfolderBase]: For 143/144 co-relation queries the response was YES. [2025-03-13 22:26:51,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1687 conditions, 1259 events. 95/1259 cut-off events. For 143/144 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 6460 event pairs, 44 based on Foata normal form. 0/1192 useless extension candidates. Maximal degree in co-relation 1635. Up to 156 conditions per place. [2025-03-13 22:26:51,604 INFO L140 encePairwiseOnDemand]: 339/342 looper letters, 0 selfloop transitions, 0 changer transitions 286/286 dead transitions. [2025-03-13 22:26:51,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 286 transitions, 742 flow [2025-03-13 22:26:51,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:51,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:51,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 950 transitions. [2025-03-13 22:26:51,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9259259259259259 [2025-03-13 22:26:51,607 INFO L175 Difference]: Start difference. First operand has 294 places, 286 transitions, 703 flow. Second operand 3 states and 950 transitions. [2025-03-13 22:26:51,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 286 transitions, 742 flow [2025-03-13 22:26:51,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 286 transitions, 738 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:51,610 INFO L231 Difference]: Finished difference. Result has 293 places, 0 transitions, 0 flow [2025-03-13 22:26:51,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=293, PETRI_TRANSITIONS=0} [2025-03-13 22:26:51,611 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -20 predicate places. [2025-03-13 22:26:51,611 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 0 transitions, 0 flow [2025-03-13 22:26:51,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.6666666666667) internal successors, (941), 3 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:51,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (71 of 72 remaining) [2025-03-13 22:26:51,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (70 of 72 remaining) [2025-03-13 22:26:51,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (69 of 72 remaining) [2025-03-13 22:26:51,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (68 of 72 remaining) [2025-03-13 22:26:51,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (67 of 72 remaining) [2025-03-13 22:26:51,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (66 of 72 remaining) [2025-03-13 22:26:51,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (65 of 72 remaining) [2025-03-13 22:26:51,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (64 of 72 remaining) [2025-03-13 22:26:51,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (63 of 72 remaining) [2025-03-13 22:26:51,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (62 of 72 remaining) [2025-03-13 22:26:51,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (61 of 72 remaining) [2025-03-13 22:26:51,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (60 of 72 remaining) [2025-03-13 22:26:51,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (59 of 72 remaining) [2025-03-13 22:26:51,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (58 of 72 remaining) [2025-03-13 22:26:51,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (57 of 72 remaining) [2025-03-13 22:26:51,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (56 of 72 remaining) [2025-03-13 22:26:51,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (55 of 72 remaining) [2025-03-13 22:26:51,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (54 of 72 remaining) [2025-03-13 22:26:51,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (53 of 72 remaining) [2025-03-13 22:26:51,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (52 of 72 remaining) [2025-03-13 22:26:51,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (51 of 72 remaining) [2025-03-13 22:26:51,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (50 of 72 remaining) [2025-03-13 22:26:51,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (49 of 72 remaining) [2025-03-13 22:26:51,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (48 of 72 remaining) [2025-03-13 22:26:51,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (47 of 72 remaining) [2025-03-13 22:26:51,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (46 of 72 remaining) [2025-03-13 22:26:51,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (45 of 72 remaining) [2025-03-13 22:26:51,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (44 of 72 remaining) [2025-03-13 22:26:51,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (43 of 72 remaining) [2025-03-13 22:26:51,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (42 of 72 remaining) [2025-03-13 22:26:51,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (41 of 72 remaining) [2025-03-13 22:26:51,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (40 of 72 remaining) [2025-03-13 22:26:51,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (39 of 72 remaining) [2025-03-13 22:26:51,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 72 remaining) [2025-03-13 22:26:51,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (37 of 72 remaining) [2025-03-13 22:26:51,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (36 of 72 remaining) [2025-03-13 22:26:51,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (35 of 72 remaining) [2025-03-13 22:26:51,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 72 remaining) [2025-03-13 22:26:51,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (33 of 72 remaining) [2025-03-13 22:26:51,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 72 remaining) [2025-03-13 22:26:51,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 72 remaining) [2025-03-13 22:26:51,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (30 of 72 remaining) [2025-03-13 22:26:51,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (29 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (28 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (27 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (26 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (25 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (24 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (23 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (22 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (21 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (20 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (19 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (18 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (17 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (16 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (15 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (14 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (13 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (12 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (11 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (10 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (8 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (7 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (6 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (5 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (4 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (3 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (2 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (1 of 72 remaining) [2025-03-13 22:26:51,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (0 of 72 remaining) [2025-03-13 22:26:51,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:26:51,617 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:51,621 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 22:26:51,621 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:26:51,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:26:51 BasicIcfg [2025-03-13 22:26:51,625 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:26:51,625 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:26:51,625 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:26:51,626 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:26:51,626 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:26:45" (3/4) ... [2025-03-13 22:26:51,627 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 22:26:51,629 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-13 22:26:51,630 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-13 22:26:51,632 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-13 22:26:51,632 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-13 22:26:51,633 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 22:26:51,633 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 22:26:51,689 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 22:26:51,690 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 22:26:51,690 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:26:51,691 INFO L158 Benchmark]: Toolchain (without parser) took 6499.56ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 122.9MB in the beginning and 90.4MB in the end (delta: 32.5MB). Peak memory consumption was 154.5MB. Max. memory is 16.1GB. [2025-03-13 22:26:51,691 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:26:51,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.32ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 110.1MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:26:51,692 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.04ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 107.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:26:51,693 INFO L158 Benchmark]: Boogie Preprocessor took 34.85ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 106.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:26:51,693 INFO L158 Benchmark]: IcfgBuilder took 528.39ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 79.4MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-13 22:26:51,693 INFO L158 Benchmark]: TraceAbstraction took 5632.48ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 78.9MB in the beginning and 98.9MB in the end (delta: -19.9MB). Peak memory consumption was 104.2MB. Max. memory is 16.1GB. [2025-03-13 22:26:51,693 INFO L158 Benchmark]: Witness Printer took 64.48ms. Allocated memory is still 293.6MB. Free memory was 98.9MB in the beginning and 90.4MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:26:51,695 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.18ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.32ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 110.1MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.04ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 107.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.85ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 106.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 528.39ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 79.4MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5632.48ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 78.9MB in the beginning and 98.9MB in the end (delta: -19.9MB). Peak memory consumption was 104.2MB. Max. memory is 16.1GB. * Witness Printer took 64.48ms. Allocated memory is still 293.6MB. Free memory was 98.9MB in the beginning and 90.4MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 521 locations, 72 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: 5.5s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1166 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 520 mSDsluCounter, 376 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 212 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1509 IncrementalHoareTripleChecker+Invalid, 1721 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 212 mSolverCounterUnsat, 300 mSDtfsCounter, 1509 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=737occurred in iteration=15, InterpolantAutomatonStates: 69, 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, 1.6s InterpolantComputationTime, 1602 NumberOfCodeBlocks, 1602 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1584 ConstructedInterpolants, 0 QuantifiedInterpolants, 2435 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 39 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-13 22:26:51,711 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