./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 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/popl20-more-queue-add-2-nl.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 613bf9314e4e3fb6e64527ec38c7e6b39400e524de37a5103e9f06d9db406d3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:14:35,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:14:35,573 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:14:35,577 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:14:35,577 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:14:35,595 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:14:35,595 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:14:35,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:14:35,596 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:14:35,596 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:14:35,596 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:14:35,596 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:14:35,596 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:14:35,596 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:14:35,596 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:14:35,596 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:14:35,596 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:14:35,596 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:14:35,596 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:14:35,596 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:14:35,596 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:14:35,596 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:14:35,597 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:14:35,597 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:14:35,597 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:14:35,597 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:14:35,597 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:14:35,597 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:14:35,597 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:14:35,597 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:14:35,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:14:35,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:14:35,597 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:14:35,597 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:14:35,597 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:14:35,597 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:14:35,597 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:14:35,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:14:35,597 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:14:35,597 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:14:35,598 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:14:35,598 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:14:35,598 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 -> 613bf9314e4e3fb6e64527ec38c7e6b39400e524de37a5103e9f06d9db406d3d [2025-03-17 11:14:35,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:14:35,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:14:35,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:14:35,830 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:14:35,830 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:14:35,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c [2025-03-17 11:14:36,959 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1184f363/f3ab34b081f24e5fae063cc461a62b60/FLAG8d900abe0 [2025-03-17 11:14:37,156 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:14:37,156 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c [2025-03-17 11:14:37,182 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1184f363/f3ab34b081f24e5fae063cc461a62b60/FLAG8d900abe0 [2025-03-17 11:14:37,203 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1184f363/f3ab34b081f24e5fae063cc461a62b60 [2025-03-17 11:14:37,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:14:37,210 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:14:37,210 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:14:37,210 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:14:37,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:14:37,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:14:37" (1/1) ... [2025-03-17 11:14:37,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eef1065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:37, skipping insertion in model container [2025-03-17 11:14:37,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:14:37" (1/1) ... [2025-03-17 11:14:37,229 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:14:37,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:14:37,375 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:14:37,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:14:37,425 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:14:37,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:37 WrapperNode [2025-03-17 11:14:37,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:14:37,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:14:37,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:14:37,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:14:37,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:37" (1/1) ... [2025-03-17 11:14:37,439 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:37" (1/1) ... [2025-03-17 11:14:37,463 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 322 [2025-03-17 11:14:37,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:14:37,464 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:14:37,464 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:14:37,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:14:37,470 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:37" (1/1) ... [2025-03-17 11:14:37,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:37" (1/1) ... [2025-03-17 11:14:37,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:37" (1/1) ... [2025-03-17 11:14:37,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:37" (1/1) ... [2025-03-17 11:14:37,484 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:37" (1/1) ... [2025-03-17 11:14:37,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:37" (1/1) ... [2025-03-17 11:14:37,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:37" (1/1) ... [2025-03-17 11:14:37,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:37" (1/1) ... [2025-03-17 11:14:37,489 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:14:37,489 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:14:37,489 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:14:37,489 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:14:37,490 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:37" (1/1) ... [2025-03-17 11:14:37,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:14:37,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:14:37,517 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-17 11:14:37,521 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-17 11:14:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:14:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 11:14:37,541 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 11:14:37,541 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 11:14:37,541 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 11:14:37,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:14:37,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:14:37,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 11:14:37,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 11:14:37,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:14:37,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:14:37,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:14:37,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:14:37,542 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:14:37,628 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:14:37,630 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:14:38,055 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:14:38,055 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:14:38,255 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:14:38,257 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:14:38,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:14:38 BoogieIcfgContainer [2025-03-17 11:14:38,258 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:14:38,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:14:38,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:14:38,264 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:14:38,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:14:37" (1/3) ... [2025-03-17 11:14:38,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@207a86ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:14:38, skipping insertion in model container [2025-03-17 11:14:38,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:37" (2/3) ... [2025-03-17 11:14:38,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@207a86ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:14:38, skipping insertion in model container [2025-03-17 11:14:38,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:14:38" (3/3) ... [2025-03-17 11:14:38,267 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-2-nl.wvr.c [2025-03-17 11:14:38,277 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:14:38,281 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-queue-add-2-nl.wvr.c that has 3 procedures, 271 locations, 1 initial locations, 3 loop locations, and 53 error locations. [2025-03-17 11:14:38,281 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:14:38,373 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 11:14:38,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 277 places, 280 transitions, 574 flow [2025-03-17 11:14:38,469 INFO L124 PetriNetUnfolderBase]: 10/278 cut-off events. [2025-03-17 11:14:38,470 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:14:38,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 278 events. 10/278 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 481 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 197. Up to 2 conditions per place. [2025-03-17 11:14:38,477 INFO L82 GeneralOperation]: Start removeDead. Operand has 277 places, 280 transitions, 574 flow [2025-03-17 11:14:38,481 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 257 places, 258 transitions, 528 flow [2025-03-17 11:14:38,490 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:14:38,500 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;@52477a31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:14:38,500 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2025-03-17 11:14:38,506 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:14:38,506 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-03-17 11:14:38,506 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:14:38,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:38,507 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] [2025-03-17 11:14:38,508 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:14:38,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:38,512 INFO L85 PathProgramCache]: Analyzing trace with hash 985787169, now seen corresponding path program 1 times [2025-03-17 11:14:38,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:38,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835533471] [2025-03-17 11:14:38,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:38,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:38,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 11:14:38,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 11:14:38,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:38,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:38,629 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-17 11:14:38,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:38,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835533471] [2025-03-17 11:14:38,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835533471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:38,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:38,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:38,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794485021] [2025-03-17 11:14:38,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:38,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:38,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:38,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:38,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:38,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 280 [2025-03-17 11:14:38,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 258 transitions, 528 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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-17 11:14:38,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:38,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 280 [2025-03-17 11:14:38,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:38,784 INFO L124 PetriNetUnfolderBase]: 25/388 cut-off events. [2025-03-17 11:14:38,784 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2025-03-17 11:14:38,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 388 events. 25/388 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1193 event pairs, 14 based on Foata normal form. 10/334 useless extension candidates. Maximal degree in co-relation 286. Up to 48 conditions per place. [2025-03-17 11:14:38,788 INFO L140 encePairwiseOnDemand]: 246/280 looper letters, 13 selfloop transitions, 2 changer transitions 3/226 dead transitions. [2025-03-17 11:14:38,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 226 transitions, 494 flow [2025-03-17 11:14:38,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:38,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:38,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 737 transitions. [2025-03-17 11:14:38,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8773809523809524 [2025-03-17 11:14:38,802 INFO L175 Difference]: Start difference. First operand has 257 places, 258 transitions, 528 flow. Second operand 3 states and 737 transitions. [2025-03-17 11:14:38,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 226 transitions, 494 flow [2025-03-17 11:14:38,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 226 transitions, 486 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 11:14:38,810 INFO L231 Difference]: Finished difference. Result has 228 places, 223 transitions, 454 flow [2025-03-17 11:14:38,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=228, PETRI_TRANSITIONS=223} [2025-03-17 11:14:38,816 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -29 predicate places. [2025-03-17 11:14:38,816 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 223 transitions, 454 flow [2025-03-17 11:14:38,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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-17 11:14:38,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:38,817 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-17 11:14:38,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:14:38,817 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:14:38,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:38,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1242128491, now seen corresponding path program 1 times [2025-03-17 11:14:38,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:38,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135461295] [2025-03-17 11:14:38,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:38,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:38,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 11:14:38,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 11:14:38,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:38,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:38,866 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-17 11:14:38,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:38,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135461295] [2025-03-17 11:14:38,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135461295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:38,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:38,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:38,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520394404] [2025-03-17 11:14:38,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:38,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:38,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:38,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:38,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:38,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 280 [2025-03-17 11:14:38,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 223 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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-17 11:14:38,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:38,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 280 [2025-03-17 11:14:38,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:38,961 INFO L124 PetriNetUnfolderBase]: 12/306 cut-off events. [2025-03-17 11:14:38,961 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:14:38,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 306 events. 12/306 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 750 event pairs, 7 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 315. Up to 30 conditions per place. [2025-03-17 11:14:38,965 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 13 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2025-03-17 11:14:38,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 222 transitions, 482 flow [2025-03-17 11:14:38,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:38,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:38,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 706 transitions. [2025-03-17 11:14:38,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8404761904761905 [2025-03-17 11:14:38,967 INFO L175 Difference]: Start difference. First operand has 228 places, 223 transitions, 454 flow. Second operand 3 states and 706 transitions. [2025-03-17 11:14:38,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 222 transitions, 482 flow [2025-03-17 11:14:38,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 222 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:38,971 INFO L231 Difference]: Finished difference. Result has 224 places, 222 transitions, 452 flow [2025-03-17 11:14:38,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=224, PETRI_TRANSITIONS=222} [2025-03-17 11:14:38,972 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -33 predicate places. [2025-03-17 11:14:38,972 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 222 transitions, 452 flow [2025-03-17 11:14:38,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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-17 11:14:38,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:38,974 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] [2025-03-17 11:14:38,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:14:38,974 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:14:38,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:38,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1599979697, now seen corresponding path program 1 times [2025-03-17 11:14:38,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:38,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944116765] [2025-03-17 11:14:38,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:38,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:38,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 11:14:38,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 11:14:38,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:38,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:39,019 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-17 11:14:39,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:39,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944116765] [2025-03-17 11:14:39,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944116765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:39,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:39,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:39,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209836571] [2025-03-17 11:14:39,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:39,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:39,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:39,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:39,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:39,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 280 [2025-03-17 11:14:39,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 222 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 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-17 11:14:39,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:39,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 280 [2025-03-17 11:14:39,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:39,073 INFO L124 PetriNetUnfolderBase]: 14/338 cut-off events. [2025-03-17 11:14:39,073 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:14:39,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 338 events. 14/338 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 752 event pairs, 5 based on Foata normal form. 0/287 useless extension candidates. Maximal degree in co-relation 335. Up to 27 conditions per place. [2025-03-17 11:14:39,075 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 11 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2025-03-17 11:14:39,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 221 transitions, 476 flow [2025-03-17 11:14:39,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:39,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:39,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 710 transitions. [2025-03-17 11:14:39,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8452380952380952 [2025-03-17 11:14:39,077 INFO L175 Difference]: Start difference. First operand has 224 places, 222 transitions, 452 flow. Second operand 3 states and 710 transitions. [2025-03-17 11:14:39,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 221 transitions, 476 flow [2025-03-17 11:14:39,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 221 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:39,080 INFO L231 Difference]: Finished difference. Result has 223 places, 221 transitions, 450 flow [2025-03-17 11:14:39,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=223, PETRI_TRANSITIONS=221} [2025-03-17 11:14:39,081 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -34 predicate places. [2025-03-17 11:14:39,081 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 221 transitions, 450 flow [2025-03-17 11:14:39,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 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-17 11:14:39,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:39,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] [2025-03-17 11:14:39,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:14:39,082 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:14:39,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:39,083 INFO L85 PathProgramCache]: Analyzing trace with hash -761050074, now seen corresponding path program 1 times [2025-03-17 11:14:39,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:39,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478623439] [2025-03-17 11:14:39,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:39,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:39,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 11:14:39,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 11:14:39,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:39,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:39,110 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-17 11:14:39,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:39,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478623439] [2025-03-17 11:14:39,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478623439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:39,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:39,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:39,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717939780] [2025-03-17 11:14:39,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:39,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:39,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:39,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:39,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:39,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 280 [2025-03-17 11:14:39,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 221 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 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-17 11:14:39,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:39,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 280 [2025-03-17 11:14:39,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:39,169 INFO L124 PetriNetUnfolderBase]: 14/337 cut-off events. [2025-03-17 11:14:39,169 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:14:39,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 337 events. 14/337 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 763 event pairs, 5 based on Foata normal form. 0/287 useless extension candidates. Maximal degree in co-relation 326. Up to 27 conditions per place. [2025-03-17 11:14:39,172 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 11 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2025-03-17 11:14:39,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 220 transitions, 474 flow [2025-03-17 11:14:39,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:39,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:39,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 710 transitions. [2025-03-17 11:14:39,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8452380952380952 [2025-03-17 11:14:39,175 INFO L175 Difference]: Start difference. First operand has 223 places, 221 transitions, 450 flow. Second operand 3 states and 710 transitions. [2025-03-17 11:14:39,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 220 transitions, 474 flow [2025-03-17 11:14:39,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 220 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:39,179 INFO L231 Difference]: Finished difference. Result has 222 places, 220 transitions, 448 flow [2025-03-17 11:14:39,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=448, PETRI_PLACES=222, PETRI_TRANSITIONS=220} [2025-03-17 11:14:39,180 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -35 predicate places. [2025-03-17 11:14:39,181 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 220 transitions, 448 flow [2025-03-17 11:14:39,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 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-17 11:14:39,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:39,181 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] [2025-03-17 11:14:39,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:14:39,182 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:14:39,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:39,182 INFO L85 PathProgramCache]: Analyzing trace with hash -73383245, now seen corresponding path program 1 times [2025-03-17 11:14:39,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:39,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593607372] [2025-03-17 11:14:39,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:39,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:39,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 11:14:39,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 11:14:39,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:39,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:39,222 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-17 11:14:39,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:39,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593607372] [2025-03-17 11:14:39,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593607372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:39,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:39,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:39,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787579586] [2025-03-17 11:14:39,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:39,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:39,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:39,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:39,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:39,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 280 [2025-03-17 11:14:39,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 220 transitions, 448 flow. Second operand has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 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-17 11:14:39,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:39,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 280 [2025-03-17 11:14:39,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:39,290 INFO L124 PetriNetUnfolderBase]: 15/343 cut-off events. [2025-03-17 11:14:39,290 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-03-17 11:14:39,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 343 events. 15/343 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 783 event pairs, 2 based on Foata normal form. 0/293 useless extension candidates. Maximal degree in co-relation 324. Up to 16 conditions per place. [2025-03-17 11:14:39,292 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 12 selfloop transitions, 2 changer transitions 0/223 dead transitions. [2025-03-17 11:14:39,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 223 transitions, 483 flow [2025-03-17 11:14:39,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:39,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:39,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2025-03-17 11:14:39,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8607142857142858 [2025-03-17 11:14:39,294 INFO L175 Difference]: Start difference. First operand has 222 places, 220 transitions, 448 flow. Second operand 3 states and 723 transitions. [2025-03-17 11:14:39,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 223 transitions, 483 flow [2025-03-17 11:14:39,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 223 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:39,298 INFO L231 Difference]: Finished difference. Result has 222 places, 220 transitions, 452 flow [2025-03-17 11:14:39,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=222, PETRI_TRANSITIONS=220} [2025-03-17 11:14:39,299 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -35 predicate places. [2025-03-17 11:14:39,299 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 220 transitions, 452 flow [2025-03-17 11:14:39,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 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-17 11:14:39,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:39,301 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:39,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:14:39,302 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:14:39,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:39,303 INFO L85 PathProgramCache]: Analyzing trace with hash -659991092, now seen corresponding path program 1 times [2025-03-17 11:14:39,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:39,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022187140] [2025-03-17 11:14:39,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:39,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:39,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 11:14:39,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 11:14:39,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:39,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:39,359 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-17 11:14:39,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:39,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022187140] [2025-03-17 11:14:39,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022187140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:39,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:39,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:39,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893368714] [2025-03-17 11:14:39,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:39,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:39,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:39,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:39,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:39,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 280 [2025-03-17 11:14:39,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 220 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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-17 11:14:39,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:39,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 280 [2025-03-17 11:14:39,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:39,409 INFO L124 PetriNetUnfolderBase]: 15/338 cut-off events. [2025-03-17 11:14:39,410 INFO L125 PetriNetUnfolderBase]: For 12/13 co-relation queries the response was YES. [2025-03-17 11:14:39,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 338 events. 15/338 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 758 event pairs, 5 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 183. Up to 29 conditions per place. [2025-03-17 11:14:39,411 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 11 selfloop transitions, 2 changer transitions 0/219 dead transitions. [2025-03-17 11:14:39,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 219 transitions, 476 flow [2025-03-17 11:14:39,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:39,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:39,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions. [2025-03-17 11:14:39,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8476190476190476 [2025-03-17 11:14:39,414 INFO L175 Difference]: Start difference. First operand has 222 places, 220 transitions, 452 flow. Second operand 3 states and 712 transitions. [2025-03-17 11:14:39,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 219 transitions, 476 flow [2025-03-17 11:14:39,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 219 transitions, 474 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:14:39,416 INFO L231 Difference]: Finished difference. Result has 222 places, 219 transitions, 452 flow [2025-03-17 11:14:39,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=222, PETRI_TRANSITIONS=219} [2025-03-17 11:14:39,417 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -35 predicate places. [2025-03-17 11:14:39,417 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 219 transitions, 452 flow [2025-03-17 11:14:39,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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-17 11:14:39,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:39,419 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:14:39,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:14:39,419 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:14:39,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:39,419 INFO L85 PathProgramCache]: Analyzing trace with hash 566368530, now seen corresponding path program 1 times [2025-03-17 11:14:39,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:39,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487540470] [2025-03-17 11:14:39,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:39,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:39,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 11:14:39,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 11:14:39,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:39,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:39,468 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-17 11:14:39,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:39,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487540470] [2025-03-17 11:14:39,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487540470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:39,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:39,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:39,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307891796] [2025-03-17 11:14:39,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:39,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:39,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:39,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:39,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:39,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 280 [2025-03-17 11:14:39,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 219 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 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-17 11:14:39,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:39,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 280 [2025-03-17 11:14:39,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:39,514 INFO L124 PetriNetUnfolderBase]: 15/337 cut-off events. [2025-03-17 11:14:39,515 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-03-17 11:14:39,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 337 events. 15/337 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 758 event pairs, 5 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 319. Up to 27 conditions per place. [2025-03-17 11:14:39,516 INFO L140 encePairwiseOnDemand]: 278/280 looper letters, 10 selfloop transitions, 1 changer transitions 0/218 dead transitions. [2025-03-17 11:14:39,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 218 transitions, 472 flow [2025-03-17 11:14:39,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:39,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:39,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2025-03-17 11:14:39,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8559523809523809 [2025-03-17 11:14:39,518 INFO L175 Difference]: Start difference. First operand has 222 places, 219 transitions, 452 flow. Second operand 3 states and 719 transitions. [2025-03-17 11:14:39,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 218 transitions, 472 flow [2025-03-17 11:14:39,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 218 transitions, 468 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:39,521 INFO L231 Difference]: Finished difference. Result has 221 places, 218 transitions, 448 flow [2025-03-17 11:14:39,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=448, PETRI_PLACES=221, PETRI_TRANSITIONS=218} [2025-03-17 11:14:39,522 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -36 predicate places. [2025-03-17 11:14:39,522 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 218 transitions, 448 flow [2025-03-17 11:14:39,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 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-17 11:14:39,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:39,523 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-17 11:14:39,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:14:39,523 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:14:39,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:39,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1987951885, now seen corresponding path program 1 times [2025-03-17 11:14:39,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:39,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336132353] [2025-03-17 11:14:39,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:39,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:39,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 11:14:39,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 11:14:39,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:39,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:39,961 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-17 11:14:39,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:39,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336132353] [2025-03-17 11:14:39,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336132353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:39,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:39,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:14:39,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77022281] [2025-03-17 11:14:39,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:39,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:14:39,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:39,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:14:39,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:14:40,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 280 [2025-03-17 11:14:40,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 218 transitions, 448 flow. Second operand has 6 states, 6 states have (on average 227.5) internal successors, (1365), 6 states have internal predecessors, (1365), 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-17 11:14:40,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:40,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 280 [2025-03-17 11:14:40,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:40,074 INFO L124 PetriNetUnfolderBase]: 15/336 cut-off events. [2025-03-17 11:14:40,074 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-03-17 11:14:40,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 336 events. 15/336 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 752 event pairs, 5 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 328. Up to 34 conditions per place. [2025-03-17 11:14:40,076 INFO L140 encePairwiseOnDemand]: 274/280 looper letters, 16 selfloop transitions, 5 changer transitions 0/217 dead transitions. [2025-03-17 11:14:40,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 217 transitions, 488 flow [2025-03-17 11:14:40,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:14:40,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:14:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1377 transitions. [2025-03-17 11:14:40,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8196428571428571 [2025-03-17 11:14:40,079 INFO L175 Difference]: Start difference. First operand has 221 places, 218 transitions, 448 flow. Second operand 6 states and 1377 transitions. [2025-03-17 11:14:40,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 217 transitions, 488 flow [2025-03-17 11:14:40,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 217 transitions, 487 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:14:40,082 INFO L231 Difference]: Finished difference. Result has 224 places, 217 transitions, 455 flow [2025-03-17 11:14:40,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=455, PETRI_PLACES=224, PETRI_TRANSITIONS=217} [2025-03-17 11:14:40,083 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -33 predicate places. [2025-03-17 11:14:40,084 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 217 transitions, 455 flow [2025-03-17 11:14:40,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 227.5) internal successors, (1365), 6 states have internal predecessors, (1365), 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-17 11:14:40,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:40,085 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-17 11:14:40,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:14:40,085 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:14:40,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:40,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1302309905, now seen corresponding path program 1 times [2025-03-17 11:14:40,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:40,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216872738] [2025-03-17 11:14:40,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:40,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:40,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 11:14:40,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 11:14:40,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:40,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:40,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:40,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:40,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216872738] [2025-03-17 11:14:40,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216872738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:40,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:40,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:40,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679766943] [2025-03-17 11:14:40,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:40,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:40,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:40,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:40,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:40,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 280 [2025-03-17 11:14:40,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 217 transitions, 455 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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-17 11:14:40,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:40,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 280 [2025-03-17 11:14:40,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:40,175 INFO L124 PetriNetUnfolderBase]: 15/335 cut-off events. [2025-03-17 11:14:40,176 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-03-17 11:14:40,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 335 events. 15/335 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 743 event pairs, 5 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 369. Up to 29 conditions per place. [2025-03-17 11:14:40,178 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 11 selfloop transitions, 2 changer transitions 0/216 dead transitions. [2025-03-17 11:14:40,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 216 transitions, 479 flow [2025-03-17 11:14:40,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:40,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:40,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions. [2025-03-17 11:14:40,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8476190476190476 [2025-03-17 11:14:40,180 INFO L175 Difference]: Start difference. First operand has 224 places, 217 transitions, 455 flow. Second operand 3 states and 712 transitions. [2025-03-17 11:14:40,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 216 transitions, 479 flow [2025-03-17 11:14:40,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 216 transitions, 469 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:14:40,184 INFO L231 Difference]: Finished difference. Result has 220 places, 216 transitions, 447 flow [2025-03-17 11:14:40,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=447, PETRI_PLACES=220, PETRI_TRANSITIONS=216} [2025-03-17 11:14:40,185 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -37 predicate places. [2025-03-17 11:14:40,185 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 216 transitions, 447 flow [2025-03-17 11:14:40,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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-17 11:14:40,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:40,186 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] [2025-03-17 11:14:40,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:14:40,186 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:14:40,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:40,187 INFO L85 PathProgramCache]: Analyzing trace with hash -534622394, now seen corresponding path program 1 times [2025-03-17 11:14:40,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:40,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471281424] [2025-03-17 11:14:40,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:40,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:40,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 11:14:40,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 11:14:40,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:40,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:40,226 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-17 11:14:40,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:40,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471281424] [2025-03-17 11:14:40,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471281424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:40,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:40,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:40,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130675664] [2025-03-17 11:14:40,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:40,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:40,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:40,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:40,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:40,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 280 [2025-03-17 11:14:40,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 216 transitions, 447 flow. Second operand has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 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-17 11:14:40,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:40,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 280 [2025-03-17 11:14:40,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:40,285 INFO L124 PetriNetUnfolderBase]: 19/302 cut-off events. [2025-03-17 11:14:40,285 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-17 11:14:40,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 302 events. 19/302 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 741 event pairs, 9 based on Foata normal form. 1/261 useless extension candidates. Maximal degree in co-relation 302. Up to 38 conditions per place. [2025-03-17 11:14:40,287 INFO L140 encePairwiseOnDemand]: 276/280 looper letters, 12 selfloop transitions, 1 changer transitions 2/213 dead transitions. [2025-03-17 11:14:40,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 213 transitions, 469 flow [2025-03-17 11:14:40,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:40,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:40,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 706 transitions. [2025-03-17 11:14:40,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8404761904761905 [2025-03-17 11:14:40,290 INFO L175 Difference]: Start difference. First operand has 220 places, 216 transitions, 447 flow. Second operand 3 states and 706 transitions. [2025-03-17 11:14:40,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 213 transitions, 469 flow [2025-03-17 11:14:40,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 213 transitions, 465 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:40,295 INFO L231 Difference]: Finished difference. Result has 217 places, 211 transitions, 435 flow [2025-03-17 11:14:40,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=435, PETRI_PLACES=217, PETRI_TRANSITIONS=211} [2025-03-17 11:14:40,295 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -40 predicate places. [2025-03-17 11:14:40,295 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 211 transitions, 435 flow [2025-03-17 11:14:40,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 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-17 11:14:40,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:40,296 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-17 11:14:40,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:14:40,296 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:14:40,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:40,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1132792419, now seen corresponding path program 1 times [2025-03-17 11:14:40,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:40,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535781243] [2025-03-17 11:14:40,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:40,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:40,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 11:14:40,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 11:14:40,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:40,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:40,350 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-17 11:14:40,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:40,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535781243] [2025-03-17 11:14:40,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535781243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:40,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:40,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:40,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710752821] [2025-03-17 11:14:40,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:40,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:40,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:40,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:40,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:40,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 280 [2025-03-17 11:14:40,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 211 transitions, 435 flow. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 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-17 11:14:40,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:40,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 280 [2025-03-17 11:14:40,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:40,432 INFO L124 PetriNetUnfolderBase]: 33/342 cut-off events. [2025-03-17 11:14:40,433 INFO L125 PetriNetUnfolderBase]: For 23/27 co-relation queries the response was YES. [2025-03-17 11:14:40,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 342 events. 33/342 cut-off events. For 23/27 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 994 event pairs, 9 based on Foata normal form. 1/303 useless extension candidates. Maximal degree in co-relation 378. Up to 38 conditions per place. [2025-03-17 11:14:40,435 INFO L140 encePairwiseOnDemand]: 272/280 looper letters, 14 selfloop transitions, 5 changer transitions 0/211 dead transitions. [2025-03-17 11:14:40,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 211 transitions, 478 flow [2025-03-17 11:14:40,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:40,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 707 transitions. [2025-03-17 11:14:40,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8416666666666667 [2025-03-17 11:14:40,437 INFO L175 Difference]: Start difference. First operand has 217 places, 211 transitions, 435 flow. Second operand 3 states and 707 transitions. [2025-03-17 11:14:40,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 211 transitions, 478 flow [2025-03-17 11:14:40,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 211 transitions, 477 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:14:40,442 INFO L231 Difference]: Finished difference. Result has 213 places, 208 transitions, 438 flow [2025-03-17 11:14:40,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=438, PETRI_PLACES=213, PETRI_TRANSITIONS=208} [2025-03-17 11:14:40,443 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -44 predicate places. [2025-03-17 11:14:40,443 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 208 transitions, 438 flow [2025-03-17 11:14:40,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 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-17 11:14:40,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:40,443 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-17 11:14:40,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:14:40,444 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:14:40,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:40,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1986760064, now seen corresponding path program 1 times [2025-03-17 11:14:40,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:40,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52258658] [2025-03-17 11:14:40,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:40,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:40,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 11:14:40,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 11:14:40,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:40,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:40,499 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-17 11:14:40,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:40,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52258658] [2025-03-17 11:14:40,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52258658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:40,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:40,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:40,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265217927] [2025-03-17 11:14:40,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:40,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:40,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:40,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:40,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:40,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 280 [2025-03-17 11:14:40,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 208 transitions, 438 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 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-17 11:14:40,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:40,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 280 [2025-03-17 11:14:40,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:40,583 INFO L124 PetriNetUnfolderBase]: 54/482 cut-off events. [2025-03-17 11:14:40,583 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-17 11:14:40,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 482 events. 54/482 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1869 event pairs, 10 based on Foata normal form. 0/432 useless extension candidates. Maximal degree in co-relation 572. Up to 87 conditions per place. [2025-03-17 11:14:40,588 INFO L140 encePairwiseOnDemand]: 274/280 looper letters, 19 selfloop transitions, 3 changer transitions 0/212 dead transitions. [2025-03-17 11:14:40,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 212 transitions, 493 flow [2025-03-17 11:14:40,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:40,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:40,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2025-03-17 11:14:40,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.85 [2025-03-17 11:14:40,590 INFO L175 Difference]: Start difference. First operand has 213 places, 208 transitions, 438 flow. Second operand 3 states and 714 transitions. [2025-03-17 11:14:40,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 212 transitions, 493 flow [2025-03-17 11:14:40,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 212 transitions, 483 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:40,594 INFO L231 Difference]: Finished difference. Result has 211 places, 208 transitions, 443 flow [2025-03-17 11:14:40,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=443, PETRI_PLACES=211, PETRI_TRANSITIONS=208} [2025-03-17 11:14:40,595 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -46 predicate places. [2025-03-17 11:14:40,595 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 208 transitions, 443 flow [2025-03-17 11:14:40,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 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-17 11:14:40,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:40,596 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] [2025-03-17 11:14:40,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:14:40,596 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:14:40,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:40,597 INFO L85 PathProgramCache]: Analyzing trace with hash 236792375, now seen corresponding path program 1 times [2025-03-17 11:14:40,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:40,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719654081] [2025-03-17 11:14:40,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:40,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:40,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 11:14:40,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 11:14:40,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:40,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:40,642 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-17 11:14:40,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:40,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719654081] [2025-03-17 11:14:40,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719654081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:40,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:40,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:40,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754204821] [2025-03-17 11:14:40,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:40,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:40,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:40,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:40,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:40,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 280 [2025-03-17 11:14:40,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 208 transitions, 443 flow. Second operand has 3 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 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-17 11:14:40,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:40,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 280 [2025-03-17 11:14:40,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:40,741 INFO L124 PetriNetUnfolderBase]: 78/548 cut-off events. [2025-03-17 11:14:40,741 INFO L125 PetriNetUnfolderBase]: For 26/27 co-relation queries the response was YES. [2025-03-17 11:14:40,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 548 events. 78/548 cut-off events. For 26/27 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2364 event pairs, 26 based on Foata normal form. 0/479 useless extension candidates. Maximal degree in co-relation 669. Up to 106 conditions per place. [2025-03-17 11:14:40,744 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 16 selfloop transitions, 2 changer transitions 0/210 dead transitions. [2025-03-17 11:14:40,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 210 transitions, 484 flow [2025-03-17 11:14:40,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:40,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2025-03-17 11:14:40,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.85 [2025-03-17 11:14:40,747 INFO L175 Difference]: Start difference. First operand has 211 places, 208 transitions, 443 flow. Second operand 3 states and 714 transitions. [2025-03-17 11:14:40,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 210 transitions, 484 flow [2025-03-17 11:14:40,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 210 transitions, 484 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:14:40,750 INFO L231 Difference]: Finished difference. Result has 212 places, 207 transitions, 445 flow [2025-03-17 11:14:40,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=445, PETRI_PLACES=212, PETRI_TRANSITIONS=207} [2025-03-17 11:14:40,751 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -45 predicate places. [2025-03-17 11:14:40,751 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 207 transitions, 445 flow [2025-03-17 11:14:40,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 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-17 11:14:40,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:40,752 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-17 11:14:40,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:14:40,752 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:14:40,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:40,752 INFO L85 PathProgramCache]: Analyzing trace with hash -289446843, now seen corresponding path program 1 times [2025-03-17 11:14:40,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:40,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749475186] [2025-03-17 11:14:40,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:40,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:40,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 11:14:40,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 11:14:40,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:40,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:40,806 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-17 11:14:40,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:40,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749475186] [2025-03-17 11:14:40,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749475186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:40,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:40,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:40,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956146773] [2025-03-17 11:14:40,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:40,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:40,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:40,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:40,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:40,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 280 [2025-03-17 11:14:40,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 207 transitions, 445 flow. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 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-17 11:14:40,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:40,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 280 [2025-03-17 11:14:40,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:40,874 INFO L124 PetriNetUnfolderBase]: 57/414 cut-off events. [2025-03-17 11:14:40,875 INFO L125 PetriNetUnfolderBase]: For 35/37 co-relation queries the response was YES. [2025-03-17 11:14:40,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 414 events. 57/414 cut-off events. For 35/37 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1406 event pairs, 23 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 529. Up to 81 conditions per place. [2025-03-17 11:14:40,876 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 17 selfloop transitions, 2 changer transitions 0/209 dead transitions. [2025-03-17 11:14:40,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 209 transitions, 492 flow [2025-03-17 11:14:40,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:40,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:40,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 711 transitions. [2025-03-17 11:14:40,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8464285714285714 [2025-03-17 11:14:40,878 INFO L175 Difference]: Start difference. First operand has 212 places, 207 transitions, 445 flow. Second operand 3 states and 711 transitions. [2025-03-17 11:14:40,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 209 transitions, 492 flow [2025-03-17 11:14:40,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 209 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:40,880 INFO L231 Difference]: Finished difference. Result has 211 places, 206 transitions, 443 flow [2025-03-17 11:14:40,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=443, PETRI_PLACES=211, PETRI_TRANSITIONS=206} [2025-03-17 11:14:40,881 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -46 predicate places. [2025-03-17 11:14:40,881 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 206 transitions, 443 flow [2025-03-17 11:14:40,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 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-17 11:14:40,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:40,882 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:40,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:14:40,882 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:14:40,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:40,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1514480275, now seen corresponding path program 1 times [2025-03-17 11:14:40,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:40,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122814025] [2025-03-17 11:14:40,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:40,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:40,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 11:14:40,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 11:14:40,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:40,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:40,912 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-17 11:14:40,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:40,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122814025] [2025-03-17 11:14:40,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122814025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:40,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:40,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:40,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977918634] [2025-03-17 11:14:40,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:40,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:40,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:40,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:40,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:40,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 280 [2025-03-17 11:14:40,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 206 transitions, 443 flow. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 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-17 11:14:40,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:40,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 280 [2025-03-17 11:14:40,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:40,980 INFO L124 PetriNetUnfolderBase]: 57/411 cut-off events. [2025-03-17 11:14:40,980 INFO L125 PetriNetUnfolderBase]: For 38/43 co-relation queries the response was YES. [2025-03-17 11:14:40,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 593 conditions, 411 events. 57/411 cut-off events. For 38/43 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1378 event pairs, 23 based on Foata normal form. 1/370 useless extension candidates. Maximal degree in co-relation 528. Up to 81 conditions per place. [2025-03-17 11:14:40,982 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 17 selfloop transitions, 2 changer transitions 0/208 dead transitions. [2025-03-17 11:14:40,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 208 transitions, 490 flow [2025-03-17 11:14:40,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:40,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:40,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 711 transitions. [2025-03-17 11:14:40,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8464285714285714 [2025-03-17 11:14:40,984 INFO L175 Difference]: Start difference. First operand has 211 places, 206 transitions, 443 flow. Second operand 3 states and 711 transitions. [2025-03-17 11:14:40,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 208 transitions, 490 flow [2025-03-17 11:14:40,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 208 transitions, 486 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:40,986 INFO L231 Difference]: Finished difference. Result has 210 places, 205 transitions, 441 flow [2025-03-17 11:14:40,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=210, PETRI_TRANSITIONS=205} [2025-03-17 11:14:40,987 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -47 predicate places. [2025-03-17 11:14:40,987 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 205 transitions, 441 flow [2025-03-17 11:14:40,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 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-17 11:14:40,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:40,988 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:40,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:14:40,988 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:14:40,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:40,988 INFO L85 PathProgramCache]: Analyzing trace with hash 204627205, now seen corresponding path program 1 times [2025-03-17 11:14:40,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:40,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912960547] [2025-03-17 11:14:40,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:40,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:40,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 11:14:41,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 11:14:41,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:41,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:41,023 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-17 11:14:41,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:41,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912960547] [2025-03-17 11:14:41,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912960547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:41,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:41,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:41,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346588655] [2025-03-17 11:14:41,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:41,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:41,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:41,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:41,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:41,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 280 [2025-03-17 11:14:41,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 205 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 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-17 11:14:41,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:41,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 280 [2025-03-17 11:14:41,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:41,094 INFO L124 PetriNetUnfolderBase]: 60/510 cut-off events. [2025-03-17 11:14:41,094 INFO L125 PetriNetUnfolderBase]: For 25/26 co-relation queries the response was YES. [2025-03-17 11:14:41,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 510 events. 60/510 cut-off events. For 25/26 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2080 event pairs, 19 based on Foata normal form. 1/469 useless extension candidates. Maximal degree in co-relation 607. Up to 65 conditions per place. [2025-03-17 11:14:41,096 INFO L140 encePairwiseOnDemand]: 275/280 looper letters, 13 selfloop transitions, 2 changer transitions 4/206 dead transitions. [2025-03-17 11:14:41,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 206 transitions, 476 flow [2025-03-17 11:14:41,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:41,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:41,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2025-03-17 11:14:41,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8488095238095238 [2025-03-17 11:14:41,098 INFO L175 Difference]: Start difference. First operand has 210 places, 205 transitions, 441 flow. Second operand 3 states and 713 transitions. [2025-03-17 11:14:41,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 206 transitions, 476 flow [2025-03-17 11:14:41,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 206 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:41,100 INFO L231 Difference]: Finished difference. Result has 208 places, 199 transitions, 429 flow [2025-03-17 11:14:41,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=429, PETRI_PLACES=208, PETRI_TRANSITIONS=199} [2025-03-17 11:14:41,101 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -49 predicate places. [2025-03-17 11:14:41,101 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 199 transitions, 429 flow [2025-03-17 11:14:41,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 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-17 11:14:41,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:41,101 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] [2025-03-17 11:14:41,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:14:41,101 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:14:41,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:41,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1010974073, now seen corresponding path program 1 times [2025-03-17 11:14:41,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:41,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655381765] [2025-03-17 11:14:41,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:41,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:41,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 11:14:41,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 11:14:41,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:41,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:41,134 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-17 11:14:41,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:41,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655381765] [2025-03-17 11:14:41,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655381765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:41,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:41,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:41,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946519852] [2025-03-17 11:14:41,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:41,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:41,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:41,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:41,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:41,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 280 [2025-03-17 11:14:41,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 199 transitions, 429 flow. Second operand has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 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-17 11:14:41,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:41,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 280 [2025-03-17 11:14:41,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:41,210 INFO L124 PetriNetUnfolderBase]: 76/515 cut-off events. [2025-03-17 11:14:41,210 INFO L125 PetriNetUnfolderBase]: For 32/33 co-relation queries the response was YES. [2025-03-17 11:14:41,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 515 events. 76/515 cut-off events. For 32/33 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2245 event pairs, 29 based on Foata normal form. 0/475 useless extension candidates. Maximal degree in co-relation 647. Up to 95 conditions per place. [2025-03-17 11:14:41,212 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 15 selfloop transitions, 2 changer transitions 0/201 dead transitions. [2025-03-17 11:14:41,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 201 transitions, 468 flow [2025-03-17 11:14:41,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:41,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:41,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2025-03-17 11:14:41,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8488095238095238 [2025-03-17 11:14:41,214 INFO L175 Difference]: Start difference. First operand has 208 places, 199 transitions, 429 flow. Second operand 3 states and 713 transitions. [2025-03-17 11:14:41,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 201 transitions, 468 flow [2025-03-17 11:14:41,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 201 transitions, 464 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:41,216 INFO L231 Difference]: Finished difference. Result has 203 places, 198 transitions, 427 flow [2025-03-17 11:14:41,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=427, PETRI_PLACES=203, PETRI_TRANSITIONS=198} [2025-03-17 11:14:41,217 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -54 predicate places. [2025-03-17 11:14:41,217 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 198 transitions, 427 flow [2025-03-17 11:14:41,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 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-17 11:14:41,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:41,218 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] [2025-03-17 11:14:41,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:14:41,218 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:14:41,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:41,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1616986801, now seen corresponding path program 1 times [2025-03-17 11:14:41,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:41,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066655629] [2025-03-17 11:14:41,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:41,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:41,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 11:14:41,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 11:14:41,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:41,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:41,251 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-17 11:14:41,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:41,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066655629] [2025-03-17 11:14:41,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066655629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:41,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:41,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:41,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582874063] [2025-03-17 11:14:41,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:41,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:41,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:41,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:41,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:41,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 280 [2025-03-17 11:14:41,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 198 transitions, 427 flow. Second operand has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 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-17 11:14:41,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:41,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 280 [2025-03-17 11:14:41,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:41,322 INFO L124 PetriNetUnfolderBase]: 51/420 cut-off events. [2025-03-17 11:14:41,322 INFO L125 PetriNetUnfolderBase]: For 22/23 co-relation queries the response was YES. [2025-03-17 11:14:41,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 563 conditions, 420 events. 51/420 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1398 event pairs, 12 based on Foata normal form. 1/399 useless extension candidates. Maximal degree in co-relation 498. Up to 49 conditions per place. [2025-03-17 11:14:41,324 INFO L140 encePairwiseOnDemand]: 275/280 looper letters, 11 selfloop transitions, 2 changer transitions 4/199 dead transitions. [2025-03-17 11:14:41,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 199 transitions, 460 flow [2025-03-17 11:14:41,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:41,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:41,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2025-03-17 11:14:41,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8511904761904762 [2025-03-17 11:14:41,325 INFO L175 Difference]: Start difference. First operand has 203 places, 198 transitions, 427 flow. Second operand 3 states and 715 transitions. [2025-03-17 11:14:41,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 199 transitions, 460 flow [2025-03-17 11:14:41,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 199 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:41,327 INFO L231 Difference]: Finished difference. Result has 201 places, 192 transitions, 414 flow [2025-03-17 11:14:41,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=201, PETRI_TRANSITIONS=192} [2025-03-17 11:14:41,328 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -56 predicate places. [2025-03-17 11:14:41,328 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 192 transitions, 414 flow [2025-03-17 11:14:41,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 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-17 11:14:41,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:41,328 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] [2025-03-17 11:14:41,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:14:41,328 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:14:41,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:41,329 INFO L85 PathProgramCache]: Analyzing trace with hash -832022606, now seen corresponding path program 1 times [2025-03-17 11:14:41,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:41,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704868108] [2025-03-17 11:14:41,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:41,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:41,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 11:14:41,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 11:14:41,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:41,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:41,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:41,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:41,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704868108] [2025-03-17 11:14:41,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704868108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:41,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:41,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:14:41,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961954070] [2025-03-17 11:14:41,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:41,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:41,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:41,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:41,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:41,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 280 [2025-03-17 11:14:41,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 192 transitions, 414 flow. Second operand has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 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-17 11:14:41,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:41,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 280 [2025-03-17 11:14:41,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:41,508 INFO L124 PetriNetUnfolderBase]: 24/366 cut-off events. [2025-03-17 11:14:41,508 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-17 11:14:41,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 366 events. 24/366 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 977 event pairs, 3 based on Foata normal form. 1/348 useless extension candidates. Maximal degree in co-relation 393. Up to 33 conditions per place. [2025-03-17 11:14:41,510 INFO L140 encePairwiseOnDemand]: 276/280 looper letters, 11 selfloop transitions, 3 changer transitions 0/195 dead transitions. [2025-03-17 11:14:41,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 195 transitions, 449 flow [2025-03-17 11:14:41,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:41,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:41,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2025-03-17 11:14:41,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8595238095238096 [2025-03-17 11:14:41,511 INFO L175 Difference]: Start difference. First operand has 201 places, 192 transitions, 414 flow. Second operand 3 states and 722 transitions. [2025-03-17 11:14:41,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 195 transitions, 449 flow [2025-03-17 11:14:41,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 195 transitions, 445 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:41,514 INFO L231 Difference]: Finished difference. Result has 198 places, 194 transitions, 429 flow [2025-03-17 11:14:41,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=429, PETRI_PLACES=198, PETRI_TRANSITIONS=194} [2025-03-17 11:14:41,514 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -59 predicate places. [2025-03-17 11:14:41,514 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 194 transitions, 429 flow [2025-03-17 11:14:41,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 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-17 11:14:41,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:41,515 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] [2025-03-17 11:14:41,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:14:41,515 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-17 11:14:41,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:41,516 INFO L85 PathProgramCache]: Analyzing trace with hash -28370404, now seen corresponding path program 1 times [2025-03-17 11:14:41,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:41,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276631247] [2025-03-17 11:14:41,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:41,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:41,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 11:14:41,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 11:14:41,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:41,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:41,555 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-17 11:14:41,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:41,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276631247] [2025-03-17 11:14:41,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276631247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:41,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:41,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:41,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890756118] [2025-03-17 11:14:41,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:41,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:41,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:41,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:41,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:41,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 280 [2025-03-17 11:14:41,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 194 transitions, 429 flow. Second operand has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 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-17 11:14:41,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:41,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 280 [2025-03-17 11:14:41,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:41,608 INFO L124 PetriNetUnfolderBase]: 45/389 cut-off events. [2025-03-17 11:14:41,608 INFO L125 PetriNetUnfolderBase]: For 54/60 co-relation queries the response was YES. [2025-03-17 11:14:41,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 389 events. 45/389 cut-off events. For 54/60 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1204 event pairs, 12 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 484. Up to 64 conditions per place. [2025-03-17 11:14:41,609 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 0 selfloop transitions, 0 changer transitions 196/196 dead transitions. [2025-03-17 11:14:41,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 196 transitions, 472 flow [2025-03-17 11:14:41,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:41,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:41,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2025-03-17 11:14:41,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.85 [2025-03-17 11:14:41,611 INFO L175 Difference]: Start difference. First operand has 198 places, 194 transitions, 429 flow. Second operand 3 states and 714 transitions. [2025-03-17 11:14:41,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 196 transitions, 472 flow [2025-03-17 11:14:41,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 196 transitions, 469 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:14:41,613 INFO L231 Difference]: Finished difference. Result has 198 places, 0 transitions, 0 flow [2025-03-17 11:14:41,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=198, PETRI_TRANSITIONS=0} [2025-03-17 11:14:41,613 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -59 predicate places. [2025-03-17 11:14:41,613 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 0 transitions, 0 flow [2025-03-17 11:14:41,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 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-17 11:14:41,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (93 of 94 remaining) [2025-03-17 11:14:41,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (92 of 94 remaining) [2025-03-17 11:14:41,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (91 of 94 remaining) [2025-03-17 11:14:41,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (90 of 94 remaining) [2025-03-17 11:14:41,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (89 of 94 remaining) [2025-03-17 11:14:41,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (88 of 94 remaining) [2025-03-17 11:14:41,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (87 of 94 remaining) [2025-03-17 11:14:41,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (86 of 94 remaining) [2025-03-17 11:14:41,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (85 of 94 remaining) [2025-03-17 11:14:41,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (84 of 94 remaining) [2025-03-17 11:14:41,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (83 of 94 remaining) [2025-03-17 11:14:41,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (82 of 94 remaining) [2025-03-17 11:14:41,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (81 of 94 remaining) [2025-03-17 11:14:41,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (80 of 94 remaining) [2025-03-17 11:14:41,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (79 of 94 remaining) [2025-03-17 11:14:41,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (78 of 94 remaining) [2025-03-17 11:14:41,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (77 of 94 remaining) [2025-03-17 11:14:41,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (76 of 94 remaining) [2025-03-17 11:14:41,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (75 of 94 remaining) [2025-03-17 11:14:41,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (74 of 94 remaining) [2025-03-17 11:14:41,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (73 of 94 remaining) [2025-03-17 11:14:41,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (72 of 94 remaining) [2025-03-17 11:14:41,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (71 of 94 remaining) [2025-03-17 11:14:41,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (70 of 94 remaining) [2025-03-17 11:14:41,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (69 of 94 remaining) [2025-03-17 11:14:41,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (68 of 94 remaining) [2025-03-17 11:14:41,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (67 of 94 remaining) [2025-03-17 11:14:41,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (66 of 94 remaining) [2025-03-17 11:14:41,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (65 of 94 remaining) [2025-03-17 11:14:41,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (64 of 94 remaining) [2025-03-17 11:14:41,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (63 of 94 remaining) [2025-03-17 11:14:41,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (62 of 94 remaining) [2025-03-17 11:14:41,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (61 of 94 remaining) [2025-03-17 11:14:41,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (60 of 94 remaining) [2025-03-17 11:14:41,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (59 of 94 remaining) [2025-03-17 11:14:41,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (58 of 94 remaining) [2025-03-17 11:14:41,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (57 of 94 remaining) [2025-03-17 11:14:41,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (56 of 94 remaining) [2025-03-17 11:14:41,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (55 of 94 remaining) [2025-03-17 11:14:41,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (54 of 94 remaining) [2025-03-17 11:14:41,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (53 of 94 remaining) [2025-03-17 11:14:41,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (52 of 94 remaining) [2025-03-17 11:14:41,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (51 of 94 remaining) [2025-03-17 11:14:41,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (50 of 94 remaining) [2025-03-17 11:14:41,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (49 of 94 remaining) [2025-03-17 11:14:41,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (48 of 94 remaining) [2025-03-17 11:14:41,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (47 of 94 remaining) [2025-03-17 11:14:41,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (46 of 94 remaining) [2025-03-17 11:14:41,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (45 of 94 remaining) [2025-03-17 11:14:41,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (44 of 94 remaining) [2025-03-17 11:14:41,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (43 of 94 remaining) [2025-03-17 11:14:41,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (42 of 94 remaining) [2025-03-17 11:14:41,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (41 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (38 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (37 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (36 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (35 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (34 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (33 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (32 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (31 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (30 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (29 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (28 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (27 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (26 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (25 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (24 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (23 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (22 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (21 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (20 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (19 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (18 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (16 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (15 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (14 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (13 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (11 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (10 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (6 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 94 remaining) [2025-03-17 11:14:41,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 94 remaining) [2025-03-17 11:14:41,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 94 remaining) [2025-03-17 11:14:41,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 94 remaining) [2025-03-17 11:14:41,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 94 remaining) [2025-03-17 11:14:41,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (0 of 94 remaining) [2025-03-17 11:14:41,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:14:41,620 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:41,624 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 11:14:41,624 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:14:41,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:14:41 BasicIcfg [2025-03-17 11:14:41,630 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:14:41,630 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:14:41,630 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:14:41,630 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:14:41,631 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:14:38" (3/4) ... [2025-03-17 11:14:41,632 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:14:41,634 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-17 11:14:41,634 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-17 11:14:41,638 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-17 11:14:41,638 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 11:14:41,639 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 11:14:41,639 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 11:14:41,703 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:14:41,703 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:14:41,703 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:14:41,704 INFO L158 Benchmark]: Toolchain (without parser) took 4494.07ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 121.7MB in the beginning and 172.6MB in the end (delta: -50.9MB). Peak memory consumption was 142.4MB. Max. memory is 16.1GB. [2025-03-17 11:14:41,704 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:14:41,705 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.91ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 109.6MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:14:41,705 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.48ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 106.9MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:14:41,705 INFO L158 Benchmark]: Boogie Preprocessor took 25.31ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 104.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:14:41,705 INFO L158 Benchmark]: IcfgBuilder took 768.36ms. Allocated memory is still 167.8MB. Free memory was 104.6MB in the beginning and 40.9MB in the end (delta: 63.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-17 11:14:41,705 INFO L158 Benchmark]: TraceAbstraction took 3370.12ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 39.8MB in the beginning and 177.1MB in the end (delta: -137.3MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. [2025-03-17 11:14:41,705 INFO L158 Benchmark]: Witness Printer took 72.97ms. Allocated memory is still 360.7MB. Free memory was 177.1MB in the beginning and 172.6MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:14:41,706 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.14ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.91ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 109.6MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.48ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 106.9MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.31ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 104.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 768.36ms. Allocated memory is still 167.8MB. Free memory was 104.6MB in the beginning and 40.9MB in the end (delta: 63.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3370.12ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 39.8MB in the beginning and 177.1MB in the end (delta: -137.3MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. * Witness Printer took 72.97ms. Allocated memory is still 360.7MB. Free memory was 177.1MB in the beginning and 172.6MB in the end (delta: 4.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: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: 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: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: 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: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: 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, 372 locations, 385 edges, 94 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.2s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 424 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 630 IncrementalHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 65 mSDtfsCounter, 630 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=528occurred in iteration=0, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1794 NumberOfCodeBlocks, 1794 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1774 ConstructedInterpolants, 0 QuantifiedInterpolants, 2053 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 53 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:14:41,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE