./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/unroll-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/unroll-2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8c7125507f231f46c946ebcd57e8b56859ee58b969eed99ccdbcf88141d9e219 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:56:19,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:56:19,338 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:56:19,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:56:19,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:56:19,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:56:19,366 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:56:19,366 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:56:19,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:56:19,367 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:56:19,367 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:56:19,367 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:56:19,367 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:56:19,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:56:19,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:56:19,367 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:56:19,367 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:56:19,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:56:19,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:56:19,369 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:56:19,369 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:56:19,369 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:56:19,369 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:56:19,369 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:56:19,369 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:56:19,369 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:56:19,369 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:56:19,369 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:56:19,369 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:56:19,369 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:56:19,370 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:56:19,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:56:19,370 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:56:19,370 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:56:19,370 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:56:19,370 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:56:19,370 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:56:19,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:56:19,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:56:19,370 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:56:19,370 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:56:19,370 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:56:19,370 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 -> 8c7125507f231f46c946ebcd57e8b56859ee58b969eed99ccdbcf88141d9e219 [2025-03-04 06:56:19,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:56:19,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:56:19,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:56:19,604 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:56:19,605 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:56:19,606 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-2.wvr.c [2025-03-04 06:56:20,756 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fcd0b883/a3149411f01349a0a91f028989156346/FLAGe9d0a9488 [2025-03-04 06:56:21,024 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:56:21,025 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-2.wvr.c [2025-03-04 06:56:21,051 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fcd0b883/a3149411f01349a0a91f028989156346/FLAGe9d0a9488 [2025-03-04 06:56:21,346 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fcd0b883/a3149411f01349a0a91f028989156346 [2025-03-04 06:56:21,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:56:21,350 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:56:21,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:56:21,352 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:56:21,356 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:56:21,357 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:56:21" (1/1) ... [2025-03-04 06:56:21,358 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f4c3749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:21, skipping insertion in model container [2025-03-04 06:56:21,358 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:56:21" (1/1) ... [2025-03-04 06:56:21,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:56:21,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:56:21,520 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:56:21,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:56:21,563 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:56:21,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:21 WrapperNode [2025-03-04 06:56:21,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:56:21,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:56:21,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:56:21,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:56:21,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:21" (1/1) ... [2025-03-04 06:56:21,576 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:21" (1/1) ... [2025-03-04 06:56:21,599 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 226 [2025-03-04 06:56:21,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:56:21,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:56:21,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:56:21,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:56:21,611 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:21" (1/1) ... [2025-03-04 06:56:21,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:21" (1/1) ... [2025-03-04 06:56:21,618 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:21" (1/1) ... [2025-03-04 06:56:21,618 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:21" (1/1) ... [2025-03-04 06:56:21,629 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:21" (1/1) ... [2025-03-04 06:56:21,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:21" (1/1) ... [2025-03-04 06:56:21,635 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:21" (1/1) ... [2025-03-04 06:56:21,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:21" (1/1) ... [2025-03-04 06:56:21,641 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:56:21,642 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:56:21,642 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:56:21,642 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:56:21,643 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:21" (1/1) ... [2025-03-04 06:56:21,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:56:21,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:56:21,676 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:56:21,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:56:21,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:56:21,698 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 06:56:21,698 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 06:56:21,698 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 06:56:21,698 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 06:56:21,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:56:21,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:56:21,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:56:21,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:56:21,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:56:21,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:56:21,700 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:56:21,771 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:56:21,772 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:56:22,076 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:56:22,076 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:56:22,097 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:56:22,099 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:56:22,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:56:22 BoogieIcfgContainer [2025-03-04 06:56:22,099 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:56:22,101 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:56:22,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:56:22,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:56:22,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:56:21" (1/3) ... [2025-03-04 06:56:22,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427e566e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:56:22, skipping insertion in model container [2025-03-04 06:56:22,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:21" (2/3) ... [2025-03-04 06:56:22,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427e566e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:56:22, skipping insertion in model container [2025-03-04 06:56:22,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:56:22" (3/3) ... [2025-03-04 06:56:22,108 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-2.wvr.c [2025-03-04 06:56:22,120 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:56:22,122 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-2.wvr.c that has 3 procedures, 288 locations, 1 initial locations, 3 loop locations, and 32 error locations. [2025-03-04 06:56:22,123 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:56:22,215 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:56:22,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 294 places, 303 transitions, 620 flow [2025-03-04 06:56:22,319 INFO L124 PetriNetUnfolderBase]: 16/301 cut-off events. [2025-03-04 06:56:22,327 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:56:22,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 301 events. 16/301 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 477 event pairs, 0 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 176. Up to 2 conditions per place. [2025-03-04 06:56:22,334 INFO L82 GeneralOperation]: Start removeDead. Operand has 294 places, 303 transitions, 620 flow [2025-03-04 06:56:22,348 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 276 places, 284 transitions, 580 flow [2025-03-04 06:56:22,374 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:56:22,386 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;@5523eacc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:56:22,386 INFO L334 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2025-03-04 06:56:22,391 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:56:22,391 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-04 06:56:22,391 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:56:22,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:22,392 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:22,392 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2025-03-04 06:56:22,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:22,396 INFO L85 PathProgramCache]: Analyzing trace with hash 45567117, now seen corresponding path program 1 times [2025-03-04 06:56:22,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:22,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114667219] [2025-03-04 06:56:22,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:22,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:22,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 06:56:22,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 06:56:22,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:22,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:22,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:22,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:22,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114667219] [2025-03-04 06:56:22,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114667219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:22,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:22,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:22,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660946585] [2025-03-04 06:56:22,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:22,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:22,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:22,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:22,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:22,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 303 [2025-03-04 06:56:22,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 284 transitions, 580 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:22,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:22,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 303 [2025-03-04 06:56:22,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:22,678 INFO L124 PetriNetUnfolderBase]: 13/382 cut-off events. [2025-03-04 06:56:22,678 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 06:56:22,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 382 events. 13/382 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1027 event pairs, 3 based on Foata normal form. 9/325 useless extension candidates. Maximal degree in co-relation 277. Up to 19 conditions per place. [2025-03-04 06:56:22,682 INFO L140 encePairwiseOnDemand]: 291/303 looper letters, 10 selfloop transitions, 2 changer transitions 4/274 dead transitions. [2025-03-04 06:56:22,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 274 transitions, 584 flow [2025-03-04 06:56:22,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:22,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 856 transitions. [2025-03-04 06:56:22,695 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9416941694169417 [2025-03-04 06:56:22,699 INFO L175 Difference]: Start difference. First operand has 276 places, 284 transitions, 580 flow. Second operand 3 states and 856 transitions. [2025-03-04 06:56:22,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 274 transitions, 584 flow [2025-03-04 06:56:22,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 274 transitions, 576 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 06:56:22,709 INFO L231 Difference]: Finished difference. Result has 273 places, 270 transitions, 548 flow [2025-03-04 06:56:22,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=273, PETRI_TRANSITIONS=270} [2025-03-04 06:56:22,714 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, -3 predicate places. [2025-03-04 06:56:22,714 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 270 transitions, 548 flow [2025-03-04 06:56:22,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:22,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:22,715 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:22,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:56:22,715 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2025-03-04 06:56:22,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:22,716 INFO L85 PathProgramCache]: Analyzing trace with hash 718990882, now seen corresponding path program 1 times [2025-03-04 06:56:22,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:22,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108742396] [2025-03-04 06:56:22,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:22,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:22,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 06:56:22,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 06:56:22,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:22,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:22,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:22,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:22,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108742396] [2025-03-04 06:56:22,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108742396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:22,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:22,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:22,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282573766] [2025-03-04 06:56:22,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:22,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:22,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:22,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:22,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:22,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 303 [2025-03-04 06:56:22,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 270 transitions, 548 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:22,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:22,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 303 [2025-03-04 06:56:22,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:22,841 INFO L124 PetriNetUnfolderBase]: 14/376 cut-off events. [2025-03-04 06:56:22,841 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:56:22,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 376 events. 14/376 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 930 event pairs, 5 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 380. Up to 23 conditions per place. [2025-03-04 06:56:22,845 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 12 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2025-03-04 06:56:22,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 269 transitions, 574 flow [2025-03-04 06:56:22,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:22,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:22,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 843 transitions. [2025-03-04 06:56:22,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9273927392739274 [2025-03-04 06:56:22,848 INFO L175 Difference]: Start difference. First operand has 273 places, 270 transitions, 548 flow. Second operand 3 states and 843 transitions. [2025-03-04 06:56:22,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 269 transitions, 574 flow [2025-03-04 06:56:22,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 269 transitions, 570 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:22,856 INFO L231 Difference]: Finished difference. Result has 268 places, 269 transitions, 546 flow [2025-03-04 06:56:22,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=546, PETRI_PLACES=268, PETRI_TRANSITIONS=269} [2025-03-04 06:56:22,858 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, -8 predicate places. [2025-03-04 06:56:22,858 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 269 transitions, 546 flow [2025-03-04 06:56:22,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:22,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:22,859 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-04 06:56:22,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:56:22,859 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2025-03-04 06:56:22,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:22,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1246971164, now seen corresponding path program 1 times [2025-03-04 06:56:22,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:22,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616297816] [2025-03-04 06:56:22,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:22,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:22,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 06:56:22,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 06:56:22,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:22,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:22,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:22,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:22,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616297816] [2025-03-04 06:56:22,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616297816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:22,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:22,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:22,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179052157] [2025-03-04 06:56:22,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:22,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:22,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:22,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:22,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:22,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 303 [2025-03-04 06:56:22,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 269 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:22,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:22,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 303 [2025-03-04 06:56:22,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:23,040 INFO L124 PetriNetUnfolderBase]: 45/722 cut-off events. [2025-03-04 06:56:23,040 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-04 06:56:23,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 722 events. 45/722 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2883 event pairs, 14 based on Foata normal form. 0/596 useless extension candidates. Maximal degree in co-relation 753. Up to 57 conditions per place. [2025-03-04 06:56:23,045 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 14 selfloop transitions, 1 changer transitions 0/264 dead transitions. [2025-03-04 06:56:23,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 264 transitions, 566 flow [2025-03-04 06:56:23,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:23,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:23,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 836 transitions. [2025-03-04 06:56:23,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9196919691969196 [2025-03-04 06:56:23,048 INFO L175 Difference]: Start difference. First operand has 268 places, 269 transitions, 546 flow. Second operand 3 states and 836 transitions. [2025-03-04 06:56:23,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 264 transitions, 566 flow [2025-03-04 06:56:23,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 264 transitions, 562 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:23,052 INFO L231 Difference]: Finished difference. Result has 263 places, 264 transitions, 534 flow [2025-03-04 06:56:23,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=263, PETRI_TRANSITIONS=264} [2025-03-04 06:56:23,053 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, -13 predicate places. [2025-03-04 06:56:23,054 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 264 transitions, 534 flow [2025-03-04 06:56:23,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:23,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:23,054 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:23,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:56:23,055 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2025-03-04 06:56:23,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:23,056 INFO L85 PathProgramCache]: Analyzing trace with hash -756068272, now seen corresponding path program 1 times [2025-03-04 06:56:23,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:23,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233661412] [2025-03-04 06:56:23,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:23,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:23,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:56:23,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:56:23,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:23,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:23,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:23,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:23,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233661412] [2025-03-04 06:56:23,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233661412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:23,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:23,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:23,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272128788] [2025-03-04 06:56:23,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:23,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:23,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:23,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:23,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:23,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 303 [2025-03-04 06:56:23,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 264 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:23,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:23,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 303 [2025-03-04 06:56:23,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:23,211 INFO L124 PetriNetUnfolderBase]: 14/368 cut-off events. [2025-03-04 06:56:23,212 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:56:23,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 368 events. 14/368 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 876 event pairs, 5 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 361. Up to 21 conditions per place. [2025-03-04 06:56:23,213 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 10 selfloop transitions, 2 changer transitions 0/263 dead transitions. [2025-03-04 06:56:23,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 263 transitions, 556 flow [2025-03-04 06:56:23,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:23,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 847 transitions. [2025-03-04 06:56:23,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317931793179318 [2025-03-04 06:56:23,219 INFO L175 Difference]: Start difference. First operand has 263 places, 264 transitions, 534 flow. Second operand 3 states and 847 transitions. [2025-03-04 06:56:23,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 263 transitions, 556 flow [2025-03-04 06:56:23,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 263 transitions, 555 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:56:23,223 INFO L231 Difference]: Finished difference. Result has 263 places, 263 transitions, 535 flow [2025-03-04 06:56:23,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=535, PETRI_PLACES=263, PETRI_TRANSITIONS=263} [2025-03-04 06:56:23,225 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, -13 predicate places. [2025-03-04 06:56:23,225 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 263 transitions, 535 flow [2025-03-04 06:56:23,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:23,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:23,226 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:23,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:56:23,226 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2025-03-04 06:56:23,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:23,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1518641116, now seen corresponding path program 1 times [2025-03-04 06:56:23,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:23,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370140551] [2025-03-04 06:56:23,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:23,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:23,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:56:23,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:56:23,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:23,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:23,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:23,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:23,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370140551] [2025-03-04 06:56:23,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370140551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:23,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:23,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:56:23,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310193619] [2025-03-04 06:56:23,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:23,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:56:23,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:23,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:56:23,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:56:23,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 303 [2025-03-04 06:56:23,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 263 transitions, 535 flow. Second operand has 6 states, 6 states have (on average 263.5) internal successors, (1581), 6 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:23,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:23,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 303 [2025-03-04 06:56:23,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:24,038 INFO L124 PetriNetUnfolderBase]: 86/894 cut-off events. [2025-03-04 06:56:24,038 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 06:56:24,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 894 events. 86/894 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4066 event pairs, 44 based on Foata normal form. 0/742 useless extension candidates. Maximal degree in co-relation 1011. Up to 136 conditions per place. [2025-03-04 06:56:24,043 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 24 selfloop transitions, 5 changer transitions 0/262 dead transitions. [2025-03-04 06:56:24,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 262 transitions, 591 flow [2025-03-04 06:56:24,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:56:24,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:56:24,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1602 transitions. [2025-03-04 06:56:24,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8811881188118812 [2025-03-04 06:56:24,049 INFO L175 Difference]: Start difference. First operand has 263 places, 263 transitions, 535 flow. Second operand 6 states and 1602 transitions. [2025-03-04 06:56:24,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 262 transitions, 591 flow [2025-03-04 06:56:24,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 262 transitions, 587 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:24,053 INFO L231 Difference]: Finished difference. Result has 265 places, 262 transitions, 539 flow [2025-03-04 06:56:24,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=539, PETRI_PLACES=265, PETRI_TRANSITIONS=262} [2025-03-04 06:56:24,054 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, -11 predicate places. [2025-03-04 06:56:24,054 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 262 transitions, 539 flow [2025-03-04 06:56:24,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 263.5) internal successors, (1581), 6 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:24,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:24,054 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] [2025-03-04 06:56:24,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:56:24,055 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2025-03-04 06:56:24,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:24,055 INFO L85 PathProgramCache]: Analyzing trace with hash 805724454, now seen corresponding path program 1 times [2025-03-04 06:56:24,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:24,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226703295] [2025-03-04 06:56:24,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:24,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:24,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 06:56:24,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 06:56:24,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:24,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:24,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:24,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:24,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226703295] [2025-03-04 06:56:24,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226703295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:24,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:24,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:24,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799843806] [2025-03-04 06:56:24,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:24,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:24,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:24,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:24,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:24,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 303 [2025-03-04 06:56:24,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 262 transitions, 539 flow. Second operand has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:24,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:24,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 303 [2025-03-04 06:56:24,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:24,182 INFO L124 PetriNetUnfolderBase]: 28/645 cut-off events. [2025-03-04 06:56:24,183 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:56:24,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 691 conditions, 645 events. 28/645 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2636 event pairs, 8 based on Foata normal form. 0/544 useless extension candidates. Maximal degree in co-relation 673. Up to 32 conditions per place. [2025-03-04 06:56:24,187 INFO L140 encePairwiseOnDemand]: 299/303 looper letters, 10 selfloop transitions, 1 changer transitions 0/259 dead transitions. [2025-03-04 06:56:24,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 259 transitions, 555 flow [2025-03-04 06:56:24,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:24,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:24,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 848 transitions. [2025-03-04 06:56:24,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9328932893289329 [2025-03-04 06:56:24,189 INFO L175 Difference]: Start difference. First operand has 265 places, 262 transitions, 539 flow. Second operand 3 states and 848 transitions. [2025-03-04 06:56:24,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 259 transitions, 555 flow [2025-03-04 06:56:24,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 259 transitions, 545 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:56:24,193 INFO L231 Difference]: Finished difference. Result has 259 places, 259 transitions, 525 flow [2025-03-04 06:56:24,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=525, PETRI_PLACES=259, PETRI_TRANSITIONS=259} [2025-03-04 06:56:24,195 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, -17 predicate places. [2025-03-04 06:56:24,195 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 259 transitions, 525 flow [2025-03-04 06:56:24,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:24,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:24,195 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:24,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:56:24,196 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2025-03-04 06:56:24,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:24,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1188497837, now seen corresponding path program 1 times [2025-03-04 06:56:24,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:24,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551980804] [2025-03-04 06:56:24,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:24,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:24,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 06:56:24,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 06:56:24,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:24,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:24,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:24,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:24,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551980804] [2025-03-04 06:56:24,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551980804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:24,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:24,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:24,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854094615] [2025-03-04 06:56:24,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:24,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:24,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:24,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:24,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:24,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 303 [2025-03-04 06:56:24,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 259 transitions, 525 flow. Second operand has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:24,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:24,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 303 [2025-03-04 06:56:24,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:24,328 INFO L124 PetriNetUnfolderBase]: 17/391 cut-off events. [2025-03-04 06:56:24,328 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:56:24,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 391 events. 17/391 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 807 event pairs, 1 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 397. Up to 20 conditions per place. [2025-03-04 06:56:24,332 INFO L140 encePairwiseOnDemand]: 296/303 looper letters, 11 selfloop transitions, 3 changer transitions 0/256 dead transitions. [2025-03-04 06:56:24,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 256 transitions, 548 flow [2025-03-04 06:56:24,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:24,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:24,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 843 transitions. [2025-03-04 06:56:24,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9273927392739274 [2025-03-04 06:56:24,334 INFO L175 Difference]: Start difference. First operand has 259 places, 259 transitions, 525 flow. Second operand 3 states and 843 transitions. [2025-03-04 06:56:24,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 256 transitions, 548 flow [2025-03-04 06:56:24,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 256 transitions, 547 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:56:24,338 INFO L231 Difference]: Finished difference. Result has 256 places, 255 transitions, 522 flow [2025-03-04 06:56:24,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=522, PETRI_PLACES=256, PETRI_TRANSITIONS=255} [2025-03-04 06:56:24,340 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, -20 predicate places. [2025-03-04 06:56:24,340 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 255 transitions, 522 flow [2025-03-04 06:56:24,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:24,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:24,341 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:24,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:56:24,341 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2025-03-04 06:56:24,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:24,342 INFO L85 PathProgramCache]: Analyzing trace with hash -199796560, now seen corresponding path program 1 times [2025-03-04 06:56:24,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:24,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39448381] [2025-03-04 06:56:24,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:24,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:24,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 06:56:24,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 06:56:24,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:24,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:24,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:24,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:24,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39448381] [2025-03-04 06:56:24,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39448381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:24,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:24,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:24,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866335772] [2025-03-04 06:56:24,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:24,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:24,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:24,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:24,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:24,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 303 [2025-03-04 06:56:24,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 255 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 266.3333333333333) internal successors, (799), 3 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:24,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:24,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 303 [2025-03-04 06:56:24,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:24,463 INFO L124 PetriNetUnfolderBase]: 22/328 cut-off events. [2025-03-04 06:56:24,463 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-04 06:56:24,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 328 events. 22/328 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 829 event pairs, 2 based on Foata normal form. 1/303 useless extension candidates. Maximal degree in co-relation 350. Up to 37 conditions per place. [2025-03-04 06:56:24,465 INFO L140 encePairwiseOnDemand]: 291/303 looper letters, 14 selfloop transitions, 4 changer transitions 4/249 dead transitions. [2025-03-04 06:56:24,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 249 transitions, 551 flow [2025-03-04 06:56:24,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:24,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:24,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 822 transitions. [2025-03-04 06:56:24,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9042904290429042 [2025-03-04 06:56:24,469 INFO L175 Difference]: Start difference. First operand has 256 places, 255 transitions, 522 flow. Second operand 3 states and 822 transitions. [2025-03-04 06:56:24,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 249 transitions, 551 flow [2025-03-04 06:56:24,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 249 transitions, 545 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:24,476 INFO L231 Difference]: Finished difference. Result has 249 places, 244 transitions, 501 flow [2025-03-04 06:56:24,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=249, PETRI_TRANSITIONS=244} [2025-03-04 06:56:24,478 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, -27 predicate places. [2025-03-04 06:56:24,478 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 244 transitions, 501 flow [2025-03-04 06:56:24,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.3333333333333) internal successors, (799), 3 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:24,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:24,479 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:24,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:56:24,479 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2025-03-04 06:56:24,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:24,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1017500351, now seen corresponding path program 1 times [2025-03-04 06:56:24,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:24,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924515352] [2025-03-04 06:56:24,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:24,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:24,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 06:56:24,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 06:56:24,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:24,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:24,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:24,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924515352] [2025-03-04 06:56:24,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924515352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:24,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:24,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:24,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701673346] [2025-03-04 06:56:24,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:24,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:24,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:24,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:24,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:24,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 303 [2025-03-04 06:56:24,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 244 transitions, 501 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:24,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:24,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 303 [2025-03-04 06:56:24,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:24,614 INFO L124 PetriNetUnfolderBase]: 43/659 cut-off events. [2025-03-04 06:56:24,614 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 06:56:24,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 659 events. 43/659 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2492 event pairs, 4 based on Foata normal form. 0/596 useless extension candidates. Maximal degree in co-relation 704. Up to 50 conditions per place. [2025-03-04 06:56:24,617 INFO L140 encePairwiseOnDemand]: 298/303 looper letters, 12 selfloop transitions, 2 changer transitions 0/245 dead transitions. [2025-03-04 06:56:24,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 245 transitions, 533 flow [2025-03-04 06:56:24,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:24,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:24,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 851 transitions. [2025-03-04 06:56:24,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9361936193619362 [2025-03-04 06:56:24,619 INFO L175 Difference]: Start difference. First operand has 249 places, 244 transitions, 501 flow. Second operand 3 states and 851 transitions. [2025-03-04 06:56:24,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 245 transitions, 533 flow [2025-03-04 06:56:24,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 245 transitions, 525 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:24,625 INFO L231 Difference]: Finished difference. Result has 243 places, 243 transitions, 501 flow [2025-03-04 06:56:24,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=243, PETRI_TRANSITIONS=243} [2025-03-04 06:56:24,626 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, -33 predicate places. [2025-03-04 06:56:24,626 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 243 transitions, 501 flow [2025-03-04 06:56:24,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:24,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:24,627 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:24,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:56:24,627 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2025-03-04 06:56:24,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:24,627 INFO L85 PathProgramCache]: Analyzing trace with hash -659104475, now seen corresponding path program 1 times [2025-03-04 06:56:24,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:24,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598690918] [2025-03-04 06:56:24,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:24,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:24,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 06:56:24,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 06:56:24,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:24,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:24,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:24,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598690918] [2025-03-04 06:56:24,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598690918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:24,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:24,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:56:24,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060117533] [2025-03-04 06:56:24,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:24,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:56:24,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:24,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:56:24,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:56:24,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 303 [2025-03-04 06:56:24,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 243 transitions, 501 flow. Second operand has 4 states, 4 states have (on average 282.25) internal successors, (1129), 4 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:24,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:24,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 303 [2025-03-04 06:56:24,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:24,826 INFO L124 PetriNetUnfolderBase]: 34/763 cut-off events. [2025-03-04 06:56:24,826 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:56:24,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 763 events. 34/763 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2715 event pairs, 3 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 798. Up to 18 conditions per place. [2025-03-04 06:56:24,830 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 13 selfloop transitions, 6 changer transitions 0/252 dead transitions. [2025-03-04 06:56:24,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 252 transitions, 561 flow [2025-03-04 06:56:24,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:56:24,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 06:56:24,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1425 transitions. [2025-03-04 06:56:24,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9405940594059405 [2025-03-04 06:56:24,833 INFO L175 Difference]: Start difference. First operand has 243 places, 243 transitions, 501 flow. Second operand 5 states and 1425 transitions. [2025-03-04 06:56:24,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 252 transitions, 561 flow [2025-03-04 06:56:24,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 252 transitions, 561 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:24,837 INFO L231 Difference]: Finished difference. Result has 250 places, 247 transitions, 539 flow [2025-03-04 06:56:24,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=539, PETRI_PLACES=250, PETRI_TRANSITIONS=247} [2025-03-04 06:56:24,838 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, -26 predicate places. [2025-03-04 06:56:24,838 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 247 transitions, 539 flow [2025-03-04 06:56:24,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 282.25) internal successors, (1129), 4 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:24,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:24,839 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-04 06:56:24,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:56:24,839 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2025-03-04 06:56:24,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:24,840 INFO L85 PathProgramCache]: Analyzing trace with hash 608508121, now seen corresponding path program 1 times [2025-03-04 06:56:24,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:24,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110145762] [2025-03-04 06:56:24,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:24,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:24,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 06:56:24,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 06:56:24,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:24,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:25,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:25,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:25,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110145762] [2025-03-04 06:56:25,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110145762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:25,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:25,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:56:25,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623054773] [2025-03-04 06:56:25,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:25,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:56:25,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:25,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:56:25,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:56:25,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 303 [2025-03-04 06:56:25,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 247 transitions, 539 flow. Second operand has 6 states, 6 states have (on average 275.5) internal successors, (1653), 6 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:25,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:25,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 303 [2025-03-04 06:56:25,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:25,390 INFO L124 PetriNetUnfolderBase]: 30/583 cut-off events. [2025-03-04 06:56:25,390 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-04 06:56:25,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 583 events. 30/583 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1648 event pairs, 2 based on Foata normal form. 0/536 useless extension candidates. Maximal degree in co-relation 639. Up to 17 conditions per place. [2025-03-04 06:56:25,393 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 15 selfloop transitions, 6 changer transitions 0/250 dead transitions. [2025-03-04 06:56:25,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 250 transitions, 591 flow [2025-03-04 06:56:25,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:56:25,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:56:25,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1665 transitions. [2025-03-04 06:56:25,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9158415841584159 [2025-03-04 06:56:25,396 INFO L175 Difference]: Start difference. First operand has 250 places, 247 transitions, 539 flow. Second operand 6 states and 1665 transitions. [2025-03-04 06:56:25,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 250 transitions, 591 flow [2025-03-04 06:56:25,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 250 transitions, 591 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:25,399 INFO L231 Difference]: Finished difference. Result has 254 places, 246 transitions, 549 flow [2025-03-04 06:56:25,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=549, PETRI_PLACES=254, PETRI_TRANSITIONS=246} [2025-03-04 06:56:25,400 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, -22 predicate places. [2025-03-04 06:56:25,400 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 246 transitions, 549 flow [2025-03-04 06:56:25,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 275.5) internal successors, (1653), 6 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:25,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:25,401 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:25,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:56:25,401 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2025-03-04 06:56:25,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:25,401 INFO L85 PathProgramCache]: Analyzing trace with hash 406288895, now seen corresponding path program 1 times [2025-03-04 06:56:25,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:25,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119670120] [2025-03-04 06:56:25,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:25,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:25,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 06:56:25,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 06:56:25,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:25,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:25,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:25,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:25,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119670120] [2025-03-04 06:56:25,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119670120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:25,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:25,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:56:25,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408508377] [2025-03-04 06:56:25,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:25,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:56:25,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:25,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:56:25,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:56:25,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 303 [2025-03-04 06:56:25,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 246 transitions, 549 flow. Second operand has 4 states, 4 states have (on average 281.5) internal successors, (1126), 4 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:25,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:25,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 303 [2025-03-04 06:56:25,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:25,592 INFO L124 PetriNetUnfolderBase]: 42/730 cut-off events. [2025-03-04 06:56:25,592 INFO L125 PetriNetUnfolderBase]: For 30/31 co-relation queries the response was YES. [2025-03-04 06:56:25,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 730 events. 42/730 cut-off events. For 30/31 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3027 event pairs, 6 based on Foata normal form. 0/667 useless extension candidates. Maximal degree in co-relation 818. Up to 46 conditions per place. [2025-03-04 06:56:25,596 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 13 selfloop transitions, 6 changer transitions 0/254 dead transitions. [2025-03-04 06:56:25,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 254 transitions, 606 flow [2025-03-04 06:56:25,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:56:25,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 06:56:25,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1420 transitions. [2025-03-04 06:56:25,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9372937293729373 [2025-03-04 06:56:25,598 INFO L175 Difference]: Start difference. First operand has 254 places, 246 transitions, 549 flow. Second operand 5 states and 1420 transitions. [2025-03-04 06:56:25,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 254 transitions, 606 flow [2025-03-04 06:56:25,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 254 transitions, 594 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:56:25,602 INFO L231 Difference]: Finished difference. Result has 256 places, 250 transitions, 575 flow [2025-03-04 06:56:25,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=575, PETRI_PLACES=256, PETRI_TRANSITIONS=250} [2025-03-04 06:56:25,602 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, -20 predicate places. [2025-03-04 06:56:25,602 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 250 transitions, 575 flow [2025-03-04 06:56:25,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 281.5) internal successors, (1126), 4 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:25,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:25,603 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-04 06:56:25,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:56:25,603 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2025-03-04 06:56:25,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:25,604 INFO L85 PathProgramCache]: Analyzing trace with hash -653407461, now seen corresponding path program 1 times [2025-03-04 06:56:25,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:25,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289693186] [2025-03-04 06:56:25,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:25,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:25,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 06:56:25,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 06:56:25,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:25,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:25,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:25,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:25,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289693186] [2025-03-04 06:56:25,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289693186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:25,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:25,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:25,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966146855] [2025-03-04 06:56:25,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:25,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:25,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:25,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:25,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:25,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 303 [2025-03-04 06:56:25,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 250 transitions, 575 flow. Second operand has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:25,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:25,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 303 [2025-03-04 06:56:25,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:25,727 INFO L124 PetriNetUnfolderBase]: 39/982 cut-off events. [2025-03-04 06:56:25,728 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-04 06:56:25,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 982 events. 39/982 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4294 event pairs, 10 based on Foata normal form. 0/908 useless extension candidates. Maximal degree in co-relation 1122. Up to 34 conditions per place. [2025-03-04 06:56:25,733 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 9 selfloop transitions, 2 changer transitions 0/250 dead transitions. [2025-03-04 06:56:25,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 250 transitions, 598 flow [2025-03-04 06:56:25,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:25,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 849 transitions. [2025-03-04 06:56:25,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.933993399339934 [2025-03-04 06:56:25,735 INFO L175 Difference]: Start difference. First operand has 256 places, 250 transitions, 575 flow. Second operand 3 states and 849 transitions. [2025-03-04 06:56:25,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 250 transitions, 598 flow [2025-03-04 06:56:25,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 250 transitions, 598 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:25,738 INFO L231 Difference]: Finished difference. Result has 257 places, 249 transitions, 577 flow [2025-03-04 06:56:25,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=257, PETRI_TRANSITIONS=249} [2025-03-04 06:56:25,739 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, -19 predicate places. [2025-03-04 06:56:25,739 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 249 transitions, 577 flow [2025-03-04 06:56:25,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:25,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:25,740 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] [2025-03-04 06:56:25,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:56:25,740 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2025-03-04 06:56:25,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:25,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1072125622, now seen corresponding path program 1 times [2025-03-04 06:56:25,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:25,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118569816] [2025-03-04 06:56:25,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:25,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:25,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 06:56:25,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 06:56:25,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:25,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:26,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:26,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:26,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118569816] [2025-03-04 06:56:26,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118569816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:26,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:26,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:56:26,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739807990] [2025-03-04 06:56:26,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:26,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:56:26,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:26,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:56:26,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:56:26,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 303 [2025-03-04 06:56:26,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 249 transitions, 577 flow. Second operand has 6 states, 6 states have (on average 268.6666666666667) internal successors, (1612), 6 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:26,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:26,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 303 [2025-03-04 06:56:26,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:26,337 INFO L124 PetriNetUnfolderBase]: 54/636 cut-off events. [2025-03-04 06:56:26,338 INFO L125 PetriNetUnfolderBase]: For 55/56 co-relation queries the response was YES. [2025-03-04 06:56:26,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 859 conditions, 636 events. 54/636 cut-off events. For 55/56 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2681 event pairs, 6 based on Foata normal form. 0/600 useless extension candidates. Maximal degree in co-relation 811. Up to 42 conditions per place. [2025-03-04 06:56:26,341 INFO L140 encePairwiseOnDemand]: 291/303 looper letters, 16 selfloop transitions, 11 changer transitions 0/251 dead transitions. [2025-03-04 06:56:26,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 251 transitions, 639 flow [2025-03-04 06:56:26,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:56:26,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:56:26,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1630 transitions. [2025-03-04 06:56:26,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8965896589658966 [2025-03-04 06:56:26,344 INFO L175 Difference]: Start difference. First operand has 257 places, 249 transitions, 577 flow. Second operand 6 states and 1630 transitions. [2025-03-04 06:56:26,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 251 transitions, 639 flow [2025-03-04 06:56:26,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 251 transitions, 635 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:26,347 INFO L231 Difference]: Finished difference. Result has 258 places, 247 transitions, 591 flow [2025-03-04 06:56:26,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=591, PETRI_PLACES=258, PETRI_TRANSITIONS=247} [2025-03-04 06:56:26,348 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, -18 predicate places. [2025-03-04 06:56:26,348 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 247 transitions, 591 flow [2025-03-04 06:56:26,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 268.6666666666667) internal successors, (1612), 6 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:26,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:26,349 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:26,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:56:26,349 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2025-03-04 06:56:26,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:26,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1148344264, now seen corresponding path program 1 times [2025-03-04 06:56:26,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:26,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905051636] [2025-03-04 06:56:26,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:26,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:26,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 06:56:26,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 06:56:26,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:26,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:26,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:26,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:26,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905051636] [2025-03-04 06:56:26,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905051636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:26,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:26,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:26,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426654755] [2025-03-04 06:56:26,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:26,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:26,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:26,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:26,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:26,422 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 303 [2025-03-04 06:56:26,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 247 transitions, 591 flow. Second operand has 3 states, 3 states have (on average 277.6666666666667) internal successors, (833), 3 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:26,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:26,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 303 [2025-03-04 06:56:26,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:26,495 INFO L124 PetriNetUnfolderBase]: 50/715 cut-off events. [2025-03-04 06:56:26,495 INFO L125 PetriNetUnfolderBase]: For 62/63 co-relation queries the response was YES. [2025-03-04 06:56:26,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 980 conditions, 715 events. 50/715 cut-off events. For 62/63 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2958 event pairs, 26 based on Foata normal form. 0/678 useless extension candidates. Maximal degree in co-relation 934. Up to 86 conditions per place. [2025-03-04 06:56:26,499 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 13 selfloop transitions, 2 changer transitions 0/247 dead transitions. [2025-03-04 06:56:26,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 247 transitions, 622 flow [2025-03-04 06:56:26,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:26,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:26,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 841 transitions. [2025-03-04 06:56:26,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9251925192519251 [2025-03-04 06:56:26,500 INFO L175 Difference]: Start difference. First operand has 258 places, 247 transitions, 591 flow. Second operand 3 states and 841 transitions. [2025-03-04 06:56:26,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 247 transitions, 622 flow [2025-03-04 06:56:26,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 247 transitions, 600 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:56:26,504 INFO L231 Difference]: Finished difference. Result has 254 places, 246 transitions, 571 flow [2025-03-04 06:56:26,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=254, PETRI_TRANSITIONS=246} [2025-03-04 06:56:26,504 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, -22 predicate places. [2025-03-04 06:56:26,504 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 246 transitions, 571 flow [2025-03-04 06:56:26,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.6666666666667) internal successors, (833), 3 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:26,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:26,505 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:26,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:56:26,505 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2025-03-04 06:56:26,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:26,505 INFO L85 PathProgramCache]: Analyzing trace with hash 205921932, now seen corresponding path program 1 times [2025-03-04 06:56:26,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:26,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143550483] [2025-03-04 06:56:26,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:26,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:26,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 06:56:26,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 06:56:26,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:26,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:26,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:26,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:26,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143550483] [2025-03-04 06:56:26,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143550483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:26,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:26,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:26,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976136376] [2025-03-04 06:56:26,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:26,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:26,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:26,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:26,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:26,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 303 [2025-03-04 06:56:26,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 246 transitions, 571 flow. Second operand has 3 states, 3 states have (on average 278.6666666666667) internal successors, (836), 3 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:26,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:26,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 303 [2025-03-04 06:56:26,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:26,624 INFO L124 PetriNetUnfolderBase]: 49/678 cut-off events. [2025-03-04 06:56:26,624 INFO L125 PetriNetUnfolderBase]: For 55/56 co-relation queries the response was YES. [2025-03-04 06:56:26,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 678 events. 49/678 cut-off events. For 55/56 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2788 event pairs, 26 based on Foata normal form. 0/647 useless extension candidates. Maximal degree in co-relation 837. Up to 86 conditions per place. [2025-03-04 06:56:26,627 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 0 selfloop transitions, 0 changer transitions 246/246 dead transitions. [2025-03-04 06:56:26,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 246 transitions, 602 flow [2025-03-04 06:56:26,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:26,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 841 transitions. [2025-03-04 06:56:26,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9251925192519251 [2025-03-04 06:56:26,629 INFO L175 Difference]: Start difference. First operand has 254 places, 246 transitions, 571 flow. Second operand 3 states and 841 transitions. [2025-03-04 06:56:26,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 246 transitions, 602 flow [2025-03-04 06:56:26,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 246 transitions, 598 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:26,631 INFO L231 Difference]: Finished difference. Result has 253 places, 0 transitions, 0 flow [2025-03-04 06:56:26,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=253, PETRI_TRANSITIONS=0} [2025-03-04 06:56:26,631 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, -23 predicate places. [2025-03-04 06:56:26,631 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 0 transitions, 0 flow [2025-03-04 06:56:26,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.6666666666667) internal successors, (836), 3 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:26,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (56 of 57 remaining) [2025-03-04 06:56:26,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (55 of 57 remaining) [2025-03-04 06:56:26,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (54 of 57 remaining) [2025-03-04 06:56:26,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (53 of 57 remaining) [2025-03-04 06:56:26,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (52 of 57 remaining) [2025-03-04 06:56:26,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (51 of 57 remaining) [2025-03-04 06:56:26,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (50 of 57 remaining) [2025-03-04 06:56:26,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (49 of 57 remaining) [2025-03-04 06:56:26,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (48 of 57 remaining) [2025-03-04 06:56:26,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (47 of 57 remaining) [2025-03-04 06:56:26,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (46 of 57 remaining) [2025-03-04 06:56:26,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (45 of 57 remaining) [2025-03-04 06:56:26,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (44 of 57 remaining) [2025-03-04 06:56:26,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (43 of 57 remaining) [2025-03-04 06:56:26,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (42 of 57 remaining) [2025-03-04 06:56:26,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (41 of 57 remaining) [2025-03-04 06:56:26,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (40 of 57 remaining) [2025-03-04 06:56:26,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (39 of 57 remaining) [2025-03-04 06:56:26,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (38 of 57 remaining) [2025-03-04 06:56:26,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (37 of 57 remaining) [2025-03-04 06:56:26,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (36 of 57 remaining) [2025-03-04 06:56:26,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (35 of 57 remaining) [2025-03-04 06:56:26,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (34 of 57 remaining) [2025-03-04 06:56:26,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (33 of 57 remaining) [2025-03-04 06:56:26,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (32 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (31 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (30 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (29 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (27 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (26 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (25 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (22 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (21 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (20 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (19 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (18 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (17 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (15 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (14 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (13 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (11 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (10 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (6 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 57 remaining) [2025-03-04 06:56:26,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (0 of 57 remaining) [2025-03-04 06:56:26,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:56:26,636 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:26,639 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:56:26,639 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:56:26,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:56:26 BasicIcfg [2025-03-04 06:56:26,643 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:56:26,643 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:56:26,643 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:56:26,643 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:56:26,644 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:56:22" (3/4) ... [2025-03-04 06:56:26,645 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:56:26,647 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 06:56:26,647 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 06:56:26,649 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-03-04 06:56:26,650 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 06:56:26,650 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 06:56:26,650 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:56:26,701 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:56:26,701 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:56:26,701 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:56:26,702 INFO L158 Benchmark]: Toolchain (without parser) took 5352.46ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 106.4MB in the beginning and 215.3MB in the end (delta: -108.9MB). Peak memory consumption was 97.8MB. Max. memory is 16.1GB. [2025-03-04 06:56:26,702 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:56:26,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.26ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 94.2MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:56:26,702 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.82ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 92.2MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:56:26,702 INFO L158 Benchmark]: Boogie Preprocessor took 41.75ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:56:26,703 INFO L158 Benchmark]: IcfgBuilder took 457.63ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 66.0MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 06:56:26,703 INFO L158 Benchmark]: TraceAbstraction took 4541.84ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 65.1MB in the beginning and 223.7MB in the end (delta: -158.6MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2025-03-04 06:56:26,703 INFO L158 Benchmark]: Witness Printer took 58.11ms. Allocated memory is still 352.3MB. Free memory was 223.7MB in the beginning and 215.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:56:26,704 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.24ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.26ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 94.2MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.82ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 92.2MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.75ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 457.63ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 66.0MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4541.84ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 65.1MB in the beginning and 223.7MB in the end (delta: -158.6MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. * Witness Printer took 58.11ms. Allocated memory is still 352.3MB. Free memory was 223.7MB in the beginning and 215.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 99]: 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: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: 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, 437 locations, 57 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: 4.4s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 828 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 361 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1027 IncrementalHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 160 mSolverCounterUnsat, 136 mSDtfsCounter, 1027 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=591occurred in iteration=14, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1445 NumberOfCodeBlocks, 1445 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1429 ConstructedInterpolants, 0 QuantifiedInterpolants, 2142 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 32 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:56:26,718 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